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 Solvers17
Suggested Problems
-
Determine whether a vector is monotonically increasing
22177 Solvers
-
1298 Solvers
-
Generate N equally spaced intervals between -L and L
911 Solvers
-
639 Solvers
-
10216 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!