Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Contiguous Array
Bookmark
Brute Force
Prefix Sum + Hash Map
Input
Classic
Alternating
Full Balance
Mostly Ones
Custom
nums
=
[0, 1, 0]
zeros =
0
ones =
0
maxLen =
0
0
1
2
0
1
0
zeros =
0
ones =
0
maxLen =
0
0
1
2
0
1
0
zeros =
0
ones =
0
maxLen =
0
0
1
2
0
1
0
zeros =
1
ones =
0
maxLen =
0
0
1
2
0
1
0
start
end
nums[0..0]:
1 zero, 0 ones
zeros =
1
ones =
1
maxLen =
2
0
1
2
0
1
0
start
end
nums[0..1]:
1 zero, 1 one
balanced, new maxLen 2
zeros =
2
ones =
1
maxLen =
2
0
1
2
0
1
0
start
end
nums[0..2]:
2 zeros, 1 one
zeros =
0
ones =
1
maxLen =
2
0
1
2
0
1
0
start
end
nums[1..1]:
0 zeros, 1 one
zeros =
1
ones =
1
maxLen =
2
0
1
2
0
1
0
start
end
nums[1..2]:
1 zero, 1 one
balanced, length 2
zeros =
1
ones =
0
maxLen =
2
0
1
2
0
1
0
start
end
nums[2..2]:
1 zero, 0 ones
zeros =
0
ones =
0
maxLen =
2
0
1
2
0
1
0
maxLen =
2
: nums[0..1]
algo
master
.
io
Step:
Start: find the longest subarray with equal 0s and 1s
0 / 8
Input
Classic
Alternating
Full Balance
Mostly Ones
Custom
nums
=
[0, 1, 0]
0 / 8
algo
master
.
io
Step:
Start: find the longest subarray with equal 0s and 1s
