[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>

dynamic_programming/all_construct.py

@@ -2,6 +2,7 @@
 Program to list all the ways a target string can be
 constructed from the given list of substrings
 """
+
 from __future__ import annotations
 
 

dynamic_programming/bitmask.py

@@ -8,6 +8,7 @@ We have N tasks and M people. Each person in M can do only certain of these task
 a person can do only one task and a task is performed only by one person.
 Find the total no of ways in which the tasks can be distributed.
 """
+
 from collections import defaultdict
 
 

dynamic_programming/fast_fibonacci.py

@@ -4,6 +4,7 @@
 This program calculates the nth Fibonacci number in O(log(n)).
 It's possible to calculate F(1_000_000) in less than a second.
 """
+
 from __future__ import annotations
 
 import sys

dynamic_programming/iterating_through_submasks.py

@@ -5,6 +5,7 @@ You are given a bitmask m and you want to efficiently iterate through all of
 its submasks. The mask s is submask of m if only bits that were included in
 bitmask are set
 """
+
 from __future__ import annotations
 
 

dynamic_programming/longest_increasing_subsequence.py

@@ -10,6 +10,7 @@ return it.
 Example: [10, 22, 9, 33, 21, 50, 41, 60, 80] as input will return
          [10, 22, 33, 41, 60, 80] as output
 """
+
 from __future__ import annotations
 
 

dynamic_programming/matrix_chain_multiplication.py

@@ -38,6 +38,7 @@ Example input:
 arr = [40, 20, 30, 10, 30]
 output: 26000
 """
+
 from collections.abc import Iterator
 from contextlib import contextmanager
 from functools import cache

dynamic_programming/max_subarray_sum.py

@@ -9,6 +9,7 @@ subarray sum problem in O(n) time and O(1) space.
 
 Reference: https://en.wikipedia.org/wiki/Maximum_subarray_problem
 """
+
 from collections.abc import Sequence