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
-
1218 Solvers
-
Project Euler: Problem 5, Smallest multiple
1318 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
94 Solvers
-
494 Solvers
-
Matlab Basics - Switching Assignments
272 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!