Longest Increasing Subsequence (LIS)

Question

Accepted Answer

Given an integer array `nums`, return the length of the longest strictly increasing subsequence. Can be solved with $O(n^2)$ DP or $O(n \log n)$ using patience sorting.

Longest Increasing Subsequence (LIS)

Question Explain

Start Trying This Question Simulation

Other interview questions like this

Two Sum

Longest Substring Without Repeating Characters

Median of Two Sorted Arrays