Dynamic Programming Complete Course for Beginners | Learn Dynamic Programming from Scratch

What is Dynamic Programming?
Dynamic programming is both a mathematical optimisation method and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics. In both contexts, it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. While some decision problems cannot be taken apart this way, decisions that span several points in time do often break apart recursively. Likewise, in computer science, if a problem can be solved optimally by breaking it into sub-problems and then recursively finding the optimal solutions to the sub-problems, then it is said to have an optimal substructure.

The following topics are covered in this tutorial:

0:00 - Introduction
0:55 - Introduction To Dynamic Programming
1:21:51 - Coin Change Problem Using Dynamic Programming
2:15:27 - Longest Common Subsequence Using Dynamic Programming
3:04:18 - Edit Distance Using Dynamic Programming
3:33:44 - Knapsack Problem Using Dynamic Programming
4:07:22 - Minimum Cost Path Sum Using Dynamic Programming

---------------------------------------- About SCALER --------------------------------------------------

A transformative tech school, creating talent with impeccable skills. Upskill and #CreateImpact

📌 Follow us on Social and be a part of an amazing tech community📌

🔔 Hit that bell icon to get notified of all our new videos 🔔

If you liked this video, please don't forget to like and comment. Never miss out on our exclusive videos to help boost your coding career! Subscribe to Scaler now!

#dynamicprogramming #dp #interview #coding

[SCALER]

Got a question? Feel free to drop them in the comments below! We make sure all your queries are answered. If you don't want to miss out on exclusive content, hit the subscribe button and turn on the notifications as well.

[govindarathi]

In Fibonacci series, using bottom-up approach might be better because in top-down approach, you can run into stack overflow if the number is pretty huge.

[noire.]

Thank you for this great video: you go straight to the point without wasting any time! Helped me a lot :)

[ephremwube]

I was scared this problem but now clear. Thanks

[randhirsingh]

I am bca first semester student, after I will also do MCA than Can I eligible for FANG company.

[manishagrawal]

"We make sure all your queries are answered". Really? :-)

[vinzgrow]

I explored so many options to learn DP and finally here I got a deep understanding of the DP concepts and some standard problems😇😇
Thank you scaler team for such a great tutorial