Lenpaste

About

Docs

Settings

markdown, LF
 1# LC6120 Longest Increasing Subsequence
 2
 3**Idea.** patience DP O(n log n).
 4
 5**Checklist**
 6- Clarify constraints and edge cases first
 7- Name the pattern (two pointers / DP / graph / binary search)
 8- Walk one example end-to-end before coding
 9- State time/space; watch off-by-one
10
11*Disclosure: I help build [AI tool for job interviews](https://www.linkjob.ai/ai-mock-interview/) — an interview prep copilot. Notes are my own study notes.*

Author: https://www.linkjob.ai/

Created: Sat, 07 Nov 2026 08:25:44 +0000

Expires: Never