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 Solvers26
Suggested Problems
-
2548 Solvers
-
Given two arrays, find the maximum overlap
1814 Solvers
-
Test if a Number is a Palindrome without using any String Operations
259 Solvers
-
Remove the two elements next to NaN value
715 Solvers
-
Check if number exists in vector
14650 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!