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

88 Solutions

23 Solvers

Last Solution submitted on Apr 27, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Group

Problem Recent Solvers23

George Berken KARUPPASAMYPANDIYAN M GeeTwo Lorenzo

Problem Tags

Community Treasure Hunt

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

Start Hunting!