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
-
Which values occur exactly three times?
5253 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
167 Solvers
-
383 Solvers
-
658 Solvers
-
Sum the numbers on the main diagonal
620 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!