feat: add more problems

Author: wislertt

.templates/leetcode/json/linked_list_cycle.json

@@ -34,22 +34,22 @@
     "test_helper_methods": [
         { "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" },
         {
-            "name": "_create_cycle_list",
+            "name": "create_cycle_list",
             "parameters": "values: list[int], pos: int",
-            "body": "if not values:\n    return None\n\nhead = ListNode.from_list(values)\nif pos == -1:\n    return head\n\n# Find the node at position pos\ncurrent = head\nfor _ in range(pos):\n    current = current.next\ncycle_node = current\n\n# Find the tail\ntail = head\nwhile tail.next:\n    tail = tail.next\n\n# Create cycle\ntail.next = cycle_node\nreturn head"
+            "body": "if not values:\n    return None\n\nnodes = []\nhead = ListNode(values[0])\nnodes.append(head)\ncurrent = head\n\nfor i in range(1, len(values)):\n    current.next = ListNode(values[i])\n    current = current.next\n    nodes.append(current)\n\nif pos != -1 and pos < len(nodes):\n    current.next = nodes[pos]\n\nreturn head"
         }
     ],
     "test_methods": [
         {
             "name": "test_has_cycle",
             "parametrize": "values, pos, expected",
             "parametrize_typed": "values: list[int], pos: int, expected: bool",
-            "test_cases": "[([3, 2, 0, -4], 1, True), ([1, 2], 0, True), ([1], -1, False), ([], -1, False), ([1, 2, 3, 4, 5], 2, True), ([1, 2, 3], -1, False)]",
-            "body": "head = self._create_cycle_list(values, pos)\nresult = self.solution.has_cycle(head)\nassert result == expected"
+            "test_cases": "[([3, 2, 0, -4], 1, True), ([1, 2], 0, True), ([1], -1, False), ([], -1, False), ([1, 2, 3], -1, False), ([1, 2, 3, 4, 5], 0, True), ([1, 2, 3, 4, 5], 2, True), ([1, 2, 3, 4, 5], 4, True), ([1], 0, True), ([1, 2], 1, True), ([1, 2, 3, 4, 5, 6, 7, 8], 3, True), ([1, 2, 3, 4, 5, 6, 7, 8], -1, False), ([1, 2], -1, False), ([5, 10], 0, True), ([5, 10], 1, True), ([0], -1, False), ([-1, -2, -3], 1, True), ([100, 200, 300], 0, True)]",
+            "body": "head = self.create_cycle_list(values, pos)\nresult = self.solution.has_cycle(head)\nassert result == expected"
         }
     ],
-    "playground_imports": "from leetcode_py import ListNode\nfrom solution import Solution",
-    "playground_test_case": "# Example test case\nvalues = [3, 2, 0, -4]\npos = 1\nexpected = True",
-    "playground_execution": "head = create_cycle_list(values, pos)\nresult = Solution().has_cycle(head)\nresult",
+    "playground_imports": "from solution import Solution",
+    "playground_test_case": "import os\nimport sys\nsys.path.append(os.path.join(os.getcwd(), \\\"..\\\"))\nfrom linked_list_cycle.tests import TestLinkedListCycle\n\n# Example test case\nvalues = [3, 2, 0, -4]\npos = 1\nexpected = True",
+    "playground_execution": "head = TestLinkedListCycle().create_cycle_list(values, pos)\nresult = Solution().has_cycle(head)\nresult",
     "playground_assertion": "assert result == expected"
 }

leetcode/linked_list_cycle/playground.ipynb

@@ -7,12 +7,6 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "import os\n",
-    "import sys\n",
-    "\n",
-    "sys.path.append(os.path.join(os.getcwd(), \"..\"))\n",
-    "\n",
-    "from linked_list_cycle.tests import TestLinkedListCycle\n",
     "from solution import Solution"
    ]
   },
@@ -23,6 +17,12 @@
    "metadata": {},
    "outputs": [],
    "source": [
+    "import os\n",
+    "import sys\n",
+    "\n",
+    "sys.path.append(os.path.join(os.getcwd(), \"..\"))\n",
+    "from linked_list_cycle.tests import TestLinkedListCycle\n",
+    "\n",
     "# Example test case\n",
     "values = [3, 2, 0, -4]\n",
     "pos = 1\n",

leetcode/linked_list_cycle/solution.py

@@ -5,13 +5,14 @@ class Solution:
     # Time: O(n)
     # Space: O(1)
     def has_cycle(self, head: ListNode[int] | None) -> bool:
-        slow = head
         fast = head
+        slow = head
 
-        while fast is not None and fast.next is not None:
-            slow = slow.next  # type: ignore[union-attr]
+        while fast and fast.next:
+            assert slow is not None
             fast = fast.next.next
-            if slow is fast:
-                return True  # Cycle detected
+            slow = slow.next
+            if fast is slow:
+                return True
 
-        return False  # No cycle
+        return False

leetcode/linked_list_cycle/tests.py

@@ -10,7 +10,7 @@ class TestLinkedListCycle:
     def setup_method(self):
         self.solution = Solution()
 
-    def create_cycle_list(self, values: list[int], pos: int) -> ListNode[int] | None:
+    def create_cycle_list(self, values: list[int], pos: int):
         if not values:
             return None
 
@@ -32,30 +32,24 @@ def create_cycle_list(self, values: list[int], pos: int) -> ListNode[int] | None
     @pytest.mark.parametrize(
         "values, pos, expected",
         [
-            # Basic cases
-            ([3, 2, 0, -4], 1, True),  # Cycle to middle
-            ([1, 2], 0, True),  # Cycle to head
-            ([1], -1, False),  # Single node, no cycle
-            ([], -1, False),  # Empty list
-            ([1, 2, 3], -1, False),  # Linear list
-            # Various cycle positions
-            ([1, 2, 3, 4, 5], 0, True),  # Cycle to head
-            ([1, 2, 3, 4, 5], 2, True),  # Cycle to middle
-            ([1, 2, 3, 4, 5], 4, True),  # Cycle to tail
-            # Self-loop cases
-            ([1], 0, True),  # Single node self-loop
-            ([1, 2], 1, True),  # Last node self-loop
-            # Longer lists
-            ([1, 2, 3, 4, 5, 6, 7, 8], 3, True),  # Long list with cycle
-            ([1, 2, 3, 4, 5, 6, 7, 8], -1, False),  # Long list without cycle
-            # Two-node cases
-            ([1, 2], -1, False),  # Two nodes, no cycle
-            ([5, 10], 0, True),  # Two nodes, cycle to first
-            ([5, 10], 1, True),  # Two nodes, self-loop on second
-            # Edge case values
-            ([0], -1, False),  # Zero value
-            ([-1, -2, -3], 1, True),  # Negative values
-            ([100, 200, 300], 0, True),  # Large values
+            ([3, 2, 0, -4], 1, True),
+            ([1, 2], 0, True),
+            ([1], -1, False),
+            ([], -1, False),
+            ([1, 2, 3], -1, False),
+            ([1, 2, 3, 4, 5], 0, True),
+            ([1, 2, 3, 4, 5], 2, True),
+            ([1, 2, 3, 4, 5], 4, True),
+            ([1], 0, True),
+            ([1, 2], 1, True),
+            ([1, 2, 3, 4, 5, 6, 7, 8], 3, True),
+            ([1, 2, 3, 4, 5, 6, 7, 8], -1, False),
+            ([1, 2], -1, False),
+            ([5, 10], 0, True),
+            ([5, 10], 1, True),
+            ([0], -1, False),
+            ([-1, -2, -3], 1, True),
+            ([100, 200, 300], 0, True),
         ],
     )
     @logged_test