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 Solvers22
Suggested Problems
-
Find matching string from a list of strings
270 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
748 Solvers
-
Find the maximum number of decimal places in a set of numbers
3375 Solvers
-
Is this triangle right-angled?
6536 Solvers
-
Approximation of Pi (vector inputs)
272 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!