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

23.53% Correct | 76.47% Incorrect
Last Solution submitted on Dec 07, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers20

Suggested Problems

More from this Author174

Problem Tags

sequence

Community Treasure Hunt

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

Start Hunting!