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 Solvers24
Suggested Problems
-
Select every other element of a vector
36838 Solvers
-
Remove the small words from a list of words.
1566 Solvers
-
Longest run of consecutive numbers
6620 Solvers
-
390 Solvers
-
Numbers spiral diagonals (Part 1)
302 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!