Arc 4: The Ascent (C++ for FAANG Interviews)
by Eric Wucrsman
$2
This is the arc most people buy the whole series for. Arcs 1–3 built the structures; Arc 4 is where you learn to actually solve problems with them — including Dynamic Programming, the single most-feared topic in FAANG interviews.
Eight chapters:
Chapter 15 — Sorting Algorithms
O(n²) sorts through merge/quick/heap sort · non-comparison sorts (counting, radix, bucket) · the complete STL sort reference · custom comparators · sorting as a preprocessing tool for other techniques
Chapter 16 — Binary Search
The two core templates · lower_bound/upper_bound · binary search on the answer space · on rotated sorted arrays · on 2D matrices · condition-based templates
Chapter 17 — Recursion & Backtracking
Call stack visualization & recursion trees · memoization · the backtracking framework (Choose → Explore → Unchoose) · subsets, permutations & combinations · N-Queens · Sudoku solver · word search · pruning strategies
Chapter 18 — Graphs: Fundamentals & Traversals
Core vocabulary · adjacency list/matrix/edge list · BFS & DFS · cycle detection (directed & undirected) · topological sort · connected components · strongly connected components (Kosaraju's) · bipartite check · multi-source & 0-1 BFS
Chapter 19 — Graph Algorithms: Shortest Paths, MST & Union-Find
Dijkstra's · Bellman-Ford · Floyd-Warshall · Union-Find/DSU · Kruskal's & Prim's MST · a decision guide for which algorithm fits which problem
Chapter 20 — Dynamic Programming
DP philosophy and state definition (the actual skill that matters) · memoization vs. tabulation · 1D & 2D DP · the knapsack family · string DP (LCS, edit distance, palindromes) · LIS · interval DP · tree DP · bitmask DP · state-machine DP for stock problems · common anti-patterns
Chapter 21 — Greedy Algorithms
Proving correctness via the exchange argument · interval scheduling · jump game · fractional knapsack · gas station · candy/rating two-pass greedy · partition & labeling
Chapter 22 — Divide & Conquer
The D&C paradigm vs. DP · the Master Theorem · quickselect · count inversions via modified merge sort · closest pair of points
Every chapter pairs the theory with numbered LeetCode problems and a full worked approach. By the end of this arc you'll have covered the patterns behind the large majority of real FAANG interview questions.
Bonus: each of the 8 chapters ends with a unique access code — redeem it at dsadayone.com to unlock that chapter's collectible card.
🔜 Arc 5 closes out the series.