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
-
Remove the polynomials that have positive real elements of their roots.
1740 Solvers
-
Sum all integers from 1 to 2^n
17466 Solvers
-
Change the sign of even index entries of the reversed vector
645 Solvers
-
Reverse the elements of an array
1114 Solvers
-
Create an index-powered vector
940 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!