Minimum Size Subarray Sum · Coding Interview Practice

Minimum Size Subarray SumGiven a target and an array of positive integers, return the minimal length of a contiguous subarray whose sum is >= target, or 0 if none.Constraints

1 <= target <= 10^9

1 <= nums.length <= 10^5

1 <= nums[i] <= 10^4

Examples

Input: target = 7, nums = [2,3,1,2,4,3] Output: 2

Input: target = 11, nums = [1,1,1,1,1,1,1,1] Output: 0

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…