Dynamic Programming21 sections · 916 units
Open in Course

From Memoization to Problems

The transition

You learned recursion and memoization in the Recursion section. Now we apply those skills to real problems. When you ask: "How do I solve a big problem without repeating the same work?" The answer is often DP.

Store and reuse answers to subproblems. Here, you'll focus on 1D DP problems where the state depends on a single index or value. You'll define states, write recurrences, and implement solutions. Work through each example before moving to practice problems.