Minimum Size Subarray Sum

0Medium

Minimum Size Subarray Sum

Given an array of positive integers nums and positive integer target, return the minimal length of a subarray whose sum >= target. Return 0 if no such subarray.

Example 1:

Input: target = 7, nums = [2,3,1,2,4,3] Output: 2 (subarray [4,3])

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

Jnaneshwara Reddy Satti

Builder · ClearCode

Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕

If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.

Support via Razorpay

Found this helpful? Support ClearCode ☕ — keeps it free forever

Algorithm Visualizer

O(N)

Before starting this video, please check the description to ensure you know the prerequisites. If you're comfortable with arrays and hash maps, let's go!

TEST CASE: []O(1)

clearcode.in

Execution Trace

1def min_subarray_len(target, nums):

2 n = len(nums)

3 min_length = float('inf')

4 left = 0

5 current_sum = 0

6 for right in range(n):

7 current_sum += nums[right]

8 while current_sum >= target:

9 min_length = min(min_length, right - left + 1)

10 current_sum -= nums[left]

11 left += 1

12 return 0 if min_length == float('inf') else min_length

0:00 / 7:34