Problem 45473. Sub-sequence - 01
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
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers12
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5603 Solvers
-
1516 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1079 Solvers
-
Large Sum (inspired by Project Euler 13)
83 Solvers
-
Calculate Amount of Cake Frosting
23654 Solvers
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!