Skip to content

209. Minimum Size Subarray Sum

Array Binary Search Sliding Window Prefix Sum

Problem - Minimum Size Subarray Sum

Medium

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.

 

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

Example 3:

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

 

Constraints:

  • 1 <= target <= 109
  • 1 <= nums.length <= 105
  • 1 <= nums[i] <= 104

 

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)).

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        n = len(nums)
        li = list(accumulate(nums, initial=0))
        result = n + 1
        for i, val in enumerate(li):
            found = bisect_left(li, val + target)   
            if found <= n:
                result = min(result, found - i)
        return result if result <= n else 0

Submission Stats:

  • Runtime: 46 ms (5.20%)
  • Memory: 28.7 MB (10.79%)