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
-
The Goldbach Conjecture, Part 2
2417 Solvers
-
Set the array elements whose value is 13 to 0
1449 Solvers
-
5929 Solvers
-
Approximation of Pi (vector inputs)
279 Solvers
-
calculate the length of matrix
2572 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!