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 Solvers13
Suggested Problems
-
Determine if a Given Number is a Triangle Number
377 Solvers
-
Back to basics 12 - Input Arguments
596 Solvers
-
Find the maximum number of decimal places in a set of numbers
2854 Solvers
-
589 Solvers
-
the average value of the elements
1575 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!