Appendix E — Subject Index
This manual index works in both the HTML navigation and printed/exported versions. Quarto generates the book table of contents and per-page contents automatically; subject entries below add conceptual lookup across chapters.
E.1 A
- adjacency list: Course Schedule; Java toolkit; Rust toolkit
- anagrams: Group Anagrams
ArrayDeque: Valid Parentheses; Level Order; Java toolkitArrayList: Merge Intervals; Java toolkit- arrays and sequences: Binary Search; Product Except Self; Java toolkit; Python toolkit; Rust toolkit
E.2 B
- binary search: Binary Search; Rotated Search
- binary search tree: Validate BST
- breadth-first search: Level Order; Number of Islands
E.3 C
- canonical key: Group Anagrams
- comparators and sort keys: Merge Intervals; Top K Words; Java toolkit; Python toolkit; Rust toolkit
- connected components: Number of Islands
- correctness proofs: Complexity guide
- cycles: Linked-List Cycle; Course Schedule
E.4 D
- depth-first search: Validate BST; Lowest Common Ancestor
- dynamic programming: Maximum Subarray; Coin Change
E.5 F–H
- fast and slow pointers: Linked-List Cycle
- frequency map: Top K Words
- graphs: Number of Islands; Course Schedule; Java toolkit
- greedy reasoning: Maximum Subarray; Coin Change counterexample
HashMap: Two Sum; Longest Substring; Group Anagrams- heap: Top K Words; Java toolkit
E.6 I–L
- indegree: Course Schedule
- interview process: Interview Playbook
- invariants: Interview Playbook; every problem chapter
- JUnit: Java toolkit
- Kadane’s algorithm: Maximum Subarray
- Kahn’s algorithm: Course Schedule
- linked lists: Reverse List; Cycle; Merge Lists
- lowest common ancestor: Lowest Common Ancestor
E.7 M–P
- mutation: Merge Intervals; Reverse List; Number of Islands
OptionandResult: Rust toolkit- prefix/suffix products: Product Except Self
PriorityQueue: Top K Words; Java toolkit
E.8 Q–S
- queue: Level Order; Number of Islands; Course Schedule
Rc<RefCell<_>>: Linked-List Cycle; Rust toolkit- recursion: Validate BST; Lowest Common Ancestor
- sentinel node: Merge Sorted Lists
- sliding window: Longest Substring
- sorting: Merge Intervals; Three Sum; Group Anagrams
- space complexity: Complexity guide
- stack: Valid Parentheses
E.9 T–Z
- test design: Interview Playbook; test table in every chapter
- testing frameworks: Java/JUnit; Python/
unittest; Rust/Cargo - time complexity: Complexity guide
- topological sort: Course Schedule
- trees: Level Order; Validate BST; Lowest Common Ancestor
- two pointers: Three Sum; Merge Sorted Lists
- Unicode: Longest Substring; Python toolkit; Rust toolkit
- visited marking: Number of Islands
- zeros: Product Except Self; Coin Change