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
-
Sort a list of complex numbers based on far they are from the origin.
5820 Solvers
-
Given two arrays, find the maximum overlap
1812 Solvers
-
1635 Solvers
-
1699 Solvers
-
2276 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!