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 Solvers22
Suggested Problems
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
Get the area codes from a list of phone numbers
1072 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1267 Solvers
-
572 Solvers
-
Converts numbers into characters
2038 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!