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

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

Author: pre-commit-ci[bot]

backtracking/all_n_queens.py

@@ -90,21 +90,9 @@ def printboard(board: list[list[int]]) -> None:
 print("The total no. of solutions are :", len(solution))
 
 
-
-
-
-
-
-
 # Implementation using depth first search
 
 
-
-
-
-
-
-
 r"""
 
 To solve this problem we will use simple math. First we know the queen can move in all
@@ -257,25 +245,9 @@ def n_queens_solution(n: int) -> None:
     n_queens_solution(4)
 
 
-
-
-
-
-
-
-
-
 # Implementation of n queens in sudoku problem
 
 
-
-
-
-
-
-
-
-
 """
 Given a partially filled 9×9 2D array, the objective is to fill a 9×9
 square grid with digits numbered 1 to 9, so that every row, column, and
@@ -408,7 +380,3 @@ def print_solution(grid: Matrix) -> None:
             print_solution(solution)
         else:
             print("Cannot find a solution.")
-
-
-
-