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. 🛒 Recommended books (on Amazon): https://www.amazon.com/hz/wishlist/ls... ❤️ Support me on Patreon: / simondevyt 🌍 My Gamedev Courses: https://simondev.teachable.com/ Disclaimer: Commission is earned from qualifying purchases on Amazon links. Follow me on: Twitter: / iced_coffee_dev Instagram: / 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.
▶︎
Is the COST of JavaScript’s GC REALLY that high?
▶︎
What Big-O notation ACTUALLY tells you, and how I almost failed my Google Interview
▶︎
Mastering Dynamic Programming - How to solve any interview problem
▶︎
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
▶︎
Most Optimization Advice Misses the REAL Problem
▶︎
Wait, so comparisons in floating point only just KINDA work? What DOES work?
▶︎
How Dynamic Programming Broke Software Engineers
▶︎
When Optimisations Work, But for the Wrong Reasons
▶︎
Do Google engineers actually vibe code?
▶︎
Branchless Programming: Why "If" is Sloowww... and what we can do about it!
▶︎
It finally happened
▶︎
Something is jamming GPS over Europe. Here's what we found
▶︎
AI Coding Works. That’s the Problem
▶︎
What Is Dynamic Programming and How To Use It
▶︎
Fibonacci Heaps or "How to invent an extremely clever data structure"
▶︎
"Clean" Code, Horrible Performance
▶︎
I made an EVEN BETTER Minecraft
▶︎
The Algorithm Behind Spell Checkers
▶︎
Dynamic Programming Explained (Practical Examples)
▶︎