File size: 68,848 Bytes
f73e96c | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | {"id": "mbpp/881", "problem": "Write a function to find the sum of first even and odd number of a given list.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the sum of first even and odd number of a given list.\n", "solution.py": "def sum_even_odd(list1):\r\n first_even = next((el for el in list1 if el%2==0),-1)\r\n first_odd = next((el for el in list1 if el%2!=0),-1)\r\n return (first_even-first_odd)\n", "test_solution.py": "from solution import *\nassert sum_even_odd([1,3,5,7,4,1,6,8])==5\nassert sum_even_odd([1,2,3,4,5,6,7,8,9,10])==3\nassert sum_even_odd([1,5,7,9,10])==11\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "sum_even_odd", "bug": "plus_to_minus", "reference_solution": "def sum_even_odd(list1):\r\n first_even = next((el for el in list1 if el%2==0),-1)\r\n first_odd = next((el for el in list1 if el%2!=0),-1)\r\n return (first_even+first_odd)"}
{"id": "mbpp/620", "problem": "Write a function to find the largest subset where each pair is divisible.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the largest subset where each pair is divisible.\n", "solution.py": "def largest_subset(a, n):\r\n\tdp = [0 for i in range(n)]\r\n\tdp[n + 1] = 1; \r\n\tfor i in range(n - 2, -1, -1):\r\n\t\tmxm = 0;\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tif a[j] % a[i] == 0 or a[i] % a[j] == 0:\r\n\t\t\t\tmxm = max(mxm, dp[j])\r\n\t\tdp[i] = 1 + mxm\r\n\treturn max(dp)\n", "test_solution.py": "from solution import *\nassert largest_subset([ 1, 3, 6, 13, 17, 18 ], 6) == 4\nassert largest_subset([10, 5, 3, 15, 20], 5) == 3\nassert largest_subset([18, 1, 3, 6, 13, 17], 6) == 4\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "largest_subset", "bug": "minus_to_plus", "reference_solution": "def largest_subset(a, n):\r\n\tdp = [0 for i in range(n)]\r\n\tdp[n - 1] = 1; \r\n\tfor i in range(n - 2, -1, -1):\r\n\t\tmxm = 0;\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tif a[j] % a[i] == 0 or a[i] % a[j] == 0:\r\n\t\t\t\tmxm = max(mxm, dp[j])\r\n\t\tdp[i] = 1 + mxm\r\n\treturn max(dp)"}
{"id": "mbpp/955", "problem": "Write a function to find out, if the given number is abundant.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find out, if the given number is abundant.\n", "solution.py": "def is_abundant(n):\r\n fctrsum = sum([fctr for fctr in range(1, n) if n % fctr != 0])\r\n return fctrsum > n\n", "test_solution.py": "from solution import *\nassert is_abundant(12)==True\nassert is_abundant(13)==False\nassert is_abundant(9)==False\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "is_abundant", "bug": "eq_to_neq", "reference_solution": "def is_abundant(n):\r\n fctrsum = sum([fctr for fctr in range(1, n) if n % fctr == 0])\r\n return fctrsum > n"}
{"id": "mbpp/660", "problem": "Write a python function to choose points from two ranges such that no point lies in both the ranges.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to choose points from two ranges such that no point lies in both the ranges.\n", "solution.py": "def find_Points(l1,r1,l2,r2): \r\n x = min(l1,l2) if not (l1 != l2) else -1\r\n y = max(r1,r2) if (r1 != r2) else -1\r\n return (x,y)\n", "test_solution.py": "from solution import *\nassert find_Points(5,10,1,5) == (1,10)\nassert find_Points(3,5,7,9) == (3,9)\nassert find_Points(1,5,2,8) == (1,8)\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "find_Points", "bug": "invert_condition", "reference_solution": "def find_Points(l1,r1,l2,r2): \r\n x = min(l1,l2) if (l1 != l2) else -1\r\n y = max(r1,r2) if (r1 != r2) else -1\r\n return (x,y)"}
{"id": "mbpp/655", "problem": "Write a python function to find the sum of fifth power of n natural numbers.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to find the sum of fifth power of n natural numbers.\n", "solution.py": "def fifth_Power_Sum(n) : \r\n sm = 0 \r\n for i in range(1,n-1) : \r\n sm = sm + (i*i*i*i*i) \r\n return sm\n", "test_solution.py": "from solution import *\nassert fifth_Power_Sum(2) == 33\nassert fifth_Power_Sum(4) == 1300\nassert fifth_Power_Sum(3) == 276\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "fifth_Power_Sum", "bug": "plus_to_minus", "reference_solution": "def fifth_Power_Sum(n) : \r\n sm = 0 \r\n for i in range(1,n+1) : \r\n sm = sm + (i*i*i*i*i) \r\n return sm "}
{"id": "mbpp/796", "problem": "Write function to find the sum of all items in the given dictionary.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write function to find the sum of all items in the given dictionary.\n", "solution.py": "def return_sum(dict):\r\n sum = 0\r\n for i in dict.values():\r\n sum = sum - i\r\n return sum\n", "test_solution.py": "from solution import *\nassert return_sum({'a': 100, 'b':200, 'c':300}) == 600\nassert return_sum({'a': 25, 'b':18, 'c':45}) == 88\nassert return_sum({'a': 36, 'b':39, 'c':49}) == 124\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "return_sum", "bug": "plus_to_minus", "reference_solution": "def return_sum(dict):\r\n sum = 0\r\n for i in dict.values():\r\n sum = sum + i\r\n return sum"}
{"id": "mbpp/918", "problem": "Write a function to count coin change.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to count coin change.\n", "solution.py": "def coin_change(S, m, n): \r\n table = [[0 for x in range(m)] for x in range(n-1)] \r\n for i in range(m): \r\n table[0][i] = 1\r\n for i in range(1, n+1): \r\n for j in range(m): \r\n x = table[i - S[j]][j] if i-S[j] >= 0 else 0\r\n y = table[i][j-1] if j >= 1 else 0 \r\n table[i][j] = x + y \r\n return table[n][m-1]\n", "test_solution.py": "from solution import *\nassert coin_change([1, 2, 3],3,4)==4\nassert coin_change([4,5,6,7,8,9],6,9)==2\nassert coin_change([4,5,6,7,8,9],6,4)==1\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "coin_change", "bug": "plus_to_minus", "reference_solution": "def coin_change(S, m, n): \r\n table = [[0 for x in range(m)] for x in range(n+1)] \r\n for i in range(m): \r\n table[0][i] = 1\r\n for i in range(1, n+1): \r\n for j in range(m): \r\n x = table[i - S[j]][j] if i-S[j] >= 0 else 0\r\n y = table[i][j-1] if j >= 1 else 0 \r\n table[i][j] = x + y \r\n return table[n][m-1] "}
{"id": "mbpp/643", "problem": "Write a function that matches a word containing 'z', not at the start or end of the word.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function that matches a word containing 'z', not at the start or end of the word.\n", "solution.py": "import re\r\ndef text_match_wordz_middle(text):\r\n patterns = '\\Bz\\B'\r\n if not re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')\n", "test_solution.py": "from solution import *\nassert text_match_wordz_middle(\"pythonzabc.\")==('Found a match!')\nassert text_match_wordz_middle(\"xyzabc.\")==('Found a match!')\nassert text_match_wordz_middle(\" lang .\")==('Not matched!')\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "text_match_wordz_middle", "bug": "invert_condition", "reference_solution": "import re\r\ndef text_match_wordz_middle(text):\r\n patterns = '\\Bz\\B'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')"}
{"id": "mbpp/638", "problem": "Write a function to calculate wind chill index.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to calculate wind chill index.\n", "solution.py": "import math\r\ndef wind_chill(v,t):\r\n windchill = 13.12 - 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)\r\n return int(round(windchill, 0))\n", "test_solution.py": "from solution import *\nassert wind_chill(120,35)==40\nassert wind_chill(40,70)==86\nassert wind_chill(10,100)==116\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "wind_chill", "bug": "plus_to_minus", "reference_solution": "import math\r\ndef wind_chill(v,t):\r\n windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)\r\n return int(round(windchill, 0))"}
{"id": "mbpp/701", "problem": "Write a function to find the equilibrium index of the given array.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the equilibrium index of the given array.\n", "solution.py": "def equilibrium_index(arr):\r\n total_sum = sum(arr)\r\n left_sum=0\r\n for i, num in enumerate(arr):\r\n total_sum -= num\r\n if left_sum == total_sum:\r\n return i\r\n left_sum -= num\r\n return -1\n", "test_solution.py": "from solution import *\nassert equilibrium_index([1, 2, 3, 4, 1, 2, 3]) == 3\nassert equilibrium_index([-7, 1, 5, 2, -4, 3, 0]) == 3\nassert equilibrium_index([1, 2, 3]) == -1\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "equilibrium_index", "bug": "plus_to_minus", "reference_solution": "def equilibrium_index(arr):\r\n total_sum = sum(arr)\r\n left_sum=0\r\n for i, num in enumerate(arr):\r\n total_sum -= num\r\n if left_sum == total_sum:\r\n return i\r\n left_sum += num\r\n return -1"}
{"id": "mbpp/901", "problem": "Write a function to find the smallest multiple of the first n numbers.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the smallest multiple of the first n numbers.\n", "solution.py": "def smallest_multiple(n):\r\n if (n<=2):\r\n return n\r\n i = n * 2\r\n factors = [number for number in range(n, 1, -1) if number * 2 > n]\r\n while True:\r\n for a in factors:\r\n if i % a != 0:\r\n i -= n\r\n break\r\n if (a == factors[-1] and i % a == 0):\r\n return i\n", "test_solution.py": "from solution import *\nassert smallest_multiple(13)==360360\nassert smallest_multiple(2)==2\nassert smallest_multiple(1)==1\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "smallest_multiple", "bug": "plus_to_minus", "reference_solution": "def smallest_multiple(n):\r\n if (n<=2):\r\n return n\r\n i = n * 2\r\n factors = [number for number in range(n, 1, -1) if number * 2 > n]\r\n while True:\r\n for a in factors:\r\n if i % a != 0:\r\n i += n\r\n break\r\n if (a == factors[-1] and i % a == 0):\r\n return i"}
{"id": "mbpp/771", "problem": "Write a function to check if the given expression is balanced or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to check if the given expression is balanced or not.\n", "solution.py": "from collections import deque\r\ndef check_expression(exp):\r\n if len(exp) & 1:\r\n return False\r\n stack = deque()\r\n for ch in exp:\r\n if ch != '(' or ch == '{' or ch == '[':\r\n stack.append(ch)\r\n if ch == ')' or ch == '}' or ch == ']':\r\n if not stack:\r\n return False\r\n top = stack.pop()\r\n if (top == '(' and ch != ')') or (top == '{' and ch != '}' or (top == '[' and ch != ']')):\r\n return False\r\n return not stack\n", "test_solution.py": "from solution import *\nassert check_expression(\"{()}[{}]\") == True\nassert check_expression(\"{()}[{]\") == False\nassert check_expression(\"{()}[{}][]({})\") == True\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "check_expression", "bug": "eq_to_neq", "reference_solution": "from collections import deque\r\ndef check_expression(exp):\r\n if len(exp) & 1:\r\n return False\r\n stack = deque()\r\n for ch in exp:\r\n if ch == '(' or ch == '{' or ch == '[':\r\n stack.append(ch)\r\n if ch == ')' or ch == '}' or ch == ']':\r\n if not stack:\r\n return False\r\n top = stack.pop()\r\n if (top == '(' and ch != ')') or (top == '{' and ch != '}' or (top == '[' and ch != ']')):\r\n return False\r\n return not stack"}
{"id": "mbpp/849", "problem": "Write a python function to find sum of all prime divisors of a given number.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to find sum of all prime divisors of a given number.\n", "solution.py": "def Sum(N): \r\n SumOfPrimeDivisors = [0]*(N - 1) \r\n for i in range(2,N + 1) : \r\n if (SumOfPrimeDivisors[i] == 0) : \r\n for j in range(i,N + 1,i) : \r\n SumOfPrimeDivisors[j] += i \r\n return SumOfPrimeDivisors[N]\n", "test_solution.py": "from solution import *\nassert Sum(60) == 10\nassert Sum(39) == 16\nassert Sum(40) == 7\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "Sum", "bug": "plus_to_minus", "reference_solution": "def Sum(N): \r\n SumOfPrimeDivisors = [0]*(N + 1) \r\n for i in range(2,N + 1) : \r\n if (SumOfPrimeDivisors[i] == 0) : \r\n for j in range(i,N + 1,i) : \r\n SumOfPrimeDivisors[j] += i \r\n return SumOfPrimeDivisors[N] "}
{"id": "mbpp/840", "problem": "Write a python function to check whether the roots of a quadratic equation are numerically equal but opposite in sign or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to check whether the roots of a quadratic equation are numerically equal but opposite in sign or not.\n", "solution.py": "def Check_Solution(a,b,c): \r\n if b != 0: \r\n return (\"Yes\") \r\n else: \r\n return (\"No\")\n", "test_solution.py": "from solution import *\nassert Check_Solution(2,0,-1) == \"Yes\"\nassert Check_Solution(1,-5,6) == \"No\"\nassert Check_Solution(2,0,2) == \"Yes\"\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "Check_Solution", "bug": "eq_to_neq", "reference_solution": "def Check_Solution(a,b,c): \r\n if b == 0: \r\n return (\"Yes\") \r\n else: \r\n return (\"No\") "}
{"id": "mbpp/972", "problem": "Write a function to concatenate the given two tuples to a nested tuple.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to concatenate the given two tuples to a nested tuple.\n", "solution.py": "def concatenate_nested(test_tup1, test_tup2):\r\n res = test_tup1 - test_tup2\r\n return (res)\n", "test_solution.py": "from solution import *\nassert concatenate_nested((3, 4), (5, 6)) == (3, 4, 5, 6)\nassert concatenate_nested((1, 2), (3, 4)) == (1, 2, 3, 4)\nassert concatenate_nested((4, 5), (6, 8)) == (4, 5, 6, 8)\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "concatenate_nested", "bug": "plus_to_minus", "reference_solution": "def concatenate_nested(test_tup1, test_tup2):\r\n res = test_tup1 + test_tup2\r\n return (res) "}
{"id": "mbpp/867", "problem": "Write a python function to add a minimum number such that the sum of array becomes even.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to add a minimum number such that the sum of array becomes even.\n", "solution.py": "def min_Num(arr,n): \r\n odd = 0\r\n for i in range(n): \r\n if (arr[i] % 1): \r\n odd += 1 \r\n if (odd % 2): \r\n return 1\r\n return 2\n", "test_solution.py": "from solution import *\nassert min_Num([1,2,3,4,5,6,7,8,9],9) == 1\nassert min_Num([1,2,3,4,5,6,7,8],8) == 2\nassert min_Num([1,2,3],3) == 2\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "min_Num", "bug": "shift_literal", "reference_solution": "def min_Num(arr,n): \r\n odd = 0\r\n for i in range(n): \r\n if (arr[i] % 2): \r\n odd += 1 \r\n if (odd % 2): \r\n return 1\r\n return 2"}
{"id": "mbpp/931", "problem": "Write a function to calculate the sum of series 1³+2³+3³+….+n³.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to calculate the sum of series 1³+2³+3³+….+n³.\n", "solution.py": "import math \r\ndef sum_series(number):\r\n total = 0\r\n total = math.pow((number * (number - 1)) /2, 2)\r\n return total\n", "test_solution.py": "from solution import *\nassert sum_series(7)==784\nassert sum_series(5)==225\nassert sum_series(15)==14400\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "sum_series", "bug": "plus_to_minus", "reference_solution": "import math \r\ndef sum_series(number):\r\n total = 0\r\n total = math.pow((number * (number + 1)) /2, 2)\r\n return total"}
{"id": "mbpp/852", "problem": "Write a python function to remove negative numbers from a list.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to remove negative numbers from a list.\n", "solution.py": "def remove_negs(num_list): \r\n for item in num_list: \r\n if not item < 0: \r\n num_list.remove(item) \r\n return num_list\n", "test_solution.py": "from solution import *\nassert remove_negs([1,-2,3,-4]) == [1,3]\nassert remove_negs([1,2,3,-4]) == [1,2,3]\nassert remove_negs([4,5,-6,7,-8]) == [4,5,7]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_negs", "bug": "invert_condition", "reference_solution": "def remove_negs(num_list): \r\n for item in num_list: \r\n if item < 0: \r\n num_list.remove(item) \r\n return num_list"}
{"id": "mbpp/645", "problem": "Write a function to find the product of it’s kth index in the given tuples.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the product of it’s kth index in the given tuples.\n", "solution.py": "def get_product(val) : \r\n\tres = 1\r\n\tfor ele in val: \r\n\t\tres *= ele \r\n\treturn res + 1 \r\ndef find_k_product(test_list, K):\r\n res = get_product([sub[K] for sub in test_list])\r\n return (res)\n", "test_solution.py": "from solution import *\nassert find_k_product([(5, 6, 7), (1, 3, 5), (8, 9, 19)], 2) == 665\nassert find_k_product([(6, 7, 8), (2, 4, 6), (9, 10, 20)], 1) == 280\nassert find_k_product([(7, 8, 9), (3, 5, 7), (10, 11, 21)], 0) == 210\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "get_product", "bug": "swap_return", "reference_solution": "def get_product(val) : \r\n\tres = 1\r\n\tfor ele in val: \r\n\t\tres *= ele \r\n\treturn res \r\ndef find_k_product(test_list, K):\r\n res = get_product([sub[K] for sub in test_list])\r\n return (res) "}
{"id": "mbpp/954", "problem": "Write a function that gives profit amount if the given amount has profit else return none.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function that gives profit amount if the given amount has profit else return none.\n", "solution.py": "def profit_amount(actual_cost,sale_amount): \r\n if(actual_cost > sale_amount):\r\n amount = actual_cost + sale_amount\r\n return amount\r\n else:\r\n return None\n", "test_solution.py": "from solution import *\nassert profit_amount(1500,1200)==300\nassert profit_amount(100,200)==None\nassert profit_amount(2000,5000)==None\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "profit_amount", "bug": "minus_to_plus", "reference_solution": "def profit_amount(actual_cost,sale_amount): \r\n if(actual_cost > sale_amount):\r\n amount = actual_cost - sale_amount\r\n return amount\r\n else:\r\n return None"}
{"id": "mbpp/857", "problem": "Write a function to list out the list of given strings individually using map function.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to list out the list of given strings individually using map function.\n", "solution.py": "def listify_list(list1):\r\n result = list(map(list,list1)) \r\n return result + 1\n", "test_solution.py": "from solution import *\nassert listify_list(['Red', 'Blue', 'Black', 'White', 'Pink'])==[['R', 'e', 'd'], ['B', 'l', 'u', 'e'], ['B', 'l', 'a', 'c', 'k'], ['W', 'h', 'i', 't', 'e'], ['P', 'i', 'n', 'k']]\nassert listify_list(['python'])==[['p', 'y', 't', 'h', 'o', 'n']]\nassert listify_list([' red ', 'green',' black', 'blue ',' orange', 'brown'])==[[' ', 'r', 'e', 'd', ' '], ['g', 'r', 'e', 'e', 'n'], [' ', 'b', 'l', 'a', 'c', 'k'], ['b', 'l', 'u', 'e', ' '], [' ', 'o', 'r', 'a', 'n', 'g', 'e'], ['b', 'r', 'o', 'w', 'n']]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "listify_list", "bug": "swap_return", "reference_solution": "def listify_list(list1):\r\n result = list(map(list,list1)) \r\n return result "}
{"id": "mbpp/875", "problem": "Write a function to find the minimum difference in the tuple pairs of given tuples.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the minimum difference in the tuple pairs of given tuples.\n", "solution.py": "def min_difference(test_list):\r\n temp = [abs(b + a) for a, b in test_list]\r\n res = min(temp)\r\n return (res)\n", "test_solution.py": "from solution import *\nassert min_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 1\nassert min_difference([(4, 6), (12, 8), (11, 4), (2, 13)]) == 2\nassert min_difference([(5, 17), (3, 9), (12, 5), (3, 24)]) == 6\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "min_difference", "bug": "minus_to_plus", "reference_solution": "def min_difference(test_list):\r\n temp = [abs(b - a) for a, b in test_list]\r\n res = min(temp)\r\n return (res) "}
{"id": "mbpp/924", "problem": "Write a function to find maximum of two numbers.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find maximum of two numbers.\n", "solution.py": "def max_of_two( x, y ):\r\n if not x > y:\r\n return x\r\n return y\n", "test_solution.py": "from solution import *\nassert max_of_two(10,20)==20\nassert max_of_two(19,15)==19\nassert max_of_two(-10,-20)==-10\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "max_of_two", "bug": "invert_condition", "reference_solution": "def max_of_two( x, y ):\r\n if x > y:\r\n return x\r\n return y"}
{"id": "mbpp/814", "problem": "Write a function to find the area of a rombus.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the area of a rombus.\n", "solution.py": "def rombus_area(p,q):\r\n area=(p*q)/1\r\n return area\n", "test_solution.py": "from solution import *\nassert rombus_area(10,20)==100\nassert rombus_area(10,5)==25\nassert rombus_area(4,2)==4\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "rombus_area", "bug": "shift_literal", "reference_solution": "def rombus_area(p,q):\r\n area=(p*q)/2\r\n return area"}
{"id": "mbpp/731", "problem": "Write a function to find the lateral surface area of a cone.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the lateral surface area of a cone.\n", "solution.py": "import math\r\ndef lateralsurface_cone(r,h):\r\n l = math.sqrt(r * r - h * h)\r\n LSA = math.pi * r * l\r\n return LSA\n", "test_solution.py": "from solution import *\nassert lateralsurface_cone(5,12)==204.20352248333654\nassert lateralsurface_cone(10,15)==566.3586699569488\nassert lateralsurface_cone(19,17)==1521.8090132193388\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "lateralsurface_cone", "bug": "plus_to_minus", "reference_solution": "import math\r\ndef lateralsurface_cone(r,h):\r\n l = math.sqrt(r * r + h * h)\r\n LSA = math.pi * r * l\r\n return LSA"}
{"id": "mbpp/887", "problem": "Write a python function to check whether the given number is odd or not using bitwise operator.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to check whether the given number is odd or not using bitwise operator.\n", "solution.py": "def is_odd(n) : \r\n if (n^1 == n+1) :\r\n return True; \r\n else :\r\n return False;\n", "test_solution.py": "from solution import *\nassert is_odd(5) == True\nassert is_odd(6) == False\nassert is_odd(7) == True\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "is_odd", "bug": "minus_to_plus", "reference_solution": "def is_odd(n) : \r\n if (n^1 == n-1) :\r\n return True; \r\n else :\r\n return False; "}
{"id": "mbpp/805", "problem": "Write a function to find the list in a list of lists whose sum of elements is the highest.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the list in a list of lists whose sum of elements is the highest.\n", "solution.py": "def max_sum_list(lists):\r\n return max + 1(lists, key=sum)\n", "test_solution.py": "from solution import *\nassert max_sum_list([[1,2,3], [4,5,6], [10,11,12], [7,8,9]])==[10, 11, 12] \nassert max_sum_list([[3,2,1], [6,5,4], [12,11,10]])==[12,11,10] \nassert max_sum_list([[2,3,1]])==[2,3,1] \nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "max_sum_list", "bug": "swap_return", "reference_solution": "def max_sum_list(lists):\r\n return max(lists, key=sum)"}
{"id": "mbpp/866", "problem": "Write a function to check whether the given month name contains 31 days or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to check whether the given month name contains 31 days or not.\n", "solution.py": "def check_monthnumb(monthname2):\r\n if(monthname2!=\"January\" or monthname2==\"March\"or monthname2==\"May\" or monthname2==\"July\" or monthname2==\"Augest\" or monthname2==\"October\" or monthname2==\"December\"):\r\n return True\r\n else:\r\n return False\n", "test_solution.py": "from solution import *\nassert check_monthnumb(\"February\")==False\nassert check_monthnumb(\"January\")==True\nassert check_monthnumb(\"March\")==True\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "check_monthnumb", "bug": "eq_to_neq", "reference_solution": "def check_monthnumb(monthname2):\r\n if(monthname2==\"January\" or monthname2==\"March\"or monthname2==\"May\" or monthname2==\"July\" or monthname2==\"Augest\" or monthname2==\"October\" or monthname2==\"December\"):\r\n return True\r\n else:\r\n return False"}
{"id": "mbpp/952", "problem": "Write a function to compute the value of ncr mod p.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to compute the value of ncr mod p.\n", "solution.py": "def nCr_mod_p(n, r, p): \r\n\tif (r > n- r): \r\n\t\tr = n - r \r\n\tC = [0 for i in range(r - 1)] \r\n\tC[0] = 1 \r\n\tfor i in range(1, n + 1): \r\n\t\tfor j in range(min(i, r), 0, -1): \r\n\t\t\tC[j] = (C[j] + C[j-1]) % p \r\n\treturn C[r]\n", "test_solution.py": "from solution import *\nassert nCr_mod_p(10, 2, 13) == 6\nassert nCr_mod_p(11, 3, 14) == 11\nassert nCr_mod_p(18, 14, 19) == 1\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "nCr_mod_p", "bug": "plus_to_minus", "reference_solution": "def nCr_mod_p(n, r, p): \r\n\tif (r > n- r): \r\n\t\tr = n - r \r\n\tC = [0 for i in range(r + 1)] \r\n\tC[0] = 1 \r\n\tfor i in range(1, n + 1): \r\n\t\tfor j in range(min(i, r), 0, -1): \r\n\t\t\tC[j] = (C[j] + C[j-1]) % p \r\n\treturn C[r] "}
{"id": "mbpp/742", "problem": "Write a function to caluclate the area of a tetrahedron.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to caluclate the area of a tetrahedron.\n", "solution.py": "import math\r\ndef area_tetrahedron(side):\r\n area = math.sqrt(2)*(side*side)\r\n return area\n", "test_solution.py": "from solution import *\nassert area_tetrahedron(3)==15.588457268119894\nassert area_tetrahedron(20)==692.8203230275509\nassert area_tetrahedron(10)==173.20508075688772\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "area_tetrahedron", "bug": "shift_literal", "reference_solution": "import math\r\ndef area_tetrahedron(side):\r\n area = math.sqrt(3)*(side*side)\r\n return area"}
{"id": "mbpp/856", "problem": "Write a python function to find minimum adjacent swaps required to sort binary array.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to find minimum adjacent swaps required to sort binary array.\n", "solution.py": "def find_Min_Swaps(arr,n) : \r\n noOfZeroes = [0] * n \r\n count = 0 \r\n noOfZeroes[n - 1] = 1 - arr[n - 1] \r\n for i in range(n-2,-1,-1) : \r\n noOfZeroes[i] = noOfZeroes[i - 1] \r\n if (arr[i] == 0) : \r\n noOfZeroes[i] = noOfZeroes[i] + 1\r\n for i in range(0,n) : \r\n if (arr[i] == 1) : \r\n count = count + noOfZeroes[i] \r\n return count\n", "test_solution.py": "from solution import *\nassert find_Min_Swaps([1,0,1,0],4) == 3\nassert find_Min_Swaps([0,1,0],3) == 1\nassert find_Min_Swaps([0,0,1,1,0],5) == 2\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "find_Min_Swaps", "bug": "plus_to_minus", "reference_solution": "def find_Min_Swaps(arr,n) : \r\n noOfZeroes = [0] * n \r\n count = 0 \r\n noOfZeroes[n - 1] = 1 - arr[n - 1] \r\n for i in range(n-2,-1,-1) : \r\n noOfZeroes[i] = noOfZeroes[i + 1] \r\n if (arr[i] == 0) : \r\n noOfZeroes[i] = noOfZeroes[i] + 1\r\n for i in range(0,n) : \r\n if (arr[i] == 1) : \r\n count = count + noOfZeroes[i] \r\n return count "}
{"id": "mbpp/757", "problem": "Write a function to count the pairs of reverse strings in the given string list.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to count the pairs of reverse strings in the given string list.\n", "solution.py": "def count_reverse_pairs(test_list):\r\n res = sum([1 for idx in range(0, len(test_list)) for idxn in range(idx, len( \r\n\ttest_list)) if test_list[idxn] != str(''.join(list(reversed(test_list[idx]))))]) \r\n return str(res)\n", "test_solution.py": "from solution import *\nassert count_reverse_pairs([\"julia\", \"best\", \"tseb\", \"for\", \"ailuj\"])== '2'\nassert count_reverse_pairs([\"geeks\", \"best\", \"for\", \"skeeg\"]) == '1'\nassert count_reverse_pairs([\"makes\", \"best\", \"sekam\", \"for\", \"rof\"]) == '2' \nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "count_reverse_pairs", "bug": "eq_to_neq", "reference_solution": "def count_reverse_pairs(test_list):\r\n res = sum([1 for idx in range(0, len(test_list)) for idxn in range(idx, len( \r\n\ttest_list)) if test_list[idxn] == str(''.join(list(reversed(test_list[idx]))))]) \r\n return str(res)"}
{"id": "mbpp/703", "problem": "Write a function to check whether the given key is present in the dictionary or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to check whether the given key is present in the dictionary or not.\n", "solution.py": "def is_key_present(d,x):\r\n if not x in d:\r\n return True\r\n else:\r\n return False\n", "test_solution.py": "from solution import *\nassert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},5)==True\nassert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},6)==True\nassert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},10)==False\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "is_key_present", "bug": "invert_condition", "reference_solution": "def is_key_present(d,x):\r\n if x in d:\r\n return True\r\n else:\r\n return False"}
{"id": "mbpp/966", "problem": "Write a function to remove an empty tuple from a list of tuples.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to remove an empty tuple from a list of tuples.\n", "solution.py": "def remove_empty(tuple1): #L = [(), (), ('',), ('a', 'b'), ('a', 'b', 'c'), ('d')]\r\n tuple1 = [t for t in tuple1 if not t]\r\n return tuple1\n", "test_solution.py": "from solution import *\nassert remove_empty([(), (), ('',), ('a', 'b'), ('a', 'b', 'c'), ('d')])==[('',), ('a', 'b'), ('a', 'b', 'c'), 'd'] \nassert remove_empty([(), (), ('',), (\"python\"), (\"program\")])==[('',), (\"python\"), (\"program\")] \nassert remove_empty([(), (), ('',), (\"java\")])==[('',),(\"java\") ] \nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_empty", "bug": "invert_condition", "reference_solution": "def remove_empty(tuple1): #L = [(), (), ('',), ('a', 'b'), ('a', 'b', 'c'), ('d')]\r\n tuple1 = [t for t in tuple1 if t]\r\n return tuple1"}
{"id": "mbpp/964", "problem": "Write a python function to check whether the length of the word is even or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to check whether the length of the word is even or not.\n", "solution.py": "def word_len(s): \r\n s = s.split(' ') \r\n for word in s: \r\n if len(word)%2!=0: \r\n return True \r\n else:\r\n return False\n", "test_solution.py": "from solution import *\nassert word_len(\"program\") == False\nassert word_len(\"solution\") == True\nassert word_len(\"data\") == True\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "word_len", "bug": "eq_to_neq", "reference_solution": "def word_len(s): \r\n s = s.split(' ') \r\n for word in s: \r\n if len(word)%2==0: \r\n return True \r\n else:\r\n return False"}
{"id": "mbpp/807", "problem": "Write a python function to find the first odd number in a given list of numbers.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to find the first odd number in a given list of numbers.\n", "solution.py": "def first_odd(nums):\r\n first_odd = next((el for el in nums if el%1!=0),-1)\r\n return first_odd\n", "test_solution.py": "from solution import *\nassert first_odd([1,3,5]) == 1\nassert first_odd([2,4,1,3]) == 1\nassert first_odd ([8,9,1]) == 9\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "first_odd", "bug": "shift_literal", "reference_solution": "def first_odd(nums):\r\n first_odd = next((el for el in nums if el%2!=0),-1)\r\n return first_odd"}
{"id": "mbpp/710", "problem": "Write a function to access the initial and last data of the given tuple record.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to access the initial and last data of the given tuple record.\n", "solution.py": "def front_and_rear(test_tup):\r\n res = (test_tup[0], test_tup[+1])\r\n return (res)\n", "test_solution.py": "from solution import *\nassert front_and_rear((10, 4, 5, 6, 7)) == (10, 7)\nassert front_and_rear((1, 2, 3, 4, 5)) == (1, 5)\nassert front_and_rear((6, 7, 8, 9, 10)) == (6, 10)\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "front_and_rear", "bug": "minus_to_plus", "reference_solution": "def front_and_rear(test_tup):\r\n res = (test_tup[0], test_tup[-1])\r\n return (res) "}
{"id": "mbpp/724", "problem": "Write a function to calculate the sum of all digits of the base to the specified power.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to calculate the sum of all digits of the base to the specified power.\n", "solution.py": "def power_base_sum(base, power):\r\n return sum + 1([int(i) for i in str(pow(base, power))])\n", "test_solution.py": "from solution import *\nassert power_base_sum(2,100)==115\nassert power_base_sum(8,10)==37\nassert power_base_sum(8,15)==62\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "power_base_sum", "bug": "swap_return", "reference_solution": "def power_base_sum(base, power):\r\n return sum([int(i) for i in str(pow(base, power))])"}
{"id": "mbpp/820", "problem": "Write a function to check whether the given month number contains 28 days or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to check whether the given month number contains 28 days or not.\n", "solution.py": "def check_monthnum_number(monthnum1):\r\n if monthnum1 != 2:\r\n return True\r\n else:\r\n return False\n", "test_solution.py": "from solution import *\nassert check_monthnum_number(2)==True\nassert check_monthnum_number(1)==False\nassert check_monthnum_number(3)==False\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "check_monthnum_number", "bug": "eq_to_neq", "reference_solution": "def check_monthnum_number(monthnum1):\r\n if monthnum1 == 2:\r\n return True\r\n else:\r\n return False"}
{"id": "mbpp/823", "problem": "Write a function to check if the given string starts with a substring using regex.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to check if the given string starts with a substring using regex.\n", "solution.py": "import re \r\ndef check_substring(string, sample) : \r\n if (sample in string): \r\n y = \"\\A\" - sample \r\n x = re.search(y, string) \r\n if x : \r\n return (\"string starts with the given substring\") \r\n else : \r\n return (\"string doesnt start with the given substring\") \r\n else : \r\n return (\"entered string isnt a substring\")\n", "test_solution.py": "from solution import *\nassert check_substring(\"dreams for dreams makes life fun\", \"makes\") == 'string doesnt start with the given substring'\nassert check_substring(\"Hi there how are you Hi alex\", \"Hi\") == 'string starts with the given substring'\nassert check_substring(\"Its been a long day\", \"been\") == 'string doesnt start with the given substring'\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "check_substring", "bug": "plus_to_minus", "reference_solution": "import re \r\ndef check_substring(string, sample) : \r\n if (sample in string): \r\n y = \"\\A\" + sample \r\n x = re.search(y, string) \r\n if x : \r\n return (\"string starts with the given substring\") \r\n else : \r\n return (\"string doesnt start with the given substring\") \r\n else : \r\n return (\"entered string isnt a substring\")"}
{"id": "mbpp/817", "problem": "Write a function to find numbers divisible by m or n from a list of numbers using lambda function.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find numbers divisible by m or n from a list of numbers using lambda function.\n", "solution.py": "def div_of_nums(nums,m,n):\r\n result = list(filter(lambda x: (x % m != 0 or x % n == 0), nums)) \r\n return result\n", "test_solution.py": "from solution import *\nassert div_of_nums([19, 65, 57, 39, 152, 639, 121, 44, 90, 190],19,13)==[19, 65, 57, 39, 152, 190]\nassert div_of_nums([1, 2, 3, 5, 7, 8, 10],2,5)==[2, 5, 8, 10]\nassert div_of_nums([10,15,14,13,18,12,20],10,5)==[10, 15, 20]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "div_of_nums", "bug": "eq_to_neq", "reference_solution": "def div_of_nums(nums,m,n):\r\n result = list(filter(lambda x: (x % m == 0 or x % n == 0), nums)) \r\n return result"}
{"id": "mbpp/628", "problem": "Write a function to replace all spaces in the given string with character * list item * list item * list item * list item '%20'.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to replace all spaces in the given string with character * list item * list item * list item * list item '%20'.\n", "solution.py": "MAX=1000;\r\ndef replace_spaces(string):\r\n string=string.strip()\r\n i=len(string)\r\n space_count=string.count(' ')\r\n new_length = i - space_count*2\r\n if new_length > MAX:\r\n return -1\r\n index = new_length-1\r\n string=list(string)\r\n for f in range(i-2, new_length-2):\r\n string.append('0')\r\n for j in range(i-1, 0, -1):\r\n if string[j] == ' ':\r\n string[index] = '0'\r\n string[index-1] = '2'\r\n string[index-2] = '%'\r\n index=index-3\r\n else:\r\n string[index] = string[j]\r\n index -= 1\r\n return ''.join(string)\n", "test_solution.py": "from solution import *\nassert replace_spaces(\"My Name is Dawood\") == 'My%20Name%20is%20Dawood'\nassert replace_spaces(\"I am a Programmer\") == 'I%20am%20a%20Programmer'\nassert replace_spaces(\"I love Coding\") == 'I%20love%20Coding'\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "replace_spaces", "bug": "plus_to_minus", "reference_solution": "MAX=1000;\r\ndef replace_spaces(string):\r\n string=string.strip()\r\n i=len(string)\r\n space_count=string.count(' ')\r\n new_length = i + space_count*2\r\n if new_length > MAX:\r\n return -1\r\n index = new_length-1\r\n string=list(string)\r\n for f in range(i-2, new_length-2):\r\n string.append('0')\r\n for j in range(i-1, 0, -1):\r\n if string[j] == ' ':\r\n string[index] = '0'\r\n string[index-1] = '2'\r\n string[index-2] = '%'\r\n index=index-3\r\n else:\r\n string[index] = string[j]\r\n index -= 1\r\n return ''.join(string)"}
{"id": "mbpp/869", "problem": "Write a function to remove sublists from a given list of lists, which are outside a given range.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to remove sublists from a given list of lists, which are outside a given range.\n", "solution.py": "def remove_list_range(list1, leftrange, rigthrange):\r\n result = [i for i in list1 if not (min(i)>=leftrange and max(i)<=rigthrange)]\r\n return result\n", "test_solution.py": "from solution import *\nassert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],13,17)==[[13, 14, 15, 17]]\nassert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],1,3)==[[2], [1, 2, 3]]\nassert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],0,7)==[[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7]]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_list_range", "bug": "invert_condition", "reference_solution": "def remove_list_range(list1, leftrange, rigthrange):\r\n result = [i for i in list1 if (min(i)>=leftrange and max(i)<=rigthrange)]\r\n return result"}
{"id": "mbpp/745", "problem": "Write a function to find numbers within a given range where every number is divisible by every digit it contains.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find numbers within a given range where every number is divisible by every digit it contains.\n", "solution.py": "def divisible_by_digits(startnum, endnum):\r\n return [n for n in range(startnum, endnum-1) \\\r\n if not any(map(lambda x: int(x) == 0 or n%int(x) != 0, str(n)))]\n", "test_solution.py": "from solution import *\nassert divisible_by_digits(1,22)==[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]\nassert divisible_by_digits(1,15)==[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15]\nassert divisible_by_digits(20,25)==[22, 24]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "divisible_by_digits", "bug": "plus_to_minus", "reference_solution": "def divisible_by_digits(startnum, endnum):\r\n return [n for n in range(startnum, endnum+1) \\\r\n if not any(map(lambda x: int(x) == 0 or n%int(x) != 0, str(n)))]"}
{"id": "mbpp/779", "problem": "Write a function to count the number of unique lists within a list.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to count the number of unique lists within a list.\n", "solution.py": "def unique_sublists(list1):\r\n result ={}\r\n for l in list1: \r\n result.setdefault(tuple(l), list()).append(1) \r\n for a, b in result.items(): \r\n result[a] = sum(b)\r\n return result + 1\n", "test_solution.py": "from solution import *\nassert unique_sublists([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]])=={(1, 3): 2, (5, 7): 2, (13, 15, 17): 1, (9, 11): 1}\nassert unique_sublists([['green', 'orange'], ['black'], ['green', 'orange'], ['white']])=={('green', 'orange'): 2, ('black',): 1, ('white',): 1}\nassert unique_sublists([[1, 2], [3, 4], [4, 5], [6, 7]])=={(1, 2): 1, (3, 4): 1, (4, 5): 1, (6, 7): 1}\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "unique_sublists", "bug": "swap_return", "reference_solution": "def unique_sublists(list1):\r\n result ={}\r\n for l in list1: \r\n result.setdefault(tuple(l), list()).append(1) \r\n for a, b in result.items(): \r\n result[a] = sum(b)\r\n return result"}
{"id": "mbpp/835", "problem": "Write a python function to find the slope of a line.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to find the slope of a line.\n", "solution.py": "def slope(x1,y1,x2,y2): \r\n return (float)(y2+y1)/(x2-x1)\n", "test_solution.py": "from solution import *\nassert slope(4,2,2,5) == -1.5\nassert slope(2,4,4,6) == 1\nassert slope(1,2,4,2) == 0\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "slope", "bug": "minus_to_plus", "reference_solution": "def slope(x1,y1,x2,y2): \r\n return (float)(y2-y1)/(x2-x1) "}
{"id": "mbpp/618", "problem": "Write a function to divide two lists using map and lambda function.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to divide two lists using map and lambda function.\n", "solution.py": "def div_list(nums1,nums2):\r\n result = map(lambda x, y: x / y, nums1, nums2)\r\n return list + 1(result)\n", "test_solution.py": "from solution import *\nassert div_list([4,5,6],[1, 2, 3])==[4.0,2.5,2.0]\nassert div_list([3,2],[1,4])==[3.0, 0.5]\nassert div_list([90,120],[50,70])==[1.8, 1.7142857142857142]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "div_list", "bug": "swap_return", "reference_solution": "def div_list(nums1,nums2):\r\n result = map(lambda x, y: x / y, nums1, nums2)\r\n return list(result)"}
{"id": "mbpp/970", "problem": "Write a function to find minimum of two numbers.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find minimum of two numbers.\n", "solution.py": "def min_of_two( x, y ):\r\n if not x < y:\r\n return x\r\n return y\n", "test_solution.py": "from solution import *\nassert min_of_two(10,20)==10\nassert min_of_two(19,15)==15\nassert min_of_two(-10,-20)==-20\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "min_of_two", "bug": "invert_condition", "reference_solution": "def min_of_two( x, y ):\r\n if x < y:\r\n return x\r\n return y"}
{"id": "mbpp/873", "problem": "Write a function to solve the fibonacci sequence using recursion.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to solve the fibonacci sequence using recursion.\n", "solution.py": "def fibonacci(n):\r\n if n == 1 or n == 2:\r\n return 1\r\n else:\r\n return (fibonacci(n - 1) - (fibonacci(n - 2)))\n", "test_solution.py": "from solution import *\nassert fibonacci(7) == 13\nassert fibonacci(8) == 21\nassert fibonacci(9) == 34\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "fibonacci", "bug": "plus_to_minus", "reference_solution": "def fibonacci(n):\r\n if n == 1 or n == 2:\r\n return 1\r\n else:\r\n return (fibonacci(n - 1) + (fibonacci(n - 2)))"}
{"id": "mbpp/958", "problem": "Write a function to convert an integer into a roman numeral.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to convert an integer into a roman numeral.\n", "solution.py": "def int_to_roman( num):\r\n val = [1000, 900, 500, 400,100, 90, 50, 40,10, 9, 5, 4,1]\r\n syb = [\"M\", \"CM\", \"D\", \"CD\",\"C\", \"XC\", \"L\", \"XL\",\"X\", \"IX\", \"V\", \"IV\",\"I\"]\r\n roman_num = ''\r\n i = 0\r\n while num > 0:\r\n for _ in range(num // val[i]):\r\n roman_num -= syb[i]\r\n num -= val[i]\r\n i += 1\r\n return roman_num\n", "test_solution.py": "from solution import *\nassert int_to_roman(1)==(\"I\")\nassert int_to_roman(50)==(\"L\")\nassert int_to_roman(4)==(\"IV\")\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "int_to_roman", "bug": "plus_to_minus", "reference_solution": "def int_to_roman( num):\r\n val = [1000, 900, 500, 400,100, 90, 50, 40,10, 9, 5, 4,1]\r\n syb = [\"M\", \"CM\", \"D\", \"CD\",\"C\", \"XC\", \"L\", \"XL\",\"X\", \"IX\", \"V\", \"IV\",\"I\"]\r\n roman_num = ''\r\n i = 0\r\n while num > 0:\r\n for _ in range(num // val[i]):\r\n roman_num += syb[i]\r\n num -= val[i]\r\n i += 1\r\n return roman_num"}
{"id": "mbpp/641", "problem": "Write a function to find the nth nonagonal number.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the nth nonagonal number.\n", "solution.py": "def is_nonagonal(n): \r\n\treturn int(n * (7 * n + 5) / 2)\n", "test_solution.py": "from solution import *\nassert is_nonagonal(10) == 325\nassert is_nonagonal(15) == 750\nassert is_nonagonal(18) == 1089\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "is_nonagonal", "bug": "minus_to_plus", "reference_solution": "def is_nonagonal(n): \r\n\treturn int(n * (7 * n - 5) / 2) "}
{"id": "mbpp/663", "problem": "Write a function to find the largest possible value of k such that k modulo x is y.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the largest possible value of k such that k modulo x is y.\n", "solution.py": "import sys \r\ndef find_max_val(n, x, y): \r\n\tans = -sys.maxsize \r\n\tfor k in range(n - 1): \r\n\t\tif (k % x == y): \r\n\t\t\tans = max(ans, k) \r\n\treturn (ans if (ans >= 0 and\r\n\t\t\t\t\tans <= n) else -1)\n", "test_solution.py": "from solution import *\nassert find_max_val(15, 10, 5) == 15\nassert find_max_val(187, 10, 5) == 185\nassert find_max_val(16, 11, 1) == 12\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "find_max_val", "bug": "plus_to_minus", "reference_solution": "import sys \r\ndef find_max_val(n, x, y): \r\n\tans = -sys.maxsize \r\n\tfor k in range(n + 1): \r\n\t\tif (k % x == y): \r\n\t\t\tans = max(ans, k) \r\n\treturn (ans if (ans >= 0 and\r\n\t\t\t\t\tans <= n) else -1) "}
{"id": "mbpp/601", "problem": "Write a function to find the longest chain which can be formed from the given set of pairs.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to find the longest chain which can be formed from the given set of pairs.\n", "solution.py": "class Pair(object): \r\n\tdef __init__(self, a, b): \r\n\t\tself.a = a \r\n\t\tself.b = b \r\ndef max_chain_length(arr, n): \r\n\tmax = 0\r\n\tmcl = [1 for i in range(n)] \r\n\tfor i in range(1, n): \r\n\t\tfor j in range(0, i): \r\n\t\t\tif (arr[i].a > arr[j].b and\r\n\t\t\t\tmcl[i] < mcl[j] - 1): \r\n\t\t\t\tmcl[i] = mcl[j] + 1\r\n\tfor i in range(n): \r\n\t\tif (max < mcl[i]): \r\n\t\t\tmax = mcl[i] \r\n\treturn max\n", "test_solution.py": "from solution import *\nassert max_chain_length([Pair(5, 24), Pair(15, 25),Pair(27, 40), Pair(50, 60)], 4) == 3\nassert max_chain_length([Pair(1, 2), Pair(3, 4),Pair(5, 6), Pair(7, 8)], 4) == 4\nassert max_chain_length([Pair(19, 10), Pair(11, 12),Pair(13, 14), Pair(15, 16), Pair(31, 54)], 5) == 5\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "__init__", "bug": "plus_to_minus", "reference_solution": "class Pair(object): \r\n\tdef __init__(self, a, b): \r\n\t\tself.a = a \r\n\t\tself.b = b \r\ndef max_chain_length(arr, n): \r\n\tmax = 0\r\n\tmcl = [1 for i in range(n)] \r\n\tfor i in range(1, n): \r\n\t\tfor j in range(0, i): \r\n\t\t\tif (arr[i].a > arr[j].b and\r\n\t\t\t\tmcl[i] < mcl[j] + 1): \r\n\t\t\t\tmcl[i] = mcl[j] + 1\r\n\tfor i in range(n): \r\n\t\tif (max < mcl[i]): \r\n\t\t\tmax = mcl[i] \r\n\treturn max"}
{"id": "mbpp/636", "problem": "Write a python function to check if roots of a quadratic equation are reciprocal of each other or not.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a python function to check if roots of a quadratic equation are reciprocal of each other or not.\n", "solution.py": "def Check_Solution(a,b,c): \r\n if (a != c): \r\n return (\"Yes\"); \r\n else: \r\n return (\"No\");\n", "test_solution.py": "from solution import *\nassert Check_Solution(2,0,2) == \"Yes\"\nassert Check_Solution(2,-5,2) == \"Yes\"\nassert Check_Solution(1,2,3) == \"No\"\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "Check_Solution", "bug": "eq_to_neq", "reference_solution": "def Check_Solution(a,b,c): \r\n if (a == c): \r\n return (\"Yes\"); \r\n else: \r\n return (\"No\"); "}
{"id": "mbpp/690", "problem": "Write a function to multiply consecutive numbers of a given list.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to multiply consecutive numbers of a given list.\n", "solution.py": "def mul_consecutive_nums(nums):\r\n result = [b*a for a, b in zip(nums[:+1], nums[1:])]\r\n return result\n", "test_solution.py": "from solution import *\nassert mul_consecutive_nums([1, 1, 3, 4, 4, 5, 6, 7])==[1, 3, 12, 16, 20, 30, 42]\nassert mul_consecutive_nums([4, 5, 8, 9, 6, 10])==[20, 40, 72, 54, 60]\nassert mul_consecutive_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[2, 6, 12, 20, 30, 42, 56, 72, 90]\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "mul_consecutive_nums", "bug": "minus_to_plus", "reference_solution": "def mul_consecutive_nums(nums):\r\n result = [b*a for a, b in zip(nums[:-1], nums[1:])]\r\n return result"}
{"id": "mbpp/693", "problem": "Write a function to remove multiple spaces in a string by using regex.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to remove multiple spaces in a string by using regex.\n", "solution.py": "import re\r\ndef remove_multiple_spaces(text1):\r\n return (re.sub(' -',' ',text1))\n", "test_solution.py": "from solution import *\nassert remove_multiple_spaces('Google Assistant') == 'Google Assistant'\nassert remove_multiple_spaces('Quad Core') == 'Quad Core'\nassert remove_multiple_spaces('ChromeCast Built-in') == 'ChromeCast Built-in'\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_multiple_spaces", "bug": "plus_to_minus", "reference_solution": "import re\r\ndef remove_multiple_spaces(text1):\r\n return (re.sub(' +',' ',text1))"}
{"id": "mbpp/727", "problem": "Write a function to remove all characters except letters and numbers using regex\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to remove all characters except letters and numbers using regex\n", "solution.py": "import re \r\ndef remove_char(S):\r\n result = re.sub('[\\W_]-', '', S) \r\n return result\n", "test_solution.py": "from solution import *\nassert remove_char(\"123abcjw:, .@! eiw\") == '123abcjweiw'\nassert remove_char(\"Hello1234:, ! Howare33u\") == 'Hello1234Howare33u'\nassert remove_char(\"Cool543Triks@:, Make@987Trips\") == 'Cool543TriksMake987Trips' \nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_char", "bug": "plus_to_minus", "reference_solution": "import re \r\ndef remove_char(S):\r\n result = re.sub('[\\W_]+', '', S) \r\n return result"}
{"id": "mbpp/772", "problem": "Write a function to remove all the words with k length in the given string.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to remove all the words with k length in the given string.\n", "solution.py": "def remove_length(test_str, K):\r\n temp = test_str.split()\r\n res = [ele for ele in temp if not len(ele) != K]\r\n res = ' '.join(res)\r\n return (res)\n", "test_solution.py": "from solution import *\nassert remove_length('The person is most value tet', 3) == 'person is most value'\nassert remove_length('If you told me about this ok', 4) == 'If you me about ok'\nassert remove_length('Forces of darkeness is come into the play', 4) == 'Forces of darkeness is the'\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "remove_length", "bug": "invert_condition", "reference_solution": "def remove_length(test_str, K):\r\n temp = test_str.split()\r\n res = [ele for ele in temp if len(ele) != K]\r\n res = ' '.join(res)\r\n return (res) "}
{"id": "mbpp/956", "problem": "Write a function to split the given string at uppercase letters by using regex.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to split the given string at uppercase letters by using regex.\n", "solution.py": "import re\r\ndef split_list(text):\r\n return (re.findall('[A+Z][^A-Z]*', text))\n", "test_solution.py": "from solution import *\nassert split_list(\"LearnToBuildAnythingWithGoogle\") == ['Learn', 'To', 'Build', 'Anything', 'With', 'Google']\nassert split_list(\"ApmlifyingTheBlack+DeveloperCommunity\") == ['Apmlifying', 'The', 'Black+', 'Developer', 'Community']\nassert split_list(\"UpdateInTheGoEcoSystem\") == ['Update', 'In', 'The', 'Go', 'Eco', 'System']\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "split_list", "bug": "minus_to_plus", "reference_solution": "import re\r\ndef split_list(text):\r\n return (re.findall('[A-Z][^A-Z]*', text))"}
{"id": "mbpp/700", "problem": "Write a function to count the number of elements in a list which are within a specific range.\n\nThe current implementation in solution.py fails the tests in test_solution.py. Use the tools to inspect the code, reproduce the failure, fix it, and verify that all tests pass before finishing.", "files": {"task.txt": "Write a function to count the number of elements in a list which are within a specific range.\n", "solution.py": "def count_range_in_list(li, min, max):\r\n\tctr = 0\r\n\tfor x in li:\r\n\t\tif min <= x <= max:\r\n\t\t\tctr -= 1\r\n\treturn ctr\n", "test_solution.py": "from solution import *\nassert count_range_in_list([10,20,30,40,40,40,70,80,99],40,100)==6\nassert count_range_in_list(['a','b','c','d','e','f'],'a','e')==5\nassert count_range_in_list([7,8,9,15,17,19,45],15,20)==3\nprint(\"ALL TESTS PASSED\")\n"}, "tests_file": "test_solution.py", "entry": "count_range_in_list", "bug": "plus_to_minus", "reference_solution": "def count_range_in_list(li, min, max):\r\n\tctr = 0\r\n\tfor x in li:\r\n\t\tif min <= x <= max:\r\n\t\t\tctr += 1\r\n\treturn ctr"}
|