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
-
Find the two most distant points
2949 Solvers
-
Find state names that start with the letter N
1428 Solvers
-
Check to see if a Sudoku Puzzle is Solved
337 Solvers
-
Natural numbers in string form
1840 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!