Dynamic Programming21 sections · 916 units
Open in Course

Section Recap

What we learned

You've learned probability DP. You can now:

1.1. Compute probabilities using weighted sums over transitions.

2.2. Handle expected values by weighting outcomes.

3.3. Recognize when to count paths vs compute probabilities.

4.4. Apply tricks like scaling and early termination for large inputs. The observation: probability DP is just regular DP with weighted transitions. Instead of min or max, you sum with weights. That's it. For training, solve the problems here's problemset. Then move on to DP Optimizations where you'll learn to make DP faster.