D. J.:

nobodyPerfecZ · nobodyPerfecZ · commit 736201c6899b · 2025-06-29T11:58:46.000+02:00
- Moved from black, flake8 and isort to ruff
- Fixed linting errors
diff --git a/.github/workflows/check-format.yaml b/.github/workflows/check-format.yaml
@@ -29,9 +29,6 @@ jobs:
         run: |
           uv pip install -r pyproject.toml
           uv pip install --group dev
-      - name: Check Format with flake8
+      - name: Check Format with ruff
         run: |
-          # stop the build if there are Python syntax errors or undefined names
-          flake8 --exclude .venv --count --select=E9,F63,F7,F82 --show-source --statistics
-          # exit-zero treats all errors as warnings. Black has 88 max-line-length
-          flake8 --exclude .venv --count --exit-zero --max-complexity=10 --max-line-length=88 --statistics
+          ruff check .
diff --git a/awesome_python_leetcode/_101_symmetric_tree.py b/awesome_python_leetcode/_101_symmetric_tree.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_104_maximum_depth_of_binary_tree.py b/awesome_python_leetcode/_104_maximum_depth_of_binary_tree.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_105_construct_binary_tree_from_preorder_and_inorder_traversal.py b/awesome_python_leetcode/_105_construct_binary_tree_from_preorder_and_inorder_traversal.py
@@ -1,6 +1,5 @@
 from typing import List, Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_106_construct_binary_tree_from_inorder_and_postorder_traversal.py b/awesome_python_leetcode/_106_construct_binary_tree_from_inorder_and_postorder_traversal.py
@@ -1,6 +1,5 @@
 from typing import List, Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_112_path_sum.py b/awesome_python_leetcode/_112_path_sum.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_114_flatten_binary_tree_to_linked_list.py b/awesome_python_leetcode/_114_flatten_binary_tree_to_linked_list.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_123_best_time_to_buy_and_sell_stock_III.py b/awesome_python_leetcode/_123_best_time_to_buy_and_sell_stock_III.py
@@ -17,7 +17,7 @@ def maxProfit(self, prices: List[int]) -> int:
         """
         dp = [0 for _ in range(len(prices))]
 
-        for t in range(1, 3):
+        for _ in range(1, 3):
             pos = -prices[0]
             profit = 0
             for i in range(1, len(prices)):
diff --git a/awesome_python_leetcode/_129_sum_root_to_leaf_numbers.py b/awesome_python_leetcode/_129_sum_root_to_leaf_numbers.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_133_clone_graph.py b/awesome_python_leetcode/_133_clone_graph.py
@@ -1,5 +1,5 @@
 import collections
-from typing import List, Optional, Dict
+from typing import Dict, List, Optional
 
 
 class Node:
diff --git a/awesome_python_leetcode/_173_binary_search_tree_iterator.py b/awesome_python_leetcode/_173_binary_search_tree_iterator.py
@@ -1,6 +1,5 @@
 from typing import List, Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_188_best_time_to_buy_and_sell_stock_IV.py b/awesome_python_leetcode/_188_best_time_to_buy_and_sell_stock_IV.py
@@ -17,7 +17,7 @@ def maxProfit(self, k: int, prices: List[int]) -> int:
         """
         dp = [0 for _ in range(len(prices))]
 
-        for t in range(1, k + 1):
+        for _ in range(1, k + 1):
             pos = -prices[0]
             profit = 0
             for i in range(1, len(prices)):
diff --git a/awesome_python_leetcode/_205_isomorphic_strings.py b/awesome_python_leetcode/_205_isomorphic_strings.py
@@ -15,7 +15,7 @@ def isIsomorphic(self, s: str, t: str) -> bool:
         if len(s) != len(t):
             return False
         policy, reverse_policy = {}, {}
-        for s_, t_ in zip(s, t):
+        for s_, t_ in zip(s, t, strict=True):
             if s_ in policy and policy[s_] != t_:
                 return False
             if t_ in reverse_policy and reverse_policy[t_] != s_:
diff --git a/awesome_python_leetcode/_215_kth_largest_element_in_an_array.py b/awesome_python_leetcode/_215_kth_largest_element_in_an_array.py
@@ -1,5 +1,5 @@
-from typing import List
 from heapq import heapify, heappop
+from typing import List
 
 
 class Solution:
@@ -17,6 +17,6 @@ def findKthLargest(self, nums: List[int], k: int) -> int:
         """
         nums = [-n for n in nums]
         heapify(nums)
-        for t in range(k):
+        for _ in range(k):
             val = heappop(nums)
         return -val
diff --git a/awesome_python_leetcode/_222_count_complete_tree_nodes.py b/awesome_python_leetcode/_222_count_complete_tree_nodes.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_226_invert_binary_tree.py b/awesome_python_leetcode/_226_invert_binary_tree.py
@@ -1,6 +1,5 @@
 from typing import Optional
 
-
 from awesome_python_leetcode.tree import TreeNode
 
 
diff --git a/awesome_python_leetcode/_242_valid_anagram.py b/awesome_python_leetcode/_242_valid_anagram.py
@@ -13,7 +13,7 @@ def isAnagram(self, s: str, t: str) -> bool:
             return False
 
         counter_s, counter_t = {}, {}
-        for s_, t_ in zip(s, t):
+        for s_, t_ in zip(s, t, strict=True):
             if s_ not in counter_s:
                 counter_s[s_] = 1
             else:
@@ -24,7 +24,7 @@ def isAnagram(self, s: str, t: str) -> bool:
             else:
                 counter_t[t_] += 1
 
-        for k_s, k_t in zip(counter_s, counter_t):
+        for k_s, k_t in zip(counter_s, counter_t, strict=True):
             if k_s not in counter_t:
                 return False
             if k_t not in counter_s:
diff --git a/awesome_python_leetcode/_25_reverse_nodes_in_k_group.py b/awesome_python_leetcode/_25_reverse_nodes_in_k_group.py
@@ -29,9 +29,9 @@ def reverseKGroup(self, head: Optional[ListNode], k: int) -> Optional[ListNode]:
         left, cur = dummy, head
         n = self.length(head)
 
-        for i in range(n // k):
+        for _ in range(n // k):
             prev = None
-            for i in range(k):
+            for _ in range(k):
                 tmp = cur.next
                 cur.next = prev
                 prev, cur = cur, tmp
diff --git a/awesome_python_leetcode/_274_h_index.py b/awesome_python_leetcode/_274_h_index.py
@@ -18,7 +18,7 @@ def hIndex(self, citations: List[int]) -> int:
         # Sort citations by number of papers
         n = len(citations)
         count = collections.defaultdict(int)
-        for i, val in enumerate(citations):
+        for val in citations:
             index = min(val, n)
             count[index] += 1
 
diff --git a/awesome_python_leetcode/_290_word_pattern.py b/awesome_python_leetcode/_290_word_pattern.py
@@ -17,7 +17,7 @@ def wordPattern(self, pattern: str, s: str) -> bool:
         if len(pattern) != len(s):
             return False
         policy, reverse_policy = {}, {}
-        for pattern_, s_ in zip(pattern, s):
+        for pattern_, s_ in zip(pattern, s, strict=True):
             if pattern_ in policy and policy[pattern_] != s_:
                 return False
             if s_ in reverse_policy and reverse_policy[s_] != pattern_:
diff --git a/awesome_python_leetcode/_295_find_median_from_data_stream.py b/awesome_python_leetcode/_295_find_median_from_data_stream.py
@@ -1,4 +1,4 @@
-from heapq import heappush, heappop
+from heapq import heappop, heappush
 
 
 class MedianFinder:
diff --git a/awesome_python_leetcode/_373_find_k_pairs_with_smallest_sums.py b/awesome_python_leetcode/_373_find_k_pairs_with_smallest_sums.py
@@ -1,5 +1,5 @@
-from typing import List
 from heapq import heappop, heappush
+from typing import List
 
 
 class Solution:
diff --git a/awesome_python_leetcode/_415_add_strings.py b/awesome_python_leetcode/_415_add_strings.py
@@ -131,7 +131,7 @@ def addStrings(self, num1: str, num2: str) -> str:
         # Loop through the digits from right to left
         result = ""
         remaining = "0"
-        for n1, n2 in zip(reversed(smallest), reversed(largest)):
+        for n1, n2 in zip(reversed(smallest), reversed(largest), strict=True):
             # Apply the addition rules including remaining
             add, next_remaining1 = RULES[(n1, n2)]
             add, next_remaining2 = RULES[(add, remaining)]
diff --git a/awesome_python_leetcode/_433_minimum_genetic_mutation.py b/awesome_python_leetcode/_433_minimum_genetic_mutation.py
@@ -6,7 +6,7 @@ class Solution:
 
     def hammingweight(self, gene1: str, gene2: str) -> int:
         weight = 0
-        for s1, s2 in zip(gene1, gene2):
+        for s1, s2 in zip(gene1, gene2, strict=True):
             if s1 != s2:
                 weight += 1
         return weight
diff --git a/awesome_python_leetcode/_452_minimum_number_of_arrows_to_burst_balloons.py b/awesome_python_leetcode/_452_minimum_number_of_arrows_to_burst_balloons.py
@@ -22,15 +22,15 @@ def findMinArrowShots(self, points: List[List[int]]) -> int:
         burst all balloons.
         """
         points = sorted(points, key=lambda p: p[0])
-        l, r = points[0][0], points[0][1]
+        left, right = points[0][0], points[0][1]
         i, output = 1, 1
         while i < len(points):
-            c_l, c_r = points[i][0], points[i][1]
-            new_l, new_r = max(l, c_l), min(r, c_r)
-            if new_l <= new_r:
-                l, r = new_l, new_r
+            c_left, c_right = points[i][0], points[i][1]
+            new_left, new_right = max(left, c_left), min(right, c_right)
+            if new_left <= new_right:
+                left, right = new_left, new_right
             else:
-                l, r = c_l, c_r
+                left, right = c_left, c_right
                 output += 1
             i += 1
         return output
diff --git a/awesome_python_leetcode/_502_ipo.py b/awesome_python_leetcode/_502_ipo.py
@@ -1,5 +1,5 @@
+from heapq import heapify, heappop, heappush
 from typing import List
-from heapq import heappop, heappush, heapify
 
 
 class Solution:
@@ -32,10 +32,9 @@ def findMaximizedCapital(
         The answer is guaranteed to fit in a 32-bit signed integer.
         """
         maxHeap = []
-        minHeap = [(c, p) for c, p in zip(capital, profits)]
+        minHeap = [(c, p) for c, p in zip(capital, profits, strict=True)]
         heapify(minHeap)
-        for t in range(k):
-
+        for _ in range(k):
             while minHeap and minHeap[0][0] <= w:
                 c, p = heappop(minHeap)
                 heappush(maxHeap, -p)
diff --git a/awesome_python_leetcode/_67_add_binary.py b/awesome_python_leetcode/_67_add_binary.py
@@ -7,7 +7,7 @@ def addBinary(self, a: str, b: str) -> str:
         max_length = max(len(a), len(b))
         a = ("0" * (max_length - len(a))) + a
         b = ("0" * (max_length - len(b))) + b
-        for a_, b_ in zip(reversed(a), reversed(b)):
+        for a_, b_ in zip(reversed(a), reversed(b), strict=True):
             if a_ == "0" and b_ == "0" and overhead == "0":
                 result = "0" + result
                 overhead = "0"
diff --git a/awesome_python_leetcode/_68_text_justification.py b/awesome_python_leetcode/_68_text_justification.py
@@ -1,5 +1,5 @@
-from typing import List
 import math
+from typing import List
 
 
 class Solution:
diff --git a/awesome_python_leetcode/_70_climbing_stairs.py b/awesome_python_leetcode/_70_climbing_stairs.py
@@ -51,7 +51,7 @@ def climbStairsBUOptimized(self, n: int) -> int:
         # Time Complexity: O(n)
         # Space Complexity: O(1)
         one, two = 1, 1
-        for i in range(n - 1):
+        for _ in range(n - 1):
             tmp = one
             one = one + two
             two = tmp
diff --git a/awesome_python_leetcode/_92_reverse_linked_list_II.py b/awesome_python_leetcode/_92_reverse_linked_list_II.py
@@ -19,11 +19,11 @@ def reverseBetween(
         """
         dummy = ListNode(0, head)
         prev_left, cur = dummy, head
-        for i in range(left - 1):
+        for _ in range(left - 1):
             prev_left, cur = cur, cur.next
 
         prev_right = None
-        for i in range(right - left + 1):
+        for _ in range(right - left + 1):
             tmp = cur.next
             cur.next = prev_right
             prev_right, cur = cur, tmp
diff --git a/pyproject.toml b/pyproject.toml
@@ -2,25 +2,19 @@
 name = "awesome-python-leetcode"
 version = "0.0.1"
 description = "Python Solutions for LeetCode Problems!"
-authors = [
-    { name = "Dennis Jabs" },
-]
+authors = [{ name = "Dennis Jabs" }]
 requires-python = ">=3.10"
 readme = "README.md"
 license = { file = "LICENSE" }
 
-dependencies = [
-    "numpy>=2.2.5",
-]
+dependencies = ["numpy>=2.2.5"]
 
 [dependency-groups]
 dev = [
-    "black>=23.7.0",
-    "flake8>=7.3.0",
-    "isort>=5.12.0",
     "pytest>=7.4.0",
     "pytest-cov>=4.1.0",
     "pytest-mock>=3.14.1",
+    "ruff>=0.12.1",
 ]
 
 [project.urls]
@@ -32,3 +26,10 @@ name = "testpypi"
 url = "https://test.pypi.org/simple/"
 publish-url = "https://test.pypi.org/legacy/"
 explicit = true
+
+[tool.ruff]
+line-length = 88
+lint.ignore = ["E203"]
+target-version = "py310"
+lint.select = ["E", "F", "B", "I"]
+lint.mccabe.max-complexity = 10
diff --git a/tests/test_128_longest_consecutive_sequence.py b/tests/test_128_longest_consecutive_sequence.py
@@ -1,4 +1,5 @@
 from typing import List
+
 import pytest
 
 from awesome_python_leetcode._128_longest_consecutive_sequence import Solution
diff --git a/tests/test_133_clone_graph.py b/tests/test_133_clone_graph.py
@@ -2,7 +2,7 @@
 
 import pytest
 
-from awesome_python_leetcode._133_clone_graph import Solution, Node
+from awesome_python_leetcode._133_clone_graph import Node, Solution
 
 
 @pytest.mark.parametrize(
diff --git a/tests/test_136_single_number.py b/tests/test_136_single_number.py
@@ -1,4 +1,5 @@
 from typing import List
+
 import pytest
 
 from awesome_python_leetcode._136_single_number import Solution
diff --git a/tests/test_137_single_number_II.py b/tests/test_137_single_number_II.py
@@ -1,4 +1,5 @@
 from typing import List
+
 import pytest
 
 from awesome_python_leetcode._137_single_number_II import Solution
diff --git a/tests/test_141_linked_list_cycle.py b/tests/test_141_linked_list_cycle.py
@@ -2,7 +2,7 @@
 
 import pytest
 
-from awesome_python_leetcode._141_linked_list_cycle import Solution, ListNode
+from awesome_python_leetcode._141_linked_list_cycle import ListNode, Solution
 
 
 @pytest.mark.parametrize(
diff --git a/tests/test_148_sort_list.py b/tests/test_148_sort_list.py
@@ -2,7 +2,7 @@
 
 import pytest
 
-from awesome_python_leetcode._148_sort_list import Solution, ListNode
+from awesome_python_leetcode._148_sort_list import ListNode, Solution
 
 
 @pytest.mark.parametrize(
diff --git a/tests/test_14_longest_common_prefix.py b/tests/test_14_longest_common_prefix.py
@@ -1,4 +1,5 @@
 from typing import List
+
 import pytest
 
 from awesome_python_leetcode._14_longest_common_prefix import Solution
diff --git a/tests/test_209_minimum_size_subarray_sum.py b/tests/test_209_minimum_size_subarray_sum.py
@@ -1,4 +1,5 @@
 from typing import List
+
 import pytest
 
 from awesome_python_leetcode._209_minimum_size_subarray_sum import Solution
diff --git a/tests/test_212_word_search_II.py b/tests/test_212_word_search_II.py
@@ -1,5 +1,7 @@
 from typing import List
+
 import pytest
+
 from awesome_python_leetcode._212_word_search_II import Solution
 
 
diff --git a/tests/test_23_merge_k_sorted_lists.py b/tests/test_23_merge_k_sorted_lists.py
diff --git a/tests/test_2_add_two_numbers.py b/tests/test_2_add_two_numbers.py
diff --git a/tests/test_427_construct_quad_tree.py b/tests/test_427_construct_quad_tree.py
diff --git a/tests/test_42_trapping_rain_water.py b/tests/test_42_trapping_rain_water.py
diff --git a/tests/test_66_plus_one.py b/tests/test_66_plus_one.py
diff --git a/tests/test_68_text_justification.py b/tests/test_68_text_justification.py
diff --git a/tests/test_95_unique_binary_search_trees_II.py b/tests/test_95_unique_binary_search_trees_II.py

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,5 @@`
`1`	`1`	`from typing import Optional`
`2`	`2`
`3`		`-`
`4`	`3`	`from awesome_python_leetcode.tree import TreeNode`
`5`	`4`
`6`	`5`
Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,5 @@`
`1`	`1`	`from typing import List, Optional`
`2`	`2`
`3`		`-`
`4`	`3`	`from awesome_python_leetcode.tree import TreeNode`
`5`	`4`
`6`	`5`