Longest Increasing Subsequence
Medium
1-D DP
•
NeetCode 150marc30
Given an integer array nums, return the length of the longest strictly increasing subsequence.

Constraints:

  • 1 <= nums.length <= 2500
  • -104 <= nums[i] <= 104