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 Solvers20
Suggested Problems
-
Swap the first and last columns
22428 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1257 Solvers
-
Back to basics 8 - Matrix Diagonals
958 Solvers
-
Back to basics 12 - Input Arguments
618 Solvers
-
639 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!