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 Solvers25
Suggested Problems
-
Extract leading non-zero digit
2256 Solvers
-
Find state names that end with the letter A
1198 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
782 Solvers
-
Matrix of almost all zeros, except for main diagonal
191 Solvers
-
2353 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!