feat(content): function signatures + test cases

backend/data/questions/allocate-mailboxes.yaml

@@ -11,6 +11,26 @@ categories:
 patterns:
   - dynamic-programming
 
+function_signature: "def min_distance(houses: list[int], k: int) -> int:"
+
+test_cases:
+  visible:
+    - input: { houses: [1, 4, 8, 10, 20], k: 3 }
+      expected: 5
+    - input: { houses: [2, 3, 5, 12, 18], k: 2 }
+      expected: 9
+  hidden:
+    - input: { houses: [1, 2, 3], k: 1 }
+      expected: 2
+    - input: { houses: [1, 2, 3], k: 3 }
+      expected: 0
+    - input: { houses: [7, 4, 6, 1], k: 1 }
+      expected: 8
+    - input: { houses: [3, 6, 14, 10], k: 4 }
+      expected: 0
+    - input: { houses: [1, 10, 100], k: 2 }
+      expected: 9
+
 description: |
   Given the array `houses` where `houses[i]` is the location of the i<sup>th</sup> house along a street and an integer `k`, allocate `k` mailboxes in the street.