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

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

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

Follow me on:

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.

[HellgateDragon]

choosing a name "because it sounded impressive" feels very much like a developer thing to do!

[BrandonSolo]

You just broke down this problem of understanding Dynamic Programming into subproblems that were so much easier to understand! I literally just had my teacher take 4 hours of class in total to explain this and you did it in under 15 minutes. You of course have earned a new subscriber.

[buzbuz-]

The word "dynamic" usually implies that time is an element of the problem (as opposed to static). However, as far as I can tell, the only role time plays here is that it takes time to run the programs. I'm glad you are here to explain this to us.

[shufflecat]

The fact that dynamic programming was named because it sounded impressive makes me feel better that my open source project got it's name because it sounded like something an open source project would be named.

[Jiftoo]

I've never heard that dynamic programming solutions include memoisation until now. Recursive algorithms that seemed slow and restricted to me now make so much more sense!

[arshadpakkali]

You are like fireship but MORE nerdy ❤️

[JuanGonzaloCarcamo]

I’m really impressed with your content. I wonder why you don’t have a million subscribers yet. Thanks for taking the time and explain these tricky concepts in such an approachable way!

[oystercatcher]

I've written DP algorithms multiple times for comparing discrete sequences which is the min path sum problem you described. Or finding the minimum cost path through a 2D matrix from the bottom-left to the top-right. There are a few different ways to write it depending on how general you need it to be. It easy to lose sight of the generality of DP but you described it really well. Thanks

[MagnusBorregaard]

I thoroughly enjoy your videos! As a web developer I find it extremely cool that you are talking about complex topics, but ground it in javascript and web browsers. I am looking forward to more game / 3D videos as well!

[stevecooper]

Simon, thank you so much for being a presence on the internet. As someone in the industry with big dreams, your guidance is of great value to me and I hope one day to pick up new tasks and build things like you can.

[perelmanych]

Wow, easily the best tutorial on the intimidating Dynamic Programming topic! Thank you very much!

[swoorp]

Dynamic programming can come as a lot of those intimidating subjects, BUT not if the teacher is Simon!

[liviuq]

First time viewer. We were taught DP in uni. This clip should be included in the References section. It is really intuuitive what you say. Thanks for this!

[beerus]

fibonacci is dead simple if you use a loop where i < n-2. In the loop do: next = a+b; a=b; b=next; and then return next after the loop.

[MYMPSWORLD]

You blew my mind. I was so afraid of DP before but you made it look so simple. Will definitely get back to SP again now

[Draco-wqch]

1:06 this guy sneaks in the most hilarious easter eggs with inspect element

[vojinmilovic]

Your voice is so relaxing, I feel like I can listen to these tutorials for a whole day

[HamzaBenHassen]

I love how you end with " hopefully that was helpful" . Man this another tier of quality teaching. thank you !

[_Cyrus]

Got yourself a subscriber. I love it. Love the whole explanation and the demos. Thank you SimonDev

[playonce]

Its basically caching/storing frequently accessed function/calculation outputs, for a bigger function or the same function with different parameters using recursion or iterative approaches or even just basicall function calls to another function.