Cody

Problem 42838. Increasing sub-sequence (Level 2)

  • Created by HH

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

Solution Stats

57.45% Correct | 42.55% Incorrect
Last solution submitted on Nov 08, 2018

Problem Comments

Solution Comments

Problem Recent Solvers14

Suggested Problems

More from this Author34

Problem Tags