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
-
2380 Solvers
-
Read a column of numbers and interpolate missing data
2357 Solvers
-
Are all the three given point in the same line?
608 Solvers
-
Solving Quadratic Equations (Version 1)
507 Solvers
-
Combined Ages 1 - Symmetric, n = 3
335 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!