fixed_incorrect_test_combination_sum

Author: architmaheshwari99

backtracking/combination_sum.py

@@ -47,16 +47,26 @@ def combination_sum(candidates: list, target: int) -> list:
     >>> combination_sum([-8, 2.3, 0], 1)
     Traceback (most recent call last):
         ...
-    RecursionError: maximum recursion depth exceeded
+    ValueError: All elements in candidates must be non-negative.
+    >>> combination_sum([], 1)
+    Traceback (most recent call last):
+        ...
+    ValueError: Candidates list should not be empty
     """
     path = []  # type: list[int]
     answer = []  # type: list[int]
+    if not candidates:
+        raise ValueError("Candidates list should not be empty")
+
+    if any(x < 0 for x in candidates):
+        raise ValueError("All elements in candidates must be non-negative.")
+    
     backtrack(candidates, path, answer, target, 0)
     return answer
 
 
 def main() -> None:
-    print(combination_sum([-8, 2.3, 0], 1))
+    print(combination_sum([], 1))
 
 
 if __name__ == "__main__":