Dynamic Programming (with Sam's DP) example 1: Climbing Stairs

In this video, we will apply Sam's DP to solve Climbing Stairs problem.

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

Contents

00:49 Step 0: is it a multi-stage decision making process problem?
02:57 Step 1: solve the problem with pen and paper, then code DFS state tree
11:39 Step 2: calculate the information asked, bottom-up
12:44 Step 3: cache distinct DFS calls
14:40 Testing with Leetcode test cases
14:47 Characteristics of problems can be solved by Sam's DP
15:18 Let's connect and help the world to demystify Dynamic Programming

👍 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.