Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Size Subarray Sum
Bookmark
Brute Force
Sliding Window
Prefix + Binary Search
Input
Example 1
Example 2
No solution
Mid array
Custom
nums
=
[2, 3, 1, 2, 4, 3]
,
target
=
7
0
1
2
3
4
5
2
3
1
2
4
3
sum =
0
target =
7
0
1
2
3
4
5
2
3
1
2
4
3
sum =
0
target =
7
0
1
2
3
4
5
2
3
1
2
4
3
left
right
sum =
2
+
3
=
5
sum =
5
target =
7
0
1
2
3
4
5
2
3
1
2
4
3
left
right
sum =
6
+
2
=
8
target reached
sum =
8
target =
7
0
1
2
3
4
5
minLen = 4
2
3
1
2
4
3
left
right
sum =
3
+
1
=
4
sum =
4
target =
7
0
1
2
3
4
5
minLen = 4
2
3
1
2
4
3
left
right
sum =
6
+
4
=
10
target reached
sum =
10
target =
7
0
1
2
3
4
5
minLen = 4
2
3
1
2
4
3
left
right
include nums[
3
] =
2
sum =
1
target =
7
0
1
2
3
4
5
minLen = 3
2
3
1
2
4
3
left
right
include nums[
3
] =
2
sum =
7
target =
7
0
1
2
3
4
5
minLen = 3
2
3
1
2
4
3
left
right
include nums[
5
] =
3
sum =
6
target =
7
0
1
2
3
4
5
minLen = 3
2
3
1
2
4
3
left
right
include nums[
5
] =
3
sum =
4
target =
7
0
1
2
3
4
5
minLen = 2 [4,3]
2
3
1
2
4
3
minLen =
2
algo
master
.
io
Step:
Start of algorithm
0 / 53
Input
Example 1
Example 2
No solution
Mid array
Custom
nums
=
[2, 3, 1, 2, 4, 3]
,
target
=
7
0 / 53
algo
master
.
io
Step:
Start of algorithm
