You'll work through sections, each focused on a different pattern family:
Binary Search on answer for feasibility optimization
Backtracking with pruning for systematic enumeration
Greedy with proofs for local-to-global optimality
Monotonic stack for next greater/smaller problems
Hashmap design for data structures
Each section starts with the pattern, then gives you problems. Try to solve them yourself first, then read the step-by-step solution.