In class (15-351/15-650/02-613) we covered subset-sum dynamic programming as a generic example of dynamic programming. In this video addendum, we go through step-by-step how the DP matrix is actually filled out and how we do backtracing after finding the optimal weight.
https://courses.ywyu.net/15351-2024-f...
https://courses.ywyu.net/15351-2024-f...
(last video's sound got messed up, but the setup was here: • Subset-Sum Dynamic Programming Walk-through )