Loading…
The original 75-problem starter set from the Blind forum — still the most efficient way to pass a FAANG coding round.
About this plan
Blind 75 is a hand-picked list of 75 LeetCode problems that cover every pattern interviewers rely on for a FAANG-level coding round. It originated on the Blind forum (2020) as the shortest possible path to feeling interview-ready, and it remains the single highest-leverage problem set in the industry.
Work through it once, and you will have seen a canonical example of almost every pattern the interviewer is checking for. On InterviewExplainer, every problem on this list links to a line-by-line walkthrough in Java and Python — not just a submission, but the interview-voice explanation of why the approach works.
Why this sheet
How to use it
The problem set
The O(1) lookup patterns that unlock most Easy/Medium problems.
Linear-time traversal with constant extra memory.
Turn nested loops into a single pass.
Halve the search space — cleanly.
Pointer manipulation without pointer bugs.
Recursion on hierarchical data.
Prefix trees for autocomplete, word search, and dictionary problems.
Top-K and running-median patterns.
BFS, DFS, and topological sort.
The canonical introduction to memoization and tabulation.
Grids and string pairs.
Local choices that compound to a global optimum.
Merge, overlap, schedule.
Matrix manipulation and number-theory basics.
XOR tricks and bit counting.
Keep exploring