Problem 51201. Find length of longest strictly increasing subsequence

Created by Evan Braun

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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

74 Solutions
35 Solvers

Last Solution submitted on Aug 31, 2024

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

士元梁 on 24 Jul 2022

It is quite a good problem, something for nothing,

q-_--q on 16 Jul 2024

Cases that the subsequence don't start counting from the FIRST number should be considered in the test!!!

Solution Comments

Show comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers35

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 51201. Find length of longest strictly increasing subsequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers35

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Problem 51201. Find length of longest strictly increasing subsequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers35

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Players