Cody

Problem 45473. Sub-sequence - 01

Find the length of the longest increasing subsequence in the given array.

a=[2,4,2,1,3,5,6]
longest increasing subsequence = [2,4,5,6]
                               = [1,3,5,6]
                               = [2,3,5,6]
so, length = 4
Solve

Solution Stats

7.84% Correct | 92.16% Incorrect
Last Solution submitted on Apr 24, 2020

Problem Recent Solvers4

Suggested Problems

More from this Author145

Problem Tags

sequence