Cody

Problem 42837. Increasing sub-sequence (Level 1)

Created by HH in Community

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

Solution Stats

63.89% Correct | 36.11% Incorrect
Last solution submitted on Jan 24, 2019

Solution Comments