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
-
Count consecutive 0's in between values of 1
521 Solvers
-
5834 Solvers
-
Replace Nonzero Numbers with 1
446 Solvers
-
Spot the First Occurrence of 5
434 Solvers
-
Converts numbers into characters
2061 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!