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 Solvers17
Suggested Problems
-
Return the 3n+1 sequence for n
8400 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1229 Solvers
-
401 Solvers
-
Getting the indices from a vector
11150 Solvers
-
Unique values without using UNIQUE function
399 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!