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
-
373 Solvers
-
375 Solvers
-
655 Solvers
-
772 Solvers
-
Convert from Fahrenheit to Celsius
25466 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!