"Section 18: Dynamic Programming"
Section 18: Dynamic Programming
Dynamic Programming breaks problems into overlapping subproblems and stores results to avoid redundant computation.
Lessons
| # | Lesson Name | Duration | Notes |
|---|---|---|---|
| 1 | Intro to Dynamic Programming | 44m 46s | |
| 2 | Fibonacci Numbers using DP | 34m 41s | |
| 3 | Top Down & Bottom Up approach | 39m 51s | |
| 4 | Climbing Stairs | — | |
| 5 | Minimum Cost Climbing Stairs | — | |
| 6 | House Robber | — | |
| 7 | House Robber II | — | |
| 8 | Coin Change | — | |
| 9 | Palindromic Substrings | — | |
| 10 | Longest Palindromic Substring | — | |
| 11 | Decode Ways | — | |
| 12 | Maximum Subarray | — | |
| 13 | Maximum Product Subarray | — | |
| 14 | Word Break | — | |
| 15 | Longest Increasing Subsequence | — | |
| 16 | Partition Equal Subset Sum | — | |
| 17 | Coin Change II | — | |
| 18 | Unique Paths | — | |
| 19 | Jump Game | — | |
| 20 | Jump Game II | — |
Lesson Checklist
- [ ] Intro to Dynamic Programming (44m 46s)
- [ ] Fibonacci Numbers using DP (34m 41s)
- [ ] Top Down & Bottom Up approach (39m 51s)
- [ ] Climbing Stairs
- [ ] Minimum Cost Climbing Stairs
- [ ] House Robber
- [ ] House Robber II
- [ ] Coin Change
- [ ] Palindromic Substrings
- [ ] Longest Palindromic Substring
- [ ] Decode Ways
- [ ] Maximum Subarray
- [ ] Maximum Product Subarray
- [ ] Word Break
- [ ] Longest Increasing Subsequence
- [ ] Partition Equal Subset Sum
- [ ] Coin Change II
- [ ] Unique Paths
- [ ] Jump Game
- [ ] Jump Game II
My Notes
Add your key takeaways here...