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

Maximum running product for a string of numbers

2257 Solvers
Solve the set of simultaneous linear equations

505 Solvers
Construct an index vector from two input vectors in vectorized fashion

460 Solvers
Return area of square

18580 Solvers
05 - Vector Equations 1

492 Solvers

More from this Author45

Korselt's Criterion

7 Solvers
Find the dividend

6 Solvers
Sorting integers by their digits (Level 2)

59 Solvers
Return the sequence element III

23 Solvers
Minimum number of crossings in a complete graph

15 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!