Problem 42837. Increasing sub-sequence (Level 1)

HH

30 solvers

3 likes

Solve

Solve Later

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

73 Solutions

Last Solution submitted on May 28, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers30

Suggested Problems

Back to basics 4 - Search Path

383 Solvers
Back to basics 25 - Valid variable names

339 Solvers
04 - Scalar Equations 2

540 Solvers
Slicing the cube

93 Solvers
Natural numbers in string form

1946 Solvers

More from this Author45

Circle Division

9 Solvers
Minimum number of crossings in a complete graph

15 Solvers
Primitive Root Modulo n

7 Solvers
Integer complexity

25 Solvers
Factorizing a number into a given number of factors

31 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!