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 Solvers13
Suggested Problems
-
Remove the small words from a list of words.
1526 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2309 Solvers
-
Make a random, non-repeating vector.
9706 Solvers
-
Create a Multiplication table matrix...
565 Solvers
-
695 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!