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

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

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.0.285 → v0.0.286](https://github.com/astral-sh/ruff-pre-commit/compare/v0.0.285...v0.0.286)
- [github.com/tox-dev/pyproject-fmt: 0.13.1 → 1.1.0](https://github.com/tox-dev/pyproject-fmt/compare/0.13.1...1.1.0)

* updating DIRECTORY.md

* Fis ruff rules PIE808,PLR1714

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>

maths/entropy.py

@@ -101,7 +101,7 @@ def analyze_text(text: str) -> tuple[dict, dict]:
 
     # first case when we have space at start.
     two_char_strings[" " + text[0]] += 1
-    for i in range(0, len(text) - 1):
+    for i in range(len(text) - 1):
         single_char_strings[text[i]] += 1
         two_char_strings[text[i : i + 2]] += 1
     return single_char_strings, two_char_strings

maths/eulers_totient.py

@@ -21,7 +21,7 @@ def totient(n: int) -> list:
     for i in range(2, n + 1):
         if is_prime[i]:
             primes.append(i)
-        for j in range(0, len(primes)):
+        for j in range(len(primes)):
             if i * primes[j] >= n:
                 break
             is_prime[i * primes[j]] = False

maths/greedy_coin_change.py

@@ -81,7 +81,7 @@ if __name__ == "__main__":
     ):
         n = int(input("Enter the number of denominations you want to add: ").strip())
 
-        for i in range(0, n):
+        for i in range(n):
             denominations.append(int(input(f"Denomination {i}: ").strip()))
         value = input("Enter the change you want to make in Indian Currency: ").strip()
     else:

maths/persistence.py

@@ -28,7 +28,7 @@ def multiplicative_persistence(num: int) -> int:
         numbers = [int(i) for i in num_string]
 
         total = 1
-        for i in range(0, len(numbers)):
+        for i in range(len(numbers)):
             total *= numbers[i]
 
         num_string = str(total)
@@ -67,7 +67,7 @@ def additive_persistence(num: int) -> int:
         numbers = [int(i) for i in num_string]
 
         total = 0
-        for i in range(0, len(numbers)):
+        for i in range(len(numbers)):
             total += numbers[i]
 
         num_string = str(total)

maths/series/harmonic.py

@@ -45,7 +45,7 @@ def is_harmonic_series(series: list) -> bool:
         return True
     rec_series = []
     series_len = len(series)
-    for i in range(0, series_len):
+    for i in range(series_len):
         if series[i] == 0:
             raise ValueError("Input series cannot have 0 as an element")
         rec_series.append(1 / series[i])