This series of videos are focused on explaining dynamic programming by illustrating the application of DP through the use of selected problems from platforms like Codeforces, Codechef, SPOJ, CSES and Atcoder.
After going through this series, you should find yourself confident in approaching dynamic programming problems and also implementing them in a reasonable amount of time.
I will also live code and submit the solutions to the problem on the coding platform from where the problem comes.
Problem 1: Dice Combinations
Problem 2: Coin Combinations I
Problem 3: Coin Combinations II
Problem 4: Removing Digits
Problem 5: Grid Paths
Problem 6: Book Shop
Problem 7: Array Description
Problem 8: Edit Distance
Problem 9: Rectangle Cutting
Problem 10: Two Sets II
Problem 11: Beautiful Array
Problem 12: Number of Valid Arrays
Problem 13: Longest Increasing Subsequence O(NlogN)
Problem 14: Projects
Problem 15: Beauty of Tree
Problem 16: Catch Some
I am quite confident that many beginners/intermediates will definitely enjoy watching this series on dynamic programming and it will definitely help in getting better at dynamic programming and problem solving in general. I have tried to teach in a way such that not many prior prerequisites are required to understand the explanations even to the harder problems.
If people find this helpful then I will make sure that this list of problems will keep growing, cheers!
UPD: Added 2 more problems from CSES: Projects and Removing digits.