-
8. Graphs
🕸️ The capstone: representation, BFS/DFS, topological sort, shortest paths, and MST.
-
7. Sorting & Searching
🔀 Comparison and linear sorts, binary search, and binary search on the answer.
-
6. Recursion & Backtracking
🔁 The recursion mental model and the choose/explore/un-choose backtracking template.
-
5. Hierarchical Structures
🌳 Ordered and ranked access: BST and balanced trees, heaps, tries, and union-find.
-
4. Array & String Techniques
🪟 The moves that turn O(n²) into O(n): two pointers, sliding window, prefix sums, intervals, bit tricks.
-
3. Linear Structures
🧱 The workhorse containers: dynamic array, hash map/set, linked list, stack, deque.
-
2. Foundations
📐 How to reason about cost: Big-O, the master theorem, and loop invariants.
-
1. Overview
🧭 Start here. Why these notes began as a hand-drawn A2 atlas, and how to read the series.