Data Structures & Algorithms

A book-shaped table of contents for MAANG-interview DSA prep: Python language foundations, mathematical and algorithmic foundations, arrays/strings, linked structures, stacks/queues, trees, graphs, sorting/searching, dynamic programming, greedy algorithms, backtracking, bit manipulation, advanced data structures, advanced algorithms, interview problem patterns, and MAANG interview mastery — a book-length progression from fundamentals to Google/Meta/Amazon/Apple/Netflix/Microsoft (L4–L6) interview readiness.

8 — Fast Exponentiation

Binary exponentiation for computing a^n (or a^n mod m) in O(log n) instead of O(n).

9 — Randomized Algorithms

Algorithms that use randomness for expected-case guarantees — randomized QuickSelect, Monte Carlo vs. Las Vegas framing.

1 — Divide & Conquer Optimization

Speeding up a DP transition using divide-and-conquer or monotonic-decision-boundary tricks (e.g. the DC optimization, Knuth's optimization).

2 — Convex Hull

Finding the smallest convex polygon enclosing a set of points, via Graham scan or the gift-wrapping algorithm.