Sub-sequence - 01 - MATLAB Cody - MATLAB Central

Problem 45473. Sub-sequence - 01

Difficulty:
No rating
|Rate

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

19.75% Correct | 80.25% Incorrect
Last Solution submitted on Mar 18, 2025

Problem Comments

Solution Comments

Show comments
Who Deserves Your Praise? Discover the New Contribution Widget!
...
We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers16

Suggested Problems

More from this Author165

Problem Tags

sequence

Community Treasure Hunt

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

Start Hunting!
Go to top of page