Practice Minimum Size Subarray Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Minimum Size Subarray Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
target = 7, nums = [2,3,1,2,4,3]
Output
2
# 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
Related LeetCode Problems
Practice more problems similar to Minimum Size Subarray Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.