From 606f962196c3395f4f060af805749e7d0c13c049 Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Wed, 30 Oct 2024 06:04:00 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 data_structures/arrays/new_combination.py | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/data_structures/arrays/new_combination.py b/data_structures/arrays/new_combination.py
index 4b347fa14..d083acf75 100644
--- a/data_structures/arrays/new_combination.py
+++ b/data_structures/arrays/new_combination.py
@@ -1,5 +1,6 @@
 from itertools import combinations
 
+
 def permute_recursive(nums: list[int]) -> list[list[int]]:
     """
     Return all permutations.
@@ -19,6 +20,7 @@ def permute_recursive(nums: list[int]) -> list[list[int]]:
         nums.append(n)
     return result
 
+
 def permute_backtrack(nums: list[int]) -> list[list[int]]:
     """
     Return all permutations of the given list.
@@ -26,6 +28,7 @@ def permute_backtrack(nums: list[int]) -> list[list[int]]:
     >>> permute_backtrack([1, 2, 3])
     [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 2, 1], [3, 1, 2]]
     """
+
     def backtrack(start: int) -> None:
         if start == len(nums) - 1:
             output.append(nums[:])
@@ -39,6 +42,7 @@ def permute_backtrack(nums: list[int]) -> list[list[int]]:
     backtrack(0)
     return output
 
+
 def get_combinations(nums: list[int], r: int) -> list[list[int]]:
     """
     Return all combinations of the given list of length r.