Dynamic Programming - Part 1

Your first serious pass at DP for contests — what makes a problem a DP problem, the recursion → memoization → tabulation pipeline, how to design state and transitions, and the rudimentary 1D and grid patterns (Fibonacci, climbing stairs, Kadane, coin change, 0/1 knapsack, LIS, house robber) that show up in almost every round.