Fix dynamic_programming/combination_sum_iv.py

Author: MaximSmolskiy

dynamic_programming/combination_sum_iv.py

@@ -22,12 +22,12 @@
 """
 
 
-def combination_sum_iv(n: int, array: list[int], target: int) -> int:
+def combination_sum_iv(array: list[int], target: int) -> int:
     """
     Function checks the all possible combinations, and returns the count
     of possible combination in exponential Time Complexity.
 
-    >>> combination_sum_iv(3, [1,2,5], 5)
+    >>> combination_sum_iv([1,2,5], 5)
     9
     """
 
@@ -41,13 +41,13 @@ def count_of_possible_combinations(target: int) -> int:
     return count_of_possible_combinations(target)
 
 
-def combination_sum_iv_dp_array(n: int, array: list[int], target: int) -> int:
+def combination_sum_iv_dp_array(array: list[int], target: int) -> int:
     """
     Function checks the all possible combinations, and returns the count
     of possible combination in O(N^2) Time Complexity as we are using Dynamic
     programming array here.
 
-    >>> combination_sum_iv_dp_array(3, [1,2,5], 5)
+    >>> combination_sum_iv_dp_array([1,2,5], 5)
     9
     """