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
-
Return a list sorted by number of occurrences
2901 Solvers
-
585 Solvers
-
Remove the two elements next to NaN value
713 Solvers
-
Find out sum of all elements of given Matrix
540 Solvers
-
Approximation of Pi (vector inputs)
285 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!