Dynamic Programming part 2/10: The Modern Law of Dynamic Programming (Sam's DP)

In this video, we will learn how to solve Dynamic Programming problems with The Modern Law of Dynamic Programming (Sam's DP).

Part 2/10: this video
Part 3/10:
Part 4/10:
Part 5/10:
Part 6/10:
Part 7/10:
Part 8/10:
Part 9/10:
Part 10/10:

Contents

00:18 Problems can be solved by Dynamic Programming
03:21 How to solve DP problems with Bellman's theory
07:20 How to solve DP problems with MIT and the rest of the world
08:34 How to solve DP problems with The Modern Law of Dynamic Programming (Sam's DP)
15:15 Learn Sam's DP step 5: solve the DP problem BY HAND
26:03 Learn Sam's DP step 6: redraw DFS state tree with code
35:42 Learn Sam's DP step 7: calculate the information asked
38:04 Learn Sam's DP step 8: cache distinct DFS calls
42:59 Learn Sam's DP step 9: tips to debug a DP program
44:23 Learn Sam's DP step 10: summary

👍 like & 🔔 subscribe if you find this video useful!

SESV is committed to help anyone to start their career in software engineering by providing short, foundational, interview questions based training videos. If you know someone (no matter what background) who is interested in pursuing a career in software engineering, please spread the word. It may change their lives.

We're always looking to improve our training videos. All constructive comments are welcome.