6 min read A decision procedure for recognizing which algorithm pattern a problem wants, with the trigger phrase, data structure, and canonical problems to drill for each. Read article
7 min read A reference to the main dynamic programming families, what the dp array means in each, and the canonical problems that drill each one. Read article
7 min read A reference for the common sorting algorithms, their time and space costs, whether each is stable, and which one to name when an interview constraint changes. Read article
7 min read The seven recurrences that cover most interview dynamic programming, with the tells that let you recognize each one before you write code. Read article
5 min read Big-O answers one question, what the running time does when you double the input, and the gap between O(n log n) and O(n squared) at scale is where coding interviews are won or lost. Read article
7 min read A reference table mapping fifteen coding-interview patterns to the signal that triggers each one and the canonical problem to learn it on. Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.
