Completed
— The Staircase Problem: Counting Paths
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Lean Dynamic Programming with Animations - Full Course for Beginners
Automatically move to the next video in the Classroom when playback concludes
- 1 — Course Introduction and Visual Intuition
- 2 — Fundamentals of Dynamic Programming
- 3 — The Staircase Problem: Counting Paths
- 4 — Implementing Recursive Solutions
- 5 — The Inefficiency of Simple Recursion
- 6 — Pattern 1: Memoization Top-Down Approach
- 7 — Pattern 2: Tabulation Bottom-Up Approach
- 8 — Comparing Memoization vs. Tabulation
- 9 — Practice Problem: N-th Tribonacci Number
- 10 — Optimization: Min Cost Climbing Stairs
- 11 — Constant Transition Pattern and Space Optimization
- 12 — Practice Problem: House Robber
- 13 — Pattern 3: Grid Problems 2D DP
- 14 — Practice Problem: Unique Paths
- 15 — Optimizing Space in Grid Problems
- 16 — Practice Problem: Unique Paths II With Obstacles
- 17 — Pattern 4: Two Sequences
- 18 — Practice Problem: Longest Common Subsequence
- 19 — Practice Problem: Edit Distance
- 20 — Pattern 5: Interval DP
- 21 — Practice Problem: Longest Palindromic Subsequence
- 22 — Practice Problem: Palindromic Substrings
- 23 — Pattern 6: Non-Constant Transition
- 24 — Practice Problem: Longest Increasing Subsequence
- 25 — Practice Problem: Partition Array for Maximum Sum
- 26 — Pattern 7: Knapsack-like Problems
- 27 — Practice Problem: Partition Equal Subset Sum
- 28 — Practice Problem: Coin Change
- 29 — Final Summary and Resources
