Why pattern taxonomy matters
Interview success depends on recognition speed. This reference helps you map problem wording to the right solution family quickly.
Core pattern families
- Arrays & Strings
- Hash Maps
- Two Pointers
- Sliding Window
- Binary Search
- Linked Lists
- Stacks & Queues
- Trees
- Graphs
- Recursion & Backtracking
- Dynamic Programming
- Heaps
- Sorting
- Greedy
- Tries
- Bit Manipulation
- Intervals
- Advanced Graphs
- Math & Geometry
- Prefix Sum
Fast recognition cues
| Cue in prompt | Likely pattern |
|---|---|
| "longest/shortest substring with condition" | Sliding Window |
| "find pair in sorted list" | Two Pointers |
| "k largest/smallest/frequent" | Heaps |
| "minimum/maximum ways or cost" | Dynamic Programming |
| "overlap/meeting/schedule windows" | Intervals or Greedy |
FAQ
Should I memorize exact solutions?
No. Memorize pattern triggers and invariants.
How many patterns should I train at once?
Two active patterns per cycle is usually optimal for retention.