Dynamic Programming (1D)

Solve optimization and counting problems by breaking them into overlapping subproblems, storing results to avoid recomputation. Master the 3-step recipe: define state, write recurrence, set base cases. Covers Fibonacci-style, take/skip, knapsack, subsequence, and subarray archetypes.