Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· 1d-dp Mock interview

Longest Increasing Subsequence

Given an integer array `nums`, return the length of the longest strictly increasing subsequence (elements left to right, not necessarily contiguous).

Examples

in: nums = [10,9,2,5,3,7,101,18]

out: 4

[2,3,7,18] or [2,3,7,101]

Constraints

0 <= len(nums) <= 2500
-10^4 <= nums[i] <= 10^4

Hints

target: O(n log n) time⌘↩ run · ⇧⌘↩ submit