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
-
3053 Solvers
-
Compute a dot product of two vectors x and y
1057 Solvers
-
Calculate the height of an object dropped from the sky
327 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
735 Solvers
-
Matrix of almost all zeros, except for main diagonal
191 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!