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
-
Create a cell array out of a struct
2598 Solvers
-
1477 Solvers
-
Solve the set of simultaneous linear equations
513 Solvers
-
Implement simple rotation cypher
1099 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
1902 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!