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
-
3890 Solvers
-
2564 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1404 Solvers
-
Put two time series onto the same time basis
357 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1284 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!