Uploaded May 2015 | Updated September 2026, 3 weeks ago
Picking the Minimum Coins to make change and how Dynamic Programming is the best solution for this problem.
➜ Video Course Home: gjenkinsedu.com/pyds/videos
➜ Video Course free Textbook: "Problem Solving with Algorithms and Data Structures using Python" at : goo.gl/1GJCgt
➜ Skills building at codewars.com/r/nn6NXg
➜ Slides, code, and more can be found at github.com/gerryjenkinslb/cs22-slides-and-py-files
* Errata: text on screen at (1:25) should be = 63 not = 68
Copyright Attribution: Images and some code from the ebook are attributed to the Authors Bradley N. Miller and David Ranum under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC-BY-NC-SA)
License link: goo.gl/m2m1ww
Picking the Minimum Coins to make change and how Dynamic Programming is the best solution for this problem.
➜ Video Course Home: gjenkinsedu.com/pyds/videos
➜ Video Course free Textbook: "Problem Solving with Algorithms and Data Structures using Python" at : goo.gl/1GJCgt
➜ Skills building at codewars.com/r/nn6NXg
➜ Slides, code, and more can be found at github.com/gerryjenkinslb/cs22-slides-and-py-files
* Errata: text on screen at (1:25) should be = 63 not = 68
Copyright Attribution: Images and some code from the ebook are attributed to the Authors Bradley N. Miller and David Ranum under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC-BY-NC-SA)
License link: goo.gl/m2m1ww
