Grokking Dynamic Programming Patterns for Coding Interviews
Estimated completion time: 18h
Certificate Included
Lessons
Challenges
Playgrounds
Code Snippets
Illustrations
Course Overview
The fact is, Dynamic Programming (DP) problems can be some of the most intimidating on a coding interview. Even when it's actually clear if a problem can be solved using DP (which it rarely is), it can be pretty challenging to even know where to start on the solution. Unless, that is, you're trained on the approach to solving DP problems. This course was made from scratch with just that goal in mind. It'll equip you with a set of easy-to-understand techniques to handle any DP problem. Rather than just having you try to memorize solutions, you'll be walked through five underlying DP patterns that can then be applied to solve 35+ DP problems. In each pattern, we'll start with a recursive brute-force solution -- this is actually the best way to start solving a DP problem! Once we have a recursive solution, we'll then apply the advanced DP methods of Memoization and Tabulation. The practice problems in this course were carefully chosen, covering the most frequently asked DP questions in coding interviews.
1. Introduction
2. Pattern 1: 0/1 Knapsack
3. Pattern 2: Unbounded Knapsack
4. Pattern 3: Fibonacci Numbers
5. Pattern 4: Palindromic Subsequence
6. Pattern 5: Longest Common Substring
7. Appendix
1. Introduction
1. Introduction
2. Pattern 1: 0/1 Knapsack
2. Pattern 1: 0/1 Knapsack
3. Pattern 2: Unbounded Knapsack
3. Pattern 2: Unbounded Knapsack
4. Pattern 3: Fibonacci Numbers
4. Pattern 3: Fibonacci Numbers
5. Pattern 4: Palindromic Subsequence
5. Pattern 4: Palindromic Subsequence
6. Pattern 5: Longest Common Substring
6. Pattern 5: Longest Common Substring
7. Appendix
7. Appendix
License: All rights reserved
