data_source stringclasses 1
value | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2784, \"task_name\": \"Check if Array is Good\", \"entry_point\": \"isGood\", \"canonical_solution\": \"class Solution:\\n def isGood(self, nums: List[int]) -> bool:\\n n = len(nums) - 1\\n cnt = Count... | {
"index": "effibench_942",
"split": "train",
"problem_idx": "2784",
"task_name": "Check if Array is Good",
"entry_point": "isGood",
"reference_runtime_ms": 1.1949967592954636,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2785, \"task_name\": \"Sort Vowels in a String\", \"entry_point\": \"sortVowels\", \"canonical_solution\": \"class Solution:\\n def sortVowels(self, s: str) -> str:\\n vs = [c for c in s if c.lower() in \\\"a... | {
"index": "effibench_943",
"split": "train",
"problem_idx": "2785",
"task_name": "Sort Vowels in a String",
"entry_point": "sortVowels",
"reference_runtime_ms": 0.11137314140796661,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2786, \"task_name\": \"Visit Array Positions to Maximize Score\", \"entry_point\": \"maxScore\", \"canonical_solution\": \"class Solution:\\n def maxScore(self, nums: List[int], x: int) -> int:\\n f = [-inf] ... | {
"index": "effibench_944",
"split": "train",
"problem_idx": "2786",
"task_name": "Visit Array Positions to Maximize Score",
"entry_point": "maxScore",
"reference_runtime_ms": 0.1519192010164261,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2789, \"task_name\": \"Largest Element in an Array after Merge Operations\", \"entry_point\": \"maxArrayValue\", \"canonical_solution\": \"class Solution:\\n def maxArrayValue(self, nums: List[int]) -> int:\\n ... | {
"index": "effibench_945",
"split": "train",
"problem_idx": "2789",
"task_name": "Largest Element in an Array after Merge Operations",
"entry_point": "maxArrayValue",
"reference_runtime_ms": 0.05342811346054077,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2790, \"task_name\": \"Maximum Number of Groups With Increasing Length\", \"entry_point\": \"maxIncreasingGroups\", \"canonical_solution\": \"class Solution:\\n def maxIncreasingGroups(self, usageLimits: List[int]) ... | {
"index": "effibench_946",
"split": "train",
"problem_idx": "2790",
"task_name": "Maximum Number of Groups With Increasing Length",
"entry_point": "maxIncreasingGroups",
"reference_runtime_ms": 0.0401567667722702,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2799, \"task_name\": \"Count Complete Subarrays in an Array\", \"entry_point\": \"countCompleteSubarrays\", \"canonical_solution\": \"class Solution:\\n def countCompleteSubarrays(self, nums: List[int]) -> int:\\n ... | {
"index": "effibench_947",
"split": "train",
"problem_idx": "2799",
"task_name": "Count Complete Subarrays in an Array",
"entry_point": "countCompleteSubarrays",
"reference_runtime_ms": 13.520382344722748,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2800, \"task_name\": \"Shortest String That Contains Three Strings\", \"entry_point\": \"minimumString\", \"canonical_solution\": \"class Solution:\\n def minimumString(self, a: str, b: str, c: str) -> str:\\n ... | {
"index": "effibench_948",
"split": "train",
"problem_idx": "2800",
"task_name": "Shortest String That Contains Three Strings",
"entry_point": "minimumString",
"reference_runtime_ms": 0.8527245372533798,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2808, \"task_name\": \"Minimum Seconds to Equalize a Circular Array\", \"entry_point\": \"minimumSeconds\", \"canonical_solution\": \"class Solution:\\n def minimumSeconds(self, nums: List[int]) -> int:\\n d ... | {
"index": "effibench_949",
"split": "train",
"problem_idx": "2808",
"task_name": "Minimum Seconds to Equalize a Circular Array",
"entry_point": "minimumSeconds",
"reference_runtime_ms": 0.29309093952178955,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2809, \"task_name\": \"Minimum Time to Make Array Sum At Most x\", \"entry_point\": \"minimumTime\", \"canonical_solution\": \"class Solution:\\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> ... | {
"index": "effibench_950",
"split": "train",
"problem_idx": "2809",
"task_name": "Minimum Time to Make Array Sum At Most x",
"entry_point": "minimumTime",
"reference_runtime_ms": 0.7230155169963837,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2811, \"task_name\": \"Check if it is Possible to Split Array\", \"entry_point\": \"canSplitArray\", \"canonical_solution\": \"class Solution:\\n def canSplitArray(self, nums: List[int], m: int) -> bool:\\n @... | {
"index": "effibench_951",
"split": "train",
"problem_idx": "2811",
"task_name": "Check if it is Possible to Split Array",
"entry_point": "canSplitArray",
"reference_runtime_ms": 0.7083304226398468,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2813, \"task_name\": \"Maximum Elegance of a K\", \"entry_point\": \"findMaximumElegance\", \"canonical_solution\": \"class Solution:\\n def findMaximumElegance(self, items: List[List[int]], k: int) -> int:\\n ... | {
"index": "effibench_952",
"split": "train",
"problem_idx": "2813",
"task_name": "Maximum Elegance of a K",
"entry_point": "findMaximumElegance",
"reference_runtime_ms": 0.1788455992937088,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2814, \"task_name\": \"Minimum Time Takes to Reach Destination Without Drowning\", \"entry_point\": \"minimumSeconds\", \"canonical_solution\": \"class Solution:\\n def minimumSeconds(self, land: List[List[str]]) ->... | {
"index": "effibench_953",
"split": "train",
"problem_idx": "2814",
"task_name": "Minimum Time Takes to Reach Destination Without Drowning",
"entry_point": "minimumSeconds",
"reference_runtime_ms": 2.0587891340255737,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2825, \"task_name\": \"Make String a Subsequence Using Cyclic Increments\", \"entry_point\": \"canMakeSubsequence\", \"canonical_solution\": \"class Solution:\\n def canMakeSubsequence(self, str1: str, str2: str) ->... | {
"index": "effibench_954",
"split": "train",
"problem_idx": "2825",
"task_name": "Make String a Subsequence Using Cyclic Increments",
"entry_point": "canMakeSubsequence",
"reference_runtime_ms": 0.07087551057338715,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2826, \"task_name\": \"Sorting Three Groups\", \"entry_point\": \"minimumOperations\", \"canonical_solution\": \"class Solution:\\n def minimumOperations(self, nums: List[int]) -> int:\\n f = [0] * 3\\n ... | {
"index": "effibench_955",
"split": "train",
"problem_idx": "2826",
"task_name": "Sorting Three Groups",
"entry_point": "minimumOperations",
"reference_runtime_ms": 1.5730801969766617,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2827, \"task_name\": \"Number of Beautiful Integers in the Range\", \"entry_point\": \"numberOfBeautifulIntegers\", \"canonical_solution\": \"class Solution:\\n def numberOfBeautifulIntegers(self, low: int, high: in... | {
"index": "effibench_956",
"split": "train",
"problem_idx": "2827",
"task_name": "Number of Beautiful Integers in the Range",
"entry_point": "numberOfBeautifulIntegers",
"reference_runtime_ms": 2.866733819246292,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2829, \"task_name\": \"Determine the Minimum Sum of a k\", \"entry_point\": \"minimumSum\", \"canonical_solution\": \"class Solution:\\n def minimumSum(self, n: int, k: int) -> int:\\n s, i = 0, 1\\n v... | {
"index": "effibench_957",
"split": "train",
"problem_idx": "2829",
"task_name": "Determine the Minimum Sum of a k",
"entry_point": "minimumSum",
"reference_runtime_ms": 0.2725943922996521,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2831, \"task_name\": \"Find the Longest Equal Subarray\", \"entry_point\": \"longestEqualSubarray\", \"canonical_solution\": \"class Solution:\\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\\n ... | {
"index": "effibench_958",
"split": "train",
"problem_idx": "2831",
"task_name": "Find the Longest Equal Subarray",
"entry_point": "longestEqualSubarray",
"reference_runtime_ms": 0.2619456499814987,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2835, \"task_name\": \"Minimum Operations to Form Subsequence With Target Sum\", \"entry_point\": \"minOperations\", \"canonical_solution\": \"class Solution:\\n def minOperations(self, nums: List[int], target: int)... | {
"index": "effibench_959",
"split": "train",
"problem_idx": "2835",
"task_name": "Minimum Operations to Form Subsequence With Target Sum",
"entry_point": "minOperations",
"reference_runtime_ms": 0.014472752809524536,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2836, \"task_name\": \"Maximize Value of Function in a Ball Passing Game\", \"entry_point\": \"getMaxFunctionValue\", \"canonical_solution\": \"class Solution:\\n def getMaxFunctionValue(self, receiver: List[int], k... | {
"index": "effibench_960",
"split": "train",
"problem_idx": "2836",
"task_name": "Maximize Value of Function in a Ball Passing Game",
"entry_point": "getMaxFunctionValue",
"reference_runtime_ms": 29.22646328806877,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2844, \"task_name\": \"Minimum Operations to Make a Special Number\", \"entry_point\": \"minimumOperations\", \"canonical_solution\": \"class Solution:\\n def minimumOperations(self, num: str) -> int:\\n @cac... | {
"index": "effibench_961",
"split": "train",
"problem_idx": "2844",
"task_name": "Minimum Operations to Make a Special Number",
"entry_point": "minimumOperations",
"reference_runtime_ms": 1.9004065543413162,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2850, \"task_name\": \"Minimum Moves to Spread Stones Over Grid\", \"entry_point\": \"minimumMoves\", \"canonical_solution\": \"class Solution:\\n def minimumMoves(self, grid: List[List[int]]) -> int:\\n def ... | {
"index": "effibench_963",
"split": "train",
"problem_idx": "2850",
"task_name": "Minimum Moves to Spread Stones Over Grid",
"entry_point": "minimumMoves",
"reference_runtime_ms": 0.34041889011859894,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2856, \"task_name\": \"Minimum Array Length After Pair Removals\", \"entry_point\": \"minLengthAfterRemovals\", \"canonical_solution\": \"class Solution:\\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\... | {
"index": "effibench_964",
"split": "train",
"problem_idx": "2856",
"task_name": "Minimum Array Length After Pair Removals",
"entry_point": "minLengthAfterRemovals",
"reference_runtime_ms": 0.21929480135440826,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2857, \"task_name\": \"Count Pairs of Points With Distance k\", \"entry_point\": \"countPairs\", \"canonical_solution\": \"class Solution:\\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\\n ... | {
"index": "effibench_965",
"split": "train",
"problem_idx": "2857",
"task_name": "Count Pairs of Points With Distance k",
"entry_point": "countPairs",
"reference_runtime_ms": 4.185769706964493,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2859, \"task_name\": \"Sum of Values at Indices With K Set Bits\", \"entry_point\": \"sumIndicesWithKSetBits\", \"canonical_solution\": \"class Solution:\\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) ... | {
"index": "effibench_966",
"split": "train",
"problem_idx": "2859",
"task_name": "Sum of Values at Indices With K Set Bits",
"entry_point": "sumIndicesWithKSetBits",
"reference_runtime_ms": 0.06838887929916382,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2860, \"task_name\": \"Happy Students\", \"entry_point\": \"countWays\", \"canonical_solution\": \"class Solution:\\n def countWays(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n ... | {
"index": "effibench_967",
"split": "train",
"problem_idx": "2860",
"task_name": "Happy Students",
"entry_point": "countWays",
"reference_runtime_ms": 0.05157850682735443,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2868, \"task_name\": \"The Wording Game\", \"entry_point\": \"canAliceWin\", \"canonical_solution\": \"class Solution:\\n def canAliceWin(self, a: List[str], b: List[str]) -> bool:\\n i, j, k = 1, 0, 1\\n ... | {
"index": "effibench_969",
"split": "train",
"problem_idx": "2868",
"task_name": "The Wording Game",
"entry_point": "canAliceWin",
"reference_runtime_ms": 0.08529052138328552,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2871, \"task_name\": \"Split Array Into Maximum Number of Subarrays\", \"entry_point\": \"maxSubarrays\", \"canonical_solution\": \"class Solution:\\n def maxSubarrays(self, nums: List[int]) -> int:\\n score,... | {
"index": "effibench_970",
"split": "train",
"problem_idx": "2871",
"task_name": "Split Array Into Maximum Number of Subarrays",
"entry_point": "maxSubarrays",
"reference_runtime_ms": 0.039637088775634766,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2892, \"task_name\": \"Minimizing Array After Replacing Pairs With Their Product\", \"entry_point\": \"minArrayLength\", \"canonical_solution\": \"class Solution:\\n def minArrayLength(self, nums: List[int], k: int)... | {
"index": "effibench_971",
"split": "train",
"problem_idx": "2892",
"task_name": "Minimizing Array After Replacing Pairs With Their Product",
"entry_point": "minArrayLength",
"reference_runtime_ms": 0.04110671579837799,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2896, \"task_name\": \"Apply Operations to Make Two Strings Equal\", \"entry_point\": \"minOperations\", \"canonical_solution\": \"class Solution:\\n def minOperations(self, s1: str, s2: str, x: int) -> int:\\n ... | {
"index": "effibench_972",
"split": "train",
"problem_idx": "2896",
"task_name": "Apply Operations to Make Two Strings Equal",
"entry_point": "minOperations",
"reference_runtime_ms": 0.34056417644023895,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2900, \"task_name\": \"Longest Unequal Adjacent Groups Subsequence I\", \"entry_point\": \"getWordsInLongestSubsequence\", \"canonical_solution\": \"class Solution:\\n def getWordsInLongestSubsequence(\\n sel... | {
"index": "effibench_973",
"split": "train",
"problem_idx": "2900",
"task_name": "Longest Unequal Adjacent Groups Subsequence I",
"entry_point": "getWordsInLongestSubsequence",
"reference_runtime_ms": 0.2901684492826462,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2901, \"task_name\": \"Longest Unequal Adjacent Groups Subsequence II\", \"entry_point\": \"getWordsInLongestSubsequence\", \"canonical_solution\": \"class Solution:\\n def getWordsInLongestSubsequence(\\n se... | {
"index": "effibench_974",
"split": "train",
"problem_idx": "2901",
"task_name": "Longest Unequal Adjacent Groups Subsequence II",
"entry_point": "getWordsInLongestSubsequence",
"reference_runtime_ms": 1.0759197175502777,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2911, \"task_name\": \"Minimum Changes to Make K Semi\", \"entry_point\": \"minimumChanges\", \"canonical_solution\": \"class Solution:\\n def minimumChanges(self, s: str, k: int) -> int:\\n n = len(s)\\n ... | {
"index": "effibench_975",
"split": "train",
"problem_idx": "2911",
"task_name": "Minimum Changes to Make K Semi",
"entry_point": "minimumChanges",
"reference_runtime_ms": 2.971390262246132,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2912, \"task_name\": \"Number of Ways to Reach Destination in the Grid\", \"entry_point\": \"numberOfWays\", \"canonical_solution\": \"class Solution:\\n def numberOfWays(\\n self, n: int, m: int, k: int, sou... | {
"index": "effibench_976",
"split": "train",
"problem_idx": "2912",
"task_name": "Number of Ways to Reach Destination in the Grid",
"entry_point": "numberOfWays",
"reference_runtime_ms": 2.2512469440698624,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2915, \"task_name\": \"Length of the Longest Subsequence That Sums to Target\", \"entry_point\": \"lengthOfLongestSubsequence\", \"canonical_solution\": \"class Solution:\\n def lengthOfLongestSubsequence(self, nums... | {
"index": "effibench_977",
"split": "train",
"problem_idx": "2915",
"task_name": "Length of the Longest Subsequence That Sums to Target",
"entry_point": "lengthOfLongestSubsequence",
"reference_runtime_ms": 3.9885565638542175,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2917, \"task_name\": \"Find the K\", \"entry_point\": \"findKOr\", \"canonical_solution\": \"class Solution:\\n def findKOr(self, nums: List[int], k: int) -> int:\\n ans = 0\\n for i in range(32):\\n ... | {
"index": "effibench_978",
"split": "train",
"problem_idx": "2917",
"task_name": "Find the K",
"entry_point": "findKOr",
"reference_runtime_ms": 4.573391750454903,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2918, \"task_name\": \"Minimum Equal Sum of Two Arrays After Replacing Zeros\", \"entry_point\": \"minSum\", \"canonical_solution\": \"class Solution:\\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\... | {
"index": "effibench_979",
"split": "train",
"problem_idx": "2918",
"task_name": "Minimum Equal Sum of Two Arrays After Replacing Zeros",
"entry_point": "minSum",
"reference_runtime_ms": 0.07555261254310608,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2925, \"task_name\": \"Maximum Score After Applying Operations on a Tree\", \"entry_point\": \"maximumScoreAfterOperations\", \"canonical_solution\": \"class Solution:\\n def maximumScoreAfterOperations(\\n s... | {
"index": "effibench_980",
"split": "train",
"problem_idx": "2925",
"task_name": "Maximum Score After Applying Operations on a Tree",
"entry_point": "maximumScoreAfterOperations",
"reference_runtime_ms": 0.40125660598278046,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2932, \"task_name\": \"Maximum Strong Pair XOR I\", \"entry_point\": \"maximumStrongPairXor\", \"canonical_solution\": \"class Trie:\\n __slots__ = (\\\"children\\\", \\\"cnt\\\")\\n\\n def __init__(self):\\n ... | {
"index": "effibench_982",
"split": "train",
"problem_idx": "2932",
"task_name": "Maximum Strong Pair XOR I",
"entry_point": "maximumStrongPairXor",
"reference_runtime_ms": 1.3931374996900558,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2933, \"task_name\": \"High\", \"entry_point\": \"findHighAccessEmployees\", \"canonical_solution\": \"class Solution:\\n def findHighAccessEmployees(self, access_times: List[List[str]]) -> List[str]:\\n d = ... | {
"index": "effibench_983",
"split": "train",
"problem_idx": "2933",
"task_name": "High",
"entry_point": "findHighAccessEmployees",
"reference_runtime_ms": 2.5706589221954346,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2934, \"task_name\": \"Minimum Operations to Maximize Last Elements in Arrays\", \"entry_point\": \"minOperations\", \"canonical_solution\": \"class Solution:\\n def minOperations(self, nums1: List[int], nums2: List... | {
"index": "effibench_984",
"split": "train",
"problem_idx": "2934",
"task_name": "Minimum Operations to Maximize Last Elements in Arrays",
"entry_point": "minOperations",
"reference_runtime_ms": 0.11277198791503906,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2935, \"task_name\": \"Maximum Strong Pair XOR II\", \"entry_point\": \"maximumStrongPairXor\", \"canonical_solution\": \"class Trie:\\n __slots__ = (\\\"children\\\", \\\"cnt\\\")\\n\\n def __init__(self):\\n ... | {
"index": "effibench_985",
"split": "train",
"problem_idx": "2935",
"task_name": "Maximum Strong Pair XOR II",
"entry_point": "maximumStrongPairXor",
"reference_runtime_ms": 2.2842027246952057,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2938, \"task_name\": \"Separate Black and White Balls\", \"entry_point\": \"minimumSteps\", \"canonical_solution\": \"class Solution:\\n def minimumSteps(self, s: str) -> int:\\n n = len(s)\\n ans = cn... | {
"index": "effibench_987",
"split": "train",
"problem_idx": "2938",
"task_name": "Separate Black and White Balls",
"entry_point": "minimumSteps",
"reference_runtime_ms": 0.03816746175289154,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2939, \"task_name\": \"Maximum Xor Product\", \"entry_point\": \"maximumXorProduct\", \"canonical_solution\": \"class Solution:\\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\\n mod = 10**9 + ... | {
"index": "effibench_988",
"split": "train",
"problem_idx": "2939",
"task_name": "Maximum Xor Product",
"entry_point": "maximumXorProduct",
"reference_runtime_ms": 0.45314058661460876,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2940, \"task_name\": \"Find Building Where Alice and Bob Can Meet\", \"entry_point\": \"leftmostBuildingQueries\", \"canonical_solution\": \"class BinaryIndexedTree:\\n __slots__ = [\\\"n\\\", \\\"c\\\"]\\n\\n de... | {
"index": "effibench_989",
"split": "train",
"problem_idx": "2940",
"task_name": "Find Building Where Alice and Bob Can Meet",
"entry_point": "leftmostBuildingQueries",
"reference_runtime_ms": 46.1746621876955,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2941, \"task_name\": \"Maximum GCD\", \"entry_point\": \"maxGcdSum\", \"canonical_solution\": \"class Solution:\\n def maxGcdSum(self, nums: List[int], k: int) -> int:\\n s = list(accumulate(nums, initial=0))... | {
"index": "effibench_990",
"split": "train",
"problem_idx": "2941",
"task_name": "Maximum GCD",
"entry_point": "maxGcdSum",
"reference_runtime_ms": 0.38517825305461884,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2943, \"task_name\": \"Maximize Area of Square Hole in Grid\", \"entry_point\": \"maximizeSquareHoleArea\", \"canonical_solution\": \"class Solution:\\n def maximizeSquareHoleArea(\\n self, n: int, m: int, hB... | {
"index": "effibench_991",
"split": "train",
"problem_idx": "2943",
"task_name": "Maximize Area of Square Hole in Grid",
"entry_point": "maximizeSquareHoleArea",
"reference_runtime_ms": 0.4704277962446213,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2945, \"task_name\": \"Find Maximum Non\", \"entry_point\": \"findMaximumLength\", \"canonical_solution\": \"class Solution:\\n def findMaximumLength(self, nums: List[int]) -> int:\\n n = len(nums)\\n ... | {
"index": "effibench_992",
"split": "train",
"problem_idx": "2945",
"task_name": "Find Maximum Non",
"entry_point": "findMaximumLength",
"reference_runtime_ms": 0.2325214445590973,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2948, \"task_name\": \"Make Lexicographically Smallest Array by Swapping Elements\", \"entry_point\": \"lexicographicallySmallestArray\", \"canonical_solution\": \"class Solution:\\n def lexicographicallySmallestArr... | {
"index": "effibench_993",
"split": "train",
"problem_idx": "2948",
"task_name": "Make Lexicographically Smallest Array by Swapping Elements",
"entry_point": "lexicographicallySmallestArray",
"reference_runtime_ms": 0.27565471827983856,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2952, \"task_name\": \"Minimum Number of Coins to be Added\", \"entry_point\": \"minimumAddedCoins\", \"canonical_solution\": \"class Solution:\\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\\... | {
"index": "effibench_994",
"split": "train",
"problem_idx": "2952",
"task_name": "Minimum Number of Coins to be Added",
"entry_point": "minimumAddedCoins",
"reference_runtime_ms": 0.11724606156349182,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2953, \"task_name\": \"Count Complete Substrings\", \"entry_point\": \"countCompleteSubstrings\", \"canonical_solution\": \"class Solution:\\n def countCompleteSubstrings(self, word: str, k: int) -> int:\\n d... | {
"index": "effibench_995",
"split": "train",
"problem_idx": "2953",
"task_name": "Count Complete Substrings",
"entry_point": "countCompleteSubstrings",
"reference_runtime_ms": 0.36506354808807373,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2957, \"task_name\": \"Remove Adjacent Almost\", \"entry_point\": \"removeAlmostEqualCharacters\", \"canonical_solution\": \"class Solution:\\n def removeAlmostEqualCharacters(self, word: str) -> int:\\n ans ... | {
"index": "effibench_996",
"split": "train",
"problem_idx": "2957",
"task_name": "Remove Adjacent Almost",
"entry_point": "removeAlmostEqualCharacters",
"reference_runtime_ms": 0.3962647169828415,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2958, \"task_name\": \"Length of Longest Subarray With at Most K Frequency\", \"entry_point\": \"maxSubarrayLength\", \"canonical_solution\": \"class Solution:\\n def maxSubarrayLength(self, nums: List[int], k: int)... | {
"index": "effibench_997",
"split": "train",
"problem_idx": "2958",
"task_name": "Length of Longest Subarray With at Most K Frequency",
"entry_point": "maxSubarrayLength",
"reference_runtime_ms": 0.1893509179353714,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2962, \"task_name\": \"Count Subarrays Where Max Element Appears at Least K Times\", \"entry_point\": \"countSubarrays\", \"canonical_solution\": \"class Solution:\\n def countSubarrays(self, nums: List[int], k: int... | {
"index": "effibench_998",
"split": "train",
"problem_idx": "2962",
"task_name": "Count Subarrays Where Max Element Appears at Least K Times",
"entry_point": "countSubarrays",
"reference_runtime_ms": 0.07182545959949493,
"reference_memory_mb": 1110.75390625
} |
effibench | [
{
"role": "system",
"content": "You are an expert coding professional. You are given a self-contained code-related task instruction, which could include programming questions to solve, code snippets to analyse or candidates to compare. You should reason step-by-step about the task before arriving at a final... | code | {
"style": "rule",
"extraction_method": "effibench_harness",
"ground_truth": "{\"problem_idx\": 2968, \"task_name\": \"Apply Operations to Maximize Frequency Score\", \"entry_point\": \"maxFrequencyScore\", \"canonical_solution\": \"class Solution:\\n def maxFrequencyScore(self, nums: List[int], k: int) -> int... | {
"index": "effibench_999",
"split": "train",
"problem_idx": "2968",
"task_name": "Apply Operations to Maximize Frequency Score",
"entry_point": "maxFrequencyScore",
"reference_runtime_ms": 0.1515522599220276,
"reference_memory_mb": 1110.75390625
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.