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
-
Compute a dot product of two vectors x and y
1046 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
449 Solvers
-
704 Solvers
-
Spot the First Occurrence of 5
431 Solvers
-
Solve a System of Linear Equations
14122 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!