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
-
1232 Solvers
-
Find the stride of the longest skip sequence
150 Solvers
-
Height of a right-angled triangle
1754 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
839 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
106 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!