feat(content): more test cases

backend/data/questions/unique-paths.yaml

@@ -10,6 +10,24 @@ categories:
 patterns:
   - dynamic-programming
 
+function_signature: "def unique_paths(m: int, n: int) -> int:"
+
+test_cases:
+  visible:
+    - input: { m: 3, n: 7 }
+      expected: 28
+    - input: { m: 3, n: 2 }
+      expected: 3
+    - input: { m: 1, n: 1 }
+      expected: 1
+  hidden:
+    - input: { m: 7, n: 3 }
+      expected: 28
+    - input: { m: 3, n: 3 }
+      expected: 6
+    - input: { m: 10, n: 10 }
+      expected: 48620
+
 description: |
   There is a robot on an `m x n` grid. The robot is initially located at the **top-left corner** (i.e., `grid[0][0]`). The robot tries to move to the **bottom-right corner** (i.e., `grid[m - 1][n - 1]`). The robot can only move either down or right at any point in time.