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 Solvers23
Suggested Problems
-
2605 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2871 Solvers
-
Create a vector whose elements depend on the previous element
791 Solvers
-
114 Solvers
-
Numbers spiral diagonals (Part 1)
299 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!