Learn
Practice
Newsletter
Resources
F
Toggle theme
0
F
Toggle theme
0
Toggle menu
← Back to All Animations
Longest Increasing Subsequence
Bookmark
Dynamic Programming
Binary Search
Input
Example 1
Example 2
Example 3
Custom
nums
=
[10, 9, 2, 5, 3, 7, 101, 18]
10
9
2
5
3
7
101
18
1
1
1
1
1
1
1
1
nums
dp
algo
master
.
io
Step:
Start Longest Increasing Subsequence
0 / 55
Input
Example 1
Example 2
Example 3
Custom
nums
=
[10, 9, 2, 5, 3, 7, 101, 18]
0 / 55
10
9
2
5
3
7
101
18
1
1
1
1
1
1
1
1
nums
dp
algo
master
.
io
Step:
Start Longest Increasing Subsequence
