Find length of longest strictly increasing subsequence - MATLAB Cody - MATLAB Central

Problem 51201. Find length of longest strictly increasing subsequence

Difficulty:
(18)
Rate
A subsequence is a subset of the array that appears in the same relative order of the array but the elements do not necessarily have to be consecutive.
Example:
For an array x = [8, 24, 7, 35, 23, 52, 39, 64, 78],
the length of the longest strictly increasing subsequence is 6 (8, 24, 35, 52, 64, 78).
Solve

Solution Stats

55.41% Correct | 44.59% Incorrect
Last Solution submitted on Aug 31, 2024

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 Solvers35

Suggested Problems

More from this Author1

Problem Tags

matlab

Community Treasure Hunt

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

Start Hunting!
Go to top of page