Name: mod10lec53 - Bottom-Up Dynamic Programming with Dice Combinations | 影片 | 乾淨世界
Uploaded: 2023-12-02T18:15:27.313Z
Duration: 27 min 25 s
Description: 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... | 影片 | 乾淨世界

NPTEL-NOC IITM

https://video4-us-east.cloudokyo.cloud/video/v6/27/0b/79/270b7920-29da-4fbd-9b6f-39db4ed119b8/master.m3u8

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.