Minimum Size Subarray Sum
Updated Jan 31, 2026
Problem
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.
Constraints
1 <= target <= 10^9
1 <= nums.length <= 10^5
1 <= nums[i] <= 10^4
Follow Up
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log(n)).
Examples
Example 1
Input:
target = 7, nums = [2,3,1,2,4,3]
Output:
2
The subarray [4,3] has the minimal length under the problem constraint.
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
Function Signature
def minSubArrayLen(self, target: int, nums: list[int]) -> int
How to Submit
Implement a Solution class with a minSubArrayLen method.
Your method will be called with the input parameters and should return the answer.