Problem 42837. Increasing sub-sequence (Level 1)

  • Created by HH

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

Solve

Solution Stats

52.78% Correct | 47.22% Incorrect
Last Solution submitted on Oct 06, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers29

Suggested Problems

More from this Author45

Problem Tags

numbers sequences

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!