Update 416. Partition Equal Subset Sum.py

Author: iamAntimPal

Python_Daily_Solutions/416. Partition Equal Subset Sum/416. Partition Equal Subset Sum.py

@@ -0,0 +1,12 @@
+class Solution:
+    def canPartition(self, nums: List[int]) -> bool:
+        m, mod = divmod(sum(nums), 2)
+        if mod:
+            return False
+        n = len(nums)
+        f = [[False] * (m + 1) for _ in range(n + 1)]
+        f[0][0] = True
+        for i, x in enumerate(nums, 1):
+            for j in range(m + 1):
+                f[i][j] = f[i - 1][j] or (j >= x and f[i - 1][j - x])
+        return f[n][m]