Day 14 — Dynamic Programming
This chapter is being written. Check back soon!
What you’ll learn here
- Overlapping subproblems and optimal substructure — the two ingredients that make DP work
- Top-down (memoization) vs bottom-up (tabulation) — pick the right style for the problem
- Classic problems: 0/1 knapsack, edit distance, longest increasing subsequence, coin change
- Space optimization — when you can drop the table down to one or two rows
Recursion already laid the groundwork. The Memoization page in Day 5 is the bridge into this chapter — DP is just “memoized recursion taken seriously.”