L7 - Subsequences DP | Count Subsets With Sum K | 2D DP | Recursion | Memoization | Tabulation

Описание: Today in Lecture 7 of Subsequences DP, we solve GFG (MEDIUM). Perfect Sum problem using 2D Dynamic Programming. We solve by building all the subsets and will clearly see how any subset would contribute to our answer and then counting total subsets with sum equal to k. Learn Recursion ⮕ Memoization ⮕ Tabulation ⮕ Space Optimization and build your DP foundation in Hindi.

🌐 Don’t forget to select your language in YouTube settings for better understanding and subtitles!

⮕ Problem Link: https://www.geeksforgeeks.org/problem...
⮕ Code Link: https://github.com/hiren-j/dsaAffecti...

Welcome back to the ULTIMATE DP SERIES in HINDI | vHiren DP Series
This series is designed to help you master Dynamic Programming for coding interviews. 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 The Problem
1:53 - How Problem Give Hints To Think Recursive
2:00 - Approaching Recursion
7:13 - Recursive Code
8:00 - Recursion Time + Approaching DP
8:12 - Code Memoization + Time Space Discussion
14:45 - Code Tabulation + Time Space Discussion

📲 Follow Me On
🔹 LinkedIn:   / hirenjoshi1630  
🔹 GitHub: https://github.com/hiren-j
🔹 Instagram:   / cuzvhiren  

Intro Music Credits :-
Song: Blue Boi
Music provided by LAKEY INSPIRED
Music Video:    • LAKEY INSPIRED - Blue Boi  

🔔 Subscribe, Like & Share For More Series / Videos Like This.