Dynamic Programming
Solve optimisation problems with memoisation and tabulation.
0%
Confidence · no data yet
After this skill you can…
- Identify overlapping subproblems
- Convert recursive solutions to bottom-up DP
- Solve classic DP problems (knapsack, LCS, coin change)
Prerequisites
Watch (10 videos)
0/1 Knapsack problem | Dynamic Programming
→ Solve the 0/1 Knapsack problem using dynamic programming→ Apply dynamic programming to similar problems
The Recursive Staircase - Top Down & Bottom Up Dynamic Programming ("Climbing Stairs" on LeetCode)
→ Solve dynamic programming problems→ Apply top-down and bottom-up approaches
Learn Dynamic Programming with Animations – Full Course for Beginners
→ Solve complex algorithmic puzzles→ Implement memoization and tabulation→ Optimize recursive solutions
Number of Good Paths - Leetcode 2421 - Python
→ Solve dynamic programming problems on Leetcode→ Implement algorithmic solutions in Python
Stone Game II - Leetcode 1140 - Python
→ Apply dynamic programming to solve complex problems→ Optimize algorithmic solutions
Magic Cows | Dynamic Programming | Adhoc | Interview problem
→ Solve dynamic programming problems like Magical Cows→ Apply algorithmic thinking to complex problems
FREAKY Programming out here 😵💫
→ Apply dynamic programming to real-world problems→ Optimize recursive solutions
Dynamic Programming Interview Question #1 - Find Sets Of Numbers That Add Up To 16
→ Solve dynamic programming problems→ Apply dynamic programming to coding interviews
Different Ways to Add Parentheses - Leetcode 241 - Python
→ Apply dynamic programming to solve complex problems→ Optimize code for performance
Constrained Subsequence Sum - Leetcode 1425 - Python
→ Apply dynamic programming techniques→ Optimize algorithmic solutions
DeepCamp AI