data_source stringclasses 1
value | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-operations-to-make-the-integer-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two integers num1 and num2.\nIn one operation, yo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-operations-to-make-the-integer-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two integers num1 and num2.\\nIn one operation, you can choose... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-time-to-make-array-sum-at-most-x\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-time-to-make-array-sum-at-most-x\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Pentagon\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nA regular pentagon P is shown in the figure below.\n\nDetermine whether the length of the line segmen... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Pentagon\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nA regular pentagon P is shown in the figure below.\\n\\nDetermine whether the length of the line segment connecting p... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-total-reward-using-operations-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer array rewardValues of length n, representi... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: maximum-total-reward-using-operations-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer array rewardValues of length n, representing the values... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: B. Chemistry\nPlatform: codeforces\nDifficulty: medium\n\nProblem Statement:\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an inte... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "unknown",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: B. Chemistry\\nPlatform: codeforces\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\\n\\nYou nee... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: most-frequent-ids\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nThe problem involves tracking the frequency of IDs in a collection that changes over time... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: most-frequent-ids\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nThe problem involves tracking the frequency of IDs in a collection that changes over time. You have tw... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: construct-string-with-minimum-cost\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string target, an array of strings words, and an integer a... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: construct-string-with-minimum-cost\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string target, an array of strings words, and an integer array costs, bot... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: generate-binary-strings-without-adjacent-zeros\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a positive integer n.\nA binary string x is va... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: generate-binary-strings-without-adjacent-zeros\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a positive integer n.\\nA binary string x is valid if all s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: construct-string-with-minimum-cost\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string target, an array of strings words, and an integer a... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: construct-string-with-minimum-cost\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string target, an array of strings words, and an integer array costs, bot... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Printing Machine\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N products labeled 1 to N flowing on a conveyor belt.\r\nA Keyence printer is attac... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Printing Machine\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N products labeled 1 to N flowing on a conveyor belt.\\r\\nA Keyence printer is attached to the con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: most-frequent-ids\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nThe problem involves tracking the frequency of IDs in a collection that changes over time... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: most-frequent-ids\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nThe problem involves tracking the frequency of IDs in a collection that changes over time. You have tw... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-maximum-non-decreasing-array-length\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums.\nYou can perform any n... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-maximum-non-decreasing-array-length\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums.\\nYou can perform any number of opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Mex and Update\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,A_2,\\dots,A_N) of length N.\r\nRespond to the following Q quer... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Mex and Update\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,A_2,\\\\dots,A_N) of length N.\\r\\nRespond to the following Q queries in the o... |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 36