DP_LIVE_CLASS_Competitive_Programming_Basics.pdf

Dynamic Programming Notes

3. C(n,r) = C(n−1,r−1) + C(n−1,r)

4. Visualization of the Magic of DP

5. 2 Key properties for DP !
Optimal Substrcuture
Overlapping Subproblems

6. 2 Ways of Calculating DP - Top Down

7. 2 Ways of Calculating DP - Bottom Up

8. Which one is better?

9. Vivek, this is all too simple for me...
show me how to solve !!