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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15808 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
182 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
14138 Solvers
-
Convert given decimal number to binary number.
2350 Solvers
-
11863 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!