Learn
Practice
Newsletter
Resources
Animations
New
F
Toggle theme
0
F
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]
maxLength =
0
nums
10
9
2
5
3
7
101
18
dp
1
1
1
1
1
1
1
1
0
1
2
3
4
5
6
7
how long is the longest strictly increasing subsequence?
algo
master
.
io
Step:
How long is the longest strictly increasing subsequence?
0 / 55
Input
Example 1
Example 2
Example 3
Custom
nums
=
[10, 9, 2, 5, 3, 7, 101, 18]
0 / 55
maxLength =
0
nums
10
9
2
5
3
7
101
18
dp
1
1
1
1
1
1
1
1
0
1
2
3
4
5
6
7
how long is the longest strictly increasing subsequence?
algo
master
.
io
Step:
How long is the longest strictly increasing subsequence?
