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 Solvers18
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2125 Solvers
-
Find the stride of the longest skip sequence
192 Solvers
-
355 Solvers
-
404 Solvers
-
6286 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.