[pre-commit.ci] pre-commit autoupdate (#11322)

* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2)
- [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0)

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

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

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

other/davis_putnam_logemann_loveland.py

@@ -8,6 +8,7 @@ conjunctive normal form, i.e, for solving the Conjunctive Normal Form SATisfiabi
 
 For more information about the algorithm: https://en.wikipedia.org/wiki/DPLL_algorithm
 """
+
 from __future__ import annotations
 
 import random

other/fischer_yates_shuffle.py

@@ -5,6 +5,7 @@ finite sequence.
 For more details visit
 wikipedia/Fischer-Yates-Shuffle.
 """
+
 import random
 from typing import Any
 

other/gauss_easter.py

@@ -1,6 +1,7 @@
 """
 https://en.wikipedia.org/wiki/Computus#Gauss'_Easter_algorithm
 """
+
 import math
 from datetime import datetime, timedelta
 

other/majority_vote_algorithm.py

@@ -4,6 +4,7 @@ Given an integer array of size n, find all elements that appear more than ⌊ n/
 We have to solve in O(n) time and O(1) Space.
 URL : https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm
 """
+
 from collections import Counter
 
 

other/quine.py

@@ -8,4 +8,5 @@ own source code as its only output (disregarding this docstring and the shebang)
 
 More info on: https://en.wikipedia.org/wiki/Quine_(computing)
 """
+
 print((lambda quine: quine % quine)("print((lambda quine: quine %% quine)(%r))"))

other/word_search.py

@@ -5,7 +5,6 @@ that are best described as compass locations.
 @ https://en.wikipedia.org/wiki/Word_search
 """
 
-
 from random import choice, randint, shuffle
 
 # The words to display on the word search -