Minimum Size Subarray Sum
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1:
Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.
Example 2:
Input: target = 4, nums = [1,4,4]
Output: 1
Explanation: The subarray [4] already meets the target.
Example 3:
Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0
Explanation: No subarray sums to 11 or more.
Examples
Example 1
Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has sum 7 which is >= target, and its length 2 is the smallest possible.
Example 2
Input: target = 4, nums = [1,4,4]
Output: 1
Explanation: The single element [4] already meets the target of 4.
Example 3
Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0
Explanation: The total sum of the array is 8 which is less than 11, so no valid subarray exists.
Constraints
- -1 <= target <= 10^9
- -1 <= nums.length <= 10^5
- -1 <= nums[i] <= 10^4
Optimal Complexity
Time
O(n)
Space
O(1)
Practice this problem with an AI interviewer
TechInView conducts a full voice mock interview — the AI asks clarifying questions, evaluates your approach, watches you code, and scores you on 5 dimensions. Just like a real FAANG interview.
Start a free interview