feat(content): more test cases

backend/data/questions/unique-paths-ii.yaml

@@ -10,6 +10,30 @@ patterns:
   - dynamic-programming
   - matrix-traversal
 
+function_signature: "def unique_paths_with_obstacles(obstacle_grid: list[list[int]]) -> int:"
+
+test_cases:
+  visible:
+    - input: { obstacle_grid: [[0, 0, 0], [0, 1, 0], [0, 0, 0]] }
+      expected: 2
+    - input: { obstacle_grid: [[0, 1], [0, 0]] }
+      expected: 1
+    - input: { obstacle_grid: [[0, 0], [0, 0]] }
+      expected: 2
+  hidden:
+    - input: { obstacle_grid: [[1]] }
+      expected: 0
+    - input: { obstacle_grid: [[0]] }
+      expected: 1
+    - input: { obstacle_grid: [[1, 0]] }
+      expected: 0
+    - input: { obstacle_grid: [[0, 0, 0, 0], [0, 0, 0, 0]] }
+      expected: 4
+    - input: { obstacle_grid: [[0, 1, 0, 0, 0], [1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]] }
+      expected: 0
+    - input: { obstacle_grid: [[0, 0, 0], [0, 0, 0], [0, 0, 1]] }
+      expected: 0
+
 description: |
   You are given an `m x n` integer array `grid`. There is a robot 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.