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
-
Find the numeric mean of the prime numbers in a matrix.
9023 Solvers
-
2558 Solvers
-
Sum all integers from 1 to 2^n
16334 Solvers
-
209 Solvers
-
Matrix of almost all zeros, except for main diagonal
184 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!