Problem 42837. Increasing sub-sequence (Level 1)
Given a vector, v, of real numbers, return a positive integer, n, representing the longest contiguous increasing sub-sequence contained in v.
Example:
v = [2 18 9 6 11 20 25 3]
n = 4
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers26
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
229 Solvers
-
Determine the number of odd integers in a vector
706 Solvers
-
Count letters occurence in text, specific to words with a given length.
156 Solvers
-
Mysterious digits operation (easy)
277 Solvers
-
438 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!