Minimization DP from scratch | CSES DP Problemset | Minimizing Coins | DP Approach + Live Coding

Hello everyone, I'm Saptarshi Mukherjee, a Software Engineer III at Google and a Competitive Programmer with some titles like 3 times ACM-ICPC Regionals, Former Master at Codeforces, and 6 star at Codechef, Former Educator and Mentor at Unacademy, etc. Precursor: Basic DP concept - https://www.youtube.com/watch?v=nynhzVBeXkU Here's the second video of problem editorial from CSES problemset. 00:00:00 Introduction 00:00:14 About Minimization DP 00:02:25 Understanding the problem 00:04:22 Creation of Recursion Tree 00:07:05 DP Formulation in depth 00:15:47 Recursion Tree 00:20:57 Optimal Substructure and Overlapping Subproblems 00:23:26 Coding Memoization technique 00:37:04 Tabulation Technique Explanation 00:44:20 Code for Tabulation technique 00:47:46 Summary and closure Please share with your friends if you find the video informative! Let me know in the comments how you'd like the next videos to be! Tags: coding, coding interview, coding ninjas, dynamic programming, coding ninjas, coding problem, coding interview preparation, cracking the coding interview, microsoft coding interview, minimum coins to make target, competitive coding, minimum number of coins, how to crack coding interview, google coding rounds, google coding interview, how to learn coding for beginners, learn coding,coding blocks, how to learn coding, coding interviews