Dynamic Programming Explained (Practical Examples)

From the creator

Have you ever wondered what Dynamic Programming is? Well in this video I am going to go into the definition and the theory of Dynamic Programming! I am also going to talk to you about how to classify certain problems to know if you can use Dynamic Programming for them, and then I will show you some examples and how to optimize the solutions for them! Thanks for watching and I hope you enjoy! 💻 ProgrammingExpert is the best platform to learn how to code and become a software engineer as fast as possible! Check it out here: https://programmingexpert.io/tim and use code "tim" for a discount! 📄 Resources 📄 BigO Notation: youtube.com/watch?v=6aDHWSNKlVw ⭐️ Timestamps ⭐️ 00:00 | Overview 01:00 | Dynamic Programming Definition 02:37 | Fibonacci Sequence - Problem 05:03 | Fibonacci Sequence - Trivial Solution 08:02 | Fibonacci Sequence - Optimal Solution 14:39 | Minimum Sum Subarray - Problem 15:57 | Minimum Sum Subarray - Trivial Solution 17:56 | Minimum Sum Subarray - Optimal Solutions ◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️ 👕 Merchandise: https://teespring.com/stores/tech-with-tim-merch-shop 📸 Instagram: https://www.instagram.com/tech_with_tim 📱 Twitter: https://twitter.com/TechWithTimm ⭐ Discord: https://discord.gg/twt 📝 LinkedIn: https://www.linkedin.com/in/tim-ruscica-82631b179/ 🌎 Website: https://techwithtim.net 📂 GitHub: https://github.com/techwithtim 🔊 Podcast: https://anchor.fm/tech-with-tim 🎬 My YouTube Gear: https://www.techwithtim.net/gear/ 💵 One-Time Donations: http

Published 2022-03-07 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.