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 Solvers25
Suggested Problems
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Matrix indexing with two vectors of indices
782 Solvers
-
906 Solvers
-
Sum of first n positive integers
630 Solvers
-
What is Sum Of all elements of Matrix
447 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!