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
-
Find the numeric mean of the prime numbers in a matrix.
9133 Solvers
-
Project Euler: Problem 7, Nth prime
1751 Solvers
-
Are all the three given point in the same line?
600 Solvers
-
613 Solvers
-
Converts numbers into characters
2027 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!