Dynamic Programming part 1/10: the importance of Depth First Search in DP

In this video, we will learn how to the importance of the call stack and Depth First Search in Dynamic Programming.

Part 1/10: this video
Part 5/10:
Part 6/10:
Part 7/10:
Part 8/10:
Part 9/10:
Part 10/10:

Contents

00:38 Outcomes after this Dynamic Programming (DP) series
02:28 Prerequisites
03:06 Introducing The Modern Law of Dynamic Programming (Sam's DP)
08:43 Learn Sam's DP step 1: 1 Depth First Search gives 1 branching
15:46 Learn Sam's DP step 2: 2 Depth First Searches give 2 branchings
23:26 Learn Sam's DP step 3: 3 Depth First Searches give 3 branchings
28:13 Learn Sam's DP step 4: generalize DFS branching & cutting
33:49 Depth First Search branching & cutting 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.