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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15380 Solvers
-
Find the stride of the longest skip sequence
148 Solvers
-
Back to basics 16 - byte order
190 Solvers
-
Determine the number of odd integers in a vector
681 Solvers
-
Find the Oldest Person in a Room
15998 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!