Increasing sub-sequence (Level 2) - MATLAB Cody - MATLAB Central

Problem 42838. Increasing sub-sequence (Level 2)

  • Created by HH
Difficulty:
(20)
Rate

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

Solve

Solution Stats

27.52% Correct | 72.48% Incorrect
Last Solution submitted on Jun 06, 2022

Problem Comments

Solution Comments

Show comments
Why should you share code?
In a discussion on LInkedin about my recent blog post, Do these...
Mike Croucher in General
1
3
View Post

Problem Recent Solvers16

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!