Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Split Array into Consecutive Subsequences
Bookmark
List
Two Hash Maps
Min-Heap
Input
Can Split
Two Subsequences
Cannot Split
Custom
nums
=
[1, 2, 3, 3, 4, 5]
nums
1
2
3
3
4
5
nums
1
2
3
3
4
5
nums
1
2
3
3
4
5
i
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
→ needs
2
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
→ needs
3
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
3
→ needs
4
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
3
→ needs
4
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
3
→ needs
4
s2
3
→ needs
4
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
3
→ needs
4
s2
3
4
→ needs
5
nums
1
2
3
3
4
5
i
subsequences (tail = next needed)
s1
1
2
3
→ needs
4
s2
3
4
5
→ needs
6
nums
1
2
3
3
4
5
subsequences (tail = next needed)
s1
1
2
3
✓ len 3
s2
3
4
5
✓ len 3
return true
algo
master
.
io
Step:
Split into consecutive runs, each of length ≥ 3
0 / 22
Input
Can Split
Two Subsequences
Cannot Split
Custom
nums
=
[1, 2, 3, 3, 4, 5]
0 / 22
algo
master
.
io
Step:
Split into consecutive runs, each of length ≥ 3
