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: find-the-longest-equal-subarray\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums and an integer k.\nA subarray ... | 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: find-the-longest-equal-subarray\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums and an integer k.\\nA subarray is called eq... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-length-of-anagram-concatenation\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s, which is known to be a concatenation of a... | 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-length-of-anagram-concatenation\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s, which is known to be a concatenation of anagrams of so... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: power-of-heroes\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The po... | 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: power-of-heroes\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: length-of-the-longest-valid-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string word and an array of strings forbidden.\nA strin... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: length-of-the-longest-valid-substring\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string word and an array of strings forbidden.\\nA string is called va... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Find snuke\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Find snuke\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English letter writte... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-substrings\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string word and an integer k.\nA substring s of word is complete if... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-complete-substrings\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string word and an integer k.\\nA substring s of word is complete if:\\n\\nEach ch... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-substrings\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string word and an integer k.\nA substring s of word is complete if... | 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: count-complete-substrings\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string word and an integer k.\\nA substring s of word is complete if:\\n\\nEach ch... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-size-of-a-set-after-removals\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of even len... | 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-size-of-a-set-after-removals\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of even length n.\\nYou ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer k and an integer ... | 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-number-that-sum-of-the-prices-is-less-than-or-equal-to-k\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer k and an integer x.\\nConsider... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Christmas Trees\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a road that stretches infinitely to the east and west, and the coordinate of a poin... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Christmas Trees\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a road that stretches infinitely to the east and west, and the coordinate of a point located x me... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: largest-element-in-an-array-after-merge-operations\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array nums consisting of posit... | 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: largest-element-in-an-array-after-merge-operations\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums consisting of positive integers.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Minimum Width\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nTakahashi is displaying a sentence with N words in a window.\r\nAll words have the same height... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Minimum Width\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nTakahashi is displaying a sentence with N words in a window.\\r\\nAll words have the same height, and the wi... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: right-triangles\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 2D boolean matrix grid.\nReturn an integer that is the number of right tria... | 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: right-triangles\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 2D boolean matrix grid.\\nReturn an integer that is the number of right triangles that c... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Past ABCs\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a string S of length 6. It is guaranteed that the first three characters of S are ABC ... | 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: Past ABCs\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a string S of length 6. It is guaranteed that the first three characters of S are ABC and the last thr... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-all-array-elements-equal-to-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums and ... | 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: apply-operations-to-make-all-array-elements-equal-to-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums and a positive in... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Couples\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nThere are 2N people standing in a row, and the person at the i-th position from the left is wearing cl... | 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: Couples\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nThere are 2N people standing in a row, and the person at the i-th position from the left is wearing clothes of color A... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Overall Winner\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nTakahashi and Aoki played N games.\r\nYou are given a string S of length N, representing the re... | 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: Overall Winner\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nTakahashi and Aoki played N games.\\r\\nYou are given a string S of length N, representing the results of these... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-punishment-number-of-an-integer\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven a positive integer n, return the punishment number of n.\nTh... | 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: find-the-punishment-number-of-an-integer\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven a positive integer n, return the punishment number of n.\\nThe punishment... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: power-of-heroes\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The po... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: power-of-heroes\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 2UP3DOWN\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nTakahashi is in a building with 100 floors.\nHe uses the stairs for moving up two floors or less or m... | 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: 2UP3DOWN\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nTakahashi is in a building with 100 floors.\\nHe uses the stairs for moving up two floors or less or moving down thre... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Who is Saikyo?\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere are N competitive programmers numbered person 1, person 2, \\ldots, and person N.\nTher... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Who is Saikyo?\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere are N competitive programmers numbered person 1, person 2, \\\\ldots, and person N.\\nThere is a rela... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-deletions-to-make-string-k-special\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string word and an integer k.\nWe consider word ... | 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: minimum-deletions-to-make-string-k-special\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string word and an integer k.\\nWe consider word to be k-spec... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: continuous-subarrays\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums. A subarray of nums is called continuous ... | 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: continuous-subarrays\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums. A subarray of nums is called continuous if:\\n\\nLet ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: right-triangles\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 2D boolean matrix grid.\nReturn an integer that is the number of right tria... | 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: right-triangles\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 2D boolean matrix grid.\\nReturn an integer that is the number of right triangles that c... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-subarrays-in-an-array\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of positive integers.\nWe call ... | 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: count-complete-subarrays-in-an-array\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of positive integers.\\nWe call a subarray o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Distinct Adjacent\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N people numbered from 1 to N standing in a circle. Person 1 is to the right of pe... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Distinct Adjacent\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N people numbered from 1 to N standing in a circle. Person 1 is to the right of person 2, person 2... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Only one of two\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given three positive integers N, M, and K. Here, N and M are different.\nPrint the K... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Only one of two\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given three positive integers N, M, and K. Here, N and M are different.\\nPrint the K-th smallest ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Revenge of \"The Salary of AtCoder Inc.\"\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nAoki, an employee at AtCoder Inc., has his salary for this month det... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Revenge of \\\"The Salary of AtCoder Inc.\\\"\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nAoki, an employee at AtCoder Inc., has his salary for this month determined by a... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: collecting-chocolates\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums of size n representing the cost of colle... | 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: collecting-chocolates\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums of size n representing the cost of collecting differe... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-size-subarray-in-infinite-array\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array nums and an integer target.\nA 0-in... | 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: minimum-size-subarray-in-infinite-array\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums and an integer target.\\nA 0-indexed array ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: split-array-into-maximum-number-of-subarrays\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of non-negative integer... | 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: split-array-into-maximum-number-of-subarrays\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of non-negative integers.\\nWe defin... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 2UP3DOWN\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nTakahashi is in a building with 100 floors.\nHe uses the stairs for moving up two floors or less or m... | 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: 2UP3DOWN\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nTakahashi is in a building with 100 floors.\\nHe uses the stairs for moving up two floors or less or moving down thre... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-subarrays-in-an-array\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of positive integers.\nWe call ... | 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: count-complete-subarrays-in-an-array\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of positive integers.\\nWe call a subarray o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-length-of-anagram-concatenation\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s, which is known to be a concatenation of a... | 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-length-of-anagram-concatenation\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s, which is known to be a concatenation of anagrams of so... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: power-of-heroes\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The po... | 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: power-of-heroes\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Find snuke\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Find snuke\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English letter writte... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: largest-element-in-an-array-after-merge-operations\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array nums consisting of posit... | 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: largest-element-in-an-array-after-merge-operations\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums consisting of positive integers.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximize-the-profit-as-the-salesman\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer n representing the number of houses on a numbe... | 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: maximize-the-profit-as-the-salesman\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer n representing the number of houses on a number line, numbe... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Vacation Together\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nThere are N people numbered 1 to N.\r\nYou are given their schedule for the following D days... | 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: Vacation Together\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nThere are N people numbered 1 to N.\\r\\nYou are given their schedule for the following D days. The schedule... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-or\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums of length n and an integer k. In an operation, you ... | 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: maximum-or\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-palindromes-after-operations\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string array words having length n and conta... | 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: maximum-palindromes-after-operations\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string array words having length n and containing 0-index... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: taking-maximum-energy-from-the-mystic-dungeon\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nIn a mystic dungeon, n magicians are standing in a line. Each... | 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: taking-maximum-energy-from-the-mystic-dungeon\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nIn a mystic dungeon, n magicians are standing in a line. Each magician has... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 2UP3DOWN\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nTakahashi is in a building with 100 floors.\nHe uses the stairs for moving up two floors or less or m... | 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: 2UP3DOWN\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nTakahashi is in a building with 100 floors.\\nHe uses the stairs for moving up two floors or less or moving down thre... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-longest-equal-subarray\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums and an integer k.\nA subarray ... | 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: find-the-longest-equal-subarray\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums and an integer k.\\nA subarray is called eq... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximize-happiness-of-selected-children\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array happiness of length n, and a positive intege... | 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: maximize-happiness-of-selected-children\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array happiness of length n, and a positive integer k.\\nThere ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: First ABC\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a string S consisting of A, B, and C. S is guaranteed to contain all of A, B, and C.\n... | 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: First ABC\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a string S consisting of A, B, and C. S is guaranteed to contain all of A, B, and C.\\nIf the characte... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Vouchers\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are in a store to buy N items. The regular price of the i-th item is P_i yen (the currency in Ja... | 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: Vouchers\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are in a store to buy N items. The regular price of the i-th item is P_i yen (the currency in Japan).\\nYou have... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-good-subarray-sum\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums of length n and a positive integer k.\nA subarray of ... | 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: maximum-good-subarray-sum\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums of length n and a positive integer k.\\nA subarray of nums is call... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-longest-special-substring-that-occurs-thrice-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s that consists of lowercase Eng... | 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: find-longest-special-substring-that-occurs-thrice-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s that consists of lowercase English letters.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-beautiful-indices-in-the-given-array-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string s, a string a, a string b, and... | 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: find-beautiful-indices-in-the-given-array-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string s, a string a, a string b, and an integer k... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-element-sum-of-a-complete-subset-of-indices\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 1-indexed array nums of n integers.\nA se... | 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: maximum-element-sum-of-a-complete-subset-of-indices\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 1-indexed array nums of n integers.\\nA set of numbers i... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-polygon-with-the-largest-perimeter\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array of positive integers nums of length n.\nA po... | 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: find-polygon-with-the-largest-perimeter\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array of positive integers nums of length n.\\nA polygon is a c... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: longest-even-odd-subarray-with-threshold\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given a 0-indexed integer array nums and an integer threshol... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: longest-even-odd-subarray-with-threshold\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums and an integer threshold.\\nFind the l... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Base 2\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a sequence A=(A_0,A_1,\\dots,A_{63}) of length 64 consisting of 0 and 1.\nFind A_0 2^0 + ... | 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: Base 2\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a sequence A=(A_0,A_1,\\\\dots,A_{63}) of length 64 consisting of 0 and 1.\\nFind A_0 2^0 + A_1 2^1 + \\\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-distinct-difference-array\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given a 0-indexed array nums of length n.\nThe distinct difference... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-the-distinct-difference-array\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums of length n.\\nThe distinct difference array of nums... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximize-value-of-function-in-a-ball-passing-game\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array receiver of length ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: maximize-value-of-function-in-a-ball-passing-game\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array receiver of length n and an intege... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-stepping-numbers-in-range\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nGiven two positive integers low and high represented as strings, find the cou... | 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: count-stepping-numbers-in-range\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nGiven two positive integers low and high represented as strings, find the count of stepping ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-equal-sum-of-two-arrays-after-replacing-zeros\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two arrays nums1 and nums2 consisting o... | 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: minimum-equal-sum-of-two-arrays-after-replacing-zeros\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two arrays nums1 and nums2 consisting of positive in... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: split-array-into-maximum-number-of-subarrays\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of non-negative integer... | 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: split-array-into-maximum-number-of-subarrays\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of non-negative integers.\\nWe defin... |
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\": [true, false], \"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: Palindromic Number\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nA non-negative integer X is called a palindrome number if its decimal representation (wit... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Palindromic Number\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nA non-negative integer X is called a palindrome number if its decimal representation (without leading z... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: existence-of-a-substring-in-a-string-and-its-reverse\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nGiven a string s, find any substring of length 2 which i... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: existence-of-a-substring-in-a-string-and-its-reverse\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nGiven a string s, find any substring of length 2 which is also present ... |
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: Insert or Erase\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,\\ldots,A_N) of length N. The elements of A are distinct.\nPro... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Insert or Erase\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,\\\\ldots,A_N) of length N. The elements of A are distinct.\\nProcess Q querie... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimize-manhattan-distances\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a array points representing integer coordinates of some points on ... | 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: minimize-manhattan-distances\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a array points representing integer coordinates of some points on a 2D plane, whe... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Snuke Maze\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nWe have a grid with H horizontal rows and W vertical columns.\r\nWe denote by (i,j) the cell at t... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Snuke Maze\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nWe have a grid with H horizontal rows and W vertical columns.\\r\\nWe denote by (i,j) the cell at the i-th row ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-polygon-with-the-largest-perimeter\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array of positive integers nums of length n.\nA po... | 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: find-polygon-with-the-largest-perimeter\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array of positive integers nums of length n.\\nA polygon is a c... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-longest-special-substring-that-occurs-thrice-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s that consists of lowercase Eng... | 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: find-longest-special-substring-that-occurs-thrice-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s that consists of lowercase English letters.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: A. Short Sort\nPlatform: codeforces\nDifficulty: easy\n\nProblem Statement:\nThere are three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a ro... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "unknown",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: A. Short Sort\\nPlatform: codeforces\\nDifficulty: easy\\n\\nProblem Statement:\\nThere are three cards with letters $\\\\texttt{a}$, $\\\\texttt{b}$, $\\\\texttt{c}$ placed in a row in some order... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-common-elements-between-two-arrays\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-common-elements-between-two-arrays\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n and m, respect... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 88888888\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nFor a positive integer N, let V_N be the integer formed by concatenating N exactly N times.\r\nMore... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: 88888888\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nFor a positive integer N, let V_N be the integer formed by concatenating N exactly N times.\\r\\nMore precisely, ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Sensors\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere are zero or more sensors placed on a grid of H rows and W columns. Let (i, j) denote the squar... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Sensors\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere are zero or more sensors placed on a grid of H rows and W columns. Let (i, j) denote the square in the i-th ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Only one of two\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given three positive integers N, M, and K. Here, N and M are different.\nPrint the K... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Only one of two\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given three positive integers N, M, and K. Here, N and M are different.\\nPrint the K-th smallest ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-string-empty\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s.\nConsider performing the following operatio... | 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: apply-operations-to-make-string-empty\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s.\\nConsider performing the following operation until s be... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Capitalized?\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a non-empty string S consisting of uppercase and lowercase English letters. Determi... | 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: Capitalized?\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a non-empty string S consisting of uppercase and lowercase English letters. Determine whether the f... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-punishment-number-of-an-integer\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven a positive integer n, return the punishment number of n.\nTh... | 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: find-the-punishment-number-of-an-integer\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven a positive integer n, return the punishment number of n.\\nThe punishment... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Past ABCs\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a string S of length 6. It is guaranteed that the first three characters of S are ABC ... | 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: Past ABCs\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a string S of length 6. It is guaranteed that the first three characters of S are ABC and the last thr... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-winning-player-in-coin-game\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given two positive integers x and y, denoting the number of coin... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-the-winning-player-in-coin-game\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given two positive integers x and y, denoting the number of coins with values 7... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-substrings\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string word and an integer k.\nA substring s of word is complete if... | 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: count-complete-substrings\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string word and an integer k.\\nA substring s of word is complete if:\\n\\nEach ch... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-the-n-th-value-after-k-seconds\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two integers n and k.\nInitially, you start with an array... | 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: find-the-n-th-value-after-k-seconds\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two integers n and k.\\nInitially, you start with an array a of n inte... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-complete-subarrays-in-an-array\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of positive integers.\nWe call ... | 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: count-complete-subarrays-in-an-array\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of positive integers.\\nWe call a subarray o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-the-number-of-incremovable-subarrays-i\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given a 0-indexed array of positive integers nums.\nA su... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-the-number-of-incremovable-subarrays-i\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a 0-indexed array of positive integers nums.\\nA subarray of nums... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-common-elements-between-two-arrays\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-common-elements-between-two-arrays\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n and m, respect... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 88888888\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nFor a positive integer N, let V_N be the integer formed by concatenating N exactly N times.\r\nMore... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: 88888888\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nFor a positive integer N, let V_N be the integer formed by concatenating N exactly N times.\\r\\nMore precisely, ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-all-array-elements-equal-to-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed integer array nums and ... | 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: apply-operations-to-make-all-array-elements-equal-to-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums and a positive in... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-time-to-revert-word-to-initial-state-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string word and an integer k.\nAt ... | 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: minimum-time-to-revert-word-to-initial-state-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string word and an integer k.\\nAt every second... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: A+B+C\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given three sequences A=(A_1,\\ldots,A_N), B=(B_1,\\ldots,B_M), and C=(C_1,\\ldots,C_L).\nAddi... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: A+B+C\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given three sequences A=(A_1,\\\\ldots,A_N), B=(B_1,\\\\ldots,B_M), and C=(C_1,\\\\ldots,C_L).\\nAdditionall... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-subarrays-where-max-element-appears-at-least-k-times\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer array nums and a positi... | 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: count-subarrays-where-max-element-appears-at-least-k-times\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer array nums and a positive integer k.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-of-integers\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two numeric strings num1 and num2 and two integers max_sum and min_sum. We de... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-of-integers\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two numeric strings num1 and num2 and two integers max_sum and min_sum. We denote an integer... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: 2UP3DOWN\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nTakahashi is in a building with 100 floors.\nHe uses the stairs for moving up two floors or less or m... | 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: 2UP3DOWN\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nTakahashi is in a building with 100 floors.\\nHe uses the stairs for moving up two floors or less or moving down thre... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Find snuke\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Find snuke\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H horizontal rows and W vertical columns. Each cell has a lowercase English letter writte... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Christmas Trees\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a road that stretches infinitely to the east and west, and the coordinate of a poin... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Christmas Trees\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a road that stretches infinitely to the east and west, and the coordinate of a point located x me... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-longest-special-substring-that-occurs-thrice-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s that consists of lowercase Eng... | 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: find-longest-special-substring-that-occurs-thrice-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s that consists of lowercase English letters.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: taking-maximum-energy-from-the-mystic-dungeon\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nIn a mystic dungeon, n magicians are standing in a line. Each... | 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: taking-maximum-energy-from-the-mystic-dungeon\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nIn a mystic dungeon, n magicians are standing in a line. Each magician has... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-xor-product\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven three integers a, b, and n, return the maximum value of (a XOR x) * (b XOR x) whe... | 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-xor-product\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven three integers a, b, and n, return the maximum value of (a XOR x) * (b XOR x) where 0 <= x < 2... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: split-array-into-maximum-number-of-subarrays\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an array nums consisting of non-negative integer... | 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: split-array-into-maximum-number-of-subarrays\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an array nums consisting of non-negative integers.\\nWe defin... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Reindeer and Sleigh\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere are N sleighs numbered 1,2,\\ldots, N.\nR_i reindeer are required to pull sleigh i... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Reindeer and Sleigh\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere are N sleighs numbered 1,2,\\\\ldots, N.\\nR_i reindeer are required to pull sleigh i.\\nAdditio... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-longest-special-substring-that-occurs-thrice-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s that consists of lowercase Eng... | 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: find-longest-special-substring-that-occurs-thrice-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s that consists of lowercase English letters.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-common-elements-between-two-arrays\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-common-elements-between-two-arrays\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of sizes n and m, respect... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Virus\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere are N people numbered 1, 2, \\ldots, N on a two-dimensional plane, and person i is at the point ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Virus\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere are N people numbered 1, 2, \\\\ldots, N on a two-dimensional plane, and person i is at the point represented ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.