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 Solvers24
Suggested Problems
-
Read a column of numbers and interpolate missing data
2355 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1326 Solvers
-
11188 Solvers
-
Longest run of consecutive numbers
6643 Solvers
-
2298 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!