Shortest subarray reaching a sum
Mediumarraysliding windowprefix sums
Every number in nums is positive. Return the length of the shortest contiguous part whose sum is ≥ target, or 0 if none exists.
Example 1
Input: target = 7, nums = [2,3,1,2,4,3] Output: 2
[4, 3].
Example 2
Input: target = 11, nums = [1,1,1,1,1] Output: 0
Constraints
- 1 ≤ target ≤ 10⁹
- 1 ≤ nums.length ≤ 10⁵
- 1 ≤ nums[i] ≤ 10⁴
Submit checks your solution against 10 tests, including hidden ones.
/**
* @param {int} target
* @param {int[]} nums
* @return {int}
*/
function minSubArrayLen(target, nums) {
}