Skip to content
PracticalHandbooksSoftware Handbooks
Library

Senior Engineering Interview Handbook / Reading section

Part 06 - The Data Structures and Algorithms Pattern Atlas

Recognize algorithm patterns without reducing senior preparation to memorized tricks.

190entries 176chapters 1sections

This part organizes the recurring algorithm patterns that appear in interviews. The goal is not trivia recall; it is fast recognition, constraint reasoning, and choosing a defensible approach.

By the end of this part, you should have a practical pattern map for arrays, graphs, dynamic programming, search, heaps, intervals, strings, recursion, and related techniques.

  1. 39 Arrays and Strings A reasoning-first guide to two pointers, sliding windows, prefix sums, difference arrays, in-place transformations, matrix traversal, partitioning, substrings, … Read
  2. 40 Hash Maps and Sets A reasoning-first guide to membership, frequency counting, complements, grouping, indexing, caching, canonical keys, and hash-table space-time trade-offs. Read
  3. 41 Linked Structures, Stacks, Queues, and Deques A reasoning-first guide to pointer reachability, fast and slow pointers, unresolved stack obligations, expression parsing, FIFO frontiers, monotonic structures, … Read
  4. 42 Heaps and Ordered Structures A reasoning-first guide to heap invariants, top-k retention, streaming medians, scheduling, k-way merge, priority simulation, lazy deletion, and ordered search. Read
  5. 43 Sorting, Searching, and Intervals A reasoning-first guide to binary search, search on an answer, interval and event ordering, custom comparators, sweep lines, and selection algorithms. Read
  6. 44 Trees and Tries A reasoning-first guide to tree traversal, subtree facts, lowest common ancestors, serialization, balanced search trees, tries, and validation of practical … Read
  7. 45 Graphs A reasoning-first guide to graph modeling, BFS, DFS, topological ordering, cycle detection, components, union-find, bipartite checks, and weighted shortest … Read
  8. 46 Recursion, Backtracking, and Divide and Conquer A reasoning-first guide to recursive contracts, decision trees, permutations and combinations, sound pruning, state restoration, divide-and-conquer composition, … Read
  9. 47 Greedy Algorithms A technical-foundation chapter on greedy algorithms for senior coding interviews, covering safe choices, exchange arguments, interval scheduling, heaps, … Read
  10. 48 Dynamic Programming A technical-foundation chapter on dynamic programming for senior coding interviews, covering state design, recurrence transitions, memoization, tabulation, fill … Read
  11. 49 Bit Manipulation, Mathematics, and Probability A technical-foundation chapter on bit manipulation, modular arithmetic, combinatorics, randomization, and expected value, organized around the invariants that … Read
  12. 50 Pattern Selection and Proof A synthesis chapter for the algorithm pattern atlas, showing how output shape, constraints, state, invariants, rejection tests, and proof turn pattern recall … Read