Edited file names

accepted/__init__.py

@@ -1,3 +1,3 @@
-from .accepted_easy import AcceptedEasy
-from .accepted_medium import AcceptedMedium
-from .accepted_hard import AcceptedHard
+from .easy import AcceptedEasy
+from .medium import AcceptedMedium
+from .hard import AcceptedHard

accepted/easy.py

@@ -17,7 +17,7 @@ class AcceptedEasy:
                 num -= roman_map[s[i]]
         return num
 
-    def length_of_last_word(self, s: str) -> int:  # sourcery skip: use-next
+    def length_of_last_word(self, s: str) -> int:
         """
             Link: https://leetcode.com/problems/length-of-last-word/
             Runtime: 54 ms
@@ -36,7 +36,6 @@ class AcceptedEasy:
         return strIndex - spaceIndex
 
     def plus_one(self, digits: List[int]) -> List[int]:
-        # sourcery skip: inline-immediately-returned-variable, list-comprehension
         """
             Link: https://leetcode.com/problems/plus-one/
             Runtime: 34 ms

accepted/medium.py

@@ -25,7 +25,7 @@ class AcceptedMedium:
             Link: https://leetcode.com/problems/letter-combinations-of-a-phone-number/
             Runtime: 39 ms
         """
-        # sourcery skip: use-itertools-product
+
         number_to_string = {'2': ['a', 'b', 'c'], '3': ['d', 'e', 'f'], '4': ['g', 'h', 'i'],
                     '5': ['j', 'k', 'l'], '6': ['m', 'n', 'o'], '7': ['p', 'q', 'r', 's'],
                     '8': ['t', 'u', 'v'], '9': ['w', 'x', 'y', 'z']}
@@ -42,7 +42,6 @@ class AcceptedMedium:
         return [] if l[0] == '' else l
 
     def convert_linear_str_to_zigzag(self, s: str, numRows: int) -> str:
-        # sourcery skip: use-contextlib-suppress
         """
             Link: https://leetcode.com/problems/zigzag-conversion/
             Runtime: 72 ms
@@ -80,7 +79,6 @@ class AcceptedMedium:
         return s1 + s2 + s3
 
     def is_valid_sudoku(self, board: List[List[str]]) -> bool:
-        # sourcery skip: list-comprehension, use-itertools-product
         """
             Link: https://leetcode.com/problems/valid-sudoku/
             Runtime: 105 ms
@@ -105,7 +103,6 @@ class AcceptedMedium:
         return True
 
     def set_zeroes(self, matrix: List[List[int]]) -> None:
-        # sourcery skip: use-itertools-product
         """
             Link: https://leetcode.com/problems/set-matrix-zeroes/description/
             Runtime: 5780 ms

accepted_refused.py

@@ -1,11 +0,0 @@
-from accepted import (AcceptedEasy,
-                    AcceptedMedium,
-                    AcceptedHard)
-from refused import (RefusedEasy,
-                    RefusedMedium,
-                    RefusedHard)
-
-
-class LeetCodeRefused(RefusedEasy, RefusedMedium, RefusedHard): ...
-
-class LeetCodeAccepted(AcceptedEasy, AcceptedMedium, AcceptedHard): ...

problems.py

@@ -0,0 +1,16 @@
+from accepted import (
+    AcceptedEasy,
+    AcceptedMedium,
+    AcceptedHard
+)
+
+from refused import (
+    RefusedEasy,
+    RefusedMedium,
+    RefusedHard
+)
+
+
+class LeetCodeRefused(RefusedEasy, RefusedMedium, RefusedHard): ...
+
+class LeetCodeAccepted(AcceptedEasy, AcceptedMedium, AcceptedHard): ...

refused/__init__.py

@@ -1,3 +1,3 @@
-from .refused_easy import RefusedEasy
-from .refused_medium import RefusedMedium
-from .refused_hard import RefusedHard
+from .easy import RefusedEasy
+from .medium import RefusedMedium
+from .hard import RefusedHard

solution.ipynb

@@ -24,7 +24,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.10.6"
+   "version": "3.10.12"
   },
   "orig_nbformat": 4,
   "vscode": {