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 comments
Loading...
Problem Recent Solvers22
Suggested Problems
-
Calculate the area of a triangle between three points
3424 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2041 Solvers
-
Rounding off numbers to n decimals
5519 Solvers
-
Check if a matrix is a palindrome in all directions
135 Solvers
-
calculate the length of matrix
2472 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!