In this module we continue our discussion of dynamic programming but now present it in the form of DP tables, or what is also known as the bottom-up approach to dynamic programming. We solve the problem Dice Combinations from the CSES problem set:
https://cses.fi/problemset/task/1633
We contrast this table-based approach with the recursive one.
The code discussed in this lecture can be found here:
https://github.com/noc21-cs99/lectures
The DP problem set on CSES is recommended for further practice.
If you are watching this during an active run of the course, you can join the discord community for the course using this link:
https://discord.gg/etdD3SSJ6T
The course website can be found at:
https://neeldhara.com/courses/nptel/cp
