Problem 51201. Find length of longest strictly increasing subsequence
A subsequence is a subset of the array that appears in the same relative order of the array but the elements do not necessarily have to be consecutive.
Example:
For an array x = [8, 24, 7, 35, 23, 52, 39, 64, 78],
the length of the longest strictly increasing subsequence is 6 (8, 24, 35, 52, 64, 78).
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers34
Suggested Problems
-
6219 Solvers
-
Implement simple rotation cypher
1054 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
99 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1045 Solvers
-
There are 10 types of people in the world
1096 Solvers
More from this Author1
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!