Count subsets with given sum | Dynamic Programming скачать в хорошем качестве

Count subsets with given sum | Dynamic Programming

This video explains a very important dynamic programming interview problem which is a variation of 01 knapsack and also a variation of subset sum problem.In this problem, we are given an array and a sum value X, we need to count the number of subsets with the given sum X which can be formed from the array.I have explained the problem using examples.I have shown both the recursive as well as tabulation dynamic programming approach for this problem.I have explained the intuition and also the modifications needed to convert subset sum problem to this problem.If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :) ======================================================================== Join this channel to get access to perks:    / @techdose4u   INSTAGRAM :   / surya.pratap.k   SUPPORT OUR WORK:   / techdose   LinkedIn:   / surya-pratap-kahar-47bb01168   WEBSITE: https://techdose.co.in/ TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5... ======================================================================= USEFUL LINKS: Subset Sum Problem:    • subset sum problem dynamic programming | b...   01 Knapsack:    • 01 Knapsack using Recursion | Building Int...   01 knapsack Memoization:    • 01 Knapsack using Memoization | Concept of...   01 Knapsack Tabulation DP:    • 01 Knapsack Tabulation Dynamic Programming...   #subsetsum #01knapsack #dp