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
-
2662 Solvers
-
Getting the row and column location from a matrix
282 Solvers
-
670 Solvers
-
639 Solvers
-
Solve a System of Linear Equations
10885 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!