test: add more test cases

Author: wislertt

.templates/leetcode/json/two_sum.json

@@ -51,7 +51,7 @@
                 "name": "test_two_sum",
                 "signature": "(self, nums: list[int], target: int, expected: list[int])",
                 "parametrize": "nums, target, expected",
-                "test_cases": "[([2, 7, 11, 15], 9, [0, 1]), ([3, 2, 4], 6, [1, 2]), ([3, 3], 6, [0, 1]), ([2, 5, 5, 11], 10, [1, 2]), ([1, 2, 3, 4, 5], 8, [2, 4]), ([0, 4, 3, 0], 0, [0, 3]), ([-1, -2, -3, -4, -5], -8, [2, 4]), ([1, 3, 4, 2], 6, [2, 3])]",
+                "test_cases": "[([2, 7, 11, 15], 9, [0, 1]), ([3, 2, 4], 6, [1, 2]), ([3, 3], 6, [0, 1]), ([2, 5, 5, 11], 10, [1, 2]), ([1, 2, 3, 4, 5], 8, [2, 4]), ([0, 4, 3, 0], 0, [0, 3]), ([-1, -2, -3, -4, -5], -8, [2, 4]), ([1, 3, 4, 2], 6, [2, 3]), ([5, 75, 25], 100, [1, 2]), ([-3, 4, 3, 90], 0, [0, 2]), ([1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2], 6, [5, 11]), ([2, 1, 9, 4, 4, 56, 90, 3], 8, [3, 4]), ([89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99], 185, [3, 4]), ([-1000000000, 1000000000], 0, [0, 1]), ([0, 1], 1, [0, 1]), ([1, 2], 5, []), ([3, 5, 7], 1, []), ([10, 20, 30], 15, [])]",
                 "body": "        result = run_two_sum(Solution, nums, target)\n        assert_two_sum(result, expected)"
             }
         ]

leetcode/two_sum/playground.ipynb

@@ -2,7 +2,7 @@
  "cells": [
   {
    "cell_type": "code",
-   "execution_count": 1,
+   "execution_count": null,
    "id": "imports",
    "metadata": {},
    "outputs": [],
@@ -13,7 +13,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 2,
+   "execution_count": null,
    "id": "setup",
    "metadata": {},
    "outputs": [],
@@ -26,43 +26,21 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 3,
+   "execution_count": null,
    "id": "run",
    "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[0, 1]"
-      ]
-     },
-     "execution_count": 3,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
+   "outputs": [],
    "source": [
     "result = run_two_sum(Solution, nums, target)\n",
     "result"
    ]
   },
   {
    "cell_type": "code",
-   "execution_count": 4,
+   "execution_count": null,
    "id": "assert",
    "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "True"
-      ]
-     },
-     "execution_count": 4,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
+   "outputs": [],
    "source": [
     "assert_two_sum(result, expected)"
    ]
@@ -82,8 +60,7 @@
    "file_extension": ".py",
    "mimetype": "text/x-python",
    "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
+   "nbconvert_exporter": "python3",
    "version": "3.13.7"
   }
  },

leetcode/two_sum/solution.py

@@ -1,12 +1,7 @@
 class Solution:
 
-    # Time: O(n)
-    # Space: O(n)
+    # Time: O(?)
+    # Space: O(?)
     def two_sum(self, nums: list[int], target: int) -> list[int]:
-        seen: dict[int, int] = {}
-        for i, num in enumerate(nums):
-            complement = target - num
-            if complement in seen:
-                return [seen[complement], i]
-            seen[num] = i
+        # TODO: Implement two_sum
         return []

leetcode/two_sum/test_solution.py

@@ -22,6 +22,16 @@ def setup_method(self):
             ([0, 4, 3, 0], 0, [0, 3]),
             ([-1, -2, -3, -4, -5], -8, [2, 4]),
             ([1, 3, 4, 2], 6, [2, 3]),
+            ([5, 75, 25], 100, [1, 2]),
+            ([-3, 4, 3, 90], 0, [0, 2]),
+            ([1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2], 6, [5, 11]),
+            ([2, 1, 9, 4, 4, 56, 90, 3], 8, [3, 4]),
+            ([89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99], 185, [3, 4]),
+            ([-1000000000, 1000000000], 0, [0, 1]),
+            ([0, 1], 1, [0, 1]),
+            ([1, 2], 5, []),
+            ([3, 5, 7], 1, []),
+            ([10, 20, 30], 15, []),
         ],
     )
     def test_two_sum(self, nums: list[int], target: int, expected: list[int]):