Longest Increasing Subsequence

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

Constraints

  • 1 <= nums.length <= 2500
  • -10^4 <= nums[i] <= 10^4
View editorial solution
Auto-saved · 3 lines
class Solution:
def longestIncreasingSubsequence(self, nums) -> int:
Console

Click Run to execute sample tests.