feat(content): hidden test cases

backend/data/questions/stone-game-ii.yaml

@@ -10,6 +10,26 @@ patterns:
   - dynamic-programming
   - prefix-sum
 
+function_signature: "def stone_game_ii(piles: list[int]) -> int:"
+
+test_cases:
+  visible:
+    - input: { piles: [2, 7, 9, 4, 4] }
+      expected: 10
+    - input: { piles: [1, 2, 3, 4, 5, 100] }
+      expected: 104
+  hidden:
+    - input: { piles: [1] }
+      expected: 1
+    - input: { piles: [1, 2] }
+      expected: 3
+    - input: { piles: [1, 2, 3] }
+      expected: 6
+    - input: { piles: [3, 9, 1, 2] }
+      expected: 12
+    - input: { piles: [8, 9, 5, 4, 5, 4, 1, 1, 9, 3, 1, 10] }
+      expected: 36
+
 description: |
   Alice and Bob continue their games with piles of stones. There are a number of piles **arranged in a row**, and each pile has a positive integer number of stones `piles[i]`. The objective of the game is to end with the most stones.