Partition equal subset sum | Equal sum partition | Dynamic Programming | Leetcode

This video explains a very important 01 knapsack dynamic programming problem which is the equal sum partition problem.In this problem, given a set, we are required to divide it into 2 subsets such that their sum are equal.This is similar to 01 knapsack problem and exactly similar to subset sum problem.I have shown the similarity between this problem and 01 knapsack as well as subset sum problem.I have also shown the intuition for solving this problem and at the end I have shown the code using memoization as well as tabulation dynamic programming.CODE LINK is present below as usual. 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...
=======================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/...
USEFUL LINKS:
Subset Sum Problem:    • subset sum problem dynamic programmin...  
01 Knapsack Recursion:    • 01 Knapsack using Recursion | Buildin...  
01 Knapsack Memoization:    • 01 Knapsack using Memoization | Conce...  

01 Knapsack DP:    • 01 Knapsack Tabulation Dynamic Progra...  


#dp #subsetsum #01knapsack