Longest Increasing Subsequence

Medium Dynamic Programming

Log in to solve

Given an integer array, print the length of the longest strictly increasing subsequence.

Constraints

1 <= n <= 2500 -10^4 <= nums[i] <= 10^4

No discussions yet.