Search
⌘K
Get Premium
Leetcode 300. Longest Increasing Subsequence
Given an array of integers, return the length of the longest strictly increasing subsequence; the core challenge is to compute this efficiently—naive DP is O(n^2) but it can be reduced to O(n log n) using a patience‑sorting / binary‑search on tails approach.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.