ci: fix reproducibility

Author: wislertt

.templates/leetcode/json/min_stack.json

@@ -16,11 +16,11 @@
     },
     "readme_constraints": "- `-2^31 <= val <= 2^31 - 1`\n- Methods `pop`, `top` and `getMin` operations will always be called on **non-empty** stacks.\n- At most `3 * 10^4` calls will be made to `push`, `pop`, `top`, and `getMin`.",
     "readme_additional": "",
-    "helpers_imports": "",
+    "helpers_imports": "from typing import Any",
     "helpers_content": "",
     "helpers_run_name": "min_stack_operations",
     "helpers_run_signature": "(solution_class: type, operations: list[str], inputs: list[list[int]])",
-    "helpers_run_body": "    stack: solution_class | None = None\n    results: list[int | None] = []\n    for i, op in enumerate(operations):\n        if op == 'MinStack':\n            stack = solution_class()\n            results.append(None)\n        elif op == 'push' and stack is not None:\n            stack.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and stack is not None:\n            stack.pop()\n            results.append(None)\n        elif op == 'top' and stack is not None:\n            results.append(stack.top())\n        elif op == 'getMin' and stack is not None:\n            results.append(stack.get_min())\n    return results",
+    "helpers_run_body": "    stack: Any = None\n    results: list[int | None] = []\n    for i, op in enumerate(operations):\n        if op == 'MinStack':\n            stack = solution_class()\n            results.append(None)\n        elif op == 'push' and stack is not None:\n            stack.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and stack is not None:\n            stack.pop()\n            results.append(None)\n        elif op == 'top' and stack is not None:\n            results.append(stack.top())\n        elif op == 'getMin' and stack is not None:\n            results.append(stack.get_min())\n    return results",
     "helpers_assert_name": "min_stack_operations",
     "helpers_assert_signature": "(result: list[int | None], expected: list[int | None]) -> bool",
     "helpers_assert_body": "    assert result == expected\n    return True",

.templates/leetcode/json/time_based_key_value_store.json

@@ -20,7 +20,7 @@
     "helpers_content": "",
     "helpers_run_name": "time_map_operations",
     "helpers_run_signature": "(solution_class: type, operations: list[str], inputs: list[list])",
-    "helpers_run_body": "    time_map = None\n    results = []\n    for i, op in enumerate(operations):\n        if op == 'TimeMap':\n            time_map = solution_class()\n            results.append(None)\n        elif op == 'set' and time_map is not None:\n            time_map.set(*inputs[i])\n            results.append(None)\n        elif op == 'get' and time_map is not None:\n            results.append(time_map.get(*inputs[i]))\n    return results, time_map",
+    "helpers_run_body": "    time_map = None\n    results: list[str | None] = []\n    for i, op in enumerate(operations):\n        if op == 'TimeMap':\n            time_map = solution_class()\n            results.append(None)\n        elif op == 'set' and time_map is not None:\n            time_map.set(*inputs[i])\n            results.append(None)\n        elif op == 'get' and time_map is not None:\n            results.append(time_map.get(*inputs[i]))\n    return results, time_map",
     "helpers_assert_name": "time_map_operations",
     "helpers_assert_signature": "(result: list, expected: list) -> bool",
     "helpers_assert_body": "    results, _ = result\n    assert results == expected\n    return True",

Makefile

@@ -1,5 +1,5 @@
 PYTHON_VERSION = 3.13
-PROBLEM ?= binary_tree_right_side_view
+PROBLEM ?= min_stack
 FORCE ?= 0
 COMMA := ,
 

leetcode/min_stack/helpers.py

@@ -1,5 +1,8 @@
+from typing import Any
+
+
 def run_min_stack_operations(solution_class: type, operations: list[str], inputs: list[list[int]]):
-    stack = None
+    stack: Any = None
     results: list[int | None] = []
     for i, op in enumerate(operations):
         if op == "MinStack":