feat(content): more test cases

backend/data/questions/integer-break.yaml

@@ -10,6 +10,32 @@ patterns:
   - dynamic-programming
   - greedy
 
+function_signature: "def integer_break(n: int) -> int:"
+
+test_cases:
+  visible:
+    - input: { n: 2 }
+      expected: 1
+    - input: { n: 10 }
+      expected: 36
+  hidden:
+    - input: { n: 3 }
+      expected: 2
+    - input: { n: 4 }
+      expected: 4
+    - input: { n: 5 }
+      expected: 6
+    - input: { n: 6 }
+      expected: 9
+    - input: { n: 7 }
+      expected: 12
+    - input: { n: 8 }
+      expected: 18
+    - input: { n: 11 }
+      expected: 54
+    - input: { n: 58 }
+      expected: 1549681956
+
 description: |
   Given an integer `n`, break it into the sum of `k` **positive integers**, where `k >= 2`, and maximize the product of those integers.