feat(content): hidden test cases

backend/data/questions/min-cost-to-connect-all-points.yaml

@@ -10,6 +10,26 @@ patterns:
   - heap
   - union-find
 
+function_signature: "def min_cost_connect_points(points: list[list[int]]) -> int:"
+
+test_cases:
+  visible:
+    - input: { points: [[0, 0], [2, 2], [3, 10], [5, 2], [7, 0]] }
+      expected: 20
+    - input: { points: [[3, 12], [-2, 5], [-4, 1]] }
+      expected: 18
+  hidden:
+    - input: { points: [[0, 0]] }
+      expected: 0
+    - input: { points: [[0, 0], [1, 1]] }
+      expected: 2
+    - input: { points: [[0, 0], [1, 0], [2, 0]] }
+      expected: 2
+    - input: { points: [[-1000000, -1000000], [1000000, 1000000]] }
+      expected: 4000000
+    - input: { points: [[0, 0], [0, 1], [1, 0], [1, 1]] }
+      expected: 3
+
 description: |
   You are given an array `points` representing integer coordinates of some points on a 2D-plane, where `points[i] = [x_i, y_i]`.