L30 - Subsequences DP | Coin Change | CSES | LeetCode 322 | Memoization | Tabulation | 2D DP

Today in Lecture 30 of Subsequences DP, we solve LeetCode 322 (MEDIUM). Coin Change problem using 2D Dynamic Programming. Figuring out the combinations creation and minimizing coins to sum the given amount. 🌐 Don’t forget to select your language in YouTube settings for better understanding and subtitles! ⮕ Problem Link1: https://leetcode.com/problems/coin-change/description/ ⮕ Problem Link2: https://cses.fi/problemset/task/1634 ⮕ Code Link: https://github.com/hiren-j/dsaAffection/blob/C++/Dynamic%20Programming/Subsequences%20DP/17%20-%20Coin%20Change/Coin%20Change.cpp This series is designed to help you master Dynamic Programming for coding interviews and competitive programming. From beginner to advanced level, this series covers 12 DP Patterns In which we'll be focusing on recursion, memoization, tabulation, space optimization—everything you need to know about DP. Here are the patterns which you'll be learning :- ⮕ 1D DP ⮕ Multi Dimensional DP ⮕ Subarrays DP ⮕ Subsequences DP ⮕ LIS DP ⮕ String DP ⮕ Stocks DP ⮕ Game Theory DP ⮕ Partition DP ⮕ Square Submatrix DP ⮕ Tree DP ⮕ Graph DP Video Chapters :- 0:00 - Understanding Problem + Solution 11:27 - Coding Part + Time Space Discussion 📲 Follow Me On 🔹 LinkedIn: https://www.linkedin.com/in/hirenjoshi1630/ 🔹 GitHub: https://github.com/hiren-j Intro Music Credits :- Song: Blue Boi Music provided by LAKEY INSPIRED Music Video: https://youtu.be/wAukvwLCVbM?si=s7o652Zq2xEl14fV 🔔 Subscribe, Like & Share For More Series / Videos Like This.