Dynamic Programming Foundations

Learn dynamic programming from the ground up by building five classic solvers. Start with memoization on a Fibonacci-style stair climb, then move to tabulation for change-making, packing (0/1 knapsack), and text diffing (edit distance and longest common subsequence). Each step adds one function that powers a real-world use.