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 Solvers25
Suggested Problems
-
1477 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2068 Solvers
-
323 Solvers
-
Rounding off numbers to n decimals
5795 Solvers
-
Matrix multiplication across rows
403 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!