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 Solvers24
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15806 Solvers
-
Maximum running product for a string of numbers
2257 Solvers
-
Compute a dot product of two vectors x and y
1054 Solvers
-
466 Solvers
-
Area of an equilateral triangle
6906 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!