problem_id int64 0 99 | trajectory_id int64 0 15 | question stringclasses 100
values | messages stringlengths 10.7k 229k | num_turns int64 2 20 | final_reward float64 0 1 | terminated bool 2
classes | truncated bool 2
classes | interactions stringlengths 150 357k | tests stringclasses 100
values | is_successful bool 2
classes | interaction_timeout_count int64 0 12 | eval_timeout_count int64 0 11 | turn_wise_finish_reason listlengths 2 20 | turn_wise_truncated_by_token_limit listlengths 2 20 | num_assistant_messages_truncated int64 0 6 | num_assistant_messages_not_truncated int64 1 20 | rendered stringlengths 9.36k 486k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | You are given a 0-indexed string s and an integer k.
You are to perform the following partitioning operations until s is empty:
Choose the longest prefix of s containing at most k distinct characters.
Delete the prefix from s and increase the number of partitions by one. The remaining characters (if any) in s maintain... | [{"role": "system", "content": "[Harmony format] Reasoning effort: medium"}, {"role": "developer", "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... | 2 | 0.8 | true | false | [{"code": "def partitions(s, k):\n n = len(s)\n i = 0\n cnt = 0\n while i < n:\n cnt += 1\n distinct = {}\n j = i\n while j < n:\n c = s[j]\n distinct[c] = distinct.get(c, 0) + 1\n if len(distinct) > k:\n break\n j += 1\n... | {"inputs": ["\"accca\"\n2", "\"aabaab\"\n3", "\"xxyz\"\n1", "\"abcde\"\n5", "\"aaaaaa\"\n2", "\"wjlcta\"\n5", "\"eictzzwx\"\n1", "\"fvcalcqn\"\n3", "\"zcjvkodq\"\n5", "\"eifhjtmuj\"\n7", "\"cxdzvmcbcv\"\n3", "\"rnqrabcxrh\"\n1", "\"xpfcubkanivkyjzrknwyapagrimbfidmckcyeupxioksdbcmucufydzepdedezeygezuvfmzyiodsenwqdldxjmw... | true | 0 | 0 | [
"stop",
"stop"
] | [
false,
false
] | 0 | 2 | ================================================================================
Question: You are given a 0-indexed string s and an integer ...
Reward: 0.80 | Turns: 2 | Terminated: True | Truncated: False
================================================================================
[SYSTEM]
[Harmony format] Reaso... |
0 | 1 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0.933333 | true | false | "[{\"code\": \"def test_solution():\\n class Solution:\\n def maxPartitionsAfterOperations(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | [
"stop",
"stop",
"stop"
] | [
false,
false,
false
] | 0 | 3 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 2 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 4 | 0 | true | true | "[{\"code\": \"# Hypothesis: The algorithm that considers only positions where distinct_before == k (...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | [
"length",
"stop",
"stop",
"length"
] | [
true,
false,
false,
true
] | 2 | 2 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 3 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 7 | 0 | true | true | "[{\"code\": \"# Hypothesis: The maximum number of partitions after at most one change can be achiev(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | [
"length",
"stop",
"stop",
"stop",
"length",
"stop",
"length"
] | [
true,
false,
false,
false,
true,
false,
true
] | 3 | 4 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 4 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 13 | 0.8 | true | false | "[{\"code\": \"import random, time, string, sys, math\\n\\ndef partitions(s, k):\\n cnt = 0\\n (...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 4 | 0 | [
"stop",
"stop",
"length",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"length",
"stop",
"stop"
] | [
false,
false,
true,
false,
false,
false,
false,
false,
false,
false,
true,
false,
false
] | 2 | 11 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 5 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 13 | 0 | true | true | "[{\"code\": \"def partitions(s, k):\\n n = len(s)\\n i = 0\\n cnt = 0\\n while i < n:\\(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | [
"length",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop"
] | [
true,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | 1 | 12 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 6 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 15 | 0 | true | true | "[{\"code\": \"import random, string, itertools\\nfrom collections import Counter\\n\\ndef partition(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | ["stop","stop","stop","stop","stop","stop","stop","length","stop","stop","stop","stop","length","sto(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
true,
false,
false,
false,
false,
true,
false,
true
] | 3 | 12 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 7 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 15 | 0 | true | true | "[{\"code\": \"def max_partitions_bruteforce(s, k):\\n import string, itertools\\n n=len(s)\\n(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | ["length","length","stop","stop","length","stop","stop","stop","stop","stop","stop","stop","stop","s(...TRUNCATED) | [
true,
true,
false,
false,
true,
false,
false,
false,
false,
false,
false,
false,
false,
false,
true
] | 4 | 11 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 8 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 18 | 0.6 | true | false | "[{\"code\": \"def max_partitions_original(s, k):\\n n = len(s)\\n cnt = 0\\n distinct = se(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | ["length","stop","stop","stop","stop","stop","length","stop","stop","stop","stop","stop","stop","sto(...TRUNCATED) | [true,false,false,false,false,false,true,false,false,false,false,false,false,false,false,false,false(...TRUNCATED) | 2 | 16 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 9 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 20 | 0.866667 | true | false | "[{\"code\": \"import random\\nimport itertools\\n\\ndef greedy_partitions(s, k):\\n n = len(s)\\(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | ["length","stop","stop","stop","stop","stop","stop","length","stop","stop","stop","stop","stop","sto(...TRUNCATED) | [true,false,false,false,false,false,false,true,false,false,false,false,false,false,false,false,false(...TRUNCATED) | 2 | 18 | "================================================================================\nQuestion: You are(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4