Find the length of the longest increasing subsequence in the given array.
a=[2,4,2,1,3,5,6]
longest increasing subsequence = [2,4,5,6]
= [1,3,5,6]
= [2,3,5,6]
so, length = 4
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers24
Suggested Problems
-
6989 Solvers
-
2182 Solvers
-
Similar Triangles - find the height of the tree
477 Solvers
-
Sum of diagonal of a square matrix
1643 Solvers
-
Matrix indexing with two vectors of indices
781 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!