Problem · Array
Longest Subarray with Sum at Most K
● Hard
GoogleINTERNOA
See Google hiring insightsGoogleINTERNOAProblem statement
Given an integer array nums and an integer k, return the maximum length of a non-empty contiguous subarray whose sum is at most k.
The array may contain positive, zero, and negative values, so a standard positive-only sliding window is not sufficient.
The problem statement continues
ProExamples
Example 1
nums = [1,2,-1,2]k = 3return = 3The subarray [1, 2, -1] has sum 2 and length 3. The full array has sum 4.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week