Problem 45473. Sub-sequence - 01
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 commentsProblem Recent Solvers20
Suggested Problems
-
Select every other element of a vector
35821 Solvers
-
3983 Solvers
-
The Goldbach Conjecture, Part 2
2406 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
694 Solvers
-
Simple equation: Annual salary
4246 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!