What You'll Learn

You'll work through $5$ sections, each focused on a different pattern family:

$1.$ Binary Search on answer for feasibility optimization

$2.$ Backtracking with pruning for systematic enumeration

$3.$ Greedy with proofs for local-to-global optimality

$4.$ Monotonic stack for next greater/smaller problems

$5.$ Hashmap design for $O(1)$ data structures

Each section starts with the pattern, then gives you $10$ problems. Try to solve them yourself first, then read the step-by-step solution.