Dataset Viewer
Auto-converted to Parquet Duplicate
problem_id
int64
0
49
trajectory_id
int64
0
31
question
stringclasses
50 values
messages
stringlengths
9.77k
709k
num_turns
int64
2
20
final_reward
float64
0
1
terminated
bool
2 classes
truncated
bool
2 classes
interactions
stringlengths
2
2.05M
tests
stringclasses
50 values
is_successful
bool
2 classes
interaction_timeout_count
int64
0
19
eval_timeout_count
int64
0
15
rendered
stringlengths
8.25k
2.12M
0
0
You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps. In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two sub...
[{"role": "system", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT CONTEXT:\n- This is a multi-turn conversation.\n- The Python interpreter is a ...
2
1
true
false
[{"code": "def can_split_array_test(nums, m):\n n = len(nums)\n \n # Base cases\n if n <= 2:\n return True\n \n # Check if there exists any adjacent pair with sum >= m\n for i in range(n - 1):\n if nums[i] + nums[i + 1] >= m:\n return True\n \n return False\n\n# Test ...
{"inputs": ["[2, 2, 1]\n4", "[2, 1, 3]\n5", "[2, 3, 3, 2, 3]\n6", "[2]\n114", "[17, 17]\n3", "[25, 81]\n48", "[20, 33, 1]\n4", "[33, 89, 9]\n200", "[14, 5, 7, 20]\n5", "[47, 27, 74]\n200", "[68, 46, 28]\n200", "[2, 4, 26, 20, 49, 13, 47, 22, 3, 3, 28, 18, 11, 20, 39, 5, 8, 7, 10, 9, 32, 4, 35]\n73", "[1, 1, 1, 1, 1, 1,...
true
0
0
================================================================================ Question: You are given an array nums of length n and an int... Reward: 1.00 | Turns: 2 | Terminated: True | Truncated: False ================================================================================ [SYSTEM] You are a helpful codi...
0
1
You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps. In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two sub...
[{"role": "system", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT CONTEXT:\n- This is a multi-turn conversation.\n- The Python interpreter is a ...
2
1
true
false
[{"code": "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n n = len(nums)\n \n # If array length is 1 or 2, we can always split into n arrays\n if n <= 2:\n return True\n \n # Check if there exists any adjacent pair with sum >= m\n ...
{"inputs": ["[2, 2, 1]\n4", "[2, 1, 3]\n5", "[2, 3, 3, 2, 3]\n6", "[2]\n114", "[17, 17]\n3", "[25, 81]\n48", "[20, 33, 1]\n4", "[33, 89, 9]\n200", "[14, 5, 7, 20]\n5", "[47, 27, 74]\n200", "[68, 46, 28]\n200", "[2, 4, 26, 20, 49, 13, 47, 22, 3, 3, 28, 18, 11, 20, 39, 5, 8, 7, 10, 9, 32, 4, 35]\n73", "[1, 1, 1, 1, 1, 1,...
true
0
0
================================================================================ Question: You are given an array nums of length n and an int... Reward: 1.00 | Turns: 2 | Terminated: True | Truncated: False ================================================================================ [SYSTEM] You are a helpful codi...
0
2
You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps. In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two sub...
[{"role": "system", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT CONTEXT:\n- This is a multi-turn conversation.\n- The Python interpreter is a ...
2
0.933333
true
false
[{"code": "class Solution:\n def canSplitArray(self, nums, m):\n n = len(nums)\n \n # Base cases\n if n <= 2:\n return True\n \n # Check if we can split the array\n for i in range(1, n):\n left_length = i\n right_length = n - i\n ...
{"inputs": ["[2, 2, 1]\n4", "[2, 1, 3]\n5", "[2, 3, 3, 2, 3]\n6", "[2]\n114", "[17, 17]\n3", "[25, 81]\n48", "[20, 33, 1]\n4", "[33, 89, 9]\n200", "[14, 5, 7, 20]\n5", "[47, 27, 74]\n200", "[68, 46, 28]\n200", "[2, 4, 26, 20, 49, 13, 47, 22, 3, 3, 28, 18, 11, 20, 39, 5, 8, 7, 10, 9, 32, 4, 35]\n73", "[1, 1, 1, 1, 1, 1,...
true
0
0
================================================================================ Question: You are given an array nums of length n and an int... Reward: 0.93 | Turns: 2 | Terminated: True | Truncated: False ================================================================================ [SYSTEM] You are a helpful codi...
0
3
You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps. In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two sub...
[{"role": "system", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT CONTEXT:\n- This is a multi-turn conversation.\n- The Python interpreter is a ...
2
1
true
false
[{"code": "# Test hypothesis: if any adjacent pair has sum >= m, then we can split the array completely\n# This is because we can split around that pair and work outward\n\ndef canSplitArray(nums, m):\n n = len(nums)\n if n <= 2:\n return True # Can always split arrays of length 1 or 2\n \n # Check ...
{"inputs": ["[2, 2, 1]\n4", "[2, 1, 3]\n5", "[2, 3, 3, 2, 3]\n6", "[2]\n114", "[17, 17]\n3", "[25, 81]\n48", "[20, 33, 1]\n4", "[33, 89, 9]\n200", "[14, 5, 7, 20]\n5", "[47, 27, 74]\n200", "[68, 46, 28]\n200", "[2, 4, 26, 20, 49, 13, 47, 22, 3, 3, 28, 18, 11, 20, 39, 5, 8, 7, 10, 9, 32, 4, 35]\n73", "[1, 1, 1, 1, 1, 1,...
true
0
0
================================================================================ Question: You are given an array nums of length n and an int... Reward: 1.00 | Turns: 2 | Terminated: True | Truncated: False ================================================================================ [SYSTEM] You are a helpful codi...
0
4
You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps. In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two sub...
[{"role": "system", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT CONTEXT:\n- This is a multi-turn conversation.\n- The Python interpreter is a ...
2
1
true
false
[{"code": "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n n = len(nums)\n \n # If array length is 1 or 2, we can always split\n if n <= 2:\n return True\n \n # Check if any adjacent pair has sum >= m\n for i in range(n - 1):\n...
{"inputs": ["[2, 2, 1]\n4", "[2, 1, 3]\n5", "[2, 3, 3, 2, 3]\n6", "[2]\n114", "[17, 17]\n3", "[25, 81]\n48", "[20, 33, 1]\n4", "[33, 89, 9]\n200", "[14, 5, 7, 20]\n5", "[47, 27, 74]\n200", "[68, 46, 28]\n200", "[2, 4, 26, 20, 49, 13, 47, 22, 3, 3, 28, 18, 11, 20, 39, 5, 8, 7, 10, 9, 32, 4, 35]\n73", "[1, 1, 1, 1, 1, 1,...
true
0
0
================================================================================ Question: You are given an array nums of length n and an int... Reward: 1.00 | Turns: 2 | Terminated: True | Truncated: False ================================================================================ [SYSTEM] You are a helpful codi...
0
5
"You are given an array nums of length n and an integer m. You need to determine if it is possible t(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\n\\nYou have access to (...TRUNCATED)
2
1
true
false
"[{\"code\": \"def canSplitArray(nums, m):\\n n = len(nums)\\n \\n # If array has 1 or 2 el(...TRUNCATED)
"{\"inputs\": [\"[2, 2, 1]\\n4\", \"[2, 1, 3]\\n5\", \"[2, 3, 3, 2, 3]\\n6\", \"[2]\\n114\", \"[17, (...TRUNCATED)
true
0
0
"================================================================================\nQuestion: You are(...TRUNCATED)
0
6
"You are given an array nums of length n and an integer m. You need to determine if it is possible t(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\n\\nYou have access to (...TRUNCATED)
2
1
true
false
"[{\"code\": \"# Test cases\\ndef canSplitArray(nums, m):\\n n = len(nums)\\n # If array has 1(...TRUNCATED)
"{\"inputs\": [\"[2, 2, 1]\\n4\", \"[2, 1, 3]\\n5\", \"[2, 3, 3, 2, 3]\\n6\", \"[2]\\n114\", \"[17, (...TRUNCATED)
true
0
0
"================================================================================\nQuestion: You are(...TRUNCATED)
0
7
"You are given an array nums of length n and an integer m. You need to determine if it is possible t(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\n\\nYou have access to (...TRUNCATED)
2
0.866667
true
false
"[{\"code\": \"from typing import List\\n\\nclass Solution:\\n def canSplitArray(self, nums: List(...TRUNCATED)
"{\"inputs\": [\"[2, 2, 1]\\n4\", \"[2, 1, 3]\\n5\", \"[2, 3, 3, 2, 3]\\n6\", \"[2]\\n114\", \"[17, (...TRUNCATED)
true
0
0
"================================================================================\nQuestion: You are(...TRUNCATED)
0
8
"You are given an array nums of length n and an integer m. You need to determine if it is possible t(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\n\\nYou have access to (...TRUNCATED)
2
1
true
false
"[{\"code\": \"from typing import List\\n\\nclass Solution:\\n def canSplitArray(self, nums: List(...TRUNCATED)
"{\"inputs\": [\"[2, 2, 1]\\n4\", \"[2, 1, 3]\\n5\", \"[2, 3, 3, 2, 3]\\n6\", \"[2]\\n114\", \"[17, (...TRUNCATED)
true
0
0
"================================================================================\nQuestion: You are(...TRUNCATED)
0
9
"You are given an array nums of length n and an integer m. You need to determine if it is possible t(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\n\\nYou have access to (...TRUNCATED)
2
0.933333
true
false
"[{\"code\": \"class Solution:\\n def canSplitArray(self, nums: List[int], m: int) -> bool:\\n (...TRUNCATED)
"{\"inputs\": [\"[2, 2, 1]\\n4\", \"[2, 1, 3]\\n5\", \"[2, 3, 3, 2, 3]\\n6\", \"[2]\\n114\", \"[17, (...TRUNCATED)
true
0
0
"================================================================================\nQuestion: You are(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
7