L28 - Subsequences DP | Rod Cutting Problem | Simple Breakdown | 2D DP

Today in Lecture 28 of Subsequences DP, we solve Rod Cutting Problem using 2D Dynamic Programming. We'll do a simple breakdown of the problem, identifying how the problem turns out to be an ordinary combinations problem. 🌐 Don’t forget to select your language in YouTube settings for better understanding and subtitles! ⮕ Problem Link: https://www.geeksforgeeks.org/problems/rod-cutting0840/1 ⮕ Code Link: https://github.com/hiren-j/dsaAffection/blob/C++/Dynamic%20Programming/Subsequences%20DP/19%20-%20Rod%20Cutting%20Problem/Rod%20Cutting%20Problem.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 8:33 - Code 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.