From the DSA course and the 15 patterns. This folder is about how to run a coding interview, not about grinding more problems — the problems live in the NeetCode playbook.
Files
- The Coding Round — the method, the pattern-recognition table, complexity talk, and the behaviours that get you rejected with a correct solution
The uncomfortable truth about this round
A correct solution reached in silence scores worse than a nearly-correct one narrated well. The interviewer cannot read your mind and is explicitly grading communication. Most rejections at this stage are not “couldn’t solve it” — they’re “solved it in a way I couldn’t follow” or “went silent for eight minutes.”
The 60-second pattern lookup
The single highest-value thing from the patterns folder — what the problem’s phrasing tells you to reach for:
| The problem says… | Reach for | Pattern |
|---|---|---|
| sorted array, find a pair/triplet | two pointers | 02 |
| contiguous subarray, “longest/shortest with…“ | sliding window | 03 |
| range sums, queried repeatedly | prefix sum | 01 |
| cycle in a linked list, find the middle | fast/slow pointers | 04 |
| ”next greater/smaller element” | monotonic stack | 06 |
| top/smallest K, or a running median | heap | 07 |
| merge/insert intervals | sort by start, then sweep | 08 |
| sorted, or a monotonic predicate | binary search — including on the answer | 09 |
| shortest path, unweighted | BFS | 12 |
| all paths / connected components / islands | DFS | 11 |
| all combinations/permutations/subsets | backtracking | 14 |
| ”how many ways”, “min/max cost”, overlapping subproblems | DP | 15 |
| dependencies / ordering / prerequisites | topological sort | topo sort |
| dynamic connectivity, grouping | union-find | union-find |
“Binary search on the answer” is the most under-used entry there — any problem of the form “find the minimum X such that a check passes,” where the check is monotonic, is a binary search over the answer space rather than over an array. Recognising it turns a lot of hard-looking problems into medium ones.
Question banks
One bank per lesson: micro-questions with the answers hidden behind toggles, for closed-book recall rather than reading. Method explained in the arrays bank.
Related
- DSA course · the 15 patterns
- NeetCode 150 playbook
- Java collections — know your language’s data structures cold
- The Primetechie Path — Rank I gate
Software engineering
Infrastructure & security
Computer science
Hardware & engineering