[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

backtracking/generate_parentheses_iterative.py

@@ -18,7 +18,7 @@ def generate_parentheses_iterative(length: int) -> list[str]:
 
     Returns:
         A list of strings representing valid combinations of parentheses
-    
+
     Raises:
         ValueError: If length is negative
         TypeError: If length is not an integer
@@ -29,7 +29,7 @@ def generate_parentheses_iterative(length: int) -> list[str]:
     Space Complexity:
         O(4^n / sqrt(n)) - Storage for all valid combinations
 
-    
+
     >>> generate_parentheses_iterative(3)
     ['()()()', '()(())', '(())()', '(()())', '((()))']
     >>> generate_parentheses_iterative(2)
@@ -52,13 +52,13 @@ def generate_parentheses_iterative(length: int) -> list[str]:
         raise TypeError("length must be an integer")
     if length < 0:
         raise ValueError("length must be non-negative")
-    
+
     # Handle edge case
     if length == 0:
         return [""]
-    
+
     result: list[str] = []
-    
+
     # Each element in stack is a tuple (current_combination, open_count, close_count)
     stack: list[tuple[str, int, int]] = [("", 0, 0)]
 
@@ -69,11 +69,11 @@ def generate_parentheses_iterative(length: int) -> list[str]:
         if len(current_combination) == 2 * length:
             result.append(current_combination)
             continue
-        
+
         # Add '(' if we haven't used all open parentheses
         if open_count < length:
             stack.append((current_combination + "(", open_count + 1, close_count))
-            
+
         # Add ')' if it maintains validity
         if close_count < open_count:
             stack.append((current_combination + ")", open_count, close_count + 1))