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 Solvers16
Suggested Problems
-
Remove all the words that end with "ain"
2434 Solvers
-
11899 Solvers
-
Solve the set of simultaneous linear equations
437 Solvers
-
Create a square matrix of multiples
482 Solvers
-
Solve a System of Linear Equations
12785 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!