LESSON 02 / 03

Dynamic Programming, Gently

DP = recursion + memory. Solve each small sub-problem once, store it, and build bigger answers from smaller ones — top-down or bottom-up.

🎓Hardlevel
⏱️45 minto finish
✏️1activities

📂 Greedy & Dynamic Programming🏷️ Dynamic programming