33. Longest Increasing Subsequence

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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.

Example 2:

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.

Example 3:

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

Output: 1

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

Constraints:

•
•

Time Complexity

O(n log n)

Space Complexity

O(n)

33. Longest Increasing Subsequence

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

33. Longest Increasing Subsequence

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases