Skip to interview prep
Apexed

78. Longest Increasing Subsequence

MediumDynamic programming

Return the length of the longest strictly increasing subsequence of nums.

Example 1

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

Constraints

  • 1 ≤ nums.length ≤ 2500

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Run checks these cases; the expected output comes from the reference solution. Submit judges all 4 hidden and sample tests.

Code runs only in your browser in an isolated sandbox. Progress and submissions are saved on this device.

Longest Increasing Subsequence — coding interview practice — Apexed