feat(content): more test cases

backend/data/questions/gas-station.yaml

@@ -8,6 +8,26 @@ categories:
 patterns:
   - greedy
 
+function_signature: "def can_complete_circuit(gas: list[int], cost: list[int]) -> int:"
+
+test_cases:
+  visible:
+    - input: { gas: [1, 2, 3, 4, 5], cost: [3, 4, 5, 1, 2] }
+      expected: 3
+    - input: { gas: [2, 3, 4], cost: [3, 4, 3] }
+      expected: -1
+  hidden:
+    - input: { gas: [5, 1, 2, 3, 4], cost: [4, 4, 1, 5, 1] }
+      expected: 4
+    - input: { gas: [3], cost: [3] }
+      expected: 0
+    - input: { gas: [1, 2], cost: [2, 1] }
+      expected: 1
+    - input: { gas: [5, 8, 2, 8], cost: [6, 5, 6, 6] }
+      expected: 3
+    - input: { gas: [3, 3, 4], cost: [3, 4, 4] }
+      expected: -1
+
 description: |
   There are `n` gas stations along a circular route, where the amount of gas at the i<sup>th</sup> station is `gas[i]`.