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 Solvers26
Suggested Problems
-
2187 Solvers
-
Find state names that start with the letter N
1513 Solvers
-
Back to basics 8 - Matrix Diagonals
974 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
6661 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!