#1287Medium#33 in NVIDIA's list· asked at 12 companies
Minimum Size Subarray Sum
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: target = 7, nums = [2,3,1,2,4,3] Output: 2
The subarray [4,3] has the minimal length.
Example 2
Input: target = 4, nums = [1,4,4] Output: 1
Example 3
Input: target = 11, nums = [1,1,1,1,1,1,1,1] Output: 0
Constraints
- •
1 <= target <= 10^9 - •
1 <= nums.length <= 10^5 - •
1 <= nums[i] <= 10^4