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
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers50
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53923 Solvers
-
3916 Solvers
-
1852 Solvers
-
6387 Solvers
-
Converts numbers into characters
2181 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!
It is quite a good problem, something for nothing,
Cases that the subsequence don't start counting from the FIRST number should be considered in the test!!!