@@ -0,0 +1,24 @@
+class Solution:
+def canPartition(self, nums):
+s = sum(nums)
+if (s % 2 != 0): return False
+
+n = len(nums)
+s = s // 2
+
+dp = [[False] * (s+1) for _ in range(n)]
+
+for i in range(n):
+dp[i][0] = True
+
+for j in range(1, s+1):
+dp[0][j] = nums[0] == j
+
+for i in range(1, n):
+for j in range(1, s+1):
+if dp[i-1][j]:
+dp[i][j] = dp[i-1][j]
+elif j >= nums[i]:
+dp[i][j] = dp[i-1][j-nums[i]]
+
+return dp[n-1][s]

@@ -0,0 +1,21 @@
+# https://youtu.be/MqYLmIzl8sQ
+
+class Solution:
+def countSubsetsWithSum(self, nums, target):
+n = len(nums)
+dp = [[None] * (target + 1) for _ in range(n+1)]
+
+for i in range(n+1):
+dp[i][0] = 1
+
+for j in range(1, target+1):
+dp[0][j] = 0
+
+for i in range(1, n+1):
+for j in range(1, target+1):
+if nums[i-1] > j:
+dp[i][j] = dp[i-1][j]
+elif nums[i-1] <= j:
+dp[i][j] = dp[i-1][j] + dp[i-1][j-nums[i-1]]
+
+return dp[n][target]

@@ -0,0 +1,26 @@
+# https://youtu.be/FB0KUhsxXGY
+
+class Solution:
+def minimumSubsetSum(self, nums):
+total = sum(nums)
+s = total // 2
+n = len(nums)
+dp = [[False] * (s+1) for _ in range(n)]
+
+for i in range(n):
+dp[i][0] = True
+
+for j in range(1, s+1):
+dp[0][j] = nums[0] == j
+
+for i in range(1, n):
+for j in range(1, s+1):
+if dp[i-1][j]:
+dp[i][j] = dp[i-1][j]
+elif j >= nums[i]:
+dp[i][j] = dp[i-1][j-nums[i]]
+
+for j in range(s, -1, -1):
+if dp[n-1][j]:
+# ans = abs(sum1 - sum2); sum1 = j; sum2 = total - j
+return abs(j - (total - j))

@@ -0,0 +1,25 @@
+class Solution:
+def delNodes(self, root, to_delete):
+self.nodes = []
+self.toDelete = set(to_delete)
+self.delNodesRec(root)
+
+if not root.val in self.toDelete:
+self.nodes.append(root)
+
+return self.nodes
+
+def delNodesRec(self, node):
+if node is None: return None
+
+node.left = self.delNodesRec(node.left)
+node.right = self.delNodesRec(node.right)
+
+if node.val in self.toDelete:
+if node.left is not None:
+self.nodes.append(node.left)
+if node.right is not None:
+self.nodes.append(node.right)
+return None
+
+return node