Fetching algorithms...

Minimum Size Subarray Sum Visualizer & Solution | Rulcode

223. Minimum Size Subarray Sum

Medium

Topics

Companies

Hint

Understand Before Coding

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: target = 7, nums = [2,3,1,2,4,3]

Output: 2

Explanation: The subarray [4,3] has a sum of 7 and a length of 2, which is the minimal length.

Example 2:

Input: target = 4, nums = [1,4,4]

Output: 1

Explanation: The subarray [4] at index 1 has a sum of 4 and a length of 1, which is the minimal length.

Example 3:

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

Output: 0

Explanation: No subarray in [1,1,1,1,1,1,1,1] sums up to 11 or more. The maximum sum is 8.

Constraints:

Time Complexity

O(n)

Space Complexity

O(1)

Loading problem details...

rulcode

223. Minimum Size Subarray Sum

Medium

Topics

Companies

Hint

Understand Before Coding

Step 1 / 43

Speed: 1.0x

Minimum Size Subarray Sum (Sliding Window)

Target Sum Required:7

Input Array & Window

right

left

Current Sum0 / 7

Min Length Result∞

Commentary

Find the minimum length of a contiguous subarray whose sum is greater than or equal to target = 7.

Variables

target7

nums[2, 3, 1, 2, 4, 3]

left0

total0

resultInfinity

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: target = 7, nums = [2,3,1,2,4,3]

Output: 2

Explanation: The subarray [4,3] has a sum of 7 and a length of 2, which is the minimal length.

Example 2:

Input: target = 4, nums = [1,4,4]

Output: 1

Explanation: The subarray [4] at index 1 has a sum of 4 and a length of 1, which is the minimal length.

Example 3:

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

Output: 0

Explanation: No subarray in [1,1,1,1,1,1,1,1] sums up to 11 or more. The maximum sum is 8.

Constraints:

Time Complexity

O(n)

Space Complexity

O(1)

Step 1 / 43

Speed: 1.0x

Minimum Size Subarray Sum (Sliding Window)

Target Sum Required:7

Input Array & Window

right

left

Current Sum0 / 7

Min Length Result∞

Commentary

Find the minimum length of a contiguous subarray whose sum is greater than or equal to target = 7.

Variables

target7

nums[2, 3, 1, 2, 4, 3]

left0

total0

resultInfinity

223. Minimum Size Subarray Sum

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

223. Minimum Size Subarray Sum

Understand Before Coding

Minimum Size Subarray Sum (Sliding Window)

Input Array & Window

Commentary

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

Minimum Size Subarray Sum (Sliding Window)

Input Array & Window

Commentary

Variables