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
-
1 Comment
士元 梁
on 24 Jul 2022
It is quite a good problem, something for nothing,
Solution Comments
Show commentsProblem Recent Solvers29
Suggested Problems
-
Find the maximum number of decimal places in a set of numbers
2633 Solvers
-
Sum the entries of each column of a matrix which satisfy a logical condition.
157 Solvers
-
1122 Solvers
-
Find the Oldest Person in a Room
15989 Solvers
-
3n + 1 Problem (a.k.a The Collatz Conjecture)
29 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!