Dynamic Programming: Problem Solving8 sections · 332 units
Open in Course

What You'll Learn

The sections ahead

You'll work through 77 sections, each focused on a different DP pattern:

1.1. Knapsack variants and optimization twists

2.2. Interval DP for range-based problems

3.3. DP on Trees for hierarchical structures

4.4. Bitmask DP for subset and permutation states

5.5. String DP for edit distance and matching

6.6. Game Theory DP for two-player optimal play

7.7. Digit DP for counting numbers with constraints

Each section starts with the pattern, then gives you problems, you should first try to solve them yourself, and then look at the step by step solution that I explain.