An introduction to dynamic programming, how to approach these types problems, and we'll step through a few basic ones.

🛒 Recommended books (on Amazon): https://www.amazon.com/hz/wishlist/ls/1IMV0IR3QIZMQ?type=wishlist&tag=simondev01-20&sort=priority&viewType=grid
❤️ Support me on Patreon: https://www.patreon.com/simondevyt
🌍 My Gamedev Courses: https://simondev.teachable.com/

Disclaimer: Commission is earned from qualifying purchases on Amazon links.

Follow me on:
Twitter: https://twitter.com/iced_coffee_dev
Instagram: https://www.instagram.com/beer_and_code/
Github: https://github.com/simondevyoutube/


Covering dynamic programming, top down vs bottom up approaches. What is memoization and tabulation. Will also answer a few quick problems like the Fibonacci series, Coin Change, Min Path Sum, 0-1 Knapsack, Subset Sum, and the Staircase problem.

What can “The Simpsons” teach us about Dynamic Programming?