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
-
2367 Solvers
-
156 Solvers
-
Number of 1s in a binary string
10991 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
264 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
1723 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!