Week 03: combination-sum

Author: mandel-17

combination-sum/mandel-17.py

@@ -0,0 +1,18 @@
+from typing import List
+
+class Solution:
+    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
+        result = []
+        
+        def dfs(csum, index, path):
+            if csum < 0:
+                return
+            if csum == 0:
+                result.append(path)
+                return
+        
+            for i in range(index, len(candidates)):
+                dfs(csum - candidates[i], i, path + [candidates[i]])
+            
+        dfs(target, 0, [])
+        return result