Problem 45473. Sub-sequence - 01

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

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

Solution Stats

16.0% Correct | 84.0% Incorrect
Last Solution submitted on Jul 30, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers12

Suggested Problems

More from this Author165

Problem Tags

Community Treasure Hunt

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

Start Hunting!