FastPrepLongest Increasing Subsequence
Problems/Longest Increasing Subsequence

Longest Increasing Subsequence

Atlassian logoAtlassian● MediumFULLTIMEOA

Updated Nov 2026

QuestionFunctionExamplesConstraints

Problem statement

Source note: Reported in an Atlassian full-time online assessment. The report links to the exact Longest Increasing Subsequence exercise but does not copy its full statement. Our version follows that linked exercise. The function you write returns the result.

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
See Atlassian hiring insights
Saved
class Solution {
    public int lengthOfLIS(int[] nums) {
      // Write your code here.
    }

}
Checking account…