This is the next step up from Problem 42837.
Given a vector, v, of real numbers, return a positive integer, n, representing the longest non-contiguous increasing sub-sequence contained in v.
Example:
v = [ 2 18 9 6 11 20 25 3]
n = 5
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers19
Suggested Problems
-
666 Solvers
-
Back to basics 16 - byte order
202 Solvers
-
Given a window, how many subsets of a vector sum positive
875 Solvers
-
317 Solvers
-
Penny flipping - calculate winning probability (easy)
200 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The purpose of this problem is strange.