fix: fix test-reproducibility

Author: wislertt

.amazonq/rules/test-case-enhancement.md

@@ -2,7 +2,7 @@
 
 ## Simple Enhancement Workflow
 
-When user requests test case enhancement:
+When user requests test case enhancement or **test reproducibility verification**:
 
 ### 1. Problem Resolution
 
@@ -69,10 +69,24 @@ make p-gen PROBLEM={problem_name} FORCE=1
 make p-lint PROBLEM={problem_name}
 ```
 
+## Test Reproducibility Verification
+
+Use this same workflow when CI tests fail due to reproducibility issues:
+
+**Process Name**: Test Reproducibility Verification
+
+**When to Use**:
+
+- CI test failures in reproducibility checks
+- Inconsistent test results between environments
+- Missing edge cases causing coverage gaps
+- Need to ensure 100% code coverage
+
 ## Success Criteria
 
 - All tests pass with enhanced test cases
 - Minimum 12 comprehensive test cases per problem
 - Original solution code preserved
 - **Enhanced test cases in final test_solution.py**
 - JSON template updated for future regeneration
+- **100% code coverage including edge cases**

.templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json

@@ -50,7 +50,7 @@
                 "name": "test_build_tree",
                 "signature": "(self, preorder: list[int], inorder: list[int], expected_list: list[int | None])",
                 "parametrize": "preorder, inorder, expected_list",
-                "test_cases": "[([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]), ([-1], [-1], [-1]), ([1, 2], [2, 1], [1, 2]), ([1, 2], [1, 2], [1, None, 2]), ([1, 2, 3], [2, 1, 3], [1, 2, 3]), ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]), ([1, 2, 4, 5, 3, 6], [4, 2, 5, 1, 6, 3], [1, 2, 3, 4, 5, 6]), ([1], [1], [1]), ([1, 2, 3, 4], [1, 2, 3, 4], [1, None, 2, None, 3, None, 4]), ([4, 3, 2, 1], [1, 2, 3, 4], [4, 3, None, 2, None, 1]), ([5, 4, 11, 7, 2, 8, 13, 4, 1], [7, 11, 2, 4, 5, 13, 8, 4, 1], [5, 4, 8, 11, None, 13, 4, 7, 2, None, None, None, 1]), ([10, 5, 1, 7, 40, 50], [1, 5, 7, 10, 40, 50], [10, 5, 40, 1, 7, None, 50])]",
+                "test_cases": "[([], [], []), ([1], [1], [1]), ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]), ([-1], [-1], [-1]), ([1, 2], [2, 1], [1, 2]), ([1, 2], [1, 2], [1, None, 2]), ([1, 2, 3], [2, 1, 3], [1, 2, 3]), ([1, 2, 4, 5, 3, 6], [4, 2, 5, 1, 6, 3], [1, 2, 3, 4, 5, 6]), ([1, 2, 3, 4], [1, 2, 3, 4], [1, None, 2, None, 3, None, 4]), ([4, 3, 2, 1], [1, 2, 3, 4], [4, 3, None, 2, None, 1]), ([10, 5, 1, 7, 40, 50], [1, 5, 7, 10, 40, 50], [10, 5, 40, 1, 7, None, 50]), ([1, 3, 2], [1, 2, 3], [1, None, 3, 2]), ([2, 1, 3], [1, 2, 3], [2, 1, 3]), ([5, 3, 2, 1, 4, 6, 7], [1, 2, 3, 4, 5, 6, 7], [5, 3, 6, 2, 4, None, 7, 1]), ([7, 3, 2, 1, 5, 4, 6, 10, 9, 11], [1, 2, 3, 4, 5, 6, 7, 9, 10, 11], [7, 3, 10, 2, 5, 9, 11, 1, None, 4, 6]), ([-3000, -2999, -2998], [-2998, -2999, -3000], [-3000, -2999, None, -2998])]",
                 "body": "        result = run_build_tree(Solution, preorder, inorder)\n        assert_build_tree(result, expected_list)"
             }
         ]

leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py

@@ -14,17 +14,26 @@ def setup_method(self):
     @pytest.mark.parametrize(
         "preorder, inorder, expected_list",
         [
+            ([], [], []),
+            ([1], [1], [1]),
             ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]),
             ([-1], [-1], [-1]),
             ([1, 2], [2, 1], [1, 2]),
             ([1, 2], [1, 2], [1, None, 2]),
             ([1, 2, 3], [2, 1, 3], [1, 2, 3]),
-            ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]),
             ([1, 2, 4, 5, 3, 6], [4, 2, 5, 1, 6, 3], [1, 2, 3, 4, 5, 6]),
-            ([1], [1], [1]),
             ([1, 2, 3, 4], [1, 2, 3, 4], [1, None, 2, None, 3, None, 4]),
             ([4, 3, 2, 1], [1, 2, 3, 4], [4, 3, None, 2, None, 1]),
             ([10, 5, 1, 7, 40, 50], [1, 5, 7, 10, 40, 50], [10, 5, 40, 1, 7, None, 50]),
+            ([1, 3, 2], [1, 2, 3], [1, None, 3, 2]),
+            ([2, 1, 3], [1, 2, 3], [2, 1, 3]),
+            ([5, 3, 2, 1, 4, 6, 7], [1, 2, 3, 4, 5, 6, 7], [5, 3, 6, 2, 4, None, 7, 1]),
+            (
+                [7, 3, 2, 1, 5, 4, 6, 10, 9, 11],
+                [1, 2, 3, 4, 5, 6, 7, 9, 10, 11],
+                [7, 3, 10, 2, 5, 9, 11, 1, None, 4, 6],
+            ),
+            ([-3000, -2999, -2998], [-2998, -2999, -3000], [-3000, -2999, None, -2998]),
         ],
     )
     def test_build_tree(self, preorder: list[int], inorder: list[int], expected_list: list[int | None]):