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
-
Find the numeric mean of the prime numbers in a matrix.
9178 Solvers
-
Back to basics 12 - Input Arguments
626 Solvers
-
835 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
268 Solvers
-
Is this triangle right-angled?
6692 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!