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
-
Which values occur exactly three times?
5176 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2029 Solvers
-
Convert Roman to Arabic Numerals
115 Solvers
-
Matlab Basics - Convert a row vector to a column vector
658 Solvers
-
240 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!