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 if a Given Number is a Triangle Number
386 Solvers
-
Number of 1s in a binary string
10256 Solvers
-
Relative ratio of "1" in binary number
1525 Solvers
-
Is this triangle right-angled?
6276 Solvers
-
423 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!