FastPrep
Problem · Array

Longest Subarray

Learn this problem
● EasyGoldman Sachs logoGoldman SachsNEW GRADOA

Problem statement

A subarray of array a is defined as a contiguous block of a's elements having a length that is less than or equal to the length of the array. For example, the subarrays of array a = [1, 2, 3] are [1], [2], [3], [1, 2], [2, 3], and [1, 2, 3]. Given an integer, k = 3, the subarrays having elements that sum to a number ≤ k are [1], [2], and [1, 2]. The longest of these subarrays is [1, 2], which has a length of 2. Given an array, a, determine its longest subarray that sums to less than or equal to a given value k.

Function

maxLength(a: int[], k: int) → int

Complete the function maxLength in the editor below. The function must return an integer that represents the length of the longest subarray of a that sums to a number ≤ k.

maxLength has the following parameter(s):

  1. a[a[0],...a[n-1]]: an array of integers
  2. k: an integer

Examples

Example 1

a = [1, 2, 3]k = 4return = 2

The subarrays having elements that sum to a number ≤ 4 are [1], [2], and [1, 2]. The longest of these subarrays is [1, 2], which has a length of 2.

Constraints

  • 1 ≤ n ≤ 10^5
  • 1 ≤ a[i] ≤ 10^3
  • 1 ≤ k ≤ 10^9

More Goldman Sachs problems

drafts saved locally
public int maxLength(int[] a, int k) {
  // write your code here
}
a[1, 2, 3]
k4
expected2
checking account