Dataset Viewer
Auto-converted to Parquet Duplicate
id
stringlengths
14
14
data_source
stringclasses
1 value
prompt
listlengths
1
1
ability
stringclasses
1 value
reward_model
dict
extra_info
dict
nemotron_12063
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou a...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"3\\r\\n3\\r\\n1 4 3\\r\\n5\\r\\n1 2 5 7 1\\r\\n4\\r\\n1 10 100 1000\\r\\n\"...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:1857/E" ], "cf_rating": 1500, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Power of Points", "num_tests": 1, "platform": "codeforces", "problem_id": "1857/E", "prompt_sha256": ...
nemotron_08356
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nWe ha...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"1 0 1\\n2 1 2\\n1 0 1\",\"1 8 6\\n2 9 7\\n0 7 7\",\"0 8 8\\n0 8 8\\n0 8 8\"...
{ "atcoder_difficulty": 477, "atcoder_difficulty_raw": 477, "canonical_ids": [ "atcoder:abc088_c" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Takahashi's Information", "num_tests": 104, "platform": "atcoder", "problem_id": "abc088_c", "prompt_sha...
nemotron_09795
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nChef ...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"3\\n3\\n5\\n7\",\"3\\n3\\n5\\n11\",\"3\\n2\\n5\\n11\",\"3\\n2\\n9\\n11\",\"...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codecontests:tricoin" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "tricoin", "num_tests": 101, "platform": "codechef", "problem_id": "tricoin", "prompt_sha256": "7ce...
leetcode_02277
lcb_coding
[ { "content": "You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\n### Question:\nYou are given a tree (i.e. a connected, undirected graph that has no cycles) rooted at node 0 ...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"[-1,0,0,1,1,2,2,3,3]\\n\\\"abacabadaba\\\"\",\"[-1,0,0,1,1,2]\\n\\\"acaabc\...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "leetcode:count-paths-that-can-form-a-palindrome-in-a-tree", "leetcode_number:2791" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": "Hard", "name": "count-paths-that-can-form-a-palindrome-...
nemotron_08129
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nDeter...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"7 7 1\",\"300000 300000 300000\",\"5 3 2\",\"7 0 1\",\"1 1 1\",\"6 1 6\",\"...
{ "atcoder_difficulty": 1889, "atcoder_difficulty_raw": 1889, "canonical_ids": [ "atcoder:arc091_c" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "LISDL", "num_tests": 103, "platform": "atcoder", "problem_id": "arc091_c", "prompt_sha256": "956ccfdf5...
nemotron_14032
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nTwo b...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"... ... ...\\r\\n... ... ...\\r\\n... ... ...\\r\\n\\r\\n... ... ...\\r\\n....
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:904/B", "codeforces:907/B" ], "cf_rating": 1400, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Tic-Tac-Toe", "num_tests": 20, "platform": "codeforces", "problem_id": "904/B", ...
nemotron_15550
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nIn th...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"5\\r\\n7500 South\\r\\n10000 East\\r\\n3500 North\\r\\n4444 West\\r\\n4000 ...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:750/B" ], "cf_rating": 1300, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "New Year and North Pole", "num_tests": 137, "platform": "codeforces", "problem_id": "750/B", "prompt_s...
nemotron_01262
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nDo yo...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"5 6\\r\\n1 2\\r\\n1 3\\r\\n2 3\\r\\n2 4\\r\\n3 4\\r\\n4 5\\r\\n\",\"7 4\\r\...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:574/B" ], "cf_rating": 1500, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Bear and Three Musketeers", "num_tests": 15, "platform": "codeforces", "problem_id": "574/B", "prompt_...
nemotron_06493
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nSnuke...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"1 2 3 4\",\"13 1 4 3000\",\"1 2 3 1\",\"13 1 4 540\",\"1 2 3 2\",\"17 1 4 5...
{ "atcoder_difficulty": 538, "atcoder_difficulty_raw": 538, "canonical_ids": [ "atcoder:diverta2019_b" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "RGB Boxes", "num_tests": 102, "platform": "atcoder", "problem_id": "diverta2019_b", "prompt_sha256"...
nemotron_11518
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nVasya...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"3 3\\r\\n1 1\\r\\n3 1\\r\\n2 2\\r\\n\",\"5 2\\r\\n1 5\\r\\n5 1\\r\\n\",\"10...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:701/B" ], "cf_rating": 1200, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Cells Not Under Attack", "num_tests": 11, "platform": "codeforces", "problem_id": "701/B", "prompt_sha...
nemotron_11480
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nSever...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"2 3 4\\r\\n\",\"2 2 2\\r\\n\",\"7 8 13\\r\\n\",\"14 7 75\\r\\n\",\"201 108 ...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:216/A" ], "cf_rating": 1200, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Tiling with Hexagons", "num_tests": 40, "platform": "codeforces", "problem_id": "216/A", "prompt_sha25...
nemotron_07669
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou a...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"5\\n1 4 3 5 2\",\"9\\n1 2 4 9 5 8 7 3 6\",\"2\\n1 2\",\"2\\n2 1\",\"5\\n1 4...
{ "atcoder_difficulty": 656, "atcoder_difficulty_raw": 656, "canonical_ids": [ "atcoder:arc082_b" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Derangement", "num_tests": 104, "platform": "atcoder", "problem_id": "arc082_b", "prompt_sha256": "ebda9...
nemotron_09796
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nLong ...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"5 1\\n\",\"7 2\\n\",\"20 4\\n\",\"5 0\\n\",\"6 4\\n\",\"15 5\\n\",\"10 0\\n...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:1040/B" ], "cf_rating": 1300, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Shashlik Cooking", "num_tests": 159, "platform": "codeforces", "problem_id": "1040/B", "prompt_sha256...
nemotron_08494
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou p...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"4\\n5 3 4\\n2 1 0\\n3 5 5\\n4 10 6\\n\",\"5\\n1 1 100000000\\n100000000 100...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:1217/A" ], "cf_rating": 1300, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Creating a Character", "num_tests": 102, "platform": "codeforces", "problem_id": "1217/A", "prompt_sh...
nemotron_03770
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nThe B...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"\"],\"outputs\":[\"\"],\"fn_name\":null},\"code_prelude\":\"\",\"adapter\":...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codecontests:p00754" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "p00754 The Balance of the World", "num_tests": 1, "platform": "aizu", "problem_id": "p00754", "prom...
nemotron_00203
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nIahub...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"4\\r\\n0 0 1 0\\r\\n\",\"5\\r\\n1 0 1 0 1\\r\\n\",\"50\\r\\n1 1 0 1 1 1 1 1...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:383/A" ], "cf_rating": 1600, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Milking cows", "num_tests": 11, "platform": "codeforces", "problem_id": "383/A", "prompt_sha256": "f82...
nemotron_09906
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou a...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"6\\n3 1\\n4 2\\n10 3\\n10 2\\n16 4\\n16 5\\n\",\"1\\n10000000 9999998\\n\",...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:1327/A" ], "cf_rating": 1100, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Sum of Odd Integers", "num_tests": 109, "platform": "codeforces", "problem_id": "1327/A", "prompt_sha...
nemotron_09994
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nAs At...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"10\\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\",\"4\\n631 577 243 ...
{ "atcoder_difficulty": 327, "atcoder_difficulty_raw": 320, "canonical_ids": [ "atcoder:abc100_c" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "*3 or /2", "num_tests": 103, "platform": "atcoder", "problem_id": "abc100_c", "prompt_sha256": "3fc73ebb...
leetcode_00864
lcb_coding
[ { "content": "You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\n### Question:\nWe run a preorder depth-first search (DFS) on the root of a binary tree.\nAt each node in this...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"\\\"1\\\"\",\"\\\"1-2--3--4---5\\\"\",\"\\\"1-2--3---5----6\\\"\",\"\\\"1-2...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "leetcode:recover-a-tree-from-preorder-traversal", "leetcode_number:1028" ], "cf_rating": null, "duplicate_tests_removed": 0, "leetcode_difficulty": "Hard", "name": "recover-a-tree-from-preorder-traversal", "num_t...
nemotron_00745
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nVladi...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"4 1 4\\r\\n1010\\r\\n\",\"5 5 2\\r\\n10110\\r\\n\",\"10 9 5\\r\\n1011111001...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:743/A" ], "cf_rating": 1200, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Vladik and flights", "num_tests": 35, "platform": "codeforces", "problem_id": "743/A", "prompt_sha256"...
nemotron_01099
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou a...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"7\\r\\nj......\\r\\n\",\"7\\r\\n...feon\\r\\n\",\"7\\r\\n.l.r.o.\\r\\n\",\"...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:452/A" ], "cf_rating": 1000, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Eevee", "num_tests": 20, "platform": "codeforces", "problem_id": "452/A", "prompt_sha256": "d855553120...
nemotron_12850
lcb_coding
[ { "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nThis ...
coding
{ "ground_truth": "{\"grader\":\"livecodebench\",\"schema_version\":1,\"revision\":\"28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24\",\"unit_test_timeout_seconds\":10,\"check_eos\":false,\"score_after_thinking\":true,\"input_output\":{\"inputs\":[\"3 1\\r\\n2 3\\r\\n3 1\\r\\n3\\r\\n\",\"5 1\\r\\n1 2\\r\\n2 3\\r\\n3 4\\r\\n...
{ "atcoder_difficulty": null, "atcoder_difficulty_raw": null, "canonical_ids": [ "codeforces:1970/C1" ], "cf_rating": 1400, "duplicate_tests_removed": 0, "leetcode_difficulty": null, "name": "Game on Tree (Easy)", "num_tests": 6, "platform": "codeforces", "problem_id": "1970/C1", "prompt_sha...
End of preview. Expand in Data Studio

Nemotron + LeetCode Coding Clean 3.2k

3,200 distinct training problems, seed 42, intended for Python coding reinforcement learning. This is a training mix, not a held-out benchmark. It combines the pinned default train Parquet split of Nemotron-RL-coding-competitive_coding with the train JSONL of LeetCodeDataset.

Composition

Source Questions Selection
Nemotron / Codeforces 1,856 1000–1600, inclusive
Nemotron / AtCoder 366 300–2000 display difficulty, inclusive
LeetCodeDataset 590 Hard; reference passes the 10 s checker
Nemotron / Aizu 130 Filler; no additional rating band
Nemotron / CodeChef 129 Filler; no additional rating band
Nemotron / HackerEarth 129 Filler; no additional rating band
Total 3,200 Train only

Codeforces ratings are matched to the saved official problemset API snapshot. Ambiguous ratings and rows supported only by an unverified upstream rating are excluded. AtCoder values are the AtCoder Problems display difficulty, from its saved model snapshot, not Codeforces ratings. The two scales are not interchangeable. For raw difficulty below 400 the display transform is round(400 / exp(1 - raw / 400)); otherwise it is round(raw).

All cleaned AtCoder and LeetCode Hard candidates are retained. When primary candidates exceed 3,200, the remaining places are allocated to CF rating strata proportionally to their eligible counts using largest remainders, then sampled without replacement. If primary candidates fall short, Aizu, CodeChef, and HackerEarth are sampled in a seeded balanced round-robin. This release retained all 2,812 clean primary candidates and added 388 fillers.

Codeforces rating Questions
1000 247
1100 253
1200 272
1300 263
1400 261
1500 252
1600 308

Cleaning and validation

The AWS CodeFu article describes missing-test, malformed-description, and invalid-constraint checks. The inspected example repository contains processed data but no complete implementation of those preprocessing checks. This release implements explicit, auditable checks inspired by those categories; it is not an exact reproduction of an unpublished cleaning pipeline. The selected difficulty bands and Python source prompts take precedence over the article's example settings.

  1. Require nonempty paired tests and valid text; reject missing/malformed task content and detectable contradictory literal numeric bounds. Constraint checks are conservative heuristics, not a proof of semantic consistency.
  2. Exclude explicit interactive/output-only tasks, missing image placeholders, and detected arbitrary-answer or unordered-output tasks unsupported by ordinary output matching. This is a text-based compatibility screen, not a complete official SPJ annotation. The original selection used the NeMo checker compatibility screen; no questions are silently removed by the LCB migration. See the grading-policy differences below.
  3. Merge exact source identities, official problem aliases, and normalized full statement hashes transitively. Normalize formatting for comparison only; preserve the published original prompt. Prefer a primary candidate, then more distinct tests, then a deterministic seeded tie break.
  4. Remove only byte-identical duplicate stdin input/output pairs; preserve all remaining bytes and their order. Quarantine conflicting outputs for identical inputs instead of guessing a repair.
  5. Exclude identifiable CodeContests validation/test originals and identical tasks in the actual evaluation question lists: CodeContests test 165, LCB test6.jsonl 175, TACO non-SPJ test 782, USACO 307. Match original platform problem IDs/URLs and aliases, or full normalized statement equality with mathematical operators preserved. Word 5-gram similarity, substring containment, and matching titles trigger review only. Remove a differently numbered mirror only after confirming the same task and constraints; retain easy/hard variants and distinct tasks even when they are highly similar. The final mix has 0 detected identical-task overlaps with each of the four evaluated sets. This is an exact-task audit, not a claim of zero semantic or conceptual similarity. Earlier train-split difficulty probes are not treated as held-out benchmarks.
  6. Check all 606 LeetCode Hard reference completions with the pinned unchanged LeetCodeDataset checker, a 10-second whole-suite limit, and sandboxed execution. Retry failures once at lower concurrency. After installing the required sortedcontainers==2.4.0, 590 pass; 15 time out and 1 fails an assertion. Only passing references are eligible. Timeout exclusions reflect this checker budget, not proof that a problem is defective. Nemotron supplies tests without reference completions in this source split; its answers were not exhaustively validated by reference execution.
  7. Check original Qwen3-1.7B thinking-mode prompt length against 8,192 tokens without truncation; the longest selected prompt is 2,727 tokens. Independently compare all 3,200 exported prompts and tests back to the original pinned source rows, verify uniqueness and difficulty bounds, and reload the Parquet with Hugging Face Datasets.

Removed 476 duplicate candidate rows and 558 repeated test pairs within selected records. Exclusion counts below apply to the in-scope candidate pool before final selection; one row can have more than one reason. Out-of-band rows and unused eligible filler candidates are reported separately.

Exclusion reason Candidate rows
ambiguous_or_unverified_codeforces_rating 2
conflicting_expected_outputs 2
contradictory_literal_constraint_bounds 3
duplicate_of 476
external_image_in_statement 730
heldout_exact_problem_overlap 298
heldout_problem_id_overlap 14
malformed_test_encoding 2
malformed_text_encoding 2
missing_input_or_output_description 8
multiple_valid_outputs_without_special_judge 665
no_explicit_constraint_evidence 273
reference_does_not_pass_checker 16
too_short_or_placeholder_statement 84
unsupported_interactive_or_output_only_task 16
upstream_validation_or_test_split 108

Unified LiveCodeBench grading

This revision uses one unchanged LiveCodeBench grader for all 3,200 questions: run_test, commit 28fef95ea8c9f7a547c8329f2cd3d32b92c1fa24. The prior two-grader release remains available at dataset commit fd1a23364d2288ab84e7dc2f7047e95ebc73aeb5. All question IDs, model prompts, source metadata, and 219,771 tests are preserved.

  • 2,610 stdin questions use native LCB stdin/stdout execution.
  • 590 function questions use native LCB Solution method execution. 576 have ordinary JSON arguments/returns; 14 use thin tree/list/infinity type adapters. Original LeetCode helper definitions are loaded only in the grader.
  • Reward is binary: all tests pass = 1, otherwise 0; stop at the first failing test.
  • Grade only code after a closing </think>; missing closing tag = 0. No EOS gate.
  • Timeout is 10 seconds per test for both modes. LeetCode previously used a 10-second whole-suite timeout. LCB's native stdin comparison uses exact decimal equality; it does not inherit the NeMo fork's floating tolerance or case-insensitive YES/NO extension. This is a switch to LCB's grading policy, not a guarantee of identical scores for every possible program.
  • Grader infrastructure failures are retried and raised rather than scored as wrong answers.

Migration validation: 590/590 provided LeetCode reference solutions pass; 3,200/3,200 intentional error controls are rejected; 504 saved completions from earlier evaluations receive identical scores. Native stdin/function, timeout, fail-fast, and actual veRL reward-manager integration checks also pass. These are CPU validations; no new GPU training was launched.

Loading and schema

from datasets import load_dataset
train = load_dataset("hi-todayis-jh/Nemotron-LeetCode-coding-clean-3.2k", split="train")
assert len(train) == 3200
  • data_source: lcb_coding for every row; original platform/source remains in extra_info.
  • prompt, ability, id, and extra_info: unchanged from the audited selection.
  • reward_model.style: rule.
  • reward_model.ground_truth: JSON string with grader=livecodebench, pinned revision, schema_version=1, native input_output={inputs,outputs,fn_name}, code_prelude, optional adapter, unit_test_timeout_seconds=10, check_eos=false, and score_after_thinking=true.
  • Stdin fn_name is null; native function rows name the original Solution method. Adapted rows use _maxrl_lcb_adapter_v1, which converts types and calls the original method. Tests/expected outputs and the helper prelude are grader inputs, not model messages. No reference completion or saved model response is exported.

The project's registered veRL reward manager is lcb_code. See training setup and reproduction and the included reward manager. Loading the Parquet alone does not install the reward integration. The isolated runtime uses the existing coding Python environment, NumPy, sortedcontainers, and bubblewrap. The original builder produces the pre-LCB format; run the LCB converter afterward.

Audit and reproducibility

Parquet SHA-256: 8f61558b1982bdb276d2a4d68bbe5bf685bbfc1058a74019a6e1bb7ba50ec76b.

Attribution

See source-specific license notices, including the differing license statements in NVIDIA's upstream card. Original source cards are preserved under source_notices/. Upstream question authors, contest platforms, NVIDIA, CodeContests, Open-R1, and LeetCodeDataset retain their attribution.

Downloads last month
250