33. Longest Increasing Subsequence

Medium

Topics

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

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

Output: 4

Explanation: The longest increasing subsequence is [2, 3, 7, 18] or [2, 5, 7, 101], therefore the length is 4.

Input: nums = [0,1,0,3,2,3]

Output: 4

Explanation: The longest increasing subsequence is [0, 1, 2, 3], therefore the length is 4.

Input: nums = [7,7,7,7,7,7,7]

Output: 1

Explanation: The longest increasing subsequence is [7], therefore the length is 1.

Time Complexity

O(n log n)

Space Complexity

O(n)