feat(content): more test cases

backend/data/questions/target-sum.yaml

@@ -10,6 +10,32 @@ patterns:
   - dynamic-programming
   - backtracking
 
+function_signature: "def find_target_sum_ways(nums: list[int], target: int) -> int:"
+
+test_cases:
+  visible:
+    - input: { nums: [1, 1, 1, 1, 1], target: 3 }
+      expected: 5
+    - input: { nums: [1], target: 1 }
+      expected: 1
+    - input: { nums: [1, 2, 1], target: 0 }
+      expected: 2
+  hidden:
+    - input: { nums: [1], target: 2 }
+      expected: 0
+    - input: { nums: [0, 0, 0, 0, 0], target: 0 }
+      expected: 32
+    - input: { nums: [2, 3, 5], target: 0 }
+      expected: 0
+    - input: { nums: [1, 0], target: 1 }
+      expected: 2
+    - input: { nums: [1, 2, 3, 4, 5], target: 3 }
+      expected: 3
+    - input: { nums: [100], target: -200 }
+      expected: 0
+    - input: { nums: [7, 9, 3, 8, 0, 2, 4, 8, 3, 9], target: 0 }
+      expected: 0
+
 description: |
   You are given an integer array `nums` and an integer `target`.