feat(content): hidden test cases

backend/data/questions/maximum-length-of-pair-chain.yaml

@@ -11,6 +11,26 @@ patterns:
   - greedy
   - intervals
 
+function_signature: "def find_longest_chain(pairs: list[list[int]]) -> int:"
+
+test_cases:
+  visible:
+    - input: { pairs: [[1, 2], [2, 3], [3, 4]] }
+      expected: 2
+    - input: { pairs: [[1, 2], [7, 8], [4, 5]] }
+      expected: 3
+  hidden:
+    - input: { pairs: [[1, 2]] }
+      expected: 1
+    - input: { pairs: [[1, 10], [2, 3], [4, 5]] }
+      expected: 2
+    - input: { pairs: [[-10, -5], [-3, 0], [1, 5]] }
+      expected: 3
+    - input: { pairs: [[1, 5], [2, 3], [4, 6]] }
+      expected: 2
+    - input: { pairs: [[1, 2], [3, 4], [5, 6], [7, 8]] }
+      expected: 4
+
 description: |
   You are given an array of `n` pairs `pairs` where `pairs[i] = [left_i, right_i]` and `left_i < right_i`.