Add pre commit hooks

Author: onixlas

.pre-commit-config.yaml

@@ -0,0 +1,12 @@
+repos:
+  - repo: https://github.com/astral-sh/ruff-pre-commit
+    rev: v0.12.7
+    hooks:
+      - id: ruff
+        args: [--fix]
+
+  - repo: https://github.com/psf/black
+    rev: 25.1.0
+    hooks:
+      - id: black
+        language_version: python3.13

array_string/can_place_flowers/solution.py

@@ -8,7 +8,9 @@ def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
         for index in range(len(flowerbed)):
             if flowerbed[index] == 0:
                 left_is_empty = (index == 0) or (flowerbed[index - 1] == 0)
-                right_is_empty = (index == len(flowerbed) - 1) or (flowerbed[index + 1] == 0)
+                right_is_empty = (index == len(flowerbed) - 1) or (
+                    flowerbed[index + 1] == 0
+                )
                 if left_is_empty and right_is_empty:
                     flowerbed[index] = 1
                     counter += 1

array_string/greatest_common_divisor_of_strings/solution.py

@@ -12,4 +12,4 @@ def is_valid_gcd(index):
         for i in range(min(length1, length2), 0, -1):
             if is_valid_gcd(i):
                 return str1[:i]
-        return ""
+        return ""

array_string/kids_with_the_greatest_number_of_candies/solution.py

@@ -4,4 +4,6 @@
 class Solution:
     def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
         max_candies = max(candies)
-        return [current_candies + extraCandies >= max_candies for current_candies in candies]
+        return [
+            current_candies + extraCandies >= max_candies for current_candies in candies
+        ]

array_string/merge_strings_alternately/solution.py

@@ -8,4 +8,4 @@ def mergeAlternately(self, word1: str, word2: str) -> str:
             if index < len(word2):
                 result.append(word2[index])
 
-        return ''.join(result)
+        return "".join(result)

tests/test_can_place_flowers.py

@@ -1,14 +1,18 @@
 import pytest
 from array_string.can_place_flowers.solution import Solution
 
-@pytest.mark.parametrize("flowerbed, n, expected", [
-    ([1, 0, 0, 0, 1], 1, True),
-    ([1, 0, 0, 0, 1], 2, False),
-    ([1,0,1,0,1,0,1], 1, False),
-    ([1, 0, 0, 0, 1, 0, 0], 2, True),
-    ([0], 1, True),
-    ([1,0,1,0,1,0,1], 0, True)
-])
+
+@pytest.mark.parametrize(
+    "flowerbed, n, expected",
+    [
+        ([1, 0, 0, 0, 1], 1, True),
+        ([1, 0, 0, 0, 1], 2, False),
+        ([1, 0, 1, 0, 1, 0, 1], 1, False),
+        ([1, 0, 0, 0, 1, 0, 0], 2, True),
+        ([0], 1, True),
+        ([1, 0, 1, 0, 1, 0, 1], 0, True),
+    ],
+)
 def test_merge_alternately(flowerbed, n, expected):
     solution = Solution()
-    assert solution.canPlaceFlowers(flowerbed, n) == expected
+    assert solution.canPlaceFlowers(flowerbed, n) == expected

tests/test_greatest_common_divisor_of_strings.py

@@ -1,11 +1,11 @@
 import pytest
 from array_string.greatest_common_divisor_of_strings.solution import Solution
 
-@pytest.mark.parametrize("str1, str2, expected", [
-    ("ABCABC", "ABC", "ABC"),
-    ("ABABAB", "ABAB", "AB"),
-    ("LEET", "CODE", "")
-])
+
+@pytest.mark.parametrize(
+    "str1, str2, expected",
+    [("ABCABC", "ABC", "ABC"), ("ABABAB", "ABAB", "AB"), ("LEET", "CODE", "")],
+)
 def test_merge_alternately(str1, str2, expected):
     solution = Solution()
-    assert solution.gcdOfStrings(str1, str2) == expected
+    assert solution.gcdOfStrings(str1, str2) == expected

tests/test_kids_with_candies.py

@@ -1,11 +1,15 @@
 import pytest
 from array_string.kids_with_the_greatest_number_of_candies.solution import Solution
 
-@pytest.mark.parametrize("candies, extraCandies, expected", [
-    ([2, 3, 5, 1, 3], 3, [True, True, True, False, True] ),
-    ([4, 2, 1, 1, 2], 1, [True, False, False, False, False]),
-    ([12, 1, 12], 10, [True, False, True])
-])
+
+@pytest.mark.parametrize(
+    "candies, extraCandies, expected",
+    [
+        ([2, 3, 5, 1, 3], 3, [True, True, True, False, True]),
+        ([4, 2, 1, 1, 2], 1, [True, False, False, False, False]),
+        ([12, 1, 12], 10, [True, False, True]),
+    ],
+)
 def test_merge_alternately(candies, extraCandies, expected):
     solution = Solution()
-    assert solution.kidsWithCandies(candies, extraCandies) == expected
+    assert solution.kidsWithCandies(candies, extraCandies) == expected

tests/test_merge_strings_alternately.py

@@ -1,11 +1,11 @@
 import pytest
 from array_string.merge_strings_alternately.solution import Solution
 
-@pytest.mark.parametrize("word1, word2, expected", [
-    ("abc", "pqr", "apbqcr"),
-    ("ab", "pqrs", "apbqrs"),
-    ("abcd", "pq", "apbqcd")
-])
+
+@pytest.mark.parametrize(
+    "word1, word2, expected",
+    [("abc", "pqr", "apbqcr"), ("ab", "pqrs", "apbqrs"), ("abcd", "pq", "apbqcd")],
+)
 def test_merge_alternately(word1, word2, expected):
     solution = Solution()
-    assert solution.mergeAlternately(word1, word2) == expected
+    assert solution.mergeAlternately(word1, word2) == expected