Loading…
LeetCode's own curated 150-problem set — the single most representative sample of what a modern coding interview actually asks.
About this plan
The LeetCode Top Interview 150 is the platform's official, hand-curated study plan: 150 problems chosen to cover every pattern an interviewer is likely to test, ordered from foundational array/string work up to multidimensional dynamic programming. Unlike random grinding, every problem here earns its place — it is either a canonical example of a pattern or a high-frequency company favourite.
On InterviewExplainer, each problem links to a full interview-voice walkthrough: clarifying questions, brute-force → optimal progression, a dry-run trace, and line-by-line Java and Python. Problems still being written show as "Queued" — they are on the roadmap and the list stays stable so your progress carries over.
Why this sheet
How to use it
The problem set
Bread-and-butter scanning, in-place edits, and string parsing.
Opposite-end and fast/slow traversal in O(1) space.
Variable and fixed windows over arrays and strings.
In-place grid manipulation tricks.
O(1) membership and frequency counting.
Sort then sweep.
LIFO parsing and evaluation.
Pointer surgery with dummy heads.
Recursion on hierarchical data.
Level-order traversal patterns.
Inorder = sorted.
DFS, union-find, topological sort.
Shortest path in unweighted graphs.
Prefix trees.
Choose, explore, un-choose.
Split, solve, combine.
Running-best subarray DP.
Halve the search space.
Top-K and running median.
XOR and bit tricks.
Number theory and overflow-safe arithmetic.
The canonical memo/tabulation set.
Grids and string pairs.
Keep exploring