.flake8

@@ -0,0 +1,10 @@
+[flake8]
+max-line-length = 88
+# max-complexity should be 10
+max-complexity = 19
+extend-ignore =
+    # Formatting style for `black`
+    # E203 is whitespace before ':'
+    E203,
+    # W503 is line break occurred before a binary operator
+    W503

.github/workflows/ruff.yml

@@ -1,16 +0,0 @@
-# https://beta.ruff.rs
-name: ruff
-on:
-  push:
-    branches:
-      - master
-  pull_request:
-    branches:
-      - master
-jobs:
-  ruff:
-    runs-on: ubuntu-latest
-    steps:
-    - uses: actions/checkout@v3
-    - run: pip install --user ruff
-    - run: ruff --format=github .

.pre-commit-config.yaml

@@ -3,7 +3,6 @@ repos:
     rev: v4.4.0
     hooks:
       - id: check-executables-have-shebangs
-      - id: check-toml
       - id: check-yaml
       - id: end-of-file-fixer
         types: [python]
@@ -15,41 +14,60 @@ repos:
     hooks:
     -   id: auto-walrus
 
-  - repo: https://github.com/charliermarsh/ruff-pre-commit
-    rev: v0.0.255
-    hooks:
-      - id: ruff
-
   - repo: https://github.com/psf/black
     rev: 23.1.0
     hooks:
       - id: black
 
-  - repo: https://github.com/codespell-project/codespell
+  - repo: https://github.com/PyCQA/isort
-    rev: v2.2.4
+    rev: 5.12.0
     hooks:
-      - id: codespell
+      - id: isort
-        additional_dependencies:
+        args:
-          - tomli
+          - --profile=black
 
   - repo: https://github.com/tox-dev/pyproject-fmt
     rev: "0.9.2"
     hooks:
       - id: pyproject-fmt
 
-  - repo: local
-    hooks:
-      - id: validate-filenames
-        name: Validate filenames
-        entry: ./scripts/validate_filenames.py
-        language: script
-        pass_filenames: false
-
   - repo: https://github.com/abravalheri/validate-pyproject
     rev: v0.12.1
     hooks:
       - id: validate-pyproject
 
+  - repo: https://github.com/asottile/pyupgrade
+    rev: v3.3.1
+    hooks:
+      - id: pyupgrade
+        args:
+          - --py311-plus
+
+  - repo: https://github.com/charliermarsh/ruff-pre-commit
+    rev: v0.0.255
+    hooks:
+      - id: ruff
+        args:
+          - --ignore=E741
+
+  - repo: https://github.com/PyCQA/flake8
+    rev: 6.0.0
+    hooks:
+      - id: flake8 # See .flake8 for args
+        additional_dependencies: &flake8-plugins
+          - flake8-bugbear
+          - flake8-builtins
+          # - flake8-broken-line
+          - flake8-comprehensions
+          - pep8-naming
+
+  - repo: https://github.com/asottile/yesqa
+    rev: v1.4.0
+    hooks:
+      - id: yesqa
+        additional_dependencies:
+          *flake8-plugins
+
   - repo: https://github.com/pre-commit/mirrors-mypy
     rev: v1.1.1
     hooks:
@@ -59,3 +77,25 @@ repos:
           - --install-types # See mirrors-mypy README.md
           - --non-interactive
         additional_dependencies: [types-requests]
+
+  - repo: https://github.com/codespell-project/codespell
+    rev: v2.2.4
+    hooks:
+      - id: codespell
+        args:
+          - --ignore-words-list=3rt,ans,crate,damon,fo,followings,hist,iff,kwanza,mater,secant,som,sur,tim,zar
+        exclude: |
+          (?x)^(
+              ciphers/prehistoric_men.txt |
+              strings/dictionary.txt |
+              strings/words.txt |
+              project_euler/problem_022/p022_names.txt
+          )$
+
+  - repo: local
+    hooks:
+      - id: validate-filenames
+        name: Validate filenames
+        entry: ./scripts/validate_filenames.py
+        language: script
+        pass_filenames: false

DIRECTORY.md

@@ -196,14 +196,11 @@
     * [Disjoint Set](data_structures/disjoint_set/disjoint_set.py)
   * Hashing
     * [Double Hash](data_structures/hashing/double_hash.py)
-    * [Hash Map](data_structures/hashing/hash_map.py)
     * [Hash Table](data_structures/hashing/hash_table.py)
     * [Hash Table With Linked List](data_structures/hashing/hash_table_with_linked_list.py)
     * Number Theory
       * [Prime Numbers](data_structures/hashing/number_theory/prime_numbers.py)
     * [Quadratic Probing](data_structures/hashing/quadratic_probing.py)
-    * Tests
-      * [Test Hash Map](data_structures/hashing/tests/test_hash_map.py)
   * Heap
     * [Binomial Heap](data_structures/heap/binomial_heap.py)
     * [Heap](data_structures/heap/heap.py)
@@ -976,8 +973,6 @@
     * [Sol1](project_euler/problem_125/sol1.py)
   * Problem 129
     * [Sol1](project_euler/problem_129/sol1.py)
-  * Problem 131
-    * [Sol1](project_euler/problem_131/sol1.py)
   * Problem 135
     * [Sol1](project_euler/problem_135/sol1.py)
   * Problem 144

arithmetic_analysis/newton_raphson.py

@@ -5,7 +5,7 @@
 from __future__ import annotations
 
 from decimal import Decimal
-from math import *  # noqa: F403
+from math import *  # noqa: F401, F403
 
 from sympy import diff
 

arithmetic_analysis/newton_raphson_new.py

@@ -8,7 +8,7 @@
 # Newton's Method - https://en.wikipedia.org/wiki/Newton's_method
 
 from sympy import diff, lambdify, symbols
-from sympy.functions import *  # noqa: F403
+from sympy.functions import *  # noqa: F401, F403
 
 
 def newton_raphson(

data_structures/heap/heap_generic.py

@@ -166,6 +166,7 @@ def test_heap() -> None:
     >>> h.get_top()
     [9, -40]
     """
+    pass
 
 
 if __name__ == "__main__":

dynamic_programming/min_distance_up_bottom.py

@@ -6,13 +6,13 @@ to find edit distance.
 The aim is to demonstate up bottom approach for solving the task.
 The implementation was tested on the
 leetcode: https://leetcode.com/problems/edit-distance/
+"""
 
+"""
 Levinstein distance
 Dynamic Programming: up -> down.
 """
 
-import functools
-
 
 def min_distance_up_bottom(word1: str, word2: str) -> int:
     """
@@ -25,10 +25,13 @@ def min_distance_up_bottom(word1: str, word2: str) -> int:
     >>> min_distance_up_bottom("zooicoarchaeologist", "zoologist")
     10
     """
+
+    from functools import lru_cache
+
     len_word1 = len(word1)
     len_word2 = len(word2)
 
-    @functools.cache
+    @lru_cache(maxsize=None)
     def min_distance(index1: int, index2: int) -> int:
         # if first word index is overflow - delete all from the second word
         if index1 >= len_word1:

dynamic_programming/minimum_tickets_cost.py

@@ -22,7 +22,7 @@ Minimum Cost For Tickets
 Dynamic Programming: up -> down.
 """
 
-import functools
+from functools import lru_cache
 
 
 def mincost_tickets(days: list[int], costs: list[int]) -> int:
@@ -106,7 +106,7 @@ def mincost_tickets(days: list[int], costs: list[int]) -> int:
 
     days_set = set(days)
 
-    @functools.cache
+    @lru_cache(maxsize=None)
     def dynamic_programming(index: int) -> int:
         if index > 365:
             return 0

dynamic_programming/word_break.py

@@ -20,7 +20,7 @@ Runtime: O(n * n)
 Space: O(n)
 """
 
-import functools
+from functools import lru_cache
 from typing import Any
 
 
@@ -80,7 +80,7 @@ def word_break(string: str, words: list[str]) -> bool:
     len_string = len(string)
 
     # Dynamic programming method
-    @functools.cache
+    @lru_cache(maxsize=None)
     def is_breakable(index: int) -> bool:
         """
         >>> string = 'a'

hashes/sha1.py

@@ -26,6 +26,7 @@ Reference: https://deadhacker.com/2006/02/21/sha-1-illustrated/
 import argparse
 import hashlib  # hashlib is only used inside the Test class
 import struct
+import unittest
 
 
 class SHA1Hash:
@@ -127,9 +128,14 @@ class SHA1Hash:
         return "%08x%08x%08x%08x%08x" % tuple(self.h)
 
 
-def test_sha1_hash():
+class SHA1HashTest(unittest.TestCase):
-    msg = b"Test String"
+    """
-    assert SHA1Hash(msg).final_hash() == hashlib.sha1(msg).hexdigest()  # noqa: S324
+    Test class for the SHA1Hash class. Inherits the TestCase class from unittest
+    """
+
+    def testMatchHashes(self):  # noqa: N802
+        msg = bytes("Test String", "utf-8")
+        self.assertEqual(SHA1Hash(msg).final_hash(), hashlib.sha1(msg).hexdigest())
 
 
 def main():

machine_learning/support_vector_machines.py

@@ -56,7 +56,7 @@ class SVC:
         *,
         regularization: float = np.inf,
         kernel: str = "linear",
-        gamma: float = 0.0,
+        gamma: float = 0,
     ) -> None:
         self.regularization = regularization
         self.gamma = gamma
@@ -65,7 +65,7 @@ class SVC:
         elif kernel == "rbf":
             if self.gamma == 0:
                 raise ValueError("rbf kernel requires gamma")
-            if not isinstance(self.gamma, (float, int)):
+            if not (isinstance(self.gamma, float) or isinstance(self.gamma, int)):
                 raise ValueError("gamma must be float or int")
             if not self.gamma > 0:
                 raise ValueError("gamma must be > 0")

maths/eulers_totient.py

@@ -1,20 +1,5 @@
 # Eulers Totient function finds the number of relative primes of a number n from 1 to n
 def totient(n: int) -> list:
-    """
-    >>> n = 10
-    >>> totient_calculation = totient(n)
-    >>> for i in range(1, n):
-    ...     print(f"{i} has {totient_calculation[i]} relative primes.")
-    1 has 0 relative primes.
-    2 has 1 relative primes.
-    3 has 2 relative primes.
-    4 has 2 relative primes.
-    5 has 4 relative primes.
-    6 has 2 relative primes.
-    7 has 6 relative primes.
-    8 has 4 relative primes.
-    9 has 6 relative primes.
-    """
     is_prime = [True for i in range(n + 1)]
     totients = [i - 1 for i in range(n + 1)]
     primes = []
@@ -35,6 +20,25 @@ def totient(n: int) -> list:
     return totients
 
 
+def test_totient() -> None:
+    """
+    >>> n = 10
+    >>> totient_calculation = totient(n)
+    >>> for i in range(1, n):
+    ...     print(f"{i} has {totient_calculation[i]} relative primes.")
+    1 has 0 relative primes.
+    2 has 1 relative primes.
+    3 has 2 relative primes.
+    4 has 2 relative primes.
+    5 has 4 relative primes.
+    6 has 2 relative primes.
+    7 has 6 relative primes.
+    8 has 4 relative primes.
+    9 has 6 relative primes.
+    """
+    pass
+
+
 if __name__ == "__main__":
     import doctest
 

maths/fibonacci.py

@@ -16,7 +16,7 @@ fib_memoization runtime: 0.0107 ms
 fib_binet runtime: 0.0174 ms
 """
 
-import functools
+from functools import lru_cache
 from math import sqrt
 from time import time
 
@@ -110,7 +110,7 @@ def fib_recursive_cached(n: int) -> list[int]:
     Exception: n is negative
     """
 
-    @functools.cache
+    @lru_cache(maxsize=None)
     def fib_recursive_term(i: int) -> int:
         """
         Calculates the i-th (0-indexed) Fibonacci number using recursion

maths/pythagoras.py

@@ -14,13 +14,17 @@ class Point:
 
 
 def distance(a: Point, b: Point) -> float:
+    return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2))
+
+
+def test_distance() -> None:
     """
     >>> point1 = Point(2, -1, 7)
     >>> point2 = Point(1, -3, 5)
     >>> print(f"Distance from {point1} to {point2} is {distance(point1, point2)}")
     Distance from Point(2, -1, 7) to Point(1, -3, 5) is 3.0
     """
-    return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2))
+    pass
 
 
 if __name__ == "__main__":

other/quine.py

@@ -1,5 +1,4 @@
 #!/bin/python3
-# ruff: noqa
 """
 Quine:
 

project_euler/problem_075/sol1.py

@@ -29,6 +29,7 @@ Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
 
 from collections import defaultdict
 from math import gcd
+from typing import DefaultDict
 
 
 def solution(limit: int = 1500000) -> int:
@@ -42,7 +43,7 @@ def solution(limit: int = 1500000) -> int:
     >>> solution(50000)
     5502
     """
-    frequencies: defaultdict = defaultdict(int)
+    frequencies: DefaultDict = defaultdict(int)
     euclid_m = 2
     while 2 * euclid_m * (euclid_m + 1) <= limit:
         for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):

project_euler/problem_131/sol1.py

@@ -1,56 +0,0 @@
-"""
-Project Euler Problem 131: https://projecteuler.net/problem=131
-
-There are some prime values, p, for which there exists a positive integer, n,
-such that the expression n^3 + n^2p is a perfect cube.
-
-For example, when p = 19, 8^3 + 8^2 x 19 = 12^3.
-
-What is perhaps most surprising is that for each prime with this property
-the value of n is unique, and there are only four such primes below one-hundred.
-
-How many primes below one million have this remarkable property?
-"""
-
-from math import isqrt
-
-
-def is_prime(number: int) -> bool:
-    """
-    Determines whether number is prime
-
-    >>> is_prime(3)
-    True
-
-    >>> is_prime(4)
-    False
-    """
-
-    for divisor in range(2, isqrt(number) + 1):
-        if number % divisor == 0:
-            return False
-    return True
-
-
-def solution(max_prime: int = 10**6) -> int:
-    """
-    Returns number of primes below max_prime with the property
-
-    >>> solution(100)
-    4
-    """
-
-    primes_count = 0
-    cube_index = 1
-    prime_candidate = 7
-    while prime_candidate < max_prime:
-        primes_count += is_prime(prime_candidate)
-
-        cube_index += 1
-        prime_candidate += 6 * cube_index
-
-    return primes_count
-
-
-if __name__ == "__main__":
-    print(f"{solution() = }")

pyproject.toml

@@ -12,57 +12,8 @@ addopts = [
 omit = [".env/*"]
 sort = "Cover"
 
-[tool.codespell]
+#[report]
-ignore-words-list = "3rt,ans,crate,damon,fo,followings,hist,iff,kwanza,mater,secant,som,sur,tim,zar"
+#sort = Cover
-skip = "./.*,*.json,ciphers/prehistoric_men.txt,project_euler/problem_022/p022_names.txt,pyproject.toml,strings/dictionary.txt,strings/words.txt"
+#omit =
-
+#    .env/*
-[tool.ruff]
+#    backtracking/*
-ignore = [      # `ruff rule S101` for a description of that rule
-    "B904",     # B904: Within an `except` clause, raise exceptions with `raise ... from err`
-    "B905",     # B905: `zip()` without an explicit `strict=` parameter
-    "E741",     # E741: Ambiguous variable name 'l'
-    "G004",     # G004 Logging statement uses f-string
-    "N999",     # N999: Invalid module name
-    "PLC1901",  # PLC1901: `{}` can be simplified to `{}` as an empty string is falsey
-    "PLR2004",  # PLR2004: Magic value used in comparison
-    "PLR5501",  # PLR5501: Consider using `elif` instead of `else`
-    "PLW0120",  # PLW0120: `else` clause on loop without a `break` statement
-    "PLW060",   # PLW060: Using global for `{name}` but no assignment is done -- DO NOT FIX
-    "PLW2901",  # PLW2901: Redefined loop variable
-    "RUF00",    # RUF00: Ambiguous unicode character -- DO NOT FIX
-    "RUF100",   # RUF100: Unused `noqa` directive
-    "S101",     # S101: Use of `assert` detected -- DO NOT FIX
-    "S105",     # S105: Possible hardcoded password: 'password'
-    "S113",     # S113: Probable use of requests call without timeout
-    "UP038",    # UP038: Use `X | Y` in `{}` call instead of `(X, Y)` -- DO NOT FIX
-]
-select = [      # https://beta.ruff.rs/docs/rules
-    "A",        # A: builtins
-    "B",        # B: bugbear
-    "C40",      # C40: comprehensions
-    "C90",      # C90: mccabe code complexity
-    "E",        # E: pycodestyle errors
-    "F",        # F: pyflakes
-    "G",        # G: logging format
-    "I",        # I: isort
-    "N",        # N: pep8 naming
-    "PL",       # PL: pylint
-    "PIE",      # PIE: pie
-    "PYI",      # PYI: type hinting stub files
-    "RUF",      # RUF: ruff
-    "S",        # S: bandit
-    "TID",      # TID: tidy imports
-    "UP",       # UP: pyupgrade
-    "W",        # W: pycodestyle warnings
-    "YTT",      # YTT: year 2020
-]
-target-version = "py311"
-
-[tool.ruff.mccabe]   # DO NOT INCREASE THIS VALUE
-max-complexity = 20  # default: 10
-
-[tool.ruff.pylint]   # DO NOT INCREASE THESE VALUES
-max-args = 10        # default: 5
-max-branches = 20    # default: 12
-max-returns = 8      # default: 6
-max-statements = 88  # default: 50

sorts/external_sort.py

@@ -104,7 +104,7 @@ class FileMerger:
         files = {}
 
         for i in range(len(filenames)):
-            files[i] = open(filenames[i], "r", buffer_size)  # noqa: UP015
+            files[i] = open(filenames[i], "r", buffer_size)
 
         return files
 

strings/check_anagrams.py

@@ -2,6 +2,7 @@
 wiki: https://en.wikipedia.org/wiki/Anagram
 """
 from collections import defaultdict
+from typing import DefaultDict
 
 
 def check_anagrams(first_str: str, second_str: str) -> bool:
@@ -29,7 +30,7 @@ def check_anagrams(first_str: str, second_str: str) -> bool:
         return False
 
     # Default values for count should be 0
-    count: defaultdict[str, int] = defaultdict(int)
+    count: DefaultDict[str, int] = defaultdict(int)
 
     # For each character in input strings,
     # increment count in the corresponding

strings/word_occurrence.py

@@ -1,6 +1,7 @@
 # Created by sarathkaul on 17/11/19
 # Modified by Arkadip Bhattacharya(@darkmatter18) on 20/04/2020
 from collections import defaultdict
+from typing import DefaultDict
 
 
 def word_occurrence(sentence: str) -> dict:
@@ -14,7 +15,7 @@ def word_occurrence(sentence: str) -> dict:
     >>> dict(word_occurrence("Two  spaces"))
     {'Two': 1, 'spaces': 1}
     """
-    occurrence: defaultdict[str, int] = defaultdict(int)
+    occurrence: DefaultDict[str, int] = defaultdict(int)
     # Creating a dictionary containing count of each word
     for word in sentence.split():
         occurrence[word] += 1

web_programming/currency_converter.py

@@ -8,7 +8,7 @@ import os
 import requests
 
 URL_BASE = "https://www.amdoren.com/api/currency.php"
-TESTING = os.getenv("CI", "")
+TESTING = os.getenv("CI", False)
 API_KEY = os.getenv("AMDOREN_API_KEY", "")
 
 if not API_KEY and not TESTING: