FastPrep
Problem · Array

Longest Increasing Subsequence

Learn this problem
● MediumAtlassian logoAtlassianFULLTIMEOA

Problem statement

Return the length of the longest subsequence of nums whose values are strictly increasing. A subsequence preserves original index order but may omit values.

Function

lengthOfLIS(nums: int[]) → int

Examples

Example 1

nums = [10,9,2,5,3,7,101,18]return = 4

One longest increasing subsequence is [2,3,7,101].

Constraints

  • 1 <= nums.length <= 200000
  • -10^9 <= nums[i] <= 10^9

More Atlassian problems

drafts saved locally
public int lengthOfLIS(int[] nums) {
  // Write your code here.
}
nums[10,9,2,5,3,7,101,18]
expected4
checking account