3,000+ lines of coding interview preparation notes compiled over multiple interview cycles. Covers problem-solving heuristics, data structures, algorithms, bit manipulation, and general interview strategy.
- Interview strategy — how to approach a problem out loud, when to ask questions, how to start with brute force and optimize
- Pattern heuristics — quick lookup for which technique to use (sorted array = binary search/two pointers, permutations = backtracking, top K = heap, etc.)
- Data structure notes — hash tables, trees, graphs, linked lists, stacks, heaps, tries
- Algorithm patterns — DFS, BFS, dynamic programming, backtracking (choose/explore/unchoose), divide and conquer, sliding window
- Bit manipulation — 2's complement, bitwise operators, common tricks
- Complexity analysis — Big-O cheat sheet references, space/time tradeoffs
Open notes.md — it's a single comprehensive reference document organized by topic. Meant to be searched, not read front to back.