feat(content): hidden test cases

backend/data/questions/minimum-path-sum.yaml

@@ -10,6 +10,26 @@ patterns:
   - dynamic-programming
   - matrix-traversal
 
+function_signature: "def min_path_sum(grid: list[list[int]]) -> int:"
+
+test_cases:
+  visible:
+    - input: { grid: [[1, 3, 1], [1, 5, 1], [4, 2, 1]] }
+      expected: 7
+    - input: { grid: [[1, 2, 3], [4, 5, 6]] }
+      expected: 12
+  hidden:
+    - input: { grid: [[5]] }
+      expected: 5
+    - input: { grid: [[1, 2, 3, 4, 5]] }
+      expected: 15
+    - input: { grid: [[1], [2], [3], [4], [5]] }
+      expected: 15
+    - input: { grid: [[0, 0], [0, 0]] }
+      expected: 0
+    - input: { grid: [[1, 100], [1, 1]] }
+      expected: 3
+
 description: |
   Given a `m x n` `grid` filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.