Problem 51201. Find length of longest strictly increasing subsequence

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.
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).

Solution Stats

53.03% Correct | 46.97% Incorrect
Last Solution submitted on Sep 08, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers29

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

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

Start Hunting!