Sub-sequence - 01 - MATLAB Cody - MATLAB Central

Problem 45473. Sub-sequence - 01

Difficulty: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

Solution Stats

17.11% Correct | 82.89% Incorrect
Last Solution submitted on Aug 03, 2024

Problem Comments

Solution Comments

Show comments
R2025a Pre-release highlights
This topic is for discussing highlights to the current R2025a Pre-release.
13
5

Problem Recent Solvers13

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!
Go to top of page