Memoization rescued fib. Dynamic programming (DP) turns that rescue into a method for harder problems: making exact change, counting routes, finding the cheapest plan. The recipe never changes: break the problem into smaller copies, solve each copy once, and build the answer upward.