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
-
Return the 3n+1 sequence for n
8477 Solvers
-
2816 Solvers
-
Create a vector whose elements depend on the previous element
777 Solvers
-
Magic is simple (for beginners)
11064 Solvers
-
Number of Even Elements in Fibonacci Sequence
1631 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!