Solution: Minimum Size Subarray Sum

Let's solve the Minimum Size Subarray Sum problem using the Sliding Window pattern.


Given an array of positive integers, nums, and a positive integer, target, find the minimum length of a contiguous subarray whose sum is greater than or equal to the target. If no such subarray is found, return 0.


  • 11 \leq target \leq 10910^9
  • 11 \leq nums.length \leq 10510^5
  • 11 \leq nums[i] \leq 10410^4

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.