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

  1. 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 forPattern
sorted array, find a pair/triplettwo pointers02
contiguous subarray, “longest/shortest with…“sliding window03
range sums, queried repeatedlyprefix sum01
cycle in a linked list, find the middlefast/slow pointers04
”next greater/smaller element”monotonic stack06
top/smallest K, or a running medianheap07
merge/insert intervalssort by start, then sweep08
sorted, or a monotonic predicatebinary search — including on the answer09
shortest path, unweightedBFS12
all paths / connected components / islandsDFS11
all combinations/permutations/subsetsbacktracking14
”how many ways”, “min/max cost”, overlapping subproblemsDP15
dependencies / ordering / prerequisitestopological sorttopo sort
dynamic connectivity, groupingunion-findunion-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.


↑ Back to Data Structures & Algorithms