1 files changed, 33 insertions, 0 deletions
diff --git a/benchmark/agbenchmark/challenges/verticals/code/1_three_sum/data.json b/benchmark/agbenchmark/challenges/verticals/code/1_three_sum/data.json
new file mode 100644
index 000000000..f89c90c61
--- /dev/null
+++ b/benchmark/agbenchmark/challenges/verticals/code/1_three_sum/data.json
@@ -0,0 +1,33 @@
+{
+    "category": [
+        "coding",
+        "general"
+    ],
+    "cutoff": 60,
+    "dependencies": [
+        "TestWriteFile"
+    ],
+    "eval_id": "a1ff38a4-1032-4bf2-960a-3b927f9936f4",
+    "ground": {
+        "answer": "The three_sum function coded properly.",
+        "eval": {
+            "type": "python"
+        },
+        "files": [
+            "test.py"
+        ],
+        "should_contain": [
+            "[0, 1, 2]",
+            "[0, 2, 5]",
+            "[0, 2, 3]"
+        ],
+        "should_not_contain": []
+    },
+    "info": {
+        "description": "Tests if the agent can create the three_sum function.",
+        "difficulty": "basic",
+        "side_effects": []
+    },
+    "name": "ThreeSum",
+    "task": "Create a three_sum function in a file called sample_code.py. Given an array of integers, return indices of the three numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11, 15], target = 20, Because nums[0] + nums[1] + nums[2] = 2 + 7 + 11 = 20, return [0, 1, 2]."
+}