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 Solvers21
Suggested Problems
-
Determine whether a vector is monotonically increasing
22846 Solvers
-
1498 Solvers
-
The Answer to Life, the Universe, and Everything
577 Solvers
-
1589 Solvers
-
Matrix of almost all zeros, except for main diagonal
189 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!