Problem 42838. Increasing sub-sequence (Level 2)
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
Jean-Marie Sainthillier
on 29 Apr 2016
The purpose of this problem is strange.
Solution Comments
Show commentsProblem Recent Solvers16
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5603 Solvers
-
340 Solvers
-
Return unique values without sorting
905 Solvers
-
Vectorize the digits of an Integer
316 Solvers
-
Cell Counting: How Many Draws?
1834 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!