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
-
Extract leading non-zero digit
2246 Solvers
-
Number of 1s in the Binary Representation of a Number
480 Solvers
-
Project Euler: Problem 7, Nth prime
1753 Solvers
-
1065 Solvers
-
Check that number is whole number
5204 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!