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
-
3902 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3737 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
524 Solvers
-
2010 Solvers
-
Sums of cubes and squares of sums
383 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!