{"input": "from typing import List\n\n\ndef has_close_elements(numbers: List[float], threshold: float) -> bool:\n \"\"\" Check if in given list of numbers, are any two numbers closer to each other than\n given threshold.\n >>> has_close_elements([1.0, 2.0, 3.0], 0.5)\n False\n >>> has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3)\n True\n \"\"\"", "answer": "for idx, elem in enumerate(numbers):\n for idx2, elem2 in enumerate(numbers):\n if idx != idx2:\n distance = abs(elem - elem2)\n if distance < threshold:\n return True\n\n return False", "source": "humaneval", "task_id": "HumanEval/0", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.3) == True\n assert candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.05) == False\n assert candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.95) == True\n assert candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.8) == False\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.0], 0.1) == True\n assert candidate([1.1, 2.2, 3.1, 4.1, 5.1], 1.0) == True\n assert candidate([1.1, 2.2, 3.1, 4.1, 5.1], 0.5) == False", "difficulty": "code"} {"input": "from typing import List\n\n\ndef separate_paren_groups(paren_string: str) -> List[str]:\n \"\"\" Input to this function is a string containing multiple groups of nested parentheses. Your goal is to\n separate those group into separate strings and return the list of those.\n Separate groups are balanced (each open brace is properly closed) and not nested within each other\n Ignore any spaces in the input string.\n >>> separate_paren_groups('( ) (( )) (( )( ))')\n ['()', '(())', '(()())']\n \"\"\"", "answer": "result = []\n current_string = []\n current_depth = 0\n\n for c in paren_string:\n if c == '(':\n current_depth += 1\n current_string.append(c)\n elif c == ')':\n current_depth -= 1\n current_string.append(c)\n\n if current_depth == 0:\n result.append(''.join(current_string))\n current_string.clear()\n\n return result", "source": "humaneval", "task_id": "HumanEval/1", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('(()()) ((())) () ((())()())') == [\n '(()())', '((()))', '()', '((())()())'\n ]\n assert candidate('() (()) ((())) (((())))') == [\n '()', '(())', '((()))', '(((())))'\n ]\n assert candidate('(()(())((())))') == [\n '(()(())((())))'\n ]\n assert candidate('( ) (( )) (( )( ))') == ['()', '(())', '(()())']", "difficulty": "code"} {"input": "def truncate_number(number: float) -> float:\n \"\"\" Given a positive floating point number, it can be decomposed into\n and integer part (largest integer smaller than given number) and decimals\n (leftover part always smaller than 1).\n\n Return the decimal part of the number.\n >>> truncate_number(3.5)\n 0.5\n \"\"\"", "answer": "return number % 1.0", "source": "humaneval", "task_id": "HumanEval/2", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(3.5) == 0.5\n assert abs(candidate(1.33) - 0.33) < 1e-6\n assert abs(candidate(123.456) - 0.456) < 1e-6", "difficulty": "code"} {"input": "from typing import List\n\n\ndef below_zero(operations: List[int]) -> bool:\n \"\"\" You're given a list of deposit and withdrawal operations on a bank account that starts with\n zero balance. Your task is to detect if at any point the balance of account fallls below zero, and\n at that point function should return True. Otherwise it should return False.\n >>> below_zero([1, 2, 3])\n False\n >>> below_zero([1, 2, -4, 5])\n True\n \"\"\"", "answer": "balance = 0\n\n for op in operations:\n balance += op\n if balance < 0:\n return True\n\n return False", "source": "humaneval", "task_id": "HumanEval/3", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == False\n assert candidate([1, 2, -3, 1, 2, -3]) == False\n assert candidate([1, 2, -4, 5, 6]) == True\n assert candidate([1, -1, 2, -2, 5, -5, 4, -4]) == False\n assert candidate([1, -1, 2, -2, 5, -5, 4, -5]) == True\n assert candidate([1, -2, 2, -2, 5, -5, 4, -4]) == True", "difficulty": "code"} {"input": "from typing import List\n\n\ndef mean_absolute_deviation(numbers: List[float]) -> float:\n \"\"\" For a given list of input numbers, calculate Mean Absolute Deviation\n around the mean of this dataset.\n Mean Absolute Deviation is the average absolute difference between each\n element and a centerpoint (mean in this case):\n MAD = average | x - x_mean |\n >>> mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])\n 1.0\n \"\"\"", "answer": "mean = sum(numbers) / len(numbers)\n return sum(abs(x - mean) for x in numbers) / len(numbers)", "source": "humaneval", "task_id": "HumanEval/4", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert abs(candidate([1.0, 2.0, 3.0]) - 2.0/3.0) < 1e-6\n assert abs(candidate([1.0, 2.0, 3.0, 4.0]) - 1.0) < 1e-6\n assert abs(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) - 6.0/5.0) < 1e-6", "difficulty": "code"} {"input": "from typing import List\n\n\ndef intersperse(numbers: List[int], delimeter: int) -> List[int]:\n \"\"\" Insert a number 'delimeter' between every two consecutive elements of input list `numbers'\n >>> intersperse([], 4)\n []\n >>> intersperse([1, 2, 3], 4)\n [1, 4, 2, 4, 3]\n \"\"\"", "answer": "if not numbers:\n return []\n\n result = []\n\n for n in numbers[:-1]:\n result.append(n)\n result.append(delimeter)\n\n result.append(numbers[-1])\n\n return result", "source": "humaneval", "task_id": "HumanEval/5", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([], 7) == []\n assert candidate([5, 6, 3, 2], 8) == [5, 8, 6, 8, 3, 8, 2]\n assert candidate([2, 2, 2], 2) == [2, 2, 2, 2, 2]", "difficulty": "code"} {"input": "from typing import List\n\n\ndef parse_nested_parens(paren_string: str) -> List[int]:\n \"\"\" Input to this function is a string represented multiple groups for nested parentheses separated by spaces.\n For each of the group, output the deepest level of nesting of parentheses.\n E.g. (()()) has maximum two levels of nesting while ((())) has three.\n\n >>> parse_nested_parens('(()()) ((())) () ((())()())')\n [2, 3, 1, 3]\n \"\"\"", "answer": "def parse_paren_group(s):\n depth = 0\n max_depth = 0\n for c in s:\n if c == '(':\n depth += 1\n max_depth = max(depth, max_depth)\n else:\n depth -= 1\n\n return max_depth\n\n return [parse_paren_group(x) for x in paren_string.split(' ') if x]", "source": "humaneval", "task_id": "HumanEval/6", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('(()()) ((())) () ((())()())') == [2, 3, 1, 3]\n assert candidate('() (()) ((())) (((())))') == [1, 2, 3, 4]\n assert candidate('(()(())((())))') == [4]", "difficulty": "code"} {"input": "from typing import List\n\n\ndef filter_by_substring(strings: List[str], substring: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that contain given substring\n >>> filter_by_substring([], 'a')\n []\n >>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')\n ['abc', 'bacd', 'array']\n \"\"\"", "answer": "return [x for x in strings if substring in x]", "source": "humaneval", "task_id": "HumanEval/7", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([], 'john') == []\n assert candidate(['xxx', 'asd', 'xxy', 'john doe', 'xxxAAA', 'xxx'], 'xxx') == ['xxx', 'xxxAAA', 'xxx']\n assert candidate(['xxx', 'asd', 'aaaxxy', 'john doe', 'xxxAAA', 'xxx'], 'xx') == ['xxx', 'aaaxxy', 'xxxAAA', 'xxx']\n assert candidate(['grunt', 'trumpet', 'prune', 'gruesome'], 'run') == ['grunt', 'prune']", "difficulty": "code"} {"input": "from typing import List, Tuple\n\n\ndef sum_product(numbers: List[int]) -> Tuple[int, int]:\n \"\"\" For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.\n Empty sum should be equal to 0 and empty product should be equal to 1.\n >>> sum_product([])\n (0, 1)\n >>> sum_product([1, 2, 3, 4])\n (10, 24)\n \"\"\"", "answer": "sum_value = 0\n prod_value = 1\n\n for n in numbers:\n sum_value += n\n prod_value *= n\n return sum_value, prod_value", "source": "humaneval", "task_id": "HumanEval/8", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == (0, 1)\n assert candidate([1, 1, 1]) == (3, 1)\n assert candidate([100, 0]) == (100, 0)\n assert candidate([3, 5, 7]) == (3 + 5 + 7, 3 * 5 * 7)\n assert candidate([10]) == (10, 10)", "difficulty": "code"} {"input": "from typing import List, Tuple\n\n\ndef rolling_max(numbers: List[int]) -> List[int]:\n \"\"\" From a given list of integers, generate a list of rolling maximum element found until given moment\n in the sequence.\n >>> rolling_max([1, 2, 3, 2, 3, 4, 2])\n [1, 2, 3, 3, 3, 4, 4]\n \"\"\"", "answer": "running_max = None\n result = []\n\n for n in numbers:\n if running_max is None:\n running_max = n\n else:\n running_max = max(running_max, n)\n\n result.append(running_max)\n\n return result", "source": "humaneval", "task_id": "HumanEval/9", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([1, 2, 3, 4]) == [1, 2, 3, 4]\n assert candidate([4, 3, 2, 1]) == [4, 4, 4, 4]\n assert candidate([3, 2, 3, 100, 3]) == [3, 3, 3, 100, 100]", "difficulty": "code"} {"input": "def is_palindrome(string: str) -> bool:\n \"\"\" Test if given string is a palindrome \"\"\"\n return string == string[::-1]\n\n\ndef make_palindrome(string: str) -> str:\n \"\"\" Find the shortest palindrome that begins with a supplied string.\n Algorithm idea is simple:\n - Find the longest postfix of supplied string that is a palindrome.\n - Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.\n >>> make_palindrome('')\n ''\n >>> make_palindrome('cat')\n 'catac'\n >>> make_palindrome('cata')\n 'catac'\n \"\"\"", "answer": "if not string:\n return ''\n\n beginning_of_suffix = 0\n\n while not is_palindrome(string[beginning_of_suffix:]):\n beginning_of_suffix += 1\n\n return string + string[:beginning_of_suffix][::-1]", "source": "humaneval", "task_id": "HumanEval/10", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate('x') == 'x'\n assert candidate('xyz') == 'xyzyx'\n assert candidate('xyx') == 'xyx'\n assert candidate('jerry') == 'jerryrrej'", "difficulty": "code"} {"input": "from typing import List\n\n\ndef string_xor(a: str, b: str) -> str:\n \"\"\" Input are two strings a and b consisting only of 1s and 0s.\n Perform binary XOR on these inputs and return result also as a string.\n >>> string_xor('010', '110')\n '100'\n \"\"\"", "answer": "def xor(i, j):\n if i == j:\n return '0'\n else:\n return '1'\n\n return ''.join(xor(x, y) for x, y in zip(a, b))", "source": "humaneval", "task_id": "HumanEval/11", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('111000', '101010') == '010010'\n assert candidate('1', '1') == '0'\n assert candidate('0101', '0000') == '0101'", "difficulty": "code"} {"input": "from typing import List, Optional\n\n\ndef longest(strings: List[str]) -> Optional[str]:\n \"\"\" Out of list of strings, return the longest one. Return the first one in case of multiple\n strings of the same length. Return None in case the input list is empty.\n >>> longest([])\n\n >>> longest(['a', 'b', 'c'])\n 'a'\n >>> longest(['a', 'bb', 'ccc'])\n 'ccc'\n \"\"\"", "answer": "if not strings:\n return None\n\n maxlen = max(len(x) for x in strings)\n for s in strings:\n if len(s) == maxlen:\n return s", "source": "humaneval", "task_id": "HumanEval/12", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == None\n assert candidate(['x', 'y', 'z']) == 'x'\n assert candidate(['x', 'yyy', 'zzzz', 'www', 'kkkk', 'abc']) == 'zzzz'", "difficulty": "code"} {"input": "def greatest_common_divisor(a: int, b: int) -> int:\n \"\"\" Return a greatest common divisor of two integers a and b\n >>> greatest_common_divisor(3, 5)\n 1\n >>> greatest_common_divisor(25, 15)\n 5\n \"\"\"", "answer": "while b:\n a, b = b, a % b\n return a", "source": "humaneval", "task_id": "HumanEval/13", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(3, 7) == 1\n assert candidate(10, 15) == 5\n assert candidate(49, 14) == 7\n assert candidate(144, 60) == 12", "difficulty": "code"} {"input": "from typing import List\n\n\ndef all_prefixes(string: str) -> List[str]:\n \"\"\" Return list of all prefixes from shortest to longest of the input string\n >>> all_prefixes('abc')\n ['a', 'ab', 'abc']\n \"\"\"", "answer": "result = []\n\n for i in range(len(string)):\n result.append(string[:i+1])\n return result", "source": "humaneval", "task_id": "HumanEval/14", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == []\n assert candidate('asdfgh') == ['a', 'as', 'asd', 'asdf', 'asdfg', 'asdfgh']\n assert candidate('WWW') == ['W', 'WW', 'WWW']", "difficulty": "code"} {"input": "def string_sequence(n: int) -> str:\n \"\"\" Return a string containing space-delimited numbers starting from 0 upto n inclusive.\n >>> string_sequence(0)\n '0'\n >>> string_sequence(5)\n '0 1 2 3 4 5'\n \"\"\"", "answer": "return ' '.join([str(x) for x in range(n + 1)])", "source": "humaneval", "task_id": "HumanEval/15", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(0) == '0'\n assert candidate(3) == '0 1 2 3'\n assert candidate(10) == '0 1 2 3 4 5 6 7 8 9 10'", "difficulty": "code"} {"input": "def count_distinct_characters(string: str) -> int:\n \"\"\" Given a string, find out how many distinct characters (regardless of case) does it consist of\n >>> count_distinct_characters('xyzXYZ')\n 3\n >>> count_distinct_characters('Jerry')\n 4\n \"\"\"", "answer": "return len(set(string.lower()))", "source": "humaneval", "task_id": "HumanEval/16", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == 0\n assert candidate('abcde') == 5\n assert candidate('abcde' + 'cade' + 'CADE') == 5\n assert candidate('aaaaAAAAaaaa') == 1\n assert candidate('Jerry jERRY JeRRRY') == 5", "difficulty": "code"} {"input": "from typing import List\n\n\ndef parse_music(music_string: str) -> List[int]:\n \"\"\" Input to this function is a string representing musical notes in a special ASCII format.\n Your task is to parse this string and return list of integers corresponding to how many beats does each\n not last.\n\n Here is a legend:\n 'o' - whole note, lasts four beats\n 'o|' - half note, lasts two beats\n '.|' - quater note, lasts one beat\n\n >>> parse_music('o o| .| o| o| .| .| .| .| o o')\n [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]\n \"\"\"", "answer": "note_map = {'o': 4, 'o|': 2, '.|': 1}\n return [note_map[x] for x in music_string.split(' ') if x]", "source": "humaneval", "task_id": "HumanEval/17", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == []\n assert candidate('o o o o') == [4, 4, 4, 4]\n assert candidate('.| .| .| .|') == [1, 1, 1, 1]\n assert candidate('o| o| .| .| o o o o') == [2, 2, 1, 1, 4, 4, 4, 4]\n assert candidate('o| .| o| .| o o| o o|') == [2, 1, 2, 1, 4, 2, 4, 2]", "difficulty": "code"} {"input": "def how_many_times(string: str, substring: str) -> int:\n \"\"\" Find how many times a given substring can be found in the original string. Count overlaping cases.\n >>> how_many_times('', 'a')\n 0\n >>> how_many_times('aaa', 'a')\n 3\n >>> how_many_times('aaaa', 'aa')\n 3\n \"\"\"", "answer": "times = 0\n\n for i in range(len(string) - len(substring) + 1):\n if string[i:i+len(substring)] == substring:\n times += 1\n\n return times", "source": "humaneval", "task_id": "HumanEval/18", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('', 'x') == 0\n assert candidate('xyxyxyx', 'x') == 4\n assert candidate('cacacacac', 'cac') == 4\n assert candidate('john doe', 'john') == 1", "difficulty": "code"} {"input": "from typing import List\n\n\ndef sort_numbers(numbers: str) -> str:\n \"\"\" Input is a space-delimited string of numberals from 'zero' to 'nine'.\n Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.\n Return the string with numbers sorted from smallest to largest\n >>> sort_numbers('three one five')\n 'one three five'\n \"\"\"", "answer": "value_map = {\n 'zero': 0,\n 'one': 1,\n 'two': 2,\n 'three': 3,\n 'four': 4,\n 'five': 5,\n 'six': 6,\n 'seven': 7,\n 'eight': 8,\n 'nine': 9\n }\n return ' '.join(sorted([x for x in numbers.split(' ') if x], key=lambda x: value_map[x]))", "source": "humaneval", "task_id": "HumanEval/19", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate('three') == 'three'\n assert candidate('three five nine') == 'three five nine'\n assert candidate('five zero four seven nine eight') == 'zero four five seven eight nine'\n assert candidate('six five four three two one zero') == 'zero one two three four five six'", "difficulty": "code"} {"input": "from typing import List, Tuple\n\n\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"", "answer": "closest_pair = None\n distance = None\n\n for idx, elem in enumerate(numbers):\n for idx2, elem2 in enumerate(numbers):\n if idx != idx2:\n if distance is None:\n distance = abs(elem - elem2)\n closest_pair = tuple(sorted([elem, elem2]))\n else:\n new_distance = abs(elem - elem2)\n if new_distance < distance:\n distance = new_distance\n closest_pair = tuple(sorted([elem, elem2]))\n\n return closest_pair", "source": "humaneval", "task_id": "HumanEval/20", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2]) == (3.9, 4.0)\n assert candidate([1.0, 2.0, 5.9, 4.0, 5.0]) == (5.0, 5.9)\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)\n assert candidate([1.1, 2.2, 3.1, 4.1, 5.1]) == (2.2, 3.1)", "difficulty": "code"} {"input": "from typing import List\n\n\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"", "answer": "min_number = min(numbers)\n max_number = max(numbers)\n return [(x - min_number) / (max_number - min_number) for x in numbers]", "source": "humaneval", "task_id": "HumanEval/21", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([2.0, 49.9]) == [0.0, 1.0]\n assert candidate([100.0, 49.9]) == [1.0, 0.0]\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]\n assert candidate([2.0, 1.0, 5.0, 3.0, 4.0]) == [0.25, 0.0, 1.0, 0.5, 0.75]\n assert candidate([12.0, 11.0, 15.0, 13.0, 14.0]) == [0.25, 0.0, 1.0, 0.5, 0.75]", "difficulty": "code"} {"input": "from typing import List, Any\n\n\ndef filter_integers(values: List[Any]) -> List[int]:\n \"\"\" Filter given list of any python values only for integers\n >>> filter_integers(['a', 3.14, 5])\n [5]\n >>> filter_integers([1, 2, 3, 'abc', {}, []])\n [1, 2, 3]\n \"\"\"", "answer": "return [x for x in values if isinstance(x, int)]", "source": "humaneval", "task_id": "HumanEval/22", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([4, {}, [], 23.2, 9, 'adasd']) == [4, 9]\n assert candidate([3, 'c', 3, 3, 'a', 'b']) == [3, 3, 3]", "difficulty": "code"} {"input": "def strlen(string: str) -> int:\n \"\"\" Return length of given string\n >>> strlen('')\n 0\n >>> strlen('abc')\n 3\n \"\"\"", "answer": "return len(string)", "source": "humaneval", "task_id": "HumanEval/23", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == 0\n assert candidate('x') == 1\n assert candidate('asdasnakj') == 9", "difficulty": "code"} {"input": "def largest_divisor(n: int) -> int:\n \"\"\" For a given number n, find the largest number that divides n evenly, smaller than n\n >>> largest_divisor(15)\n 5\n \"\"\"", "answer": "for i in reversed(range(n)):\n if n % i == 0:\n return i", "source": "humaneval", "task_id": "HumanEval/24", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(3) == 1\n assert candidate(7) == 1\n assert candidate(10) == 5\n assert candidate(100) == 50\n assert candidate(49) == 7", "difficulty": "code"} {"input": "from typing import List\n\n\ndef factorize(n: int) -> List[int]:\n \"\"\" Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"", "answer": "import math\n fact = []\n i = 2\n while i <= int(math.sqrt(n) + 1):\n if n % i == 0:\n fact.append(i)\n n //= i\n else:\n i += 1\n\n if n > 1:\n fact.append(n)\n return fact", "source": "humaneval", "task_id": "HumanEval/25", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(2) == [2]\n assert candidate(4) == [2, 2]\n assert candidate(8) == [2, 2, 2]\n assert candidate(3 * 19) == [3, 19]\n assert candidate(3 * 19 * 3 * 19) == [3, 3, 19, 19]\n assert candidate(3 * 19 * 3 * 19 * 3 * 19) == [3, 3, 3, 19, 19, 19]\n assert candidate(3 * 19 * 19 * 19) == [3, 19, 19, 19]\n assert candidate(3 * 2 * 3) == [2, 3, 3]", "difficulty": "code"} {"input": "from typing import List\n\n\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"", "answer": "import collections\n c = collections.Counter(numbers)\n return [n for n in numbers if c[n] <= 1]", "source": "humaneval", "task_id": "HumanEval/26", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([1, 2, 3, 4]) == [1, 2, 3, 4]\n assert candidate([1, 2, 3, 2, 4, 3, 5]) == [1, 4, 5]", "difficulty": "code"} {"input": "def flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"", "answer": "return string.swapcase()", "source": "humaneval", "task_id": "HumanEval/27", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate('Hello!') == 'hELLO!'\n assert candidate('These violent delights have violent ends') == 'tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS'", "difficulty": "code"} {"input": "from typing import List\n\n\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"", "answer": "return ''.join(strings)", "source": "humaneval", "task_id": "HumanEval/28", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == ''\n assert candidate(['x', 'y', 'z']) == 'xyz'\n assert candidate(['x', 'y', 'z', 'w', 'k']) == 'xyzwk'", "difficulty": "code"} {"input": "from typing import List\n\n\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that start with a given prefix.\n >>> filter_by_prefix([], 'a')\n []\n >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')\n ['abc', 'array']\n \"\"\"", "answer": "return [x for x in strings if x.startswith(prefix)]", "source": "humaneval", "task_id": "HumanEval/29", "test_cases": "METADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([], 'john') == []\n assert candidate(['xxx', 'asd', 'xxy', 'john doe', 'xxxAAA', 'xxx'], 'xxx') == ['xxx', 'xxxAAA', 'xxx']", "difficulty": "code"} {"input": "def get_positive(l: list):\n \"\"\"Return only positive numbers in the list.\n >>> get_positive([-1, 2, -4, 5, 6])\n [2, 5, 6]\n >>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n [5, 3, 2, 3, 9, 123, 1]\n \"\"\"", "answer": "return [e for e in l if e > 0]", "source": "humaneval", "task_id": "HumanEval/30", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([-1, -2, 4, 5, 6]) == [4, 5, 6]\n assert candidate([5, 3, -5, 2, 3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 3, 9, 123, 1]\n assert candidate([-1, -2]) == []\n assert candidate([]) == []", "difficulty": "code"} {"input": "def is_prime(n):\n \"\"\"Return true if a given number is prime, and false otherwise.\n >>> is_prime(6)\n False\n >>> is_prime(101)\n True\n >>> is_prime(11)\n True\n >>> is_prime(13441)\n True\n >>> is_prime(61)\n True\n >>> is_prime(4)\n False\n >>> is_prime(1)\n False\n \"\"\"", "answer": "if n < 2:\n return False\n for k in range(2, n - 1):\n if n % k == 0:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/31", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(6) == False\n assert candidate(101) == True\n assert candidate(11) == True\n assert candidate(13441) == True\n assert candidate(61) == True\n assert candidate(4) == False\n assert candidate(1) == False\n assert candidate(5) == True\n assert candidate(11) == True\n assert candidate(17) == True\n assert candidate(5 * 17) == False\n assert candidate(11 * 7) == False\n assert candidate(13441 * 19) == False", "difficulty": "code"} {"input": "import math\n\n\ndef poly(xs: list, x: float):\n \"\"\"\n Evaluates polynomial with coefficients xs at point x.\n return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n\n \"\"\"\n return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])\n\n\ndef find_zero(xs: list):\n \"\"\" xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"", "answer": "begin, end = -1., 1.\n while poly(xs, begin) * poly(xs, end) > 0:\n begin *= 2.0\n end *= 2.0\n while end - begin > 1e-10:\n center = (begin + end) / 2.0\n if poly(xs, center) * poly(xs, begin) > 0:\n begin = center\n else:\n end = center\n return begin", "source": "humaneval", "task_id": "HumanEval/32", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n import math\n import random\n rng = random.Random(42)\n import copy\n for _ in range(100):\n ncoeff = 2 * rng.randint(1, 4)\n coeffs = []\n for _ in range(ncoeff):\n coeff = rng.randint(-10, 10)\n if coeff == 0:\n coeff = 1\n coeffs.append(coeff)\n solution = candidate(copy.deepcopy(coeffs))\n assert math.fabs(poly(coeffs, solution)) < 1e-4", "difficulty": "code"} {"input": "def sort_third(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal\n to the values of the corresponding indicies of l, but sorted.\n >>> sort_third([1, 2, 3])\n [1, 2, 3]\n >>> sort_third([5, 6, 3, 4, 8, 9, 2])\n [2, 6, 3, 4, 8, 9, 5]\n \"\"\"", "answer": "l = list(l)\n l[::3] = sorted(l[::3])\n return l", "source": "humaneval", "task_id": "HumanEval/33", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert tuple(candidate([1, 2, 3])) == tuple(sort_third([1, 2, 3]))\n assert tuple(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])) == tuple(sort_third([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]))\n assert tuple(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10])) == tuple(sort_third([5, 8, -12, 4, 23, 2, 3, 11, 12, -10]))\n assert tuple(candidate([5, 6, 3, 4, 8, 9, 2])) == tuple([2, 6, 3, 4, 8, 9, 5])\n assert tuple(candidate([5, 8, 3, 4, 6, 9, 2])) == tuple([2, 8, 3, 4, 6, 9, 5])\n assert tuple(candidate([5, 6, 9, 4, 8, 3, 2])) == tuple([2, 6, 9, 4, 8, 3, 5])\n assert tuple(candidate([5, 6, 3, 4, 8, 9, 2, 1])) == tuple([2, 6, 3, 4, 8, 9, 5, 1])", "difficulty": "code"} {"input": "def unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"", "answer": "return sorted(list(set(l)))", "source": "humaneval", "task_id": "HumanEval/34", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]", "difficulty": "code"} {"input": "def max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"", "answer": "m = l[0]\n for e in l:\n if e > m:\n m = e\n return m", "source": "humaneval", "task_id": "HumanEval/35", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 3]) == 3\n assert candidate([5, 3, -5, 2, -3, 3, 9, 0, 124, 1, -10]) == 124", "difficulty": "code"} {"input": "def fizz_buzz(n: int):\n \"\"\"Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n >>> fizz_buzz(50)\n 0\n >>> fizz_buzz(78)\n 2\n >>> fizz_buzz(79)\n 3\n \"\"\"", "answer": "ns = []\n for i in range(n):\n if i % 11 == 0 or i % 13 == 0:\n ns.append(i)\n s = ''.join(list(map(str, ns)))\n ans = 0\n for c in s:\n ans += (c == '7')\n return ans", "source": "humaneval", "task_id": "HumanEval/36", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(50) == 0\n assert candidate(78) == 2\n assert candidate(79) == 3\n assert candidate(100) == 3\n assert candidate(200) == 6\n assert candidate(4000) == 192\n assert candidate(10000) == 639\n assert candidate(100000) == 8026", "difficulty": "code"} {"input": "def sort_even(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the odd indicies, while its values at the even indicies are equal\n to the values of the even indicies of l, but sorted.\n >>> sort_even([1, 2, 3])\n [1, 2, 3]\n >>> sort_even([5, 6, 3, 4])\n [3, 6, 5, 4]\n \"\"\"", "answer": "evens = l[::2]\n odds = l[1::2]\n evens.sort()\n ans = []\n for e, o in zip(evens, odds):\n ans.extend([e, o])\n if len(evens) > len(odds):\n ans.append(evens[-1])\n return ans", "source": "humaneval", "task_id": "HumanEval/37", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert tuple(candidate([1, 2, 3])) == tuple([1, 2, 3])\n assert tuple(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])) == tuple([-10, 3, -5, 2, -3, 3, 5, 0, 9, 1, 123])\n assert tuple(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10])) == tuple([-12, 8, 3, 4, 5, 2, 12, 11, 23, -10])", "difficulty": "code"} {"input": "def encode_cyclic(s: str):\n \"\"\"\n returns encoded string by cycling groups of three characters.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n\ndef decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"", "answer": "return encode_cyclic(encode_cyclic(s))", "source": "humaneval", "task_id": "HumanEval/38", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n from random import randint, choice\n import string\n\n letters = string.ascii_lowercase\n for _ in range(100):\n str = ''.join(choice(letters) for i in range(randint(10, 20)))\n encoded_str = encode_cyclic(str)\n assert candidate(encoded_str) == str", "difficulty": "code"} {"input": "def prime_fib(n: int):\n \"\"\"\n prime_fib returns n-th number that is a Fibonacci number and it's also prime.\n >>> prime_fib(1)\n 2\n >>> prime_fib(2)\n 3\n >>> prime_fib(3)\n 5\n >>> prime_fib(4)\n 13\n >>> prime_fib(5)\n 89\n \"\"\"", "answer": "import math\n\n def is_prime(p):\n if p < 2:\n return False\n for k in range(2, min(int(math.sqrt(p)) + 1, p - 1)):\n if p % k == 0:\n return False\n return True\n f = [0, 1]\n while True:\n f.append(f[-1] + f[-2])\n if is_prime(f[-1]):\n n -= 1\n if n == 0:\n return f[-1]", "source": "humaneval", "task_id": "HumanEval/39", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(1) == 2\n assert candidate(2) == 3\n assert candidate(3) == 5\n assert candidate(4) == 13\n assert candidate(5) == 89\n assert candidate(6) == 233\n assert candidate(7) == 1597\n assert candidate(8) == 28657\n assert candidate(9) == 514229\n assert candidate(10) == 433494437", "difficulty": "code"} {"input": "def triples_sum_to_zero(l: list):\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n\n >>> triples_sum_to_zero([1, 3, 5, 0])\n False\n >>> triples_sum_to_zero([1, 3, -2, 1])\n True\n >>> triples_sum_to_zero([1, 2, 3, 7])\n False\n >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])\n True\n >>> triples_sum_to_zero([1])\n False\n \"\"\"", "answer": "for i in range(len(l)):\n for j in range(i + 1, len(l)):\n for k in range(j + 1, len(l)):\n if l[i] + l[j] + l[k] == 0:\n return True\n return False", "source": "humaneval", "task_id": "HumanEval/40", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 3, 5, 0]) == False\n assert candidate([1, 3, 5, -1]) == False\n assert candidate([1, 3, -2, 1]) == True\n assert candidate([1, 2, 3, 7]) == False\n assert candidate([1, 2, 5, 7]) == False\n assert candidate([2, 4, -5, 3, 9, 7]) == True\n assert candidate([1]) == False\n assert candidate([1, 3, 5, -100]) == False\n assert candidate([100, 3, 5, -100]) == False", "difficulty": "code"} {"input": "def car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"", "answer": "return n**2", "source": "humaneval", "task_id": "HumanEval/41", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(2) == 4\n assert candidate(3) == 9\n assert candidate(4) == 16\n assert candidate(8) == 64\n assert candidate(10) == 100", "difficulty": "code"} {"input": "def incr_list(l: list):\n \"\"\"Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"", "answer": "return [(e + 1) for e in l]", "source": "humaneval", "task_id": "HumanEval/42", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([3, 2, 1]) == [4, 3, 2]\n assert candidate([5, 2, 5, 2, 3, 3, 9, 0, 123]) == [6, 3, 6, 3, 4, 4, 10, 1, 124]", "difficulty": "code"} {"input": "def pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"", "answer": "for i, l1 in enumerate(l):\n for j in range(i + 1, len(l)):\n if l1 + l[j] == 0:\n return True\n return False", "source": "humaneval", "task_id": "HumanEval/43", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 3, 5, 0]) == False\n assert candidate([1, 3, -2, 1]) == False\n assert candidate([1, 2, 3, 7]) == False\n assert candidate([2, 4, -5, 3, 5, 7]) == True\n assert candidate([1]) == False\n\n assert candidate([-3, 9, -1, 3, 2, 30]) == True\n assert candidate([-3, 9, -1, 3, 2, 31]) == True\n assert candidate([-3, 9, -1, 4, 2, 30]) == False\n assert candidate([-3, 9, -1, 4, 2, 31]) == False", "difficulty": "code"} {"input": "def change_base(x: int, base: int):\n \"\"\"Change numerical base of input number x to base.\n return string representation after the conversion.\n base numbers are less than 10.\n >>> change_base(8, 3)\n '22'\n >>> change_base(8, 2)\n '1000'\n >>> change_base(7, 2)\n '111'\n \"\"\"", "answer": "ret = \"\"\n while x > 0:\n ret = str(x % base) + ret\n x //= base\n return ret", "source": "humaneval", "task_id": "HumanEval/44", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(8, 3) == \"22\"\n assert candidate(9, 3) == \"100\"\n assert candidate(234, 2) == \"11101010\"\n assert candidate(16, 2) == \"10000\"\n assert candidate(8, 2) == \"1000\"\n assert candidate(7, 2) == \"111\"\n for x in range(2, 8):\n assert candidate(x, x + 1) == str(x)", "difficulty": "code"} {"input": "def triangle_area(a, h):\n \"\"\"Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"", "answer": "return a * h / 2.0", "source": "humaneval", "task_id": "HumanEval/45", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(5, 3) == 7.5\n assert candidate(2, 2) == 2.0\n assert candidate(10, 8) == 40.0", "difficulty": "code"} {"input": "def fib4(n: int):\n \"\"\"The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fib4(0) -> 0\n fib4(1) -> 0\n fib4(2) -> 2\n fib4(3) -> 0\n fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use recursion.\n >>> fib4(5)\n 4\n >>> fib4(6)\n 8\n >>> fib4(7)\n 14\n \"\"\"", "answer": "results = [0, 0, 2, 0]\n if n < 4:\n return results[n]\n\n for _ in range(4, n + 1):\n results.append(results[-1] + results[-2] + results[-3] + results[-4])\n results.pop(0)\n\n return results[-1]", "source": "humaneval", "task_id": "HumanEval/46", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(5) == 4\n assert candidate(8) == 28\n assert candidate(10) == 104\n assert candidate(12) == 386", "difficulty": "code"} {"input": "def median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"", "answer": "l = sorted(l)\n if len(l) % 2 == 1:\n return l[len(l) // 2]\n else:\n return (l[len(l) // 2 - 1] + l[len(l) // 2]) / 2.0", "source": "humaneval", "task_id": "HumanEval/47", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([3, 1, 2, 4, 5]) == 3\n assert candidate([-10, 4, 6, 1000, 10, 20]) == 8.0\n assert candidate([5]) == 5\n assert candidate([6, 5]) == 5.5\n assert candidate([8, 1, 3, 9, 9, 2, 7]) == 7", "difficulty": "code"} {"input": "def is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"", "answer": "for i in range(len(text)):\n if text[i] != text[len(text) - 1 - i]:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/48", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate('') == True\n assert candidate('aba') == True\n assert candidate('aaaaa') == True\n assert candidate('zbcd') == False\n assert candidate('xywyx') == True\n assert candidate('xywyz') == False\n assert candidate('xywzx') == False", "difficulty": "code"} {"input": "def modp(n: int, p: int):\n \"\"\"Return 2^n modulo p (be aware of numerics).\n >>> modp(3, 5)\n 3\n >>> modp(1101, 101)\n 2\n >>> modp(0, 101)\n 1\n >>> modp(3, 11)\n 8\n >>> modp(100, 101)\n 1\n \"\"\"", "answer": "ret = 1\n for i in range(n):\n ret = (2 * ret) % p\n return ret", "source": "humaneval", "task_id": "HumanEval/49", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(3, 5) == 3\n assert candidate(1101, 101) == 2\n assert candidate(0, 101) == 1\n assert candidate(3, 11) == 8\n assert candidate(100, 101) == 1\n assert candidate(30, 5) == 4\n assert candidate(31, 5) == 3", "difficulty": "code"} {"input": "def encode_shift(s: str):\n \"\"\"\n returns encoded string by shifting every character by 5 in the alphabet.\n \"\"\"\n return \"\".join([chr(((ord(ch) + 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n\n\ndef decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"", "answer": "return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])", "source": "humaneval", "task_id": "HumanEval/50", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n from random import randint, choice\n import copy\n import string\n\n letters = string.ascii_lowercase\n for _ in range(100):\n str = ''.join(choice(letters) for i in range(randint(10, 20)))\n encoded_str = encode_shift(str)\n assert candidate(copy.deepcopy(encoded_str)) == str", "difficulty": "code"} {"input": "def remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n >>> remove_vowels('')\n ''\n >>> remove_vowels(\"abcdef\\nghijklm\")\n 'bcdf\\nghjklm'\n >>> remove_vowels('abcdef')\n 'bcdf'\n >>> remove_vowels('aaaaa')\n ''\n >>> remove_vowels('aaBAA')\n 'B'\n >>> remove_vowels('zbcd')\n 'zbcd'\n \"\"\"", "answer": "return \"\".join([s for s in text if s.lower() not in [\"a\", \"e\", \"i\", \"o\", \"u\"]])", "source": "humaneval", "task_id": "HumanEval/51", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate(\"abcdef\\nghijklm\") == 'bcdf\\nghjklm'\n assert candidate('fedcba') == 'fdcb'\n assert candidate('eeeee') == ''\n assert candidate('acBAA') == 'cB'\n assert candidate('EcBOO') == 'cB'\n assert candidate('ybcd') == 'ybcd'", "difficulty": "code"} {"input": "def below_threshold(l: list, t: int):\n \"\"\"Return True if all numbers in the list l are below threshold t.\n >>> below_threshold([1, 2, 4, 10], 100)\n True\n >>> below_threshold([1, 20, 4, 10], 5)\n False\n \"\"\"", "answer": "for e in l:\n if e >= t:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/52", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 4, 10], 100)\n assert not candidate([1, 20, 4, 10], 5)\n assert candidate([1, 20, 4, 10], 21)\n assert candidate([1, 20, 4, 10], 22)\n assert candidate([1, 8, 4, 10], 11)\n assert not candidate([1, 8, 4, 10], 10)", "difficulty": "code"} {"input": "def add(x: int, y: int):\n \"\"\"Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"", "answer": "return x + y", "source": "humaneval", "task_id": "HumanEval/53", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n import random\n\n assert candidate(0, 1) == 1\n assert candidate(1, 0) == 1\n assert candidate(2, 3) == 5\n assert candidate(5, 7) == 12\n assert candidate(7, 5) == 12\n\n for i in range(100):\n x, y = random.randint(0, 1000), random.randint(0, 1000)\n assert candidate(x, y) == x + y", "difficulty": "code"} {"input": "def same_chars(s0: str, s1: str):\n \"\"\"\n Check if two words have the same characters.\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')\n True\n >>> same_chars('abcd', 'dddddddabc')\n True\n >>> same_chars('dddddddabc', 'abcd')\n True\n >>> same_chars('eabcd', 'dddddddabc')\n False\n >>> same_chars('abcd', 'dddddddabce')\n False\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')\n False\n \"\"\"", "answer": "return set(s0) == set(s1)", "source": "humaneval", "task_id": "HumanEval/54", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate('eabcdzzzz', 'dddzzzzzzzddeddabc') == True\n assert candidate('abcd', 'dddddddabc') == True\n assert candidate('dddddddabc', 'abcd') == True\n assert candidate('eabcd', 'dddddddabc') == False\n assert candidate('abcd', 'dddddddabcf') == False\n assert candidate('eabcdzzzz', 'dddzzzzzzzddddabc') == False\n assert candidate('aabb', 'aaccc') == False", "difficulty": "code"} {"input": "def fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"", "answer": "if n == 0:\n return 0\n if n == 1:\n return 1\n return fib(n - 1) + fib(n - 2)", "source": "humaneval", "task_id": "HumanEval/55", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(10) == 55\n assert candidate(1) == 1\n assert candidate(8) == 21\n assert candidate(11) == 89\n assert candidate(12) == 144", "difficulty": "code"} {"input": "def correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"<\" and \">\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"<\")\n False\n >>> correct_bracketing(\"<>\")\n True\n >>> correct_bracketing(\"<<><>>\")\n True\n >>> correct_bracketing(\"><<>\")\n False\n \"\"\"", "answer": "depth = 0\n for b in brackets:\n if b == \"<\":\n depth += 1\n else:\n depth -= 1\n if depth < 0:\n return False\n return depth == 0", "source": "humaneval", "task_id": "HumanEval/56", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(\"<>\")\n assert candidate(\"<<><>>\")\n assert candidate(\"<><><<><>><>\")\n assert candidate(\"<><><<<><><>><>><<><><<>>>\")\n assert not candidate(\"<<<><>>>>\")\n assert not candidate(\"><<>\")\n assert not candidate(\"<\")\n assert not candidate(\"<<<<\")\n assert not candidate(\">\")\n assert not candidate(\"<<>\")\n assert not candidate(\"<><><<><>><>><<>\")\n assert not candidate(\"<><><<><>><>>><>\")", "difficulty": "code"} {"input": "def monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"", "answer": "if l == sorted(l) or l == sorted(l, reverse=True):\n return True\n return False", "source": "humaneval", "task_id": "HumanEval/57", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 4, 10]) == True\n assert candidate([1, 2, 4, 20]) == True\n assert candidate([1, 20, 4, 10]) == False\n assert candidate([4, 1, 0, -10]) == True\n assert candidate([4, 1, 1, 0]) == True\n assert candidate([1, 2, 3, 2, 5, 60]) == False\n assert candidate([1, 2, 3, 4, 5, 60]) == True\n assert candidate([9, 9, 9, 9]) == True", "difficulty": "code"} {"input": "def common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n\n \"\"\"", "answer": "ret = set()\n for e1 in l1:\n for e2 in l2:\n if e1 == e2:\n ret.add(e1)\n return sorted(list(ret))", "source": "humaneval", "task_id": "HumanEval/58", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121]) == [1, 5, 653]\n assert candidate([5, 3, 2, 8], [3, 2]) == [2, 3]\n assert candidate([4, 3, 2, 8], [3, 2, 4]) == [2, 3, 4]\n assert candidate([4, 3, 2, 8], []) == []", "difficulty": "code"} {"input": "def largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"", "answer": "def is_prime(k):\n if k < 2:\n return False\n for i in range(2, k - 1):\n if k % i == 0:\n return False\n return True\n largest = 1\n for j in range(2, n + 1):\n if n % j == 0 and is_prime(j):\n largest = max(largest, j)\n return largest", "source": "humaneval", "task_id": "HumanEval/59", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(15) == 5\n assert candidate(27) == 3\n assert candidate(63) == 7\n assert candidate(330) == 11\n assert candidate(13195) == 29", "difficulty": "code"} {"input": "def sum_to_n(n: int):\n \"\"\"sum_to_n is a function that sums numbers from 1 to n.\n >>> sum_to_n(30)\n 465\n >>> sum_to_n(100)\n 5050\n >>> sum_to_n(5)\n 15\n >>> sum_to_n(10)\n 55\n >>> sum_to_n(1)\n 1\n \"\"\"", "answer": "return sum(range(n + 1))", "source": "humaneval", "task_id": "HumanEval/60", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(1) == 1\n assert candidate(6) == 21\n assert candidate(11) == 66\n assert candidate(30) == 465\n assert candidate(100) == 5050", "difficulty": "code"} {"input": "def correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"(\" and \")\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"(\")\n False\n >>> correct_bracketing(\"()\")\n True\n >>> correct_bracketing(\"(()())\")\n True\n >>> correct_bracketing(\")(()\")\n False\n \"\"\"", "answer": "depth = 0\n for b in brackets:\n if b == \"(\":\n depth += 1\n else:\n depth -= 1\n if depth < 0:\n return False\n return depth == 0", "source": "humaneval", "task_id": "HumanEval/61", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(\"()\")\n assert candidate(\"(()())\")\n assert candidate(\"()()(()())()\")\n assert candidate(\"()()((()()())())(()()(()))\")\n assert not candidate(\"((()())))\")\n assert not candidate(\")(()\")\n assert not candidate(\"(\")\n assert not candidate(\"((((\")\n assert not candidate(\")\")\n assert not candidate(\"(()\")\n assert not candidate(\"()()(()())())(()\")\n assert not candidate(\"()()(()())()))()\")", "difficulty": "code"} {"input": "def derivative(xs: list):\n \"\"\" xs represent coefficients of a polynomial.\n xs[0] + xs[1] * x + xs[2] * x^2 + ....\n Return derivative of this polynomial in the same form.\n >>> derivative([3, 1, 2, 4, 5])\n [1, 4, 12, 20]\n >>> derivative([1, 2, 3])\n [2, 6]\n \"\"\"", "answer": "return [(i * x) for i, x in enumerate(xs)][1:]", "source": "humaneval", "task_id": "HumanEval/62", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate([3, 1, 2, 4, 5]) == [1, 4, 12, 20]\n assert candidate([1, 2, 3]) == [2, 6]\n assert candidate([3, 2, 1]) == [2, 2]\n assert candidate([3, 2, 1, 0, 4]) == [2, 2, 0, 16]\n assert candidate([1]) == []", "difficulty": "code"} {"input": "def fibfib(n: int):\n \"\"\"The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fibfib(0) == 0\n fibfib(1) == 0\n fibfib(2) == 1\n fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).\n Please write a function to efficiently compute the n-th element of the fibfib number sequence.\n >>> fibfib(1)\n 0\n >>> fibfib(5)\n 4\n >>> fibfib(8)\n 24\n \"\"\"", "answer": "if n == 0:\n return 0\n if n == 1:\n return 0\n if n == 2:\n return 1\n return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3)", "source": "humaneval", "task_id": "HumanEval/63", "test_cases": "METADATA = {}\n\n\ndef check(candidate):\n assert candidate(2) == 1\n assert candidate(1) == 0\n assert candidate(5) == 4\n assert candidate(8) == 24\n assert candidate(10) == 81\n assert candidate(12) == 274\n assert candidate(14) == 927", "difficulty": "code"} {"input": "FIX = \"\"\"\nAdd more test cases.\n\"\"\"\n\ndef vowels_count(s):\n \"\"\"Write a function vowels_count which takes a string representing\n a word as input and returns the number of vowels in the string.\n Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a\n vowel, but only when it is at the end of the given word.\n\n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \"\"\"", "answer": "vowels = \"aeiouAEIOU\"\n n_vowels = sum(c in vowels for c in s)\n if s[-1] == 'y' or s[-1] == 'Y':\n n_vowels += 1\n return n_vowels", "source": "humaneval", "task_id": "HumanEval/64", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"abcde\") == 2, \"Test 1\"\n assert candidate(\"Alone\") == 3, \"Test 2\"\n assert candidate(\"key\") == 2, \"Test 3\"\n assert candidate(\"bye\") == 1, \"Test 4\"\n assert candidate(\"keY\") == 2, \"Test 5\"\n assert candidate(\"bYe\") == 1, \"Test 6\"\n assert candidate(\"ACEDY\") == 3, \"Test 7\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def circular_shift(x, shift):\n \"\"\"Circular shift the digits of the integer x, shift the digits right by shift\n and return the result as a string.\n If shift > number of digits, return digits reversed.\n >>> circular_shift(12, 1)\n \"21\"\n >>> circular_shift(12, 2)\n \"12\"\n \"\"\"", "answer": "s = str(x)\n if shift > len(s):\n return s[::-1]\n else:\n return s[len(s) - shift:] + s[:len(s) - shift]", "source": "humaneval", "task_id": "HumanEval/65", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(100, 2) == \"001\"\n assert candidate(12, 2) == \"12\"\n assert candidate(97, 8) == \"79\"\n assert candidate(12, 1) == \"21\", \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(11, 101) == \"11\", \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def digitSum(s):\n \"\"\"Task\n Write a function that takes a string as input and returns the sum of the upper characters only'\n ASCII codes.\n\n Examples:\n digitSum(\"\") => 0\n digitSum(\"abAB\") => 131\n digitSum(\"abcCd\") => 67\n digitSum(\"helloE\") => 69\n digitSum(\"woArBld\") => 131\n digitSum(\"aAaaaXa\") => 153\n \"\"\"", "answer": "if s == \"\": return 0\n return sum(ord(char) if char.isupper() else 0 for char in s)", "source": "humaneval", "task_id": "HumanEval/66", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(\"\") == 0, \"Error\"\n assert candidate(\"abAB\") == 131, \"Error\"\n assert candidate(\"abcCd\") == 67, \"Error\"\n assert candidate(\"helloE\") == 69, \"Error\"\n assert candidate(\"woArBld\") == 131, \"Error\"\n assert candidate(\"aAaaaXa\") == 153, \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(\" How are yOu?\") == 151, \"Error\"\n assert candidate(\"You arE Very Smart\") == 327, \"Error\"", "difficulty": "code"} {"input": "def fruit_distribution(s,n):\n \"\"\"\n In this task, you will be given a string that represents a number of apples and oranges \n that are distributed in a basket of fruit this basket contains \n apples, oranges, and mango fruits. Given the string that represents the total number of \n the oranges and apples and an integer that represent the total number of the fruits \n in the basket return the number of the mango fruits in the basket.\n for examble:\n fruit_distribution(\"5 apples and 6 oranges\", 19) ->19 - 5 - 6 = 8\n fruit_distribution(\"0 apples and 1 oranges\",3) -> 3 - 0 - 1 = 2\n fruit_distribution(\"2 apples and 3 oranges\", 100) -> 100 - 2 - 3 = 95\n fruit_distribution(\"100 apples and 1 oranges\",120) -> 120 - 100 - 1 = 19\n \"\"\"", "answer": "lis = list()\n for i in s.split(' '):\n if i.isdigit():\n lis.append(int(i))\n return n - sum(lis)", "source": "humaneval", "task_id": "HumanEval/67", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"5 apples and 6 oranges\",19) == 8\n assert candidate(\"5 apples and 6 oranges\",21) == 10\n assert candidate(\"0 apples and 1 oranges\",3) == 2\n assert candidate(\"1 apples and 0 oranges\",3) == 2\n assert candidate(\"2 apples and 3 oranges\",100) == 95\n assert candidate(\"2 apples and 3 oranges\",5) == 0\n assert candidate(\"1 apples and 100 oranges\",120) == 19", "difficulty": "code"} {"input": "def pluck(arr):\n \"\"\"\n \"Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"", "answer": "if(len(arr) == 0): return []\n evens = list(filter(lambda x: x%2 == 0, arr))\n if(evens == []): return []\n return [min(evens), arr.index(min(evens))]", "source": "humaneval", "task_id": "HumanEval/68", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([4,2,3]) == [2, 1], \"Error\"\n assert candidate([1,2,3]) == [2, 1], \"Error\"\n assert candidate([]) == [], \"Error\"\n assert candidate([5, 0, 3, 0, 4, 2]) == [0, 1], \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([1, 2, 3, 0, 5, 3]) == [0, 3], \"Error\"\n assert candidate([5, 4, 8, 4 ,8]) == [4, 1], \"Error\"\n assert candidate([7, 6, 7, 1]) == [6, 1], \"Error\"\n assert candidate([7, 9, 7, 1]) == [], \"Error\"", "difficulty": "code"} {"input": "def search(lst):\n '''\n You are given a non-empty list of positive integers. Return the greatest integer that is greater than \n zero, and has a frequency greater than or equal to the value of the integer itself. \n The frequency of an integer is the number of times it appears in the list.\n If no such a value exist, return -1.\n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n '''", "answer": "frq = [0] * (max(lst) + 1)\n for i in lst:\n frq[i] += 1;\n\n ans = -1\n for i in range(1, len(frq)):\n if frq[i] >= i:\n ans = i\n \n return ans", "source": "humaneval", "task_id": "HumanEval/69", "test_cases": "def check(candidate):\n\n # manually generated tests\n assert candidate([5, 5, 5, 5, 1]) == 1\n assert candidate([4, 1, 4, 1, 4, 4]) == 4\n assert candidate([3, 3]) == -1\n assert candidate([8, 8, 8, 8, 8, 8, 8, 8]) == 8\n assert candidate([2, 3, 3, 2, 2]) == 2\n\n # automatically generated tests\n assert candidate([2, 7, 8, 8, 4, 8, 7, 3, 9, 6, 5, 10, 4, 3, 6, 7, 1, 7, 4, 10, 8, 1]) == 1\n assert candidate([3, 2, 8, 2]) == 2\n assert candidate([6, 7, 1, 8, 8, 10, 5, 8, 5, 3, 10]) == 1\n assert candidate([8, 8, 3, 6, 5, 6, 4]) == -1\n assert candidate([6, 9, 6, 7, 1, 4, 7, 1, 8, 8, 9, 8, 10, 10, 8, 4, 10, 4, 10, 1, 2, 9, 5, 7, 9]) == 1\n assert candidate([1, 9, 10, 1, 3]) == 1\n assert candidate([6, 9, 7, 5, 8, 7, 5, 3, 7, 5, 10, 10, 3, 6, 10, 2, 8, 6, 5, 4, 9, 5, 3, 10]) == 5\n assert candidate([1]) == 1\n assert candidate([8, 8, 10, 6, 4, 3, 5, 8, 2, 4, 2, 8, 4, 6, 10, 4, 2, 1, 10, 2, 1, 1, 5]) == 4\n assert candidate([2, 10, 4, 8, 2, 10, 5, 1, 2, 9, 5, 5, 6, 3, 8, 6, 4, 10]) == 2\n assert candidate([1, 6, 10, 1, 6, 9, 10, 8, 6, 8, 7, 3]) == 1\n assert candidate([9, 2, 4, 1, 5, 1, 5, 2, 5, 7, 7, 7, 3, 10, 1, 5, 4, 2, 8, 4, 1, 9, 10, 7, 10, 2, 8, 10, 9, 4]) == 4\n assert candidate([2, 6, 4, 2, 8, 7, 5, 6, 4, 10, 4, 6, 3, 7, 8, 8, 3, 1, 4, 2, 2, 10, 7]) == 4\n assert candidate([9, 8, 6, 10, 2, 6, 10, 2, 7, 8, 10, 3, 8, 2, 6, 2, 3, 1]) == 2\n assert candidate([5, 5, 3, 9, 5, 6, 3, 2, 8, 5, 6, 10, 10, 6, 8, 4, 10, 7, 7, 10, 8]) == -1\n assert candidate([10]) == -1\n assert candidate([9, 7, 7, 2, 4, 7, 2, 10, 9, 7, 5, 7, 2]) == 2\n assert candidate([5, 4, 10, 2, 1, 1, 10, 3, 6, 1, 8]) == 1\n assert candidate([7, 9, 9, 9, 3, 4, 1, 5, 9, 1, 2, 1, 1, 10, 7, 5, 6, 7, 6, 7, 7, 6]) == 1\n assert candidate([3, 10, 10, 9, 2]) == -1", "difficulty": "code"} {"input": "def strange_sort_list(lst):\n '''\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n '''", "answer": "res, switch = [], True\n while lst:\n res.append(min(lst) if switch else max(lst))\n lst.remove(res[-1])\n switch = not switch\n return res", "source": "humaneval", "task_id": "HumanEval/70", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1, 2, 3, 4]) == [1, 4, 2, 3]\n assert candidate([5, 6, 7, 8, 9]) == [5, 9, 6, 8, 7]\n assert candidate([1, 2, 3, 4, 5]) == [1, 5, 2, 4, 3]\n assert candidate([5, 6, 7, 8, 9, 1]) == [1, 9, 5, 8, 6, 7]\n assert candidate([5, 5, 5, 5]) == [5, 5, 5, 5]\n assert candidate([]) == []\n assert candidate([1,2,3,4,5,6,7,8]) == [1, 8, 2, 7, 3, 6, 4, 5]\n assert candidate([0,2,2,2,5,5,-5,-5]) == [-5, 5, -5, 5, 0, 2, 2, 2]\n assert candidate([111111]) == [111111]\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''", "answer": "if a + b <= c or a + c <= b or b + c <= a:\n return -1 \n s = (a + b + c)/2 \n area = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n area = round(area, 2)\n return area", "source": "humaneval", "task_id": "HumanEval/71", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(3, 4, 5) == 6.00, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(1, 2, 10) == -1\n assert candidate(4, 8, 5) == 8.18\n assert candidate(2, 2, 2) == 1.73\n assert candidate(1, 2, 3) == -1\n assert candidate(10, 5, 7) == 16.25\n assert candidate(2, 6, 3) == -1\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 1, 1) == 0.43, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(2, 2, 10) == -1", "difficulty": "code"} {"input": "def will_it_fly(q,w):\n '''\n Write a function that returns True if the object q will fly, and False otherwise.\n The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.\n\n Example:\n will_it_fly([1, 2], 5) ➞ False \n # 1+2 is less than the maximum possible weight, but it's unbalanced.\n\n will_it_fly([3, 2, 3], 1) ➞ False\n # it's balanced, but 3+2+3 is more than the maximum possible weight.\n\n will_it_fly([3, 2, 3], 9) ➞ True\n # 3+2+3 is less than the maximum possible weight, and it's balanced.\n\n will_it_fly([3], 5) ➞ True\n # 3 is less than the maximum possible weight, and it's balanced.\n '''", "answer": "if sum(q) > w:\n return False\n\n i, j = 0, len(q)-1\n while i true\n is_simple_power(2, 2) => true\n is_simple_power(8, 2) => true\n is_simple_power(3, 2) => false\n is_simple_power(3, 1) => false\n is_simple_power(5, 3) => false\n \"\"\"", "answer": "if (n == 1): \n return (x == 1) \n power = 1\n while (power < x): \n power = power * n \n return (power == x)", "source": "humaneval", "task_id": "HumanEval/76", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(16, 2)== True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(143214, 16)== False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(4, 2)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(9, 3)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(16, 4)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(24, 2)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(128, 4)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(12, 6)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 1)==True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(1, 12)==True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this ingeger is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''", "answer": "a = abs(a)\n return int(round(a ** (1. / 3))) ** 3 == a", "source": "humaneval", "task_id": "HumanEval/77", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(1) == True, \"First test error: \" + str(candidate(1))\n assert candidate(2) == False, \"Second test error: \" + str(candidate(2))\n assert candidate(-1) == True, \"Third test error: \" + str(candidate(-1))\n assert candidate(64) == True, \"Fourth test error: \" + str(candidate(64))\n assert candidate(180) == False, \"Fifth test error: \" + str(candidate(180))\n assert candidate(1000) == True, \"Sixth test error: \" + str(candidate(1000))\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(0) == True, \"1st edge test error: \" + str(candidate(0))\n assert candidate(1729) == False, \"2nd edge test error: \" + str(candidate(1728))", "difficulty": "code"} {"input": "def hex_key(num):\n \"\"\"You have been tasked to write a function that receives \n a hexadecimal number as a string and counts the number of hexadecimal \n digits that are primes (prime number, or a prime, is a natural number \n greater than 1 that is not a product of two smaller natural numbers).\n Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.\n Prime numbers are 2, 3, 5, 7, 11, 13, 17,...\n So you have to determine a number of the following digits: 2, 3, 5, 7, \n B (=decimal 11), D (=decimal 13).\n Note: you may assume the input is always correct or empty string, \n and symbols A,B,C,D,E,F are always uppercase.\n Examples:\n For num = \"AB\" the output should be 1.\n For num = \"1077E\" the output should be 2.\n For num = \"ABED1A33\" the output should be 4.\n For num = \"123456789ABCDEF0\" the output should be 6.\n For num = \"2020\" the output should be 2.\n \"\"\"", "answer": "primes = ('2', '3', '5', '7', 'B', 'D')\n total = 0\n for i in range(0, len(num)):\n if num[i] in primes:\n total += 1\n return total", "source": "humaneval", "task_id": "HumanEval/78", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"AB\") == 1, \"First test error: \" + str(candidate(\"AB\")) \n assert candidate(\"1077E\") == 2, \"Second test error: \" + str(candidate(\"1077E\")) \n assert candidate(\"ABED1A33\") == 4, \"Third test error: \" + str(candidate(\"ABED1A33\")) \n assert candidate(\"2020\") == 2, \"Fourth test error: \" + str(candidate(\"2020\")) \n assert candidate(\"123456789ABCDEF0\") == 6, \"Fifth test error: \" + str(candidate(\"123456789ABCDEF0\")) \n assert candidate(\"112233445566778899AABBCCDDEEFF00\") == 12, \"Sixth test error: \" + str(candidate(\"112233445566778899AABBCCDDEEFF00\")) \n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([]) == 0", "difficulty": "code"} {"input": "def decimal_to_binary(decimal):\n \"\"\"You will be given a number in decimal form and your task is to convert it to\n binary format. The function should return a string, with each character representing a binary\n number. Each character in the string will be '0' or '1'.\n\n There will be an extra couple of characters 'db' at the beginning and at the end of the string.\n The extra characters are there to help with the format.\n\n Examples:\n decimal_to_binary(15) # returns \"db1111db\"\n decimal_to_binary(32) # returns \"db100000db\"\n \"\"\"", "answer": "return \"db\" + bin(decimal)[2:] + \"db\"", "source": "humaneval", "task_id": "HumanEval/79", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(0) == \"db0db\"\n assert candidate(32) == \"db100000db\"\n assert candidate(103) == \"db1100111db\"\n assert candidate(15) == \"db1111db\", \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def is_happy(s):\n \"\"\"You are given a string s.\n Your task is to check if the string is happy or not.\n A string is happy if its length is at least 3 and every 3 consecutive letters are distinct\n For example:\n is_happy(a) => False\n is_happy(aa) => False\n is_happy(abcd) => True\n is_happy(aabb) => False\n is_happy(adb) => True\n is_happy(xyy) => False\n \"\"\"", "answer": "if len(s) < 3:\n return False\n\n for i in range(len(s) - 2):\n \n if s[i] == s[i+1] or s[i+1] == s[i+2] or s[i] == s[i+2]:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/80", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"a\") == False , \"a\"\n assert candidate(\"aa\") == False , \"aa\"\n assert candidate(\"abcd\") == True , \"abcd\"\n assert candidate(\"aabb\") == False , \"aabb\"\n assert candidate(\"adb\") == True , \"adb\"\n assert candidate(\"xyy\") == False , \"xyy\"\n assert candidate(\"iopaxpoi\") == True , \"iopaxpoi\"\n assert candidate(\"iopaxioi\") == False , \"iopaxioi\"", "difficulty": "code"} {"input": "def numerical_letter_grade(grades):\n \"\"\"It is the last week of the semester and the teacher has to give the grades\n to students. The teacher has been making her own algorithm for grading.\n The only problem is, she has lost the code she used for grading.\n She has given you a list of GPAs for some students and you have to write \n a function that can output a list of letter grades using the following table:\n GPA | Letter grade\n 4.0 A+\n > 3.7 A \n > 3.3 A- \n > 3.0 B+\n > 2.7 B \n > 2.3 B-\n > 2.0 C+\n > 1.7 C\n > 1.3 C-\n > 1.0 D+ \n > 0.7 D \n > 0.0 D-\n 0.0 E\n \n\n Example:\n grade_equation([4.0, 3, 1.7, 2, 3.5]) ==> ['A+', 'B', 'C-', 'C', 'A-']\n \"\"\"", "answer": "letter_grade = []\n for gpa in grades:\n if gpa == 4.0:\n letter_grade.append(\"A+\")\n elif gpa > 3.7:\n letter_grade.append(\"A\")\n elif gpa > 3.3:\n letter_grade.append(\"A-\")\n elif gpa > 3.0:\n letter_grade.append(\"B+\")\n elif gpa > 2.7:\n letter_grade.append(\"B\")\n elif gpa > 2.3:\n letter_grade.append(\"B-\")\n elif gpa > 2.0:\n letter_grade.append(\"C+\")\n elif gpa > 1.7:\n letter_grade.append(\"C\")\n elif gpa > 1.3:\n letter_grade.append(\"C-\")\n elif gpa > 1.0:\n letter_grade.append(\"D+\")\n elif gpa > 0.7:\n letter_grade.append(\"D\")\n elif gpa > 0.0:\n letter_grade.append(\"D-\")\n else:\n letter_grade.append(\"E\")\n return letter_grade", "source": "humaneval", "task_id": "HumanEval/81", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([4.0, 3, 1.7, 2, 3.5]) == ['A+', 'B', 'C-', 'C', 'A-']\n assert candidate([1.2]) == ['D+']\n assert candidate([0.5]) == ['D-']\n assert candidate([0.0]) == ['E']\n assert candidate([1, 0.3, 1.5, 2.8, 3.3]) == ['D', 'D-', 'C-', 'B', 'B+']\n assert candidate([0, 0.7]) == ['E', 'D-']\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def prime_length(string):\n \"\"\"Write a function that takes a string and returns True if the string\n length is a prime number or False otherwise\n Examples\n prime_length('Hello') == True\n prime_length('abcdcba') == True\n prime_length('kittens') == True\n prime_length('orange') == False\n \"\"\"", "answer": "l = len(string)\n if l == 0 or l == 1:\n return False\n for i in range(2, l):\n if l % i == 0:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/82", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('Hello') == True\n assert candidate('abcdcba') == True\n assert candidate('kittens') == True\n assert candidate('orange') == False\n assert candidate('wow') == True\n assert candidate('world') == True\n assert candidate('MadaM') == True\n assert candidate('Wow') == True\n assert candidate('') == False\n assert candidate('HI') == True\n assert candidate('go') == True\n assert candidate('gogo') == False\n assert candidate('aaaaaaaaaaaaaaa') == False\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate('Madam') == True\n assert candidate('M') == False\n assert candidate('0') == False", "difficulty": "code"} {"input": "def starts_one_ends(n):\n \"\"\"\n Given a positive integer n, return the count of the numbers of n-digit\n positive integers that start or end with 1.\n \"\"\"", "answer": "if n == 1: return 1\n return 18 * (10 ** (n - 2))", "source": "humaneval", "task_id": "HumanEval/83", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(1) == 1\n assert candidate(2) == 18\n assert candidate(3) == 180\n assert candidate(4) == 1800\n assert candidate(5) == 18000\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def solve(N):\n \"\"\"Given a positive integer N, return the total sum of its digits in binary.\n \n Example\n For N = 1000, the sum of digits will be 1 the output should be \"1\".\n For N = 150, the sum of digits will be 6 the output should be \"110\".\n For N = 147, the sum of digits will be 12 the output should be \"1100\".\n \n Variables:\n @N integer\n Constraints: 0 ≤ N ≤ 10000.\n Output:\n a string of binary number\n \"\"\"", "answer": "return bin(sum(int(i) for i in str(N)))[2:]", "source": "humaneval", "task_id": "HumanEval/84", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(1000) == \"1\", \"Error\"\n assert candidate(150) == \"110\", \"Error\"\n assert candidate(147) == \"1100\", \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(333) == \"1001\", \"Error\"\n assert candidate(963) == \"10010\", \"Error\"", "difficulty": "code"} {"input": "def add(lst):\n \"\"\"Given a non-empty list of integers lst. add the even elements that are at odd indices..\n\n\n Examples:\n add([4, 2, 6, 7]) ==> 2 \n \"\"\"", "answer": "return sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0])", "source": "humaneval", "task_id": "HumanEval/85", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([4, 88]) == 88\n assert candidate([4, 5, 6, 7, 2, 122]) == 122\n assert candidate([4, 0, 6, 7]) == 0\n assert candidate([4, 4, 6, 8]) == 12\n\n # Check some edge cases that are easy to work out by hand.", "difficulty": "code"} {"input": "def anti_shuffle(s):\n \"\"\"\n Write a function that takes a string and returns an ordered version of it.\n Ordered version of string, is a string where all words (separated by space)\n are replaced by a new word where all the characters arranged in\n ascending order based on ascii value.\n Note: You should keep the order of words and blank spaces in the sentence.\n\n For example:\n anti_shuffle('Hi') returns 'Hi'\n anti_shuffle('hello') returns 'ehllo'\n anti_shuffle('Hello World!!!') returns 'Hello !!!Wdlor'\n \"\"\"", "answer": "return ' '.join([''.join(sorted(list(i))) for i in s.split(' ')])", "source": "humaneval", "task_id": "HumanEval/86", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('Hi') == 'Hi'\n assert candidate('hello') == 'ehllo'\n assert candidate('number') == 'bemnru'\n assert candidate('abcd') == 'abcd'\n assert candidate('Hello World!!!') == 'Hello !!!Wdlor'\n assert candidate('') == ''\n assert candidate('Hi. My name is Mister Robot. How are you?') == '.Hi My aemn is Meirst .Rboot How aer ?ouy'\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def get_row(lst, x):\n \"\"\"\n You are given a 2 dimensional data, as a nested lists,\n which is similar to matrix, however, unlike matrices,\n each row may contain a different number of columns.\n Given lst, and integer x, find integers x in the list,\n and return list of tuples, [(x1, y1), (x2, y2) ...] such that\n each tuple is a coordinate - (row, columns), starting with 0.\n Sort coordinates initially by rows in ascending order.\n Also, sort coordinates of the row by columns in descending order.\n \n Examples:\n get_row([\n [1,2,3,4,5,6],\n [1,2,3,4,1,6],\n [1,2,3,4,5,1]\n ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]\n get_row([], 1) == []\n get_row([[], [1], [1, 2, 3]], 3) == [(2, 2)]\n \"\"\"", "answer": "coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]\n return sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])", "source": "humaneval", "task_id": "HumanEval/87", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([\n [1,2,3,4,5,6],\n [1,2,3,4,1,6],\n [1,2,3,4,5,1]\n ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]\n assert candidate([\n [1,2,3,4,5,6],\n [1,2,3,4,5,6],\n [1,2,3,4,5,6],\n [1,2,3,4,5,6],\n [1,2,3,4,5,6],\n [1,2,3,4,5,6]\n ], 2) == [(0, 1), (1, 1), (2, 1), (3, 1), (4, 1), (5, 1)]\n assert candidate([\n [1,2,3,4,5,6],\n [1,2,3,4,5,6],\n [1,1,3,4,5,6],\n [1,2,1,4,5,6],\n [1,2,3,1,5,6],\n [1,2,3,4,1,6],\n [1,2,3,4,5,1]\n ], 1) == [(0, 0), (1, 0), (2, 1), (2, 0), (3, 2), (3, 0), (4, 3), (4, 0), (5, 4), (5, 0), (6, 5), (6, 0)]\n assert candidate([], 1) == []\n assert candidate([[1]], 2) == []\n assert candidate([[], [1], [1, 2, 3]], 3) == [(2, 2)]\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def sort_array(array):\n \"\"\"\n Given an array of non-negative integers, return a copy of the given array after sorting,\n you will sort the given array in ascending order if the sum( first index value, last index value) is odd,\n or sort it in descending order if the sum( first index value, last index value) is even.\n\n Note:\n * don't change the given array.\n\n Examples:\n * sort_array([]) => []\n * sort_array([5]) => [5]\n * sort_array([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]\n * sort_array([2, 4, 3, 0, 1, 5, 6]) => [6, 5, 4, 3, 2, 1, 0]\n \"\"\"", "answer": "return [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0)", "source": "humaneval", "task_id": "HumanEval/88", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([]) == [], \"Error\"\n assert candidate([5]) == [5], \"Error\"\n assert candidate([2, 4, 3, 0, 1, 5]) == [0, 1, 2, 3, 4, 5], \"Error\"\n assert candidate([2, 4, 3, 0, 1, 5, 6]) == [6, 5, 4, 3, 2, 1, 0], \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([2, 1]) == [1, 2], \"Error\"\n assert candidate([15, 42, 87, 32 ,11, 0]) == [0, 11, 15, 32, 42, 87], \"Error\"\n assert candidate([21, 14, 23, 11]) == [23, 21, 14, 11], \"Error\"", "difficulty": "code"} {"input": "def encrypt(s):\n \"\"\"Create a function encrypt that takes a string as an argument and\n returns a string encrypted with the alphabet being rotated. \n The alphabet should be rotated in a manner such that the letters \n shift down by two multiplied to two places.\n For example:\n encrypt('hi') returns 'lm'\n encrypt('asdfghjkl') returns 'ewhjklnop'\n encrypt('gf') returns 'kj'\n encrypt('et') returns 'ix'\n \"\"\"", "answer": "d = 'abcdefghijklmnopqrstuvwxyz'\n out = ''\n for c in s:\n if c in d:\n out += d[(d.index(c)+2*2) % 26]\n else:\n out += c\n return out", "source": "humaneval", "task_id": "HumanEval/89", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('hi') == 'lm', \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('asdfghjkl') == 'ewhjklnop', \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('gf') == 'kj', \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('et') == 'ix', \"This prints if this assert fails 1 (good for debugging!)\"\n\n assert candidate('faewfawefaewg')=='jeiajeaijeiak', \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('hellomyfriend')=='lippsqcjvmirh', \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate('dxzdlmnilfuhmilufhlihufnmlimnufhlimnufhfucufh')=='hbdhpqrmpjylqmpyjlpmlyjrqpmqryjlpmqryjljygyjl', \"This prints if this assert fails 3 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate('a')=='e', \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def next_smallest(lst):\n \"\"\"\n You are given a list of integers.\n Write a function next_smallest() that returns the 2nd smallest element of the list.\n Return None if there is no such element.\n \n next_smallest([1, 2, 3, 4, 5]) == 2\n next_smallest([5, 1, 4, 3, 2]) == 2\n next_smallest([]) == None\n next_smallest([1, 1]) == None\n \"\"\"", "answer": "lst = sorted(set(lst))\n return None if len(lst) < 2 else lst[1]", "source": "humaneval", "task_id": "HumanEval/90", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1, 2, 3, 4, 5]) == 2\n assert candidate([5, 1, 4, 3, 2]) == 2\n assert candidate([]) == None\n assert candidate([1, 1]) == None\n assert candidate([1,1,1,1,0]) == 1\n assert candidate([1, 0**0]) == None\n assert candidate([-35, 34, 12, -45]) == -35\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def is_bored(S):\n \"\"\"\n You'll be given a string of words, and your task is to count the number\n of boredoms. A boredom is a sentence that starts with the word \"I\".\n Sentences are delimited by '.', '?' or '!'.\n \n For example:\n >>> is_bored(\"Hello world\")\n 0\n >>> is_bored(\"The sky is blue. The sun is shining. I love this weather\")\n 1\n \"\"\"", "answer": "import re\n sentences = re.split(r'[.?!]\\s*', S)\n return sum(sentence[0:2] == 'I ' for sentence in sentences)", "source": "humaneval", "task_id": "HumanEval/91", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"Hello world\") == 0, \"Test 1\"\n assert candidate(\"Is the sky blue?\") == 0, \"Test 2\"\n assert candidate(\"I love It !\") == 1, \"Test 3\"\n assert candidate(\"bIt\") == 0, \"Test 4\"\n assert candidate(\"I feel good today. I will be productive. will kill It\") == 2, \"Test 5\"\n assert candidate(\"You and I are going for a walk\") == 0, \"Test 6\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def any_int(x, y, z):\n '''\n Create a function that takes 3 numbers.\n Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.\n Returns false in any other cases.\n \n Examples\n any_int(5, 2, 7) ➞ True\n \n any_int(3, 2, 2) ➞ False\n\n any_int(3, -2, 1) ➞ True\n \n any_int(3.6, -2.2, 2) ➞ False\n \n\n \n '''", "answer": "if isinstance(x,int) and isinstance(y,int) and isinstance(z,int):\n if (x+y==z) or (x+z==y) or (y+z==x):\n return True\n return False\n return False", "source": "humaneval", "task_id": "HumanEval/92", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(2, 3, 1)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(2.5, 2, 3)==False, \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate(1.5, 5, 3.5)==False, \"This prints if this assert fails 3 (good for debugging!)\"\n assert candidate(2, 6, 2)==False, \"This prints if this assert fails 4 (good for debugging!)\"\n assert candidate(4, 2, 2)==True, \"This prints if this assert fails 5 (good for debugging!)\"\n assert candidate(2.2, 2.2, 2.2)==False, \"This prints if this assert fails 6 (good for debugging!)\"\n assert candidate(-4, 6, 2)==True, \"This prints if this assert fails 7 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(2,1,1)==True, \"This prints if this assert fails 8 (also good for debugging!)\"\n assert candidate(3,4,7)==True, \"This prints if this assert fails 9 (also good for debugging!)\"\n assert candidate(3.0,4,7)==False, \"This prints if this assert fails 10 (also good for debugging!)\"", "difficulty": "code"} {"input": "def encode(message):\n \"\"\"\n Write a function that takes a message, and encodes in such a \n way that it swaps case of all letters, replaces all vowels in \n the message with the letter that appears 2 places ahead of that \n vowel in the english alphabet. \n Assume only letters. \n \n Examples:\n >>> encode('test')\n 'TGST'\n >>> encode('This is a message')\n 'tHKS KS C MGSSCGG'\n \"\"\"", "answer": "vowels = \"aeiouAEIOU\"\n vowels_replace = dict([(i, chr(ord(i) + 2)) for i in vowels])\n message = message.swapcase()\n return ''.join([vowels_replace[i] if i in vowels else i for i in message])", "source": "humaneval", "task_id": "HumanEval/93", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('TEST') == 'tgst', \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('Mudasir') == 'mWDCSKR', \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate('YES') == 'ygs', \"This prints if this assert fails 3 (good for debugging!)\"\n \n # Check some edge cases that are easy to work out by hand.\n assert candidate('This is a message') == 'tHKS KS C MGSSCGG', \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(\"I DoNt KnOw WhAt tO WrItE\") == 'k dQnT kNqW wHcT Tq wRkTg', \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def skjkasdkd(lst):\n \"\"\"You are given a list of integers.\n You need to find the largest prime value and return the sum of its digits.\n\n Examples:\n For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10\n For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25\n For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13\n For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11\n For lst = [0,81,12,3,1,21] the output should be 3\n For lst = [0,8,1,2,1,7] the output should be 7\n \"\"\"", "answer": "def isPrime(n):\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n return False\n\n return True\n maxx = 0\n i = 0\n while i < len(lst):\n if(lst[i] > maxx and isPrime(lst[i])):\n maxx = lst[i]\n i+=1\n result = sum(int(digit) for digit in str(maxx))\n return result", "source": "humaneval", "task_id": "HumanEval/94", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3]) == 10, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1]) == 25, \"This prints if this assert fails 2 (also good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3]) == 13, \"This prints if this assert fails 3 (also good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([0,724,32,71,99,32,6,0,5,91,83,0,5,6]) == 11, \"This prints if this assert fails 4 (also good for debugging!)\"\n \n # Check some edge cases that are easy to work out by hand.\n assert candidate([0,81,12,3,1,21]) == 3, \"This prints if this assert fails 5 (also good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([0,8,1,2,1,7]) == 7, \"This prints if this assert fails 6 (also good for debugging!)\"\n\n assert candidate([8191]) == 19, \"This prints if this assert fails 7 (also good for debugging!)\"\n assert candidate([8191, 123456, 127, 7]) == 19, \"This prints if this assert fails 8 (also good for debugging!)\"\n assert candidate([127, 97, 8192]) == 10, \"This prints if this assert fails 9 (also good for debugging!)\"", "difficulty": "code"} {"input": "def check_dict_case(dict):\n \"\"\"\n Given a dictionary, return True if all keys are strings in lower \n case or all keys are strings in upper case, else return False.\n The function should return False is the given dictionary is empty.\n Examples:\n check_dict_case({\"a\":\"apple\", \"b\":\"banana\"}) should return True.\n check_dict_case({\"a\":\"apple\", \"A\":\"banana\", \"B\":\"banana\"}) should return False.\n check_dict_case({\"a\":\"apple\", 8:\"banana\", \"a\":\"apple\"}) should return False.\n check_dict_case({\"Name\":\"John\", \"Age\":\"36\", \"City\":\"Houston\"}) should return False.\n check_dict_case({\"STATE\":\"NC\", \"ZIP\":\"12345\" }) should return True.\n \"\"\"", "answer": "if len(dict.keys()) == 0:\n return False\n else:\n state = \"start\"\n for key in dict.keys():\n\n if isinstance(key, str) == False:\n state = \"mixed\"\n break\n if state == \"start\":\n if key.isupper():\n state = \"upper\"\n elif key.islower():\n state = \"lower\"\n else:\n break\n elif (state == \"upper\" and not key.isupper()) or (state == \"lower\" and not key.islower()):\n state = \"mixed\"\n break\n else:\n break\n return state == \"upper\" or state == \"lower\"", "source": "humaneval", "task_id": "HumanEval/95", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate({\"p\":\"pineapple\", \"b\":\"banana\"}) == True, \"First test error: \" + str(candidate({\"p\":\"pineapple\", \"b\":\"banana\"}))\n assert candidate({\"p\":\"pineapple\", \"A\":\"banana\", \"B\":\"banana\"}) == False, \"Second test error: \" + str(candidate({\"p\":\"pineapple\", \"A\":\"banana\", \"B\":\"banana\"}))\n assert candidate({\"p\":\"pineapple\", 5:\"banana\", \"a\":\"apple\"}) == False, \"Third test error: \" + str(candidate({\"p\":\"pineapple\", 5:\"banana\", \"a\":\"apple\"}))\n assert candidate({\"Name\":\"John\", \"Age\":\"36\", \"City\":\"Houston\"}) == False, \"Fourth test error: \" + str(candidate({\"Name\":\"John\", \"Age\":\"36\", \"City\":\"Houston\"}))\n assert candidate({\"STATE\":\"NC\", \"ZIP\":\"12345\" }) == True, \"Fifth test error: \" + str(candidate({\"STATE\":\"NC\", \"ZIP\":\"12345\" })) \n assert candidate({\"fruit\":\"Orange\", \"taste\":\"Sweet\" }) == True, \"Fourth test error: \" + str(candidate({\"fruit\":\"Orange\", \"taste\":\"Sweet\" })) \n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate({}) == False, \"1st edge test error: \" + str(candidate({}))", "difficulty": "code"} {"input": "def count_up_to(n):\n \"\"\"Implement a function that takes an non-negative integer and returns an array of the first n\n integers that are prime numbers and less than n.\n for example:\n count_up_to(5) => [2,3]\n count_up_to(11) => [2,3,5,7]\n count_up_to(0) => []\n count_up_to(20) => [2,3,5,7,11,13,17,19]\n count_up_to(1) => []\n count_up_to(18) => [2,3,5,7,11,13,17]\n \"\"\"", "answer": "primes = []\n for i in range(2, n):\n is_prime = True\n for j in range(2, i):\n if i % j == 0:\n is_prime = False\n break\n if is_prime:\n primes.append(i)\n return primes", "source": "humaneval", "task_id": "HumanEval/96", "test_cases": "def check(candidate):\n\n assert candidate(5) == [2,3]\n assert candidate(6) == [2,3,5]\n assert candidate(7) == [2,3,5]\n assert candidate(10) == [2,3,5,7]\n assert candidate(0) == []\n assert candidate(22) == [2,3,5,7,11,13,17,19]\n assert candidate(1) == []\n assert candidate(18) == [2,3,5,7,11,13,17]\n assert candidate(47) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43]\n assert candidate(101) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]", "difficulty": "code"} {"input": "def multiply(a, b):\n \"\"\"Complete the function that takes two integers and returns \n the product of their unit digits.\n Assume the input is always valid.\n Examples:\n multiply(148, 412) should return 16.\n multiply(19, 28) should return 72.\n multiply(2020, 1851) should return 0.\n multiply(14,-15) should return 20.\n \"\"\"", "answer": "return abs(a % 10) * abs(b % 10)", "source": "humaneval", "task_id": "HumanEval/97", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(148, 412) == 16, \"First test error: \" + str(candidate(148, 412)) \n assert candidate(19, 28) == 72, \"Second test error: \" + str(candidate(19, 28)) \n assert candidate(2020, 1851) == 0, \"Third test error: \" + str(candidate(2020, 1851))\n assert candidate(14,-15) == 20, \"Fourth test error: \" + str(candidate(14,-15)) \n assert candidate(76, 67) == 42, \"Fifth test error: \" + str(candidate(76, 67)) \n assert candidate(17, 27) == 49, \"Sixth test error: \" + str(candidate(17, 27)) \n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(0, 1) == 0, \"1st edge test error: \" + str(candidate(0, 1))\n assert candidate(0, 0) == 0, \"2nd edge test error: \" + str(candidate(0, 0))", "difficulty": "code"} {"input": "def count_upper(s):\n \"\"\"\n Given a string s, count the number of uppercase vowels in even indices.\n \n For example:\n count_upper('aBCdEf') returns 1\n count_upper('abcdefg') returns 0\n count_upper('dBBE') returns 0\n \"\"\"", "answer": "count = 0\n for i in range(0,len(s),2):\n if s[i] in \"AEIOU\":\n count += 1\n return count", "source": "humaneval", "task_id": "HumanEval/98", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('aBCdEf') == 1\n assert candidate('abcdefg') == 0\n assert candidate('dBBE') == 0\n assert candidate('B') == 0\n assert candidate('U') == 1\n assert candidate('') == 0\n assert candidate('EEEE') == 2\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def closest_integer(value):\n '''\n Create a function that takes a value (string) representing a number\n and returns the closest integer to it. If the number is equidistant\n from two integers, round it away from zero.\n\n Examples\n >>> closest_integer(\"10\")\n 10\n >>> closest_integer(\"15.3\")\n 15\n\n Note:\n Rounding away from zero means that if the given number is equidistant\n from two integers, the one you should return is the one that is the\n farthest from zero. For example closest_integer(\"14.5\") should\n return 15 and closest_integer(\"-14.5\") should return -15.\n '''", "answer": "from math import floor, ceil\n\n if value.count('.') == 1:\n # remove trailing zeros\n while (value[-1] == '0'):\n value = value[:-1]\n\n num = float(value)\n if value[-2:] == '.5':\n if num > 0:\n res = ceil(num)\n else:\n res = floor(num)\n elif len(value) > 0:\n res = int(round(num))\n else:\n res = 0\n\n return res", "source": "humaneval", "task_id": "HumanEval/99", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"10\") == 10, \"Test 1\"\n assert candidate(\"14.5\") == 15, \"Test 2\"\n assert candidate(\"-15.5\") == -16, \"Test 3\"\n assert candidate(\"15.3\") == 15, \"Test 3\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"0\") == 0, \"Test 0\"", "difficulty": "code"} {"input": "def make_a_pile(n):\n \"\"\"\n Given a positive integer n, you have to make a pile of n levels of stones.\n The first level has n stones.\n The number of stones in the next level is:\n - the next odd number if n is odd.\n - the next even number if n is even.\n Return the number of stones in each level in a list, where element at index\n i represents the number of stones in the level (i+1).\n\n Examples:\n >>> make_a_pile(3)\n [3, 5, 7]\n \"\"\"", "answer": "return [n + 2*i for i in range(n)]", "source": "humaneval", "task_id": "HumanEval/100", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(3) == [3, 5, 7], \"Test 3\"\n assert candidate(4) == [4,6,8,10], \"Test 4\"\n assert candidate(5) == [5, 7, 9, 11, 13]\n assert candidate(6) == [6, 8, 10, 12, 14, 16]\n assert candidate(8) == [8, 10, 12, 14, 16, 18, 20, 22]\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def words_string(s):\n \"\"\"\n You will be given a string of words separated by commas or spaces. Your task is\n to split the string into words and return an array of the words.\n \n For example:\n words_string(\"Hi, my name is John\") == [\"Hi\", \"my\", \"name\", \"is\", \"John\"]\n words_string(\"One, two, three, four, five, six\") == [\"One\", \"two\", \"three\", \"four\", \"five\", \"six\"]\n \"\"\"", "answer": "if not s:\n return []\n\n s_list = []\n\n for letter in s:\n if letter == ',':\n s_list.append(' ')\n else:\n s_list.append(letter)\n\n s_list = \"\".join(s_list)\n return s_list.split()", "source": "humaneval", "task_id": "HumanEval/101", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(\"Hi, my name is John\") == [\"Hi\", \"my\", \"name\", \"is\", \"John\"]\n assert candidate(\"One, two, three, four, five, six\") == [\"One\", \"two\", \"three\", \"four\", \"five\", \"six\"]\n assert candidate(\"Hi, my name\") == [\"Hi\", \"my\", \"name\"]\n assert candidate(\"One,, two, three, four, five, six,\") == [\"One\", \"two\", \"three\", \"four\", \"five\", \"six\"]\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(\"\") == []\n assert candidate(\"ahmed , gamal\") == [\"ahmed\", \"gamal\"]", "difficulty": "code"} {"input": "def choose_num(x, y):\n \"\"\"This function takes two positive numbers x and y and returns the\n biggest even integer number that is in the range [x, y] inclusive. If \n there's no such number, then the function should return -1.\n\n For example:\n choose_num(12, 15) = 14\n choose_num(13, 12) = -1\n \"\"\"", "answer": "if x > y:\n return -1\n if y % 2 == 0:\n return y\n if x == y:\n return -1\n return y - 1", "source": "humaneval", "task_id": "HumanEval/102", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(12, 15) == 14\n assert candidate(13, 12) == -1\n assert candidate(33, 12354) == 12354\n assert candidate(5234, 5233) == -1\n assert candidate(6, 29) == 28\n assert candidate(27, 10) == -1\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(7, 7) == -1\n assert candidate(546, 546) == 546", "difficulty": "code"} {"input": "def rounded_avg(n, m):\n \"\"\"You are given two positive integers n and m, and your task is to compute the\n average of the integers from n through m (including n and m). \n Round the answer to the nearest integer and convert that to binary.\n If n is greater than m, return -1.\n Example:\n rounded_avg(1, 5) => \"0b11\"\n rounded_avg(7, 5) => -1\n rounded_avg(10, 20) => \"0b1111\"\n rounded_avg(20, 33) => \"0b11010\"\n \"\"\"", "answer": "if m < n:\n return -1\n summation = 0\n for i in range(n, m+1):\n summation += i\n return bin(round(summation/(m - n + 1)))", "source": "humaneval", "task_id": "HumanEval/103", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(1, 5) == \"0b11\"\n assert candidate(7, 13) == \"0b1010\"\n assert candidate(964,977) == \"0b1111001010\"\n assert candidate(996,997) == \"0b1111100100\"\n assert candidate(560,851) == \"0b1011000010\"\n assert candidate(185,546) == \"0b101101110\"\n assert candidate(362,496) == \"0b110101101\"\n assert candidate(350,902) == \"0b1001110010\"\n assert candidate(197,233) == \"0b11010111\"\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(7, 5) == -1\n assert candidate(5, 1) == -1\n assert candidate(5, 5) == \"0b101\"", "difficulty": "code"} {"input": "def unique_digits(x):\n \"\"\"Given a list of positive integers x. return a sorted list of all \n elements that hasn't any even digit.\n\n Note: Returned list should be sorted in increasing order.\n \n For example:\n >>> unique_digits([15, 33, 1422, 1])\n [1, 15, 33]\n >>> unique_digits([152, 323, 1422, 10])\n []\n \"\"\"", "answer": "odd_digit_elements = []\n for i in x:\n if all (int(c) % 2 == 1 for c in str(i)):\n odd_digit_elements.append(i)\n return sorted(odd_digit_elements)", "source": "humaneval", "task_id": "HumanEval/104", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([15, 33, 1422, 1]) == [1, 15, 33]\n assert candidate([152, 323, 1422, 10]) == []\n assert candidate([12345, 2033, 111, 151]) == [111, 151]\n assert candidate([135, 103, 31]) == [31, 135]\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def by_length(arr):\n \"\"\"\n Given an array of integers, sort the integers that are between 1 and 9 inclusive,\n reverse the resulting array, and then replace each digit by its corresponding name from\n \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\".\n\n For example:\n arr = [2, 1, 1, 4, 5, 8, 2, 3] \n -> sort arr -> [1, 1, 2, 2, 3, 4, 5, 8] \n -> reverse arr -> [8, 5, 4, 3, 2, 2, 1, 1]\n return [\"Eight\", \"Five\", \"Four\", \"Three\", \"Two\", \"Two\", \"One\", \"One\"]\n \n If the array is empty, return an empty array:\n arr = []\n return []\n \n If the array has any strange number ignore it:\n arr = [1, -1 , 55] \n -> sort arr -> [-1, 1, 55]\n -> reverse arr -> [55, 1, -1]\n return = ['One']\n \"\"\"", "answer": "dic = {\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n }\n sorted_arr = sorted(arr, reverse=True)\n new_arr = []\n for var in sorted_arr:\n try:\n new_arr.append(dic[var])\n except:\n pass\n return new_arr", "source": "humaneval", "task_id": "HumanEval/105", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([2, 1, 1, 4, 5, 8, 2, 3]) == [\"Eight\", \"Five\", \"Four\", \"Three\", \"Two\", \"Two\", \"One\", \"One\"], \"Error\"\n assert candidate([]) == [], \"Error\"\n assert candidate([1, -1 , 55]) == ['One'], \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([1, -1, 3, 2]) == [\"Three\", \"Two\", \"One\"]\n assert candidate([9, 4, 8]) == [\"Nine\", \"Eight\", \"Four\"]", "difficulty": "code"} {"input": "def f(n):\n \"\"\" Implement the function f that takes n as a parameter,\n and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even\n or the sum of numbers from 1 to i otherwise.\n i starts from 1.\n the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i).\n Example:\n f(5) == [1, 2, 6, 24, 15]\n \"\"\"", "answer": "ret = []\n for i in range(1,n+1):\n if i%2 == 0:\n x = 1\n for j in range(1,i+1): x *= j\n ret += [x]\n else:\n x = 0\n for j in range(1,i+1): x += j\n ret += [x]\n return ret", "source": "humaneval", "task_id": "HumanEval/106", "test_cases": "def check(candidate):\n\n assert candidate(5) == [1, 2, 6, 24, 15]\n assert candidate(7) == [1, 2, 6, 24, 15, 720, 28]\n assert candidate(1) == [1]\n assert candidate(3) == [1, 2, 6]", "difficulty": "code"} {"input": "def even_odd_palindrome(n):\n \"\"\"\n Given a positive integer n, return a tuple that has the number of even and odd\n integer palindromes that fall within the range(1, n), inclusive.\n\n Example 1:\n\n Input: 3\n Output: (1, 2)\n Explanation:\n Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.\n\n Example 2:\n\n Input: 12\n Output: (4, 6)\n Explanation:\n Integer palindrome are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. four of them are even, and 6 of them are odd.\n\n Note:\n 1. 1 <= n <= 10^3\n 2. returned tuple has the number of even and odd integer palindromes respectively.\n \"\"\"", "answer": "def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n even_palindrome_count = 0\n odd_palindrome_count = 0\n\n for i in range(1, n+1):\n if i%2 == 1 and is_palindrome(i):\n odd_palindrome_count += 1\n elif i%2 == 0 and is_palindrome(i):\n even_palindrome_count += 1\n return (even_palindrome_count, odd_palindrome_count)", "source": "humaneval", "task_id": "HumanEval/107", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(123) == (8, 13)\n assert candidate(12) == (4, 6)\n assert candidate(3) == (1, 2)\n assert candidate(63) == (6, 8)\n assert candidate(25) == (5, 6)\n assert candidate(19) == (4, 6)\n assert candidate(9) == (4, 5), \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1) == (0, 1), \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def count_nums(arr):\n \"\"\"\n Write a function count_nums which takes an array of integers and returns\n the number of elements which has a sum of digits > 0.\n If a number is negative, then its first signed digit will be negative:\n e.g. -123 has signed digits -1, 2, and 3.\n >>> count_nums([]) == 0\n >>> count_nums([-1, 11, -11]) == 1\n >>> count_nums([1, 1, 2]) == 3\n \"\"\"", "answer": "def digits_sum(n):\n neg = 1\n if n < 0: n, neg = -1 * n, -1 \n n = [int(i) for i in str(n)]\n n[0] = n[0] * neg\n return sum(n)\n return len(list(filter(lambda x: x > 0, [digits_sum(i) for i in arr])))", "source": "humaneval", "task_id": "HumanEval/108", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([]) == 0\n assert candidate([-1, -2, 0]) == 0\n assert candidate([1, 1, 2, -2, 3, 4, 5]) == 6\n assert candidate([1, 6, 9, -6, 0, 1, 5]) == 5\n assert candidate([1, 100, 98, -7, 1, -1]) == 4\n assert candidate([12, 23, 34, -45, -56, 0]) == 5\n assert candidate([-0, 1**0]) == 1\n assert candidate([1]) == 1\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def move_one_ball(arr):\n \"\"\"We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The\n numbers in the array will be randomly ordered. Your task is to determine if\n it is possible to get an array sorted in non-decreasing order by performing \n the following operation on the given array:\n You are allowed to perform right shift operation any number of times.\n \n One right shift operation means shifting all elements of the array by one\n position in the right direction. The last element of the array will be moved to\n the starting position in the array i.e. 0th index. \n\n If it is possible to obtain the sorted array by performing the above operation\n then return True else return False.\n If the given array is empty then return True.\n\n Note: The given list is guaranteed to have unique elements.\n\n For Example:\n \n move_one_ball([3, 4, 5, 1, 2])==>True\n Explanation: By performin 2 right shift operations, non-decreasing order can\n be achieved for the given array.\n move_one_ball([3, 5, 4, 1, 2])==>False\n Explanation:It is not possible to get non-decreasing order for the given\n array by performing any number of right shift operations.\n \n \"\"\"", "answer": "if len(arr)==0:\n return True\n sorted_array=sorted(arr)\n my_arr=[]\n \n min_value=min(arr)\n min_index=arr.index(min_value)\n my_arr=arr[min_index:]+arr[0:min_index]\n for i in range(len(arr)):\n if my_arr[i]!=sorted_array[i]:\n return False\n return True", "source": "humaneval", "task_id": "HumanEval/109", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([3, 4, 5, 1, 2])==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([3, 5, 10, 1, 2])==True\n assert candidate([4, 3, 1, 2])==False\n # Check some edge cases that are easy to work out by hand.\n assert candidate([3, 5, 4, 1, 2])==False, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([])==True", "difficulty": "code"} {"input": "def exchange(lst1, lst2):\n \"\"\"In this problem, you will implement a function that takes two lists of numbers,\n and determines whether it is possible to perform an exchange of elements\n between them to make lst1 a list of only even numbers.\n There is no limit on the number of exchanged elements between lst1 and lst2.\n If it is possible to exchange elements between the lst1 and lst2 to make\n all the elements of lst1 to be even, return \"YES\".\n Otherwise, return \"NO\".\n For example:\n exchange([1, 2, 3, 4], [1, 2, 3, 4]) => \"YES\"\n exchange([1, 2, 3, 4], [1, 5, 3, 4]) => \"NO\"\n It is assumed that the input lists will be non-empty.\n \"\"\"", "answer": "odd = 0\n even = 0\n for i in lst1:\n if i%2 == 1:\n odd += 1\n for i in lst2:\n if i%2 == 0:\n even += 1\n if even >= odd:\n return \"YES\"\n return \"NO\"", "source": "humaneval", "task_id": "HumanEval/110", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1, 2, 3, 4], [1, 2, 3, 4]) == \"YES\"\n assert candidate([1, 2, 3, 4], [1, 5, 3, 4]) == \"NO\"\n assert candidate([1, 2, 3, 4], [2, 1, 4, 3]) == \"YES\" \n assert candidate([5, 7, 3], [2, 6, 4]) == \"YES\"\n assert candidate([5, 7, 3], [2, 6, 3]) == \"NO\" \n assert candidate([3, 2, 6, 1, 8, 9], [3, 5, 5, 1, 1, 1]) == \"NO\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([100, 200], [200, 200]) == \"YES\"", "difficulty": "code"} {"input": "def histogram(test):\n \"\"\"Given a string representing a space separated lowercase letters, return a dictionary\n of the letter with the most repetition and containing the corresponding count.\n If several letters have the same occurrence, return all of them.\n \n Example:\n histogram('a b c') == {'a': 1, 'b': 1, 'c': 1}\n histogram('a b b a') == {'a': 2, 'b': 2}\n histogram('a b c a b') == {'a': 2, 'b': 2}\n histogram('b b b b a') == {'b': 4}\n histogram('') == {}\n\n \"\"\"", "answer": "dict1={}\n list1=test.split(\" \")\n t=0\n\n for i in list1:\n if(list1.count(i)>t) and i!='':\n t=list1.count(i)\n if t>0:\n for i in list1:\n if(list1.count(i)==t):\n \n dict1[i]=t\n return dict1", "source": "humaneval", "task_id": "HumanEval/111", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('a b b a') == {'a':2,'b': 2}, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('a b c a b') == {'a': 2, 'b': 2}, \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate('a b c d g') == {'a': 1, 'b': 1, 'c': 1, 'd': 1, 'g': 1}, \"This prints if this assert fails 3 (good for debugging!)\"\n assert candidate('r t g') == {'r': 1,'t': 1,'g': 1}, \"This prints if this assert fails 4 (good for debugging!)\"\n assert candidate('b b b b a') == {'b': 4}, \"This prints if this assert fails 5 (good for debugging!)\"\n assert candidate('r t g') == {'r': 1,'t': 1,'g': 1}, \"This prints if this assert fails 6 (good for debugging!)\"\n \n \n # Check some edge cases that are easy to work out by hand.\n assert candidate('') == {}, \"This prints if this assert fails 7 (also good for debugging!)\"\n assert candidate('a') == {'a': 1}, \"This prints if this assert fails 8 (also good for debugging!)\"", "difficulty": "code"} {"input": "def reverse_delete(s,c):\n \"\"\"Task\n We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c\n then check if the result string is palindrome.\n A string is called palindrome if it reads the same backward as forward.\n You should return a tuple containing the result string and True/False for the check.\n Example\n For s = \"abcde\", c = \"ae\", the result should be ('bcd',False)\n For s = \"abcdef\", c = \"b\" the result should be ('acdef',False)\n For s = \"abcdedcba\", c = \"ab\", the result should be ('cdedc',True)\n \"\"\"", "answer": "s = ''.join([char for char in s if char not in c])\n return (s,s[::-1] == s)", "source": "humaneval", "task_id": "HumanEval/112", "test_cases": "def check(candidate):\n\n assert candidate(\"abcde\",\"ae\") == ('bcd',False)\n assert candidate(\"abcdef\", \"b\") == ('acdef',False)\n assert candidate(\"abcdedcba\",\"ab\") == ('cdedc',True)\n assert candidate(\"dwik\",\"w\") == ('dik',False)\n assert candidate(\"a\",\"a\") == ('',True)\n assert candidate(\"abcdedcba\",\"\") == ('abcdedcba',True)\n assert candidate(\"abcdedcba\",\"v\") == ('abcdedcba',True)\n assert candidate(\"vabba\",\"v\") == ('abba',True)\n assert candidate(\"mamma\", \"mia\") == (\"\", True)", "difficulty": "code"} {"input": "def odd_count(lst):\n \"\"\"Given a list of strings, where each string consists of only digits, return a list.\n Each element i of the output should be \"the number of odd elements in the\n string i of the input.\" where all the i's should be replaced by the number\n of odd digits in the i'th string of the input.\n\n >>> odd_count(['1234567'])\n [\"the number of odd elements 4n the str4ng 4 of the 4nput.\"]\n >>> odd_count(['3',\"11111111\"])\n [\"the number of odd elements 1n the str1ng 1 of the 1nput.\",\n \"the number of odd elements 8n the str8ng 8 of the 8nput.\"]\n \"\"\"", "answer": "res = []\n for arr in lst:\n n = sum(int(d)%2==1 for d in arr)\n res.append(\"the number of odd elements \" + str(n) + \"n the str\"+ str(n) +\"ng \"+ str(n) +\" of the \"+ str(n) +\"nput.\")\n return res", "source": "humaneval", "task_id": "HumanEval/113", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(['1234567']) == [\"the number of odd elements 4n the str4ng 4 of the 4nput.\"], \"Test 1\"\n assert candidate(['3',\"11111111\"]) == [\"the number of odd elements 1n the str1ng 1 of the 1nput.\", \"the number of odd elements 8n the str8ng 8 of the 8nput.\"], \"Test 2\"\n assert candidate(['271', '137', '314']) == [\n 'the number of odd elements 2n the str2ng 2 of the 2nput.',\n 'the number of odd elements 3n the str3ng 3 of the 3nput.',\n 'the number of odd elements 2n the str2ng 2 of the 2nput.'\n ]\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def minSubArraySum(nums):\n \"\"\"\n Given an array of integers nums, find the minimum sum of any non-empty sub-array\n of nums.\n Example\n minSubArraySum([2, 3, 4, 1, 2, 4]) == 1\n minSubArraySum([-1, -2, -3]) == -6\n \"\"\"", "answer": "max_sum = 0\n s = 0\n for num in nums:\n s += -num\n if (s < 0):\n s = 0\n max_sum = max(s, max_sum)\n if max_sum == 0:\n max_sum = max(-i for i in nums)\n min_sum = -max_sum\n return min_sum", "source": "humaneval", "task_id": "HumanEval/114", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([2, 3, 4, 1, 2, 4]) == 1, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([-1, -2, -3]) == -6\n assert candidate([-1, -2, -3, 2, -10]) == -14\n assert candidate([-9999999999999999]) == -9999999999999999\n assert candidate([0, 10, 20, 1000000]) == 0\n assert candidate([-1, -2, -3, 10, -5]) == -6\n assert candidate([100, -1, -2, -3, 10, -5]) == -6\n assert candidate([10, 11, 13, 8, 3, 4]) == 3\n assert candidate([100, -33, 32, -1, 0, -2]) == -33\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([-10]) == -10, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([7]) == 7\n assert candidate([1, -1]) == -1", "difficulty": "code"} {"input": "def max_fill(grid, capacity):\n import math\n \"\"\"\n You are given a rectangular grid of wells. Each row represents a single well,\n and each 1 in a row represents a single unit of water.\n Each well has a corresponding bucket that can be used to extract water from it, \n and all buckets have the same capacity.\n Your task is to use the buckets to empty the wells.\n Output the number of times you need to lower the buckets.\n\n Example 1:\n Input: \n grid : [[0,0,1,0], [0,1,0,0], [1,1,1,1]]\n bucket_capacity : 1\n Output: 6\n\n Example 2:\n Input: \n grid : [[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]]\n bucket_capacity : 2\n Output: 5\n \n Example 3:\n Input: \n grid : [[0,0,0], [0,0,0]]\n bucket_capacity : 5\n Output: 0\n\n Constraints:\n * all wells have the same length\n * 1 <= grid.length <= 10^2\n * 1 <= grid[:,1].length <= 10^2\n * grid[i][j] -> 0 | 1\n * 1 <= capacity <= 10\n \"\"\"", "answer": "return sum([math.ceil(sum(arr)/capacity) for arr in grid])", "source": "humaneval", "task_id": "HumanEval/115", "test_cases": "def check(candidate):\n\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([[0,0,1,0], [0,1,0,0], [1,1,1,1]], 1) == 6, \"Error\"\n assert candidate([[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]], 2) == 5, \"Error\"\n assert candidate([[0,0,0], [0,0,0]], 5) == 0, \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([[1,1,1,1], [1,1,1,1]], 2) == 4, \"Error\"\n assert candidate([[1,1,1,1], [1,1,1,1]], 9) == 2, \"Error\"", "difficulty": "code"} {"input": "def sort_array(arr):\n \"\"\"\n In this Kata, you have to sort an array of non-negative integers according to\n number of ones in their binary representation in ascending order.\n For similar number of ones, sort based on decimal value.\n\n It must be implemented like this:\n >>> sort_array([1, 5, 2, 3, 4]) == [1, 2, 3, 4, 5]\n >>> sort_array([-2, -3, -4, -5, -6]) == [-6, -5, -4, -3, -2]\n >>> sort_array([1, 0, 2, 3, 4]) [0, 1, 2, 3, 4]\n \"\"\"", "answer": "return sorted(sorted(arr), key=lambda x: bin(x)[2:].count('1'))", "source": "humaneval", "task_id": "HumanEval/116", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1,5,2,3,4]) == [1, 2, 4, 3, 5]\n assert candidate([-2,-3,-4,-5,-6]) == [-4, -2, -6, -5, -3]\n assert candidate([1,0,2,3,4]) == [0, 1, 2, 4, 3]\n assert candidate([]) == []\n assert candidate([2,5,77,4,5,3,5,7,2,3,4]) == [2, 2, 4, 4, 3, 3, 5, 5, 5, 7, 77]\n assert candidate([3,6,44,12,32,5]) == [32, 3, 5, 6, 12, 44]\n assert candidate([2,4,8,16,32]) == [2, 4, 8, 16, 32]\n assert candidate([2,4,8,16,32]) == [2, 4, 8, 16, 32]\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def select_words(s, n):\n \"\"\"Given a string s and a natural number n, you have been tasked to implement \n a function that returns a list of all words from string s that contain exactly \n n consonants, in order these words appear in the string s.\n If the string s is empty then the function should return an empty list.\n Note: you may assume the input string contains only letters and spaces.\n Examples:\n select_words(\"Mary had a little lamb\", 4) ==> [\"little\"]\n select_words(\"Mary had a little lamb\", 3) ==> [\"Mary\", \"lamb\"]\n select_words(\"simple white space\", 2) ==> []\n select_words(\"Hello world\", 4) ==> [\"world\"]\n select_words(\"Uncle sam\", 3) ==> [\"Uncle\"]\n \"\"\"", "answer": "result = []\n for word in s.split():\n n_consonants = 0\n for i in range(0, len(word)):\n if word[i].lower() not in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\n n_consonants += 1 \n if n_consonants == n:\n result.append(word)\n return result", "source": "humaneval", "task_id": "HumanEval/117", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"Mary had a little lamb\", 4) == [\"little\"], \"First test error: \" + str(candidate(\"Mary had a little lamb\", 4)) \n assert candidate(\"Mary had a little lamb\", 3) == [\"Mary\", \"lamb\"], \"Second test error: \" + str(candidate(\"Mary had a little lamb\", 3)) \n assert candidate(\"simple white space\", 2) == [], \"Third test error: \" + str(candidate(\"simple white space\", 2)) \n assert candidate(\"Hello world\", 4) == [\"world\"], \"Fourth test error: \" + str(candidate(\"Hello world\", 4)) \n assert candidate(\"Uncle sam\", 3) == [\"Uncle\"], \"Fifth test error: \" + str(candidate(\"Uncle sam\", 3))\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"\", 4) == [], \"1st edge test error: \" + str(candidate(\"\", 4))\n assert candidate(\"a b c d e f\", 1) == [\"b\", \"c\", \"d\", \"f\"], \"2nd edge test error: \" + str(candidate(\"a b c d e f\", 1))", "difficulty": "code"} {"input": "def get_closest_vowel(word):\n \"\"\"You are given a word. Your task is to find the closest vowel that stands between \n two consonants from the right side of the word (case sensitive).\n \n Vowels in the beginning and ending doesn't count. Return empty string if you didn't\n find any vowel met the above condition. \n\n You may assume that the given string contains English letter only.\n\n Example:\n get_closest_vowel(\"yogurt\") ==> \"u\"\n get_closest_vowel(\"FULL\") ==> \"U\"\n get_closest_vowel(\"quick\") ==> \"\"\n get_closest_vowel(\"ab\") ==> \"\"\n \"\"\"", "answer": "if len(word) < 3:\n return \"\"\n\n vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", 'O', 'U', 'I'}\n for i in range(len(word)-2, 0, -1):\n if word[i] in vowels:\n if (word[i+1] not in vowels) and (word[i-1] not in vowels):\n return word[i]\n return \"\"", "source": "humaneval", "task_id": "HumanEval/118", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"yogurt\") == \"u\"\n assert candidate(\"full\") == \"u\"\n assert candidate(\"easy\") == \"\"\n assert candidate(\"eAsy\") == \"\"\n assert candidate(\"ali\") == \"\"\n assert candidate(\"bad\") == \"a\"\n assert candidate(\"most\") == \"o\"\n assert candidate(\"ab\") == \"\"\n assert candidate(\"ba\") == \"\"\n assert candidate(\"quick\") == \"\"\n assert candidate(\"anime\") == \"i\"\n assert candidate(\"Asia\") == \"\"\n assert candidate(\"Above\") == \"o\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def match_parens(lst):\n '''\n You are given a list of two strings, both strings consist of open\n parentheses '(' or close parentheses ')' only.\n Your job is to check if it is possible to concatenate the two strings in\n some order, that the resulting string will be good.\n A string S is considered to be good if and only if all parentheses in S\n are balanced. For example: the string '(())()' is good, while the string\n '())' is not.\n Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.\n\n Examples:\n match_parens(['()(', ')']) == 'Yes'\n match_parens([')', ')']) == 'No'\n '''", "answer": "def check(s):\n val = 0\n for i in s:\n if i == '(':\n val = val + 1\n else:\n val = val - 1\n if val < 0:\n return False\n return True if val == 0 else False\n\n S1 = lst[0] + lst[1]\n S2 = lst[1] + lst[0]\n return 'Yes' if check(S1) or check(S2) else 'No'", "source": "humaneval", "task_id": "HumanEval/119", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(['()(', ')']) == 'Yes'\n assert candidate([')', ')']) == 'No'\n assert candidate(['(()(())', '())())']) == 'No'\n assert candidate([')())', '(()()(']) == 'Yes'\n assert candidate(['(())))', '(()())((']) == 'Yes'\n assert candidate(['()', '())']) == 'No'\n assert candidate(['(()(', '()))()']) == 'Yes'\n assert candidate(['((((', '((())']) == 'No'\n assert candidate([')(()', '(()(']) == 'No'\n assert candidate([')(', ')(']) == 'No'\n \n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(['(', ')']) == 'Yes'\n assert candidate([')', '(']) == 'Yes'", "difficulty": "code"} {"input": "def maximum(arr, k):\n \"\"\"\n Given an array arr of integers and a positive integer k, return a sorted list \n of length k with the maximum k numbers in arr.\n\n Example 1:\n\n Input: arr = [-3, -4, 5], k = 3\n Output: [-4, -3, 5]\n\n Example 2:\n\n Input: arr = [4, -4, 4], k = 2\n Output: [4, 4]\n\n Example 3:\n\n Input: arr = [-3, 2, 1, 2, -1, -2, 1], k = 1\n Output: [2]\n\n Note:\n 1. The length of the array will be in the range of [1, 1000].\n 2. The elements in the array will be in the range of [-1000, 1000].\n 3. 0 <= k <= len(arr)\n \"\"\"", "answer": "if k == 0:\n return []\n arr.sort()\n ans = arr[-k:]\n return ans", "source": "humaneval", "task_id": "HumanEval/120", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([-3, -4, 5], 3) == [-4, -3, 5]\n assert candidate([4, -4, 4], 2) == [4, 4]\n assert candidate([-3, 2, 1, 2, -1, -2, 1], 1) == [2]\n assert candidate([123, -123, 20, 0 , 1, 2, -3], 3) == [2, 20, 123]\n assert candidate([-123, 20, 0 , 1, 2, -3], 4) == [0, 1, 2, 20]\n assert candidate([5, 15, 0, 3, -13, -8, 0], 7) == [-13, -8, 0, 0, 3, 5, 15]\n assert candidate([-1, 0, 2, 5, 3, -10], 2) == [3, 5]\n assert candidate([1, 0, 5, -7], 1) == [5]\n assert candidate([4, -4], 2) == [-4, 4]\n assert candidate([-10, 10], 2) == [-10, 10]\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1, 2, 3, -23, 243, -400, 0], 0) == []", "difficulty": "code"} {"input": "def solution(lst):\n \"\"\"Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.\n \n\n Examples\n solution([5, 8, 7, 1]) ==> 12\n solution([3, 3, 3, 3, 3]) ==> 9\n solution([30, 13, 24, 321]) ==>0\n \"\"\"", "answer": "return sum([x for idx, x in enumerate(lst) if idx%2==0 and x%2==1])", "source": "humaneval", "task_id": "HumanEval/121", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([5, 8, 7, 1]) == 12\n assert candidate([3, 3, 3, 3, 3]) == 9\n assert candidate([30, 13, 24, 321]) == 0\n assert candidate([5, 9]) == 5\n assert candidate([2, 4, 8]) == 0\n assert candidate([30, 13, 23, 32]) == 23\n assert candidate([3, 13, 2, 9]) == 3\n\n # Check some edge cases that are easy to work out by hand.", "difficulty": "code"} {"input": "def add_elements(arr, k):\n \"\"\"\n Given a non-empty array of integers arr and an integer k, return\n the sum of the elements with at most two digits from the first k elements of arr.\n\n Example:\n\n Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4\n Output: 24 # sum of 21 + 3\n\n Constraints:\n 1. 1 <= len(arr) <= 100\n 2. 1 <= k <= len(arr)\n \"\"\"", "answer": "return sum(elem for elem in arr[:k] if len(str(elem)) <= 2)", "source": "humaneval", "task_id": "HumanEval/122", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1,-2,-3,41,57,76,87,88,99], 3) == -4\n assert candidate([111,121,3,4000,5,6], 2) == 0\n assert candidate([11,21,3,90,5,6,7,8,9], 4) == 125\n assert candidate([111,21,3,4000,5,6,7,8,9], 4) == 24, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1], 1) == 1, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def get_odd_collatz(n):\n \"\"\"\n Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.\n\n The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined\n as follows: start with any positive integer n. Then each term is obtained from the \n previous term as follows: if the previous term is even, the next term is one half of \n the previous term. If the previous term is odd, the next term is 3 times the previous\n term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.\n\n Note: \n 1. Collatz(1) is [1].\n 2. returned list sorted in increasing order.\n\n For example:\n get_odd_collatz(5) returns [1, 5] # The collatz sequence for 5 is [5, 16, 8, 4, 2, 1], so the odd numbers are only 1, and 5.\n \"\"\"", "answer": "if n%2==0:\n odd_collatz = [] \n else:\n odd_collatz = [n]\n while n > 1:\n if n % 2 == 0:\n n = n/2\n else:\n n = n*3 + 1\n \n if n%2 == 1:\n odd_collatz.append(int(n))\n\n return sorted(odd_collatz)", "source": "humaneval", "task_id": "HumanEval/123", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(14) == [1, 5, 7, 11, 13, 17]\n assert candidate(5) == [1, 5]\n assert candidate(12) == [1, 3, 5], \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1) == [1], \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def valid_date(date):\n \"\"\"You have to write a function which validates a given date string and\n returns True if the date is valid otherwise False.\n The date is valid if all of the following rules are satisfied:\n 1. The date string is not empty.\n 2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the number of days is not less than 1 or higher than 30 days for months 4,6,9,11. And, the number of days is not less than 1 or higher than 29 for the month 2.\n 3. The months should not be less than 1 or higher than 12.\n 4. The date should be in the format: mm-dd-yyyy\n\n for example: \n valid_date('03-11-2000') => True\n\n valid_date('15-01-2012') => False\n\n valid_date('04-0-2040') => False\n\n valid_date('06-04-2020') => True\n\n valid_date('06/04/2020') => False\n \"\"\"", "answer": "try:\n date = date.strip()\n month, day, year = date.split('-')\n month, day, year = int(month), int(day), int(year)\n if month < 1 or month > 12:\n return False\n if month in [1,3,5,7,8,10,12] and day < 1 or day > 31:\n return False\n if month in [4,6,9,11] and day < 1 or day > 30:\n return False\n if month == 2 and day < 1 or day > 29:\n return False\n except:\n return False\n\n return True", "source": "humaneval", "task_id": "HumanEval/124", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('03-11-2000') == True\n\n assert candidate('15-01-2012') == False\n\n assert candidate('04-0-2040') == False\n\n assert candidate('06-04-2020') == True\n\n assert candidate('01-01-2007') == True\n\n assert candidate('03-32-2011') == False\n\n assert candidate('') == False\n\n assert candidate('04-31-3000') == False\n\n assert candidate('06-06-2005') == True\n\n assert candidate('21-31-2000') == False\n\n assert candidate('04-12-2003') == True\n\n assert candidate('04122003') == False\n\n assert candidate('20030412') == False\n\n assert candidate('2003-04') == False\n\n assert candidate('2003-04-12') == False\n\n assert candidate('04-2003') == False", "difficulty": "code"} {"input": "def split_words(txt):\n '''\n Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you\n should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the\n alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25\n Examples\n split_words(\"Hello world!\") ➞ [\"Hello\", \"world!\"]\n split_words(\"Hello,world!\") ➞ [\"Hello\", \"world!\"]\n split_words(\"abcdef\") == 3 \n '''", "answer": "if \" \" in txt:\n return txt.split()\n elif \",\" in txt:\n return txt.replace(',',' ').split()\n else:\n return len([i for i in txt if i.islower() and ord(i)%2 == 0])", "source": "humaneval", "task_id": "HumanEval/125", "test_cases": "def check(candidate):\n\n assert candidate(\"Hello world!\") == [\"Hello\",\"world!\"]\n assert candidate(\"Hello,world!\") == [\"Hello\",\"world!\"]\n assert candidate(\"Hello world,!\") == [\"Hello\",\"world,!\"]\n assert candidate(\"Hello,Hello,world !\") == [\"Hello,Hello,world\",\"!\"]\n assert candidate(\"abcdef\") == 3\n assert candidate(\"aaabb\") == 2\n assert candidate(\"aaaBb\") == 1\n assert candidate(\"\") == 0", "difficulty": "code"} {"input": "def is_sorted(lst):\n '''\n Given a list of numbers, return whether or not they are sorted\n in ascending order. If list has more than 1 duplicate of the same\n number, return False. Assume no negative numbers and only integers.\n\n Examples\n is_sorted([5]) ➞ True\n is_sorted([1, 2, 3, 4, 5]) ➞ True\n is_sorted([1, 3, 2, 4, 5]) ➞ False\n is_sorted([1, 2, 3, 4, 5, 6]) ➞ True\n is_sorted([1, 2, 3, 4, 5, 6, 7]) ➞ True\n is_sorted([1, 3, 2, 4, 5, 6, 7]) ➞ False\n is_sorted([1, 2, 2, 3, 3, 4]) ➞ True\n is_sorted([1, 2, 2, 2, 3, 4]) ➞ False\n '''", "answer": "count_digit = dict([(i, 0) for i in lst])\n for i in lst:\n count_digit[i]+=1 \n if any(count_digit[i] > 2 for i in lst):\n return False\n if all(lst[i-1] <= lst[i] for i in range(1, len(lst))):\n return True\n else:\n return False", "source": "humaneval", "task_id": "HumanEval/126", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([5]) == True\n assert candidate([1, 2, 3, 4, 5]) == True\n assert candidate([1, 3, 2, 4, 5]) == False\n assert candidate([1, 2, 3, 4, 5, 6]) == True\n assert candidate([1, 2, 3, 4, 5, 6, 7]) == True\n assert candidate([1, 3, 2, 4, 5, 6, 7]) == False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([]) == True, \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate([1]) == True, \"This prints if this assert fails 3 (good for debugging!)\"\n assert candidate([3, 2, 1]) == False, \"This prints if this assert fails 4 (good for debugging!)\"\n \n # Check some edge cases that are easy to work out by hand.\n assert candidate([1, 2, 2, 2, 3, 4]) == False, \"This prints if this assert fails 5 (good for debugging!)\"\n assert candidate([1, 2, 3, 3, 3, 4]) == False, \"This prints if this assert fails 6 (good for debugging!)\"\n assert candidate([1, 2, 2, 3, 3, 4]) == True, \"This prints if this assert fails 7 (good for debugging!)\"\n assert candidate([1, 2, 3, 4]) == True, \"This prints if this assert fails 8 (good for debugging!)\"", "difficulty": "code"} {"input": "def intersection(interval1, interval2):\n \"\"\"You are given two intervals,\n where each interval is a pair of integers. For example, interval = (start, end) = (1, 2).\n The given intervals are closed which means that the interval (start, end)\n includes both start and end.\n For each given interval, it is assumed that its start is less or equal its end.\n Your task is to determine whether the length of intersection of these two \n intervals is a prime number.\n Example, the intersection of the intervals (1, 3), (2, 4) is (2, 3)\n which its length is 1, which not a prime number.\n If the length of the intersection is a prime number, return \"YES\",\n otherwise, return \"NO\".\n If the two intervals don't intersect, return \"NO\".\n\n\n [input/output] samples:\n intersection((1, 2), (2, 3)) ==> \"NO\"\n intersection((-1, 1), (0, 4)) ==> \"NO\"\n intersection((-3, -1), (-5, 5)) ==> \"YES\"\n \"\"\"", "answer": "def is_prime(num):\n if num == 1 or num == 0:\n return False\n if num == 2:\n return True\n for i in range(2, num):\n if num%i == 0:\n return False\n return True\n\n l = max(interval1[0], interval2[0])\n r = min(interval1[1], interval2[1])\n length = r - l\n if length > 0 and is_prime(length):\n return \"YES\"\n return \"NO\"", "source": "humaneval", "task_id": "HumanEval/127", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate((1, 2), (2, 3)) == \"NO\"\n assert candidate((-1, 1), (0, 4)) == \"NO\"\n assert candidate((-3, -1), (-5, 5)) == \"YES\"\n assert candidate((-2, 2), (-4, 0)) == \"YES\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate((-11, 2), (-1, -1)) == \"NO\"\n assert candidate((1, 2), (3, 5)) == \"NO\"\n assert candidate((1, 2), (1, 2)) == \"NO\"\n assert candidate((-2, -2), (-3, -2)) == \"NO\"", "difficulty": "code"} {"input": "def prod_signs(arr):\n \"\"\"\n You are given an array arr of integers and you need to return\n sum of magnitudes of integers multiplied by product of all signs\n of each number in the array, represented by 1, -1 or 0.\n Note: return None for empty arr.\n\n Example:\n >>> prod_signs([1, 2, 2, -4]) == -9\n >>> prod_signs([0, 1]) == 0\n >>> prod_signs([]) == None\n \"\"\"", "answer": "if not arr: return None\n prod = 0 if 0 in arr else (-1) ** len(list(filter(lambda x: x < 0, arr)))\n return prod * sum([abs(i) for i in arr])", "source": "humaneval", "task_id": "HumanEval/128", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1, 2, 2, -4]) == -9\n assert candidate([0, 1]) == 0\n assert candidate([1, 1, 1, 2, 3, -1, 1]) == -10\n assert candidate([]) == None\n assert candidate([2, 4,1, 2, -1, -1, 9]) == 20\n assert candidate([-1, 1, -1, 1]) == 4\n assert candidate([-1, 1, 1, 1]) == -4\n assert candidate([-1, 1, 1, 0]) == 0\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def minPath(grid, k):\n \"\"\"\n Given a grid with N rows and N columns (N >= 2) and a positive integer k, \n each cell of the grid contains a value. Every integer in the range [1, N * N]\n inclusive appears exactly once on the cells of the grid.\n\n You have to find the minimum path of length k in the grid. You can start\n from any cell, and in each step you can move to any of the neighbor cells,\n in other words, you can go to cells which share an edge with you current\n cell.\n Please note that a path of length k means visiting exactly k cells (not\n necessarily distinct).\n You CANNOT go off the grid.\n A path A (of length k) is considered less than a path B (of length k) if\n after making the ordered lists of the values on the cells that A and B go\n through (let's call them lst_A and lst_B), lst_A is lexicographically less\n than lst_B, in other words, there exist an integer index i (1 <= i <= k)\n such that lst_A[i] < lst_B[i] and for any j (1 <= j < i) we have\n lst_A[j] = lst_B[j].\n It is guaranteed that the answer is unique.\n Return an ordered list of the values on the cells that the minimum path go through.\n\n Examples:\n\n Input: grid = [ [1,2,3], [4,5,6], [7,8,9]], k = 3\n Output: [1, 2, 1]\n\n Input: grid = [ [5,9,3], [4,1,6], [7,8,2]], k = 1\n Output: [1]\n \"\"\"", "answer": "n = len(grid)\n val = n * n + 1\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n temp = []\n if i != 0:\n temp.append(grid[i - 1][j])\n\n if j != 0:\n temp.append(grid[i][j - 1])\n\n if i != n - 1:\n temp.append(grid[i + 1][j])\n\n if j != n - 1:\n temp.append(grid[i][j + 1])\n\n val = min(temp)\n\n ans = []\n for i in range(k):\n if i % 2 == 0:\n ans.append(1)\n else:\n ans.append(val)\n return ans", "source": "humaneval", "task_id": "HumanEval/129", "test_cases": "def check(candidate):\n\n # Check some simple cases\n print\n assert candidate([[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3) == [1, 2, 1]\n assert candidate([[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1) == [1]\n assert candidate([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4) == [1, 2, 1, 2]\n assert candidate([[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7) == [1, 10, 1, 10, 1, 10, 1]\n assert candidate([[8, 14, 9, 2], [6, 4, 13, 15], [5, 7, 1, 12], [3, 10, 11, 16]], 5) == [1, 7, 1, 7, 1]\n assert candidate([[11, 8, 7, 2], [5, 16, 14, 4], [9, 3, 15, 6], [12, 13, 10, 1]], 9) == [1, 6, 1, 6, 1, 6, 1, 6, 1]\n assert candidate([[12, 13, 10, 1], [9, 3, 15, 6], [5, 16, 14, 4], [11, 8, 7, 2]], 12) == [1, 6, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6]\n assert candidate([[2, 7, 4], [3, 1, 5], [6, 8, 9]], 8) == [1, 3, 1, 3, 1, 3, 1, 3]\n assert candidate([[6, 1, 5], [3, 8, 9], [2, 7, 4]], 8) == [1, 5, 1, 5, 1, 5, 1, 5]\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([[1, 2], [3, 4]], 10) == [1, 2, 1, 2, 1, 2, 1, 2, 1, 2]\n assert candidate([[1, 3], [3, 2]], 10) == [1, 3, 1, 3, 1, 3, 1, 3, 1, 3]", "difficulty": "code"} {"input": "def tri(n):\n \"\"\"Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in \n the last couple centuries. However, what people don't know is Tribonacci sequence.\n Tribonacci sequence is defined by the recurrence:\n tri(1) = 3\n tri(n) = 1 + n / 2, if n is even.\n tri(n) = tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.\n For example:\n tri(2) = 1 + (2 / 2) = 2\n tri(4) = 3\n tri(3) = tri(2) + tri(1) + tri(4)\n = 2 + 3 + 3 = 8 \n You are given a non-negative integer number n, you have to a return a list of the \n first n + 1 numbers of the Tribonacci sequence.\n Examples:\n tri(3) = [1, 3, 2, 8]\n \"\"\"", "answer": "if n == 0:\n return [1]\n my_tri = [1, 3]\n for i in range(2, n + 1):\n if i % 2 == 0:\n my_tri.append(i / 2 + 1)\n else:\n my_tri.append(my_tri[i - 1] + my_tri[i - 2] + (i + 3) / 2)\n return my_tri", "source": "humaneval", "task_id": "HumanEval/130", "test_cases": "def check(candidate):\n\n # Check some simple cases\n \n assert candidate(3) == [1, 3, 2.0, 8.0]\n assert candidate(4) == [1, 3, 2.0, 8.0, 3.0]\n assert candidate(5) == [1, 3, 2.0, 8.0, 3.0, 15.0]\n assert candidate(6) == [1, 3, 2.0, 8.0, 3.0, 15.0, 4.0]\n assert candidate(7) == [1, 3, 2.0, 8.0, 3.0, 15.0, 4.0, 24.0]\n assert candidate(8) == [1, 3, 2.0, 8.0, 3.0, 15.0, 4.0, 24.0, 5.0]\n assert candidate(9) == [1, 3, 2.0, 8.0, 3.0, 15.0, 4.0, 24.0, 5.0, 35.0]\n assert candidate(20) == [1, 3, 2.0, 8.0, 3.0, 15.0, 4.0, 24.0, 5.0, 35.0, 6.0, 48.0, 7.0, 63.0, 8.0, 80.0, 9.0, 99.0, 10.0, 120.0, 11.0]\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(0) == [1]\n assert candidate(1) == [1, 3]", "difficulty": "code"} {"input": "def digits(n):\n \"\"\"Given a positive integer n, return the product of the odd digits.\n Return 0 if all digits are even.\n For example:\n digits(1) == 1\n digits(4) == 0\n digits(235) == 15\n \"\"\"", "answer": "product = 1\n odd_count = 0\n for digit in str(n):\n int_digit = int(digit)\n if int_digit%2 == 1:\n product= product*int_digit\n odd_count+=1\n if odd_count ==0:\n return 0\n else:\n return product", "source": "humaneval", "task_id": "HumanEval/131", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(5) == 5\n assert candidate(54) == 5\n assert candidate(120) ==1\n assert candidate(5014) == 5\n assert candidate(98765) == 315\n assert candidate(5576543) == 2625\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(2468) == 0", "difficulty": "code"} {"input": "def is_nested(string):\n '''\n Create a function that takes a string as input which contains only square brackets.\n The function should return True if and only if there is a valid subsequence of brackets \n where at least one bracket in the subsequence is nested.\n\n is_nested('[[]]') ➞ True\n is_nested('[]]]]]]][[[[[]') ➞ False\n is_nested('[][]') ➞ False\n is_nested('[]') ➞ False\n is_nested('[[][]]') ➞ True\n is_nested('[[]][[') ➞ True\n '''", "answer": "opening_bracket_index = []\n closing_bracket_index = []\n for i in range(len(string)):\n if string[i] == '[':\n opening_bracket_index.append(i)\n else:\n closing_bracket_index.append(i)\n closing_bracket_index.reverse()\n cnt = 0\n i = 0\n l = len(closing_bracket_index)\n for idx in opening_bracket_index:\n if i < l and idx < closing_bracket_index[i]:\n cnt += 1\n i += 1\n return cnt >= 2", "source": "humaneval", "task_id": "HumanEval/132", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('[[]]') == True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate('[]]]]]]][[[[[]') == False\n assert candidate('[][]') == False\n assert candidate(('[]')) == False\n assert candidate('[[[[]]]]') == True\n assert candidate('[]]]]]]]]]]') == False\n assert candidate('[][][[]]') == True\n assert candidate('[[]') == False\n assert candidate('[]]') == False\n assert candidate('[[]][[') == True\n assert candidate('[[][]]') == True\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate('') == False, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate('[[[[[[[[') == False\n assert candidate(']]]]]]]]') == False", "difficulty": "code"} {"input": "def sum_squares(lst):\n \"\"\"You are given a list of numbers.\n You need to return the sum of squared numbers in the given list,\n round each element in the list to the upper int(Ceiling) first.\n Examples:\n For lst = [1,2,3] the output should be 14\n For lst = [1,4,9] the output should be 98\n For lst = [1,3,5,7] the output should be 84\n For lst = [1.4,4.2,0] the output should be 29\n For lst = [-2.4,1,1] the output should be 6\n \n\n \"\"\"", "answer": "import math\n squared = 0\n for i in lst:\n squared += math.ceil(i)**2\n return squared", "source": "humaneval", "task_id": "HumanEval/133", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1,2,3])==14, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1.0,2,3])==14, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1,3,5,7])==84, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1.4,4.2,0])==29, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([-2.4,1,1])==6, \"This prints if this assert fails 1 (good for debugging!)\"\n\n assert candidate([100,1,15,2])==10230, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([10000,10000])==200000000, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([-1.4,4.6,6.3])==75, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([-1.4,17.9,18.9,19.9])==1086, \"This prints if this assert fails 1 (good for debugging!)\"\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([0])==0, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([-1])==1, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([-1,1,0])==2, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def check_if_last_char_is_a_letter(txt):\n '''\n Create a function that returns True if the last character\n of a given string is an alphabetical character and is not\n a part of a word, and False otherwise.\n Note: \"word\" is a group of characters separated by space.\n\n Examples:\n check_if_last_char_is_a_letter(\"apple pie\") ➞ False\n check_if_last_char_is_a_letter(\"apple pi e\") ➞ True\n check_if_last_char_is_a_letter(\"apple pi e \") ➞ False\n check_if_last_char_is_a_letter(\"\") ➞ False \n '''", "answer": "check = txt.split(' ')[-1]\n return True if len(check) == 1 and (97 <= ord(check.lower()) <= 122) else False", "source": "humaneval", "task_id": "HumanEval/134", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"apple\") == False\n assert candidate(\"apple pi e\") == True\n assert candidate(\"eeeee\") == False\n assert candidate(\"A\") == True\n assert candidate(\"Pumpkin pie \") == False\n assert candidate(\"Pumpkin pie 1\") == False\n assert candidate(\"\") == False\n assert candidate(\"eeeee e \") == False\n assert candidate(\"apple pie\") == False\n assert candidate(\"apple pi e \") == False\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def can_arrange(arr):\n \"\"\"Create a function which returns the largest index of an element which\n is not greater than or equal to the element immediately preceding it. If\n no such element exists then return -1. The given array will not contain\n duplicate values.\n\n Examples:\n can_arrange([1,2,4,3,5]) = 3\n can_arrange([1,2,3]) = -1\n \"\"\"", "answer": "ind=-1\n i=1\n while i 0, lst))\n return (max(smallest) if smallest else None, min(largest) if largest else None)", "source": "humaneval", "task_id": "HumanEval/136", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([2, 4, 1, 3, 5, 7]) == (None, 1)\n assert candidate([2, 4, 1, 3, 5, 7, 0]) == (None, 1)\n assert candidate([1, 3, 2, 4, 5, 6, -2]) == (-2, 1)\n assert candidate([4, 5, 3, 6, 2, 7, -7]) == (-7, 2)\n assert candidate([7, 3, 8, 4, 9, 2, 5, -9]) == (-9, 2)\n assert candidate([]) == (None, None)\n assert candidate([0]) == (None, None)\n assert candidate([-1, -3, -5, -6]) == (-1, None)\n assert candidate([-1, -3, -5, -6, 0]) == (-1, None)\n assert candidate([-6, -4, -4, -3, 1]) == (-3, 1)\n assert candidate([-6, -4, -4, -3, -100, 1]) == (-3, 1)\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def compare_one(a, b):\n \"\"\"\n Create a function that takes integers, floats, or strings representing\n real numbers, and returns the larger variable in its given variable type.\n Return None if the values are equal.\n Note: If a real number is represented as a string, the floating point might be . or ,\n\n compare_one(1, 2.5) ➞ 2.5\n compare_one(1, \"2,3\") ➞ \"2,3\"\n compare_one(\"5,1\", \"6\") ➞ \"6\"\n compare_one(\"1\", 1) ➞ None\n \"\"\"", "answer": "temp_a, temp_b = a, b\n if isinstance(temp_a, str): temp_a = temp_a.replace(',','.')\n if isinstance(temp_b, str): temp_b = temp_b.replace(',','.')\n if float(temp_a) == float(temp_b): return None\n return a if float(temp_a) > float(temp_b) else b", "source": "humaneval", "task_id": "HumanEval/137", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(1, 2) == 2\n assert candidate(1, 2.5) == 2.5\n assert candidate(2, 3) == 3\n assert candidate(5, 6) == 6\n assert candidate(1, \"2,3\") == \"2,3\"\n assert candidate(\"5,1\", \"6\") == \"6\"\n assert candidate(\"1\", \"2\") == \"2\"\n assert candidate(\"1\", 1) == None\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def is_equal_to_sum_even(n):\n \"\"\"Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers\n Example\n is_equal_to_sum_even(4) == False\n is_equal_to_sum_even(6) == False\n is_equal_to_sum_even(8) == True\n \"\"\"", "answer": "return n%2 == 0 and n >= 8", "source": "humaneval", "task_id": "HumanEval/138", "test_cases": "def check(candidate):\n assert candidate(4) == False\n assert candidate(6) == False\n assert candidate(8) == True\n assert candidate(10) == True\n assert candidate(11) == False\n assert candidate(12) == True\n assert candidate(13) == False\n assert candidate(16) == True", "difficulty": "code"} {"input": "def special_factorial(n):\n \"\"\"The Brazilian factorial is defined as:\n brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!\n where n > 0\n\n For example:\n >>> special_factorial(4)\n 288\n\n The function will receive an integer as input and should return the special\n factorial of this integer.\n \"\"\"", "answer": "fact_i = 1\n special_fact = 1\n for i in range(1, n+1):\n fact_i *= i\n special_fact *= fact_i\n return special_fact", "source": "humaneval", "task_id": "HumanEval/139", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(4) == 288, \"Test 4\"\n assert candidate(5) == 34560, \"Test 5\"\n assert candidate(7) == 125411328000, \"Test 7\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1) == 1, \"Test 1\"", "difficulty": "code"} {"input": "def fix_spaces(text):\n \"\"\"\n Given a string text, replace all spaces in it with underscores, \n and if a string has more than 2 consecutive spaces, \n then replace all consecutive spaces with - \n \n fix_spaces(\"Example\") == \"Example\"\n fix_spaces(\"Example 1\") == \"Example_1\"\n fix_spaces(\" Example 2\") == \"_Example_2\"\n fix_spaces(\" Example 3\") == \"_Example-3\"\n \"\"\"", "answer": "new_text = \"\"\n i = 0\n start, end = 0, 0\n while i < len(text):\n if text[i] == \" \":\n end += 1\n else:\n if end - start > 2:\n new_text += \"-\"+text[i]\n elif end - start > 0:\n new_text += \"_\"*(end - start)+text[i]\n else:\n new_text += text[i]\n start, end = i+1, i+1\n i+=1\n if end - start > 2:\n new_text += \"-\"\n elif end - start > 0:\n new_text += \"_\"\n return new_text", "source": "humaneval", "task_id": "HumanEval/140", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"Example\") == \"Example\", \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(\"Mudasir Hanif \") == \"Mudasir_Hanif_\", \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate(\"Yellow Yellow Dirty Fellow\") == \"Yellow_Yellow__Dirty__Fellow\", \"This prints if this assert fails 3 (good for debugging!)\"\n \n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"Exa mple\") == \"Exa-mple\", \"This prints if this assert fails 4 (good for debugging!)\"\n assert candidate(\" Exa 1 2 2 mple\") == \"-Exa_1_2_2_mple\", \"This prints if this assert fails 4 (good for debugging!)\"", "difficulty": "code"} {"input": "def file_name_check(file_name):\n \"\"\"Create a function which takes a string representing a file's name, and returns\n 'Yes' if the the file's name is valid, and returns 'No' otherwise.\n A file's name is considered to be valid if and only if all the following conditions \n are met:\n - There should not be more than three digits ('0'-'9') in the file's name.\n - The file's name contains exactly one dot '.'\n - The substring before the dot should not be empty, and it starts with a letter from \n the latin alphapet ('a'-'z' and 'A'-'Z').\n - The substring after the dot should be one of these: ['txt', 'exe', 'dll']\n Examples:\n file_name_check(\"example.txt\") # => 'Yes'\n file_name_check(\"1example.dll\") # => 'No' (the name should start with a latin alphapet letter)\n \"\"\"", "answer": "suf = ['txt', 'exe', 'dll']\n lst = file_name.split(sep='.')\n if len(lst) != 2:\n return 'No'\n if not lst[1] in suf:\n return 'No'\n if len(lst[0]) == 0:\n return 'No'\n if not lst[0][0].isalpha():\n return 'No'\n t = len([x for x in lst[0] if x.isdigit()])\n if t > 3:\n return 'No'\n return 'Yes'", "source": "humaneval", "task_id": "HumanEval/141", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"example.txt\") == 'Yes'\n assert candidate(\"1example.dll\") == 'No'\n assert candidate('s1sdf3.asd') == 'No'\n assert candidate('K.dll') == 'Yes'\n assert candidate('MY16FILE3.exe') == 'Yes'\n assert candidate('His12FILE94.exe') == 'No'\n assert candidate('_Y.txt') == 'No'\n assert candidate('?aREYA.exe') == 'No'\n assert candidate('/this_is_valid.dll') == 'No'\n assert candidate('this_is_valid.wow') == 'No'\n assert candidate('this_is_valid.txt') == 'Yes'\n assert candidate('this_is_valid.txtexe') == 'No'\n assert candidate('#this2_i4s_5valid.ten') == 'No'\n assert candidate('@this1_is6_valid.exe') == 'No'\n assert candidate('this_is_12valid.6exe4.txt') == 'No'\n assert candidate('all.exe.txt') == 'No'\n assert candidate('I563_No.exe') == 'Yes'\n assert candidate('Is3youfault.txt') == 'Yes'\n assert candidate('no_one#knows.dll') == 'Yes'\n assert candidate('1I563_Yes3.exe') == 'No'\n assert candidate('I563_Yes3.txtt') == 'No'\n assert candidate('final..txt') == 'No'\n assert candidate('final132') == 'No'\n assert candidate('_f4indsartal132.') == 'No'\n \n \n\n # Check some edge cases that are easy to work out by hand.\n assert candidate('.txt') == 'No'\n assert candidate('s.') == 'No'", "difficulty": "code"} {"input": "def sum_squares(lst):\n \"\"\"\"\n This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a \n multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not \n change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries. \n \n Examples:\n For lst = [1,2,3] the output should be 6\n For lst = [] the output should be 0\n For lst = [-1,-5,2,-1,-5] the output should be -126\n \"\"\"", "answer": "result =[]\n for i in range(len(lst)):\n if i %3 == 0:\n result.append(lst[i]**2)\n elif i % 4 == 0 and i%3 != 0:\n result.append(lst[i]**3)\n else:\n result.append(lst[i])\n return sum(result)", "source": "humaneval", "task_id": "HumanEval/142", "test_cases": "def check(candidate):\n\n # Check some simple cases\n \n assert candidate([1,2,3]) == 6\n assert candidate([1,4,9]) == 14\n assert candidate([]) == 0\n assert candidate([1,1,1,1,1,1,1,1,1]) == 9\n assert candidate([-1,-1,-1,-1,-1,-1,-1,-1,-1]) == -3\n assert candidate([0]) == 0\n assert candidate([-1,-5,2,-1,-5]) == -126\n assert candidate([-56,-99,1,0,-2]) == 3030\n assert candidate([-1,0,0,0,0,0,0,0,-1]) == 0\n assert candidate([-16, -9, -2, 36, 36, 26, -20, 25, -40, 20, -4, 12, -26, 35, 37]) == -14196\n assert candidate([-1, -3, 17, -1, -15, 13, -1, 14, -14, -12, -5, 14, -14, 6, 13, 11, 16, 16, 4, 10]) == -1448\n \n \n # Don't remove this line:", "difficulty": "code"} {"input": "def words_in_sentence(sentence):\n \"\"\"\n You are given a string representing a sentence,\n the sentence contains some words separated by a space,\n and you have to return a string that contains the words from the original sentence,\n whose lengths are prime numbers,\n the order of the words in the new string should be the same as the original one.\n\n Example 1:\n Input: sentence = \"This is a test\"\n Output: \"is\"\n\n Example 2:\n Input: sentence = \"lets go for swimming\"\n Output: \"go for\"\n\n Constraints:\n * 1 <= len(sentence) <= 100\n * sentence contains only letters\n \"\"\"", "answer": "new_lst = []\n for word in sentence.split():\n flg = 0\n if len(word) == 1:\n flg = 1\n for i in range(2, len(word)):\n if len(word)%i == 0:\n flg = 1\n if flg == 0 or len(word) == 2:\n new_lst.append(word)\n return \" \".join(new_lst)", "source": "humaneval", "task_id": "HumanEval/143", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"This is a test\") == \"is\"\n assert candidate(\"lets go for swimming\") == \"go for\"\n assert candidate(\"there is no place available here\") == \"there is no place\"\n assert candidate(\"Hi I am Hussein\") == \"Hi am Hussein\"\n assert candidate(\"go for it\") == \"go for it\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"here\") == \"\"\n assert candidate(\"here is\") == \"is\"", "difficulty": "code"} {"input": "def simplify(x, n):\n \"\"\"Your task is to implement a function that will simplify the expression\n x * n. The function returns True if x * n evaluates to a whole number and False\n otherwise. Both x and n, are string representation of a fraction, and have the following format,\n / where both numerator and denominator are positive whole numbers.\n\n You can assume that x, and n are valid fractions, and do not have zero as denominator.\n\n simplify(\"1/5\", \"5/1\") = True\n simplify(\"1/6\", \"2/1\") = False\n simplify(\"7/10\", \"10/2\") = False\n \"\"\"", "answer": "a, b = x.split(\"/\")\n c, d = n.split(\"/\")\n numerator = int(a) * int(c)\n denom = int(b) * int(d)\n if (numerator/denom == int(numerator/denom)):\n return True\n return False", "source": "humaneval", "task_id": "HumanEval/144", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"1/5\", \"5/1\") == True, 'test1'\n assert candidate(\"1/6\", \"2/1\") == False, 'test2'\n assert candidate(\"5/1\", \"3/1\") == True, 'test3'\n assert candidate(\"7/10\", \"10/2\") == False, 'test4'\n assert candidate(\"2/10\", \"50/10\") == True, 'test5'\n assert candidate(\"7/2\", \"4/2\") == True, 'test6'\n assert candidate(\"11/6\", \"6/1\") == True, 'test7'\n assert candidate(\"2/3\", \"5/2\") == False, 'test8'\n assert candidate(\"5/2\", \"3/5\") == False, 'test9'\n assert candidate(\"2/4\", \"8/4\") == True, 'test10'\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"2/4\", \"4/2\") == True, 'test11'\n assert candidate(\"1/5\", \"5/1\") == True, 'test12'\n assert candidate(\"1/5\", \"1/5\") == False, 'test13'", "difficulty": "code"} {"input": "def order_by_points(nums):\n \"\"\"\n Write a function which sorts the given list of integers\n in ascending order according to the sum of their digits.\n Note: if there are several items with similar sum of their digits,\n order them based on their index in original list.\n\n For example:\n >>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]\n >>> order_by_points([]) == []\n \"\"\"", "answer": "def digits_sum(n):\n neg = 1\n if n < 0: n, neg = -1 * n, -1 \n n = [int(i) for i in str(n)]\n n[0] = n[0] * neg\n return sum(n)\n return sorted(nums, key=digits_sum)", "source": "humaneval", "task_id": "HumanEval/145", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]\n assert candidate([1234,423,463,145,2,423,423,53,6,37,3457,3,56,0,46]) == [0, 2, 3, 6, 53, 423, 423, 423, 1234, 145, 37, 46, 56, 463, 3457]\n assert candidate([]) == []\n assert candidate([1, -11, -32, 43, 54, -98, 2, -3]) == [-3, -32, -98, -11, 1, 2, 43, 54]\n assert candidate([1,2,3,4,5,6,7,8,9,10,11]) == [1, 10, 2, 11, 3, 4, 5, 6, 7, 8, 9]\n assert candidate([0,6,6,-76,-21,23,4]) == [-76, -21, 0, 4, 23, 6, 6]\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def specialFilter(nums):\n \"\"\"Write a function that takes an array of numbers as input and returns \n the number of elements in the array that are greater than 10 and both \n first and last digits of a number are odd (1, 3, 5, 7, 9).\n For example:\n specialFilter([15, -73, 14, -15]) => 1 \n specialFilter([33, -2, -3, 45, 21, 109]) => 2\n \"\"\"", "answer": "count = 0\n for num in nums:\n if num > 10:\n odd_digits = (1, 3, 5, 7, 9)\n number_as_string = str(num)\n if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:\n count += 1\n \n return count", "source": "humaneval", "task_id": "HumanEval/146", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([5, -2, 1, -5]) == 0 \n assert candidate([15, -73, 14, -15]) == 1\n assert candidate([33, -2, -3, 45, 21, 109]) == 2\n assert candidate([43, -12, 93, 125, 121, 109]) == 4\n assert candidate([71, -2, -33, 75, 21, 19]) == 3\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1]) == 0 \n assert candidate([]) == 0", "difficulty": "code"} {"input": "def get_max_triples(n):\n \"\"\"\n You are given a positive integer n. You have to create an integer array a of length n.\n For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.\n Return the number of triples (a[i], a[j], a[k]) of a where i < j < k, \n and a[i] + a[j] + a[k] is a multiple of 3.\n\n Example :\n Input: n = 5\n Output: 1\n Explanation: \n a = [1, 3, 7, 13, 21]\n The only valid triple is (1, 7, 13).\n \"\"\"", "answer": "A = [i*i - i + 1 for i in range(1,n+1)]\n ans = []\n for i in range(n):\n for j in range(i+1,n):\n for k in range(j+1,n):\n if (A[i]+A[j]+A[k])%3 == 0:\n ans += [(A[i],A[j],A[k])]\n return len(ans)", "source": "humaneval", "task_id": "HumanEval/147", "test_cases": "def check(candidate):\n\n assert candidate(5) == 1\n assert candidate(6) == 4\n assert candidate(10) == 36\n assert candidate(100) == 53361", "difficulty": "code"} {"input": "def bf(planet1, planet2):\n '''\n There are eight planets in our solar system: the closerst to the Sun \n is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn, \n Uranus, Neptune.\n Write a function that takes two planet names as strings planet1 and planet2. \n The function should return a tuple containing all planets whose orbits are \n located between the orbit of planet1 and the orbit of planet2, sorted by \n the proximity to the sun. \n The function should return an empty tuple if planet1 or planet2\n are not correct planet names. \n Examples\n bf(\"Jupiter\", \"Neptune\") ==> (\"Saturn\", \"Uranus\")\n bf(\"Earth\", \"Mercury\") ==> (\"Venus\")\n bf(\"Mercury\", \"Uranus\") ==> (\"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\")\n '''", "answer": "planet_names = (\"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\")\n if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:\n return ()\n planet1_index = planet_names.index(planet1)\n planet2_index = planet_names.index(planet2)\n if planet1_index < planet2_index:\n return (planet_names[planet1_index + 1: planet2_index])\n else:\n return (planet_names[planet2_index + 1 : planet1_index])", "source": "humaneval", "task_id": "HumanEval/148", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"Jupiter\", \"Neptune\") == (\"Saturn\", \"Uranus\"), \"First test error: \" + str(len(candidate(\"Jupiter\", \"Neptune\"))) \n assert candidate(\"Earth\", \"Mercury\") == (\"Venus\",), \"Second test error: \" + str(candidate(\"Earth\", \"Mercury\")) \n assert candidate(\"Mercury\", \"Uranus\") == (\"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\"), \"Third test error: \" + str(candidate(\"Mercury\", \"Uranus\")) \n assert candidate(\"Neptune\", \"Venus\") == (\"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\"), \"Fourth test error: \" + str(candidate(\"Neptune\", \"Venus\")) \n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"Earth\", \"Earth\") == ()\n assert candidate(\"Mars\", \"Earth\") == ()\n assert candidate(\"Jupiter\", \"Makemake\") == ()", "difficulty": "code"} {"input": "def sorted_list_sum(lst):\n \"\"\"Write a function that accepts a list of strings as a parameter,\n deletes the strings that have odd lengths from it,\n and returns the resulted list with a sorted order,\n The list is always a list of strings and never an array of numbers,\n and it may contain duplicates.\n The order of the list should be ascending by length of each word, and you\n should return the list sorted by that rule.\n If two words have the same length, sort the list alphabetically.\n The function should return a list of strings in sorted order.\n You may assume that all words will have the same length.\n For example:\n assert list_sort([\"aa\", \"a\", \"aaa\"]) => [\"aa\"]\n assert list_sort([\"ab\", \"a\", \"aaa\", \"cd\"]) => [\"ab\", \"cd\"]\n \"\"\"", "answer": "lst.sort()\n new_lst = []\n for i in lst:\n if len(i)%2 == 0:\n new_lst.append(i)\n return sorted(new_lst, key=len)", "source": "humaneval", "task_id": "HumanEval/149", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([\"aa\", \"a\", \"aaa\"]) == [\"aa\"]\n assert candidate([\"school\", \"AI\", \"asdf\", \"b\"]) == [\"AI\", \"asdf\", \"school\"]\n assert candidate([\"d\", \"b\", \"c\", \"a\"]) == []\n assert candidate([\"d\", \"dcba\", \"abcd\", \"a\"]) == [\"abcd\", \"dcba\"]\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([\"AI\", \"ai\", \"au\"]) == [\"AI\", \"ai\", \"au\"]\n assert candidate([\"a\", \"b\", \"b\", \"c\", \"c\", \"a\"]) == []\n assert candidate(['aaaa', 'bbbb', 'dd', 'cc']) == [\"cc\", \"dd\", \"aaaa\", \"bbbb\"]", "difficulty": "code"} {"input": "def x_or_y(n, x, y):\n \"\"\"A simple program which should return the value of x if n is \n a prime number and should return the value of y otherwise.\n\n Examples:\n for x_or_y(7, 34, 12) == 34\n for x_or_y(15, 8, 5) == 5\n \n \"\"\"", "answer": "if n == 1:\n return y\n for i in range(2, n):\n if n % i == 0:\n return y\n break\n else:\n return x", "source": "humaneval", "task_id": "HumanEval/150", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(7, 34, 12) == 34\n assert candidate(15, 8, 5) == 5\n assert candidate(3, 33, 5212) == 33\n assert candidate(1259, 3, 52) == 3\n assert candidate(7919, -1, 12) == -1\n assert candidate(3609, 1245, 583) == 583\n assert candidate(91, 56, 129) == 129\n assert candidate(6, 34, 1234) == 1234\n \n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 2, 0) == 0\n assert candidate(2, 2, 0) == 2", "difficulty": "code"} {"input": "def double_the_difference(lst):\n '''\n Given a list of numbers, return the sum of squares of the numbers\n in the list that are odd. Ignore numbers that are negative or not integers.\n \n double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10\n double_the_difference([-1, -2, 0]) == 0\n double_the_difference([9, -2]) == 81\n double_the_difference([0]) == 0 \n \n If the input list is empty, return 0.\n '''", "answer": "return sum([i**2 for i in lst if i > 0 and i%2!=0 and \".\" not in str(i)])", "source": "humaneval", "task_id": "HumanEval/151", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([]) == 0 , \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([5, 4]) == 25 , \"This prints if this assert fails 2 (good for debugging!)\"\n assert candidate([0.1, 0.2, 0.3]) == 0 , \"This prints if this assert fails 3 (good for debugging!)\"\n assert candidate([-10, -20, -30]) == 0 , \"This prints if this assert fails 4 (good for debugging!)\"\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([-1, -2, 8]) == 0, \"This prints if this assert fails 5 (also good for debugging!)\"\n assert candidate([0.2, 3, 5]) == 34, \"This prints if this assert fails 6 (also good for debugging!)\"\n lst = list(range(-99, 100, 2))\n odd_sum = sum([i**2 for i in lst if i%2!=0 and i > 0])\n assert candidate(lst) == odd_sum , \"This prints if this assert fails 7 (good for debugging!)\"", "difficulty": "code"} {"input": "def compare(game,guess):\n \"\"\"I think we all remember that feeling when the result of some long-awaited\n event is finally known. The feelings and thoughts you have at that moment are\n definitely worth noting down and comparing.\n Your task is to determine if a person correctly guessed the results of a number of matches.\n You are given two arrays of scores and guesses of equal length, where each index shows a match. \n Return an array of the same length denoting how far off each guess was. If they have guessed correctly,\n the value is 0, and if not, the value is the absolute difference between the guess and the score.\n \n \n example:\n\n compare([1,2,3,4,5,1],[1,2,3,4,2,-2]) -> [0,0,0,0,3,3]\n compare([0,5,0,0,0,4],[4,1,1,0,0,-2]) -> [4,4,1,0,0,6]\n \"\"\"", "answer": "return [abs(x-y) for x,y in zip(game,guess)]", "source": "humaneval", "task_id": "HumanEval/152", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1,2,3,4,5,1],[1,2,3,4,2,-2])==[0,0,0,0,3,3], \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([0,0,0,0,0,0],[0,0,0,0,0,0])==[0,0,0,0,0,0], \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1,2,3],[-1,-2,-3])==[2,4,6], \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([1,2,3,5],[-1,2,3,4])==[2,0,0,1], \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def Strongest_Extension(class_name, extensions):\n \"\"\"You will be given the name of a class (a string) and a list of extensions.\n The extensions are to be used to load additional classes to the class. The\n strength of the extension is as follows: Let CAP be the number of the uppercase\n letters in the extension's name, and let SM be the number of lowercase letters \n in the extension's name, the strength is given by the fraction CAP - SM. \n You should find the strongest extension and return a string in this \n format: ClassName.StrongestExtensionName.\n If there are two or more extensions with the same strength, you should\n choose the one that comes first in the list.\n For example, if you are given \"Slices\" as the class and a list of the\n extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should\n return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension \n (its strength is -1).\n Example:\n for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'\n \"\"\"", "answer": "strong = extensions[0]\n my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])\n for s in extensions:\n val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])\n if val > my_val:\n strong = s\n my_val = val\n\n ans = class_name + \".\" + strong\n return ans", "source": "humaneval", "task_id": "HumanEval/153", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('Watashi', ['tEN', 'niNE', 'eIGHt8OKe']) == 'Watashi.eIGHt8OKe'\n assert candidate('Boku123', ['nani', 'NazeDa', 'YEs.WeCaNe', '32145tggg']) == 'Boku123.YEs.WeCaNe'\n assert candidate('__YESIMHERE', ['t', 'eMptY', 'nothing', 'zeR00', 'NuLl__', '123NoooneB321']) == '__YESIMHERE.NuLl__'\n assert candidate('K', ['Ta', 'TAR', 't234An', 'cosSo']) == 'K.TAR'\n assert candidate('__HAHA', ['Tab', '123', '781345', '-_-']) == '__HAHA.123'\n assert candidate('YameRore', ['HhAas', 'okIWILL123', 'WorkOut', 'Fails', '-_-']) == 'YameRore.okIWILL123'\n assert candidate('finNNalLLly', ['Die', 'NowW', 'Wow', 'WoW']) == 'finNNalLLly.WoW'\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate('_', ['Bb', '91245']) == '_.Bb'\n assert candidate('Sp', ['671235', 'Bb']) == 'Sp.671235'", "difficulty": "code"} {"input": "def cycpattern_check(a , b):\n \"\"\"You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word\n cycpattern_check(\"abcd\",\"abd\") => False\n cycpattern_check(\"hello\",\"ell\") => True\n cycpattern_check(\"whassup\",\"psus\") => False\n cycpattern_check(\"abab\",\"baa\") => True\n cycpattern_check(\"efef\",\"eeff\") => False\n cycpattern_check(\"himenss\",\"simen\") => True\n\n \"\"\"", "answer": "l = len(b)\n pat = b + b\n for i in range(len(a) - l + 1):\n for j in range(l + 1):\n if a[i:i+l] == pat[j:j+l]:\n return True\n return False", "source": "humaneval", "task_id": "HumanEval/154", "test_cases": "def check(candidate):\n\n # Check some simple cases\n #assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n #assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(\"xyzw\",\"xyw\") == False , \"test #0\"\n assert candidate(\"yello\",\"ell\") == True , \"test #1\"\n assert candidate(\"whattup\",\"ptut\") == False , \"test #2\"\n assert candidate(\"efef\",\"fee\") == True , \"test #3\"\n assert candidate(\"abab\",\"aabb\") == False , \"test #4\"\n assert candidate(\"winemtt\",\"tinem\") == True , \"test #5\"", "difficulty": "code"} {"input": "def even_odd_count(num):\n \"\"\"Given an integer. return a tuple that has the number of even and odd digits respectively.\n\n Example:\n even_odd_count(-12) ==> (1, 1)\n even_odd_count(123) ==> (1, 2)\n \"\"\"", "answer": "even_count = 0\n odd_count = 0\n for i in str(abs(num)):\n if int(i)%2==0:\n even_count +=1\n else:\n odd_count +=1\n return (even_count, odd_count)", "source": "humaneval", "task_id": "HumanEval/155", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(7) == (0, 1)\n assert candidate(-78) == (1, 1)\n assert candidate(3452) == (2, 2)\n assert candidate(346211) == (3, 3)\n assert candidate(-345821) == (3, 3)\n assert candidate(-2) == (1, 0)\n assert candidate(-45347) == (2, 3)\n assert candidate(0) == (1, 0)\n\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def int_to_mini_roman(number):\n \"\"\"\n Given a positive integer, obtain its roman numeral equivalent as a string,\n and return it in lowercase.\n Restrictions: 1 <= num <= 1000\n\n Examples:\n >>> int_to_mini_roman(19) == 'xix'\n >>> int_to_mini_roman(152) == 'clii'\n >>> int_to_mini_roman(426) == 'cdxxvi'\n \"\"\"", "answer": "num = [1, 4, 5, 9, 10, 40, 50, 90, \n 100, 400, 500, 900, 1000] \n sym = [\"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\", \n \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\"] \n i = 12\n res = ''\n while number: \n div = number // num[i] \n number %= num[i] \n while div: \n res += sym[i] \n div -= 1\n i -= 1\n return res.lower()", "source": "humaneval", "task_id": "HumanEval/156", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(19) == 'xix'\n assert candidate(152) == 'clii'\n assert candidate(251) == 'ccli'\n assert candidate(426) == 'cdxxvi'\n assert candidate(500) == 'd'\n assert candidate(1) == 'i'\n assert candidate(4) == 'iv'\n assert candidate(43) == 'xliii'\n assert candidate(90) == 'xc'\n assert candidate(94) == 'xciv'\n assert candidate(532) == 'dxxxii'\n assert candidate(900) == 'cm'\n assert candidate(994) == 'cmxciv'\n assert candidate(1000) == 'm'\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def right_angle_triangle(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return True if the three\n sides form a right-angled triangle, False otherwise.\n A right-angled triangle is a triangle in which one angle is right angle or \n 90 degree.\n Example:\n right_angle_triangle(3, 4, 5) == True\n right_angle_triangle(1, 2, 3) == False\n '''", "answer": "return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b", "source": "humaneval", "task_id": "HumanEval/157", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(3, 4, 5) == True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(1, 2, 3) == False\n assert candidate(10, 6, 8) == True\n assert candidate(2, 2, 2) == False\n assert candidate(7, 24, 25) == True\n assert candidate(10, 5, 7) == False\n assert candidate(5, 12, 13) == True\n assert candidate(15, 8, 17) == True\n assert candidate(48, 55, 73) == True\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 1, 1) == False, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(2, 2, 10) == False", "difficulty": "code"} {"input": "def find_max(words):\n \"\"\"Write a function that accepts a list of strings.\n The list contains different words. Return the word with maximum number\n of unique characters. If multiple strings have maximum number of unique\n characters, return the one which comes first in lexicographical order.\n\n find_max([\"name\", \"of\", \"string\"]) == \"string\"\n find_max([\"name\", \"enam\", \"game\"]) == \"enam\"\n find_max([\"aaaaaaa\", \"bb\" ,\"cc\"]) == \"\"aaaaaaa\"\n \"\"\"", "answer": "return sorted(words, key = lambda x: (-len(set(x)), x))[0]", "source": "humaneval", "task_id": "HumanEval/158", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert (candidate([\"name\", \"of\", \"string\"]) == \"string\"), \"t1\"\n assert (candidate([\"name\", \"enam\", \"game\"]) == \"enam\"), 't2'\n assert (candidate([\"aaaaaaa\", \"bb\", \"cc\"]) == \"aaaaaaa\"), 't3'\n assert (candidate([\"abc\", \"cba\"]) == \"abc\"), 't4'\n assert (candidate([\"play\", \"this\", \"game\", \"of\",\"footbott\"]) == \"footbott\"), 't5'\n assert (candidate([\"we\", \"are\", \"gonna\", \"rock\"]) == \"gonna\"), 't6'\n assert (candidate([\"we\", \"are\", \"a\", \"mad\", \"nation\"]) == \"nation\"), 't7'\n assert (candidate([\"this\", \"is\", \"a\", \"prrk\"]) == \"this\"), 't8'\n\n # Check some edge cases that are easy to work out by hand.\n assert (candidate([\"b\"]) == \"b\"), 't9'\n assert (candidate([\"play\", \"play\", \"play\"]) == \"play\"), 't10'", "difficulty": "code"} {"input": "def eat(number, need, remaining):\n \"\"\"\n You're a hungry rabbit, and you already have eaten a certain number of carrots,\n but now you need to eat more carrots to complete the day's meals.\n you should return an array of [ total number of eaten carrots after your meals,\n the number of carrots left after your meals ]\n if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.\n \n Example:\n * eat(5, 6, 10) -> [11, 4]\n * eat(4, 8, 9) -> [12, 1]\n * eat(1, 10, 10) -> [11, 0]\n * eat(2, 11, 5) -> [7, 0]\n \n Variables:\n @number : integer\n the number of carrots that you have eaten.\n @need : integer\n the number of carrots that you need to eat.\n @remaining : integer\n the number of remaining carrots thet exist in stock\n \n Constrain:\n * 0 <= number <= 1000\n * 0 <= need <= 1000\n * 0 <= remaining <= 1000\n\n Have fun :)\n \"\"\"", "answer": "if(need <= remaining):\n return [ number + need , remaining-need ]\n else:\n return [ number + remaining , 0]", "source": "humaneval", "task_id": "HumanEval/159", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(5, 6, 10) == [11, 4], \"Error\"\n assert candidate(4, 8, 9) == [12, 1], \"Error\"\n assert candidate(1, 10, 10) == [11, 0], \"Error\"\n assert candidate(2, 11, 5) == [7, 0], \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(4, 5, 7) == [9, 2], \"Error\"\n assert candidate(4, 5, 1) == [5, 0], \"Error\"", "difficulty": "code"} {"input": "def do_algebra(operator, operand):\n \"\"\"\n Given two lists operator, and operand. The first list has basic algebra operations, and \n the second list is a list of integers. Use the two given lists to build the algebric \n expression and return the evaluation of this expression.\n\n The basic algebra operations:\n Addition ( + ) \n Subtraction ( - ) \n Multiplication ( * ) \n Floor division ( // ) \n Exponentiation ( ** ) \n\n Example:\n operator['+', '*', '-']\n array = [2, 3, 4, 5]\n result = 2 + 3 * 4 - 5\n => result = 9\n\n Note:\n The length of operator list is equal to the length of operand list minus one.\n Operand is a list of of non-negative integers.\n Operator list has at least one operator, and operand list has at least two operands.\n\n \"\"\"", "answer": "expression = str(operand[0])\n for oprt, oprn in zip(operator, operand[1:]):\n expression+= oprt + str(oprn)\n return eval(expression)", "source": "humaneval", "task_id": "HumanEval/160", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(['**', '*', '+'], [2, 3, 4, 5]) == 37\n assert candidate(['+', '*', '-'], [2, 3, 4, 5]) == 9\n assert candidate(['//', '*'], [7, 3, 4]) == 8, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "def solve(s):\n \"\"\"You are given a string s.\n if s[i] is a letter, reverse its case from lower to upper or vise versa, \n otherwise keep it as it is.\n If the string contains no letters, reverse the string.\n The function should return the resulted string.\n Examples\n solve(\"1234\") = \"4321\"\n solve(\"ab\") = \"AB\"\n solve(\"#a@C\") = \"#A@c\"\n \"\"\"", "answer": "flg = 0\n idx = 0\n new_str = list(s)\n for i in s:\n if i.isalpha():\n new_str[idx] = i.swapcase()\n flg = 1\n idx += 1\n s = \"\"\n for i in new_str:\n s += i\n if flg == 0:\n return s[len(s)::-1]\n return s", "source": "humaneval", "task_id": "HumanEval/161", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"AsDf\") == \"aSdF\"\n assert candidate(\"1234\") == \"4321\"\n assert candidate(\"ab\") == \"AB\"\n assert candidate(\"#a@C\") == \"#A@c\"\n assert candidate(\"#AsdfW^45\") == \"#aSDFw^45\"\n assert candidate(\"#6@2\") == \"2@6#\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(\"#$a^D\") == \"#$A^d\"\n assert candidate(\"#ccc\") == \"#CCC\"\n\n # Don't remove this line:", "difficulty": "code"} {"input": "def string_to_md5(text):\n \"\"\"\n Given a string 'text', return its md5 hash equivalent string.\n If 'text' is an empty string, return None.\n\n >>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'\n \"\"\"", "answer": "import hashlib\n return hashlib.md5(text.encode('ascii')).hexdigest() if text else None", "source": "humaneval", "task_id": "HumanEval/162", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'\n assert candidate('') == None\n assert candidate('A B C') == '0ef78513b0cb8cef12743f5aeb35f888'\n assert candidate('password') == '5f4dcc3b5aa765d61d8327deb882cf99'\n\n # Check some edge cases that are easy to work out by hand.\n assert True", "difficulty": "code"} {"input": "def generate_integers(a, b):\n \"\"\"\n Given two positive integers a and b, return the even digits between a\n and b, in ascending order.\n\n For example:\n generate_integers(2, 8) => [2, 4, 6, 8]\n generate_integers(8, 2) => [2, 4, 6, 8]\n generate_integers(10, 14) => []\n \"\"\"", "answer": "lower = max(2, min(a, b))\n upper = min(8, max(a, b))\n\n return [i for i in range(lower, upper+1) if i % 2 == 0]", "source": "humaneval", "task_id": "HumanEval/163", "test_cases": "def check(candidate):\n\n # Check some simple cases\n assert candidate(2, 10) == [2, 4, 6, 8], \"Test 1\"\n assert candidate(10, 2) == [2, 4, 6, 8], \"Test 2\"\n assert candidate(132, 2) == [2, 4, 6, 8], \"Test 3\"\n assert candidate(17,89) == [], \"Test 4\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"", "difficulty": "code"} {"input": "Write a python function to remove first and last occurrence of a given character from the string.", "answer": "def remove_Occ(s,ch): \r\n for i in range(len(s)): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n for i in range(len(s) - 1,-1,-1): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n return s", "source": "mbpp", "task_id": "11", "test_cases": "assert remove_Occ(\"hello\",\"l\") == \"heo\"\nassert remove_Occ(\"abcda\",\"a\") == \"bcd\"\nassert remove_Occ(\"PHP\",\"P\") == \"H\"", "difficulty": "code"} {"input": "Write a function to sort a given matrix in ascending order according to the sum of its rows.", "answer": "def sort_matrix(M):\r\n result = sorted(M, key=sum)\r\n return result", "source": "mbpp", "task_id": "12", "test_cases": "assert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]]\nassert sort_matrix([[1, 2, 3], [-2, 4, -5], [1, -1, 1]])==[[-2, 4, -5], [1, -1, 1], [1, 2, 3]]\nassert sort_matrix([[5,8,9],[6,4,3],[2,1,4]])==[[2, 1, 4], [6, 4, 3], [5, 8, 9]]", "difficulty": "code"} {"input": "Write a function to count the most common words in a dictionary.", "answer": "from collections import Counter\r\ndef count_common(words):\r\n word_counts = Counter(words)\r\n top_four = word_counts.most_common(4)\r\n return (top_four)", "source": "mbpp", "task_id": "13", "test_cases": "assert count_common(['red','green','black','pink','black','white','black','eyes','white','black','orange','pink','pink','red','red','white','orange','white',\"black\",'pink','green','green','pink','green','pink','white','orange',\"orange\",'red']) == [('pink', 6), ('black', 5), ('white', 5), ('red', 4)]\nassert count_common(['one', 'two', 'three', 'four', 'five', 'one', 'two', 'one', 'three', 'one']) == [('one', 4), ('two', 2), ('three', 2), ('four', 1)]\nassert count_common(['Facebook', 'Apple', 'Amazon', 'Netflix', 'Google', 'Apple', 'Netflix', 'Amazon']) == [('Apple', 2), ('Amazon', 2), ('Netflix', 2), ('Facebook', 1)]", "difficulty": "code"} {"input": "Write a python function to find the volume of a triangular prism.", "answer": "def find_Volume(l,b,h) : \r\n return ((l * b * h) / 2)", "source": "mbpp", "task_id": "14", "test_cases": "assert find_Volume(10,8,6) == 240\nassert find_Volume(3,2,2) == 6\nassert find_Volume(1,2,1) == 1", "difficulty": "code"} {"input": "Write a function to split a string at lowercase letters.", "answer": "import re\r\ndef split_lowerstring(text):\r\n return (re.findall('[a-z][^a-z]*', text))", "source": "mbpp", "task_id": "15", "test_cases": "assert split_lowerstring(\"AbCd\")==['bC','d']\nassert split_lowerstring(\"Python\")==['y', 't', 'h', 'o', 'n']\nassert split_lowerstring(\"Programming\")==['r', 'o', 'g', 'r', 'a', 'm', 'm', 'i', 'n', 'g']", "difficulty": "code"} {"input": "Write a function to find sequences of lowercase letters joined with an underscore.", "answer": "import re\r\ndef text_lowercase_underscore(text):\r\n patterns = '^[a-z]+_[a-z]+$'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')", "source": "mbpp", "task_id": "16", "test_cases": "assert text_lowercase_underscore(\"aab_cbbbc\")==('Found a match!')\nassert text_lowercase_underscore(\"aab_Abbbc\")==('Not matched!')\nassert text_lowercase_underscore(\"Aaab_abbbc\")==('Not matched!')", "difficulty": "code"} {"input": "Write a function to find the perimeter of a square.", "answer": "def square_perimeter(a):\r\n perimeter=4*a\r\n return perimeter", "source": "mbpp", "task_id": "17", "test_cases": "assert square_perimeter(10)==40\nassert square_perimeter(5)==20\nassert square_perimeter(4)==16", "difficulty": "code"} {"input": "Write a function to remove characters from the first string which are present in the second string.", "answer": "NO_OF_CHARS = 256\r\ndef str_to_list(string): \r\n\ttemp = [] \r\n\tfor x in string: \r\n\t\ttemp.append(x) \r\n\treturn temp \r\ndef lst_to_string(List): \r\n\treturn ''.join(List) \r\ndef get_char_count_array(string): \r\n\tcount = [0] * NO_OF_CHARS \r\n\tfor i in string: \r\n\t\tcount[ord(i)] += 1\r\n\treturn count \r\ndef remove_dirty_chars(string, second_string): \r\n\tcount = get_char_count_array(second_string) \r\n\tip_ind = 0\r\n\tres_ind = 0\r\n\ttemp = '' \r\n\tstr_list = str_to_list(string) \r\n\twhile ip_ind != len(str_list): \r\n\t\ttemp = str_list[ip_ind] \r\n\t\tif count[ord(temp)] == 0: \r\n\t\t\tstr_list[res_ind] = str_list[ip_ind] \r\n\t\t\tres_ind += 1\r\n\t\tip_ind+=1\r\n\treturn lst_to_string(str_list[0:res_ind])", "source": "mbpp", "task_id": "18", "test_cases": "assert remove_dirty_chars(\"probasscurve\", \"pros\") == 'bacuve'\nassert remove_dirty_chars(\"digitalindia\", \"talent\") == 'digiidi'\nassert remove_dirty_chars(\"exoticmiles\", \"toxic\") == 'emles' ", "difficulty": "code"} {"input": "Write a function to find whether a given array of integers contains any duplicate element.", "answer": "def test_duplicate(arraynums):\r\n nums_set = set(arraynums) \r\n return len(arraynums) != len(nums_set)", "source": "mbpp", "task_id": "19", "test_cases": "assert test_duplicate(([1,2,3,4,5]))==False\nassert test_duplicate(([1,2,3,4, 4]))==True\nassert test_duplicate([1,1,2,2,3,3,4,4,5])==True", "difficulty": "code"} {"input": "Write a function to check if the given number is woodball or not.", "answer": "def is_woodall(x): \r\n\tif (x % 2 == 0): \r\n\t\treturn False\r\n\tif (x == 1): \r\n\t\treturn True\r\n\tx = x + 1 \r\n\tp = 0\r\n\twhile (x % 2 == 0): \r\n\t\tx = x/2\r\n\t\tp = p + 1\r\n\t\tif (p == x): \r\n\t\t\treturn True\r\n\treturn False", "source": "mbpp", "task_id": "20", "test_cases": "assert is_woodall(383) == True\nassert is_woodall(254) == False\nassert is_woodall(200) == False", "difficulty": "code"} {"input": "Write a function to find m number of multiples of n.", "answer": "def multiples_of_num(m,n): \r\n multiples_of_num= list(range(n,(m+1)*n, n)) \r\n return list(multiples_of_num)", "source": "mbpp", "task_id": "21", "test_cases": "assert multiples_of_num(4,3)== [3,6,9,12]\nassert multiples_of_num(2,5)== [5,10]\nassert multiples_of_num(9,2)== [2,4,6,8,10,12,14,16,18]", "difficulty": "code"} {"input": "Write a function to find the first duplicate element in a given array of integers.", "answer": "def find_first_duplicate(nums):\r\n num_set = set()\r\n no_duplicate = -1\r\n\r\n for i in range(len(nums)):\r\n\r\n if nums[i] in num_set:\r\n return nums[i]\r\n else:\r\n num_set.add(nums[i])\r\n\r\n return no_duplicate", "source": "mbpp", "task_id": "22", "test_cases": "assert find_first_duplicate(([1, 2, 3, 4, 4, 5]))==4\nassert find_first_duplicate([1, 2, 3, 4])==-1\nassert find_first_duplicate([1, 1, 2, 3, 3, 2, 2])==1", "difficulty": "code"} {"input": "Write a python function to find the maximum sum of elements of list in a list of lists.", "answer": "def maximum_Sum(list1): \r\n maxi = -100000\r\n for x in list1: \r\n sum = 0 \r\n for y in x: \r\n sum+= y \r\n maxi = max(sum,maxi) \r\n return maxi", "source": "mbpp", "task_id": "23", "test_cases": "assert maximum_Sum([[1,2,3],[4,5,6],[10,11,12],[7,8,9]]) == 33\nassert maximum_Sum([[0,1,1],[1,1,2],[3,2,1]]) == 6\nassert maximum_Sum([[0,1,3],[1,2,1],[9,8,2],[0,1,0],[6,4,8]]) == 19", "difficulty": "code"} {"input": "Write a function to convert the given binary number to its decimal equivalent.", "answer": "def binary_to_decimal(binary): \r\n binary1 = binary \r\n decimal, i, n = 0, 0, 0\r\n while(binary != 0): \r\n dec = binary % 10\r\n decimal = decimal + dec * pow(2, i) \r\n binary = binary//10\r\n i += 1\r\n return (decimal)", "source": "mbpp", "task_id": "24", "test_cases": "assert binary_to_decimal(100) == 4\nassert binary_to_decimal(1011) == 11\nassert binary_to_decimal(1101101) == 109", "difficulty": "code"} {"input": "Write a python function to find the product of non-repeated elements in a given array.", "answer": "def find_Product(arr,n): \r\n arr.sort() \r\n prod = 1\r\n for i in range(0,n,1): \r\n if (arr[i - 1] != arr[i]): \r\n prod = prod * arr[i] \r\n return prod;", "source": "mbpp", "task_id": "25", "test_cases": "assert find_Product([1,1,2,3],4) == 6\nassert find_Product([1,2,3,1,1],5) == 6\nassert find_Product([1,1,4,5,6],5) == 120", "difficulty": "code"} {"input": "Write a function to check if the given tuple list has all k elements.", "answer": "def check_k_elements(test_list, K):\r\n res = True\r\n for tup in test_list:\r\n for ele in tup:\r\n if ele != K:\r\n res = False\r\n return (res)", "source": "mbpp", "task_id": "26", "test_cases": "assert check_k_elements([(4, 4), (4, 4, 4), (4, 4), (4, 4, 4, 4), (4, )], 4) == True\nassert check_k_elements([(7, 7, 7), (7, 7)], 7) == True\nassert check_k_elements([(9, 9), (9, 9, 9, 9)], 7) == False", "difficulty": "code"} {"input": "Write a python function to remove all digits from a list of strings.", "answer": "import re \r\ndef remove(list): \r\n pattern = '[0-9]'\r\n list = [re.sub(pattern, '', i) for i in list] \r\n return list", "source": "mbpp", "task_id": "27", "test_cases": "assert remove(['4words', '3letters', '4digits']) == ['words', 'letters', 'digits']\nassert remove(['28Jan','12Jan','11Jan']) == ['Jan','Jan','Jan']\nassert remove(['wonder1','wonder2','wonder3']) == ['wonder','wonder','wonder']", "difficulty": "code"} {"input": "Write a python function to find binomial co-efficient.", "answer": "def binomial_Coeff(n,k): \r\n if k > n : \r\n return 0\r\n if k==0 or k ==n : \r\n return 1 \r\n return binomial_Coeff(n-1,k-1) + binomial_Coeff(n-1,k)", "source": "mbpp", "task_id": "28", "test_cases": "assert binomial_Coeff(5,2) == 10\nassert binomial_Coeff(4,3) == 4\nassert binomial_Coeff(3,2) == 3", "difficulty": "code"} {"input": "Write a python function to find the element occurring odd number of times.", "answer": "def get_Odd_Occurrence(arr,arr_size): \r\n for i in range(0,arr_size): \r\n count = 0\r\n for j in range(0,arr_size): \r\n if arr[i] == arr[j]: \r\n count+=1 \r\n if (count % 2 != 0): \r\n return arr[i] \r\n return -1", "source": "mbpp", "task_id": "29", "test_cases": "assert get_Odd_Occurrence([1,2,3,1,2,3,1],7) == 1\nassert get_Odd_Occurrence([1,2,3,2,3,1,3],7) == 3\nassert get_Odd_Occurrence([2,3,5,4,5,2,4,3,5,2,4,4,2],13) == 5", "difficulty": "code"} {"input": "Write a python function to count all the substrings starting and ending with same characters.", "answer": "def check_Equality(s): \r\n return (ord(s[0]) == ord(s[len(s) - 1])); \r\ndef count_Substring_With_Equal_Ends(s): \r\n result = 0; \r\n n = len(s); \r\n for i in range(n): \r\n for j in range(1,n-i+1): \r\n if (check_Equality(s[i:i+j])): \r\n result+=1; \r\n return result;", "source": "mbpp", "task_id": "30", "test_cases": "assert count_Substring_With_Equal_Ends(\"abc\") == 3\nassert count_Substring_With_Equal_Ends(\"abcda\") == 6\nassert count_Substring_With_Equal_Ends(\"ab\") == 2", "difficulty": "code"} {"input": "Write a function to find the top k integers that occur most frequently from given lists of sorted and distinct integers using heap queue algorithm.", "answer": "def func(nums, k):\r\n import collections\r\n d = collections.defaultdict(int)\r\n for row in nums:\r\n for i in row:\r\n d[i] += 1\r\n temp = []\r\n import heapq\r\n for key, v in d.items():\r\n if len(temp) < k:\r\n temp.append((v, key))\r\n if len(temp) == k:\r\n heapq.heapify(temp)\r\n else:\r\n if v > temp[0][0]:\r\n heapq.heappop(temp)\r\n heapq.heappush(temp, (v, key))\r\n result = []\r\n while temp:\r\n v, key = heapq.heappop(temp)\r\n result.append(key)\r\n return result", "source": "mbpp", "task_id": "31", "test_cases": "assert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],3)==[5, 7, 1]\nassert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],1)==[1]\nassert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],5)==[6, 5, 7, 8, 1]", "difficulty": "code"} {"input": "Write a python function to find the largest prime factor of a given number.", "answer": "import math \r\ndef max_Prime_Factors (n): \r\n maxPrime = -1 \r\n while n%2 == 0: \r\n maxPrime = 2\r\n n >>= 1 \r\n for i in range(3,int(math.sqrt(n))+1,2): \r\n while n % i == 0: \r\n maxPrime = i \r\n n = n / i \r\n if n > 2: \r\n maxPrime = n \r\n return int(maxPrime)", "source": "mbpp", "task_id": "32", "test_cases": "assert max_Prime_Factors(15) == 5\nassert max_Prime_Factors(6) == 3\nassert max_Prime_Factors(2) == 2", "difficulty": "code"} {"input": "Write a python function to convert a decimal number to binary number.", "answer": "def decimal_To_Binary(N): \r\n B_Number = 0\r\n cnt = 0\r\n while (N != 0): \r\n rem = N % 2\r\n c = pow(10,cnt) \r\n B_Number += rem*c \r\n N //= 2 \r\n cnt += 1\r\n return B_Number", "source": "mbpp", "task_id": "33", "test_cases": "assert decimal_To_Binary(10) == 1010\nassert decimal_To_Binary(1) == 1\nassert decimal_To_Binary(20) == 10100", "difficulty": "code"} {"input": "Write a python function to find the missing number in a sorted array.", "answer": "def find_missing(ar,N): \r\n l = 0\r\n r = N - 1\r\n while (l <= r): \r\n mid = (l + r) / 2\r\n mid= int (mid) \r\n if (ar[mid] != mid + 1 and ar[mid - 1] == mid): \r\n return (mid + 1) \r\n elif (ar[mid] != mid + 1): \r\n r = mid - 1 \r\n else: \r\n l = mid + 1\r\n return (-1)", "source": "mbpp", "task_id": "34", "test_cases": "assert find_missing([1,2,3,5],4) == 4\nassert find_missing([1,3,4,5],4) == 2\nassert find_missing([1,2,3,5,6,7],5) == 4", "difficulty": "code"} {"input": "Write a function to find the n-th rectangular number.", "answer": "def find_rect_num(n):\r\n return n*(n + 1)", "source": "mbpp", "task_id": "35", "test_cases": "assert find_rect_num(4) == 20\nassert find_rect_num(5) == 30\nassert find_rect_num(6) == 42", "difficulty": "code"} {"input": "Write a python function to find the nth digit in the proper fraction of two given numbers.", "answer": "def find_Nth_Digit(p,q,N) : \r\n while (N > 0) : \r\n N -= 1; \r\n p *= 10; \r\n res = p // q; \r\n p %= q; \r\n return res;", "source": "mbpp", "task_id": "36", "test_cases": "assert find_Nth_Digit(1,2,1) == 5\nassert find_Nth_Digit(3,5,1) == 6\nassert find_Nth_Digit(5,6,5) == 3", "difficulty": "code"} {"input": "Write a function to sort a given mixed list of integers and strings.", "answer": "def sort_mixed_list(mixed_list):\r\n int_part = sorted([i for i in mixed_list if type(i) is int])\r\n str_part = sorted([i for i in mixed_list if type(i) is str])\r\n return int_part + str_part", "source": "mbpp", "task_id": "37", "test_cases": "assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white']\nassert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white']\nassert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white']", "difficulty": "code"} {"input": "Write a function to find the division of first even and odd number of a given list.", "answer": "def div_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)", "source": "mbpp", "task_id": "38", "test_cases": "assert div_even_odd([1,3,5,7,4,1,6,8])==4\nassert div_even_odd([1,2,3,4,5,6,7,8,9,10])==2\nassert div_even_odd([1,5,7,9,10])==10", "difficulty": "code"} {"input": "Write a function to check if the letters of a given string can be rearranged so that two characters that are adjacent to each other are different.", "answer": "import heapq\r\nfrom collections import Counter\r\ndef rearange_string(S):\r\n ctr = Counter(S)\r\n heap = [(-value, key) for key, value in ctr.items()]\r\n heapq.heapify(heap)\r\n if (-heap[0][0]) * 2 > len(S) + 1: \r\n return \"\"\r\n ans = []\r\n while len(heap) >= 2:\r\n nct1, char1 = heapq.heappop(heap)\r\n nct2, char2 = heapq.heappop(heap)\r\n ans.extend([char1, char2])\r\n if nct1 + 1: heapq.heappush(heap, (nct1 + 1, char1))\r\n if nct2 + 1: heapq.heappush(heap, (nct2 + 1, char2))\r\n return \"\".join(ans) + (heap[0][1] if heap else \"\")", "source": "mbpp", "task_id": "39", "test_cases": "assert rearange_string(\"aab\")==('aba')\nassert rearange_string(\"aabb\")==('abab')\nassert rearange_string(\"abccdd\")==('cdabcd')", "difficulty": "code"} {"input": "Write a function to find frequency of the elements in a given list of lists using collections module.", "answer": "from collections import Counter\r\nfrom itertools import chain\r\ndef freq_element(nums):\r\n result = Counter(chain.from_iterable(nums))\r\n return result", "source": "mbpp", "task_id": "40", "test_cases": "assert freq_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]])==({2: 3, 1: 2, 5: 2, 3: 1, 4: 1, 6: 1, 7: 1, 9: 1})\nassert freq_element([[1,2,3,4],[5,6,7,8],[9,10,11,12]])==({1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1, 7: 1, 8: 1, 9: 1, 10: 1, 11: 1, 12: 1})\nassert freq_element([[15,20,30,40],[80,90,100,110],[30,30,80,90]])==({30: 3, 80: 2, 90: 2, 15: 1, 20: 1, 40: 1, 100: 1, 110: 1})", "difficulty": "code"} {"input": "Write a function to filter even numbers using lambda function.", "answer": "def filter_evennumbers(nums):\r\n even_nums = list(filter(lambda x: x%2 == 0, nums))\r\n return even_nums", "source": "mbpp", "task_id": "41", "test_cases": "assert filter_evennumbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[2, 4, 6, 8, 10]\nassert filter_evennumbers([10,20,45,67,84,93])==[10,20,84]\nassert filter_evennumbers([5,7,9,8,6,4,3])==[8,6,4]", "difficulty": "code"} {"input": "Write a python function to find the sum of repeated elements in a given array.", "answer": "def find_Sum(arr,n): \r\n return sum([x for x in arr if arr.count(x) > 1])", "source": "mbpp", "task_id": "42", "test_cases": "assert find_Sum([1,2,3,1,1,4,5,6],8) == 3\nassert find_Sum([1,2,3,1,1],5) == 3\nassert find_Sum([1,1,2],3) == 2", "difficulty": "code"} {"input": "Write a function to find sequences of lowercase letters joined with an underscore using regex.", "answer": "import re\r\ndef text_match(text):\r\n patterns = '^[a-z]+_[a-z]+$'\r\n if re.search(patterns, text):\r\n return ('Found a match!')\r\n else:\r\n return ('Not matched!')", "source": "mbpp", "task_id": "43", "test_cases": "assert text_match(\"aab_cbbbc\") == 'Found a match!'\nassert text_match(\"aab_Abbbc\") == 'Not matched!'\nassert text_match(\"Aaab_abbbc\") == 'Not matched!'", "difficulty": "code"} {"input": "Write a function that matches a word at the beginning of a string.", "answer": "import re\r\ndef text_match_string(text):\r\n patterns = '^\\w+'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return 'Not matched!'", "source": "mbpp", "task_id": "44", "test_cases": "assert text_match_string(\" python\")==('Not matched!')\nassert text_match_string(\"python\")==('Found a match!')\nassert text_match_string(\" lang\")==('Not matched!')", "difficulty": "code"} {"input": "Write a function to find the gcd of the given array elements.", "answer": "def find_gcd(x, y): \r\n\twhile(y): \r\n\t\tx, y = y, x % y \r\n\treturn x \r\ndef get_gcd(l):\r\n num1 = l[0]\r\n num2 = l[1]\r\n gcd = find_gcd(num1, num2)\r\n for i in range(2, len(l)):\r\n gcd = find_gcd(gcd, l[i])\r\n return gcd", "source": "mbpp", "task_id": "45", "test_cases": "assert get_gcd([2, 4, 6, 8, 16]) == 2\nassert get_gcd([1, 2, 3]) == 1\nassert get_gcd([2, 4, 6, 8]) == 2 ", "difficulty": "code"} {"input": "Write a python function to determine whether all the numbers are different from each other are not.", "answer": "def test_distinct(data):\r\n if len(data) == len(set(data)):\r\n return True\r\n else:\r\n return False;", "source": "mbpp", "task_id": "46", "test_cases": "assert test_distinct([1,5,7,9]) == True\nassert test_distinct([2,4,5,5,7,9]) == False\nassert test_distinct([1,2,3]) == True", "difficulty": "code"} {"input": "Write a python function to find the last digit when factorial of a divides factorial of b.", "answer": "def compute_Last_Digit(A,B): \r\n variable = 1\r\n if (A == B): \r\n return 1\r\n elif ((B - A) >= 5): \r\n return 0\r\n else: \r\n for i in range(A + 1,B + 1): \r\n variable = (variable * (i % 10)) % 10\r\n return variable % 10", "source": "mbpp", "task_id": "47", "test_cases": "assert compute_Last_Digit(2,4) == 2\nassert compute_Last_Digit(6,8) == 6\nassert compute_Last_Digit(1,2) == 2", "difficulty": "code"} {"input": "Write a python function to set all odd bits of a given number.", "answer": "def odd_bit_set_number(n):\r\n count = 0;res = 0;temp = n\r\n while temp > 0:\r\n if count % 2 == 0:\r\n res |= (1 << count)\r\n count += 1\r\n temp >>= 1\r\n return (n | res)", "source": "mbpp", "task_id": "48", "test_cases": "assert odd_bit_set_number(10) == 15\nassert odd_bit_set_number(20) == 21\nassert odd_bit_set_number(30) == 31", "difficulty": "code"} {"input": "Write a function to extract every first or specified element from a given two-dimensional list.", "answer": "def specified_element(nums, N):\r\n result = [i[N] for i in nums]\r\n return result", "source": "mbpp", "task_id": "49", "test_cases": "assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],0)==[1, 4, 7]\nassert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],2)==[3, 6, 9]\nassert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],1)==[2,5,1]", "difficulty": "code"} {"input": "Write a function to find the list with minimum length using lambda function.", "answer": "def min_length_list(input_list):\r\n min_length = min(len(x) for x in input_list ) \r\n min_list = min(input_list, key = lambda i: len(i))\r\n return(min_length, min_list)", "source": "mbpp", "task_id": "50", "test_cases": "assert min_length_list([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(1, [0])\nassert min_length_list([[1,2,3,4,5],[1,2,3,4],[1,2,3],[1,2],[1]])==(1,[1])\nassert min_length_list([[3,4,5],[6,7,8,9],[10,11,12],[1,2]])==(2,[1,2])", "difficulty": "code"} {"input": "Write a function to print check if the triangle is equilateral or not.", "answer": "def check_equilateral(x,y,z):\r\n if x == y == z:\r\n\t return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "51", "test_cases": "assert check_equilateral(6,8,12)==False \nassert check_equilateral(6,6,12)==False\nassert check_equilateral(6,6,6)==True", "difficulty": "code"} {"input": "Write a function to caluclate area of a parallelogram.", "answer": "def parallelogram_area(b,h):\r\n area=b*h\r\n return area", "source": "mbpp", "task_id": "52", "test_cases": "assert parallelogram_area(10,20)==200\nassert parallelogram_area(15,20)==300\nassert parallelogram_area(8,9)==72", "difficulty": "code"} {"input": "Write a python function to check whether the first and last characters of a given string are equal or not.", "answer": "def check_Equality(str):\r\n if (str[0] == str[-1]): \r\n return (\"Equal\") \r\n else: \r\n return (\"Not Equal\")", "source": "mbpp", "task_id": "53", "test_cases": "assert check_Equality(\"abcda\") == \"Equal\"\nassert check_Equality(\"ab\") == \"Not Equal\"\nassert check_Equality(\"mad\") == \"Not Equal\"", "difficulty": "code"} {"input": "Write a function to sort the given array by using counting sort.", "answer": "def counting_sort(my_list):\r\n max_value = 0\r\n for i in range(len(my_list)):\r\n if my_list[i] > max_value:\r\n max_value = my_list[i]\r\n buckets = [0] * (max_value + 1)\r\n for i in my_list:\r\n buckets[i] += 1\r\n i = 0\r\n for j in range(max_value + 1):\r\n for a in range(buckets[j]):\r\n my_list[i] = j\r\n i += 1\r\n return my_list", "source": "mbpp", "task_id": "54", "test_cases": "assert counting_sort([1,23,4,5,6,7,8]) == [1, 4, 5, 6, 7, 8, 23]\nassert counting_sort([12, 9, 28, 33, 69, 45]) == [9, 12, 28, 33, 45, 69]\nassert counting_sort([8, 4, 14, 3, 2, 1]) == [1, 2, 3, 4, 8, 14]", "difficulty": "code"} {"input": "Write a function to find t-nth term of geometric series.", "answer": "import math\r\ndef tn_gp(a,n,r):\r\n tn = a * (math.pow(r, n - 1))\r\n return tn", "source": "mbpp", "task_id": "55", "test_cases": "assert tn_gp(1,5,2)==16\nassert tn_gp(1,5,4)==256\nassert tn_gp(2,6,3)==486", "difficulty": "code"} {"input": "Write a python function to check if a given number is one less than twice its reverse.", "answer": "def rev(num): \r\n rev_num = 0\r\n while (num > 0): \r\n rev_num = (rev_num * 10 + num % 10) \r\n num = num // 10 \r\n return rev_num \r\ndef check(n): \r\n return (2 * rev(n) == n + 1)", "source": "mbpp", "task_id": "56", "test_cases": "assert check(70) == False\nassert check(23) == False\nassert check(73) == True", "difficulty": "code"} {"input": "Write a python function to find the largest number that can be formed with the given digits.", "answer": "def find_Max_Num(arr,n) : \r\n arr.sort(reverse = True) \r\n num = arr[0] \r\n for i in range(1,n) : \r\n num = num * 10 + arr[i] \r\n return num", "source": "mbpp", "task_id": "57", "test_cases": "assert find_Max_Num([1,2,3],3) == 321\nassert find_Max_Num([4,5,6,1],4) == 6541\nassert find_Max_Num([1,2,3,9],4) == 9321", "difficulty": "code"} {"input": "Write a python function to check whether the given two integers have opposite sign or not.", "answer": "def opposite_Signs(x,y): \r\n return ((x ^ y) < 0);", "source": "mbpp", "task_id": "58", "test_cases": "assert opposite_Signs(1,-2) == True\nassert opposite_Signs(3,2) == False\nassert opposite_Signs(-10,-10) == False", "difficulty": "code"} {"input": "Write a function to find the nth octagonal number.", "answer": "def is_octagonal(n): \r\n\treturn 3 * n * n - 2 * n", "source": "mbpp", "task_id": "59", "test_cases": "assert is_octagonal(5) == 65\nassert is_octagonal(10) == 280\nassert is_octagonal(15) == 645", "difficulty": "code"} {"input": "Write a function to find the maximum length of the subsequence with difference between adjacent elements for the given array.", "answer": "def max_len_sub( arr, n): \r\n\tmls=[] \r\n\tmax = 0\r\n\tfor i in range(n): \r\n\t\tmls.append(1) \r\n\tfor i in range(n): \r\n\t\tfor j in range(i): \r\n\t\t\tif (abs(arr[i] - arr[j]) <= 1 and mls[i] < mls[j] + 1): \r\n\t\t\t\tmls[i] = mls[j] + 1\r\n\tfor i in range(n): \r\n\t\tif (max < mls[i]): \r\n\t\t\tmax = mls[i] \r\n\treturn max", "source": "mbpp", "task_id": "60", "test_cases": "assert max_len_sub([2, 5, 6, 3, 7, 6, 5, 8], 8) == 5\nassert max_len_sub([-2, -1, 5, -1, 4, 0, 3], 7) == 4\nassert max_len_sub([9, 11, 13, 15, 18], 5) == 1", "difficulty": "code"} {"input": "Write a python function to count number of substrings with the sum of digits equal to their length.", "answer": "from collections import defaultdict\r\ndef count_Substrings(s,n):\r\n count,sum = 0,0\r\n mp = defaultdict(lambda : 0)\r\n mp[0] += 1\r\n for i in range(n):\r\n sum += ord(s[i]) - ord('0')\r\n count += mp[sum - (i + 1)]\r\n mp[sum - (i + 1)] += 1\r\n return count", "source": "mbpp", "task_id": "61", "test_cases": "assert count_Substrings('112112',6) == 6\nassert count_Substrings('111',3) == 6\nassert count_Substrings('1101112',7) == 12", "difficulty": "code"} {"input": "Write a python function to find smallest number in a list.", "answer": "def smallest_num(xs):\n return min(xs)", "source": "mbpp", "task_id": "62", "test_cases": "assert smallest_num([10, 20, 1, 45, 99]) == 1\nassert smallest_num([1, 2, 3]) == 1\nassert smallest_num([45, 46, 50, 60]) == 45", "difficulty": "code"} {"input": "Write a function to find the maximum difference between available pairs in the given tuple list.", "answer": "def max_difference(test_list):\r\n temp = [abs(b - a) for a, b in test_list]\r\n res = max(temp)\r\n return (res)", "source": "mbpp", "task_id": "63", "test_cases": "assert max_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 7\nassert max_difference([(4, 6), (2, 17), (9, 13), (11, 12)]) == 15\nassert max_difference([(12, 35), (21, 27), (13, 23), (41, 22)]) == 23", "difficulty": "code"} {"input": "Write a function to sort a list of tuples using lambda.", "answer": "def subject_marks(subjectmarks):\r\n#subject_marks = [('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])\r\n subjectmarks.sort(key = lambda x: x[1])\r\n return subjectmarks", "source": "mbpp", "task_id": "64", "test_cases": "assert subject_marks([('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])==[('Social sciences', 82), ('English', 88), ('Science', 90), ('Maths', 97)]\nassert subject_marks([('Telugu',49),('Hindhi',54),('Social',33)])==([('Social',33),('Telugu',49),('Hindhi',54)])\nassert subject_marks([('Physics',96),('Chemistry',97),('Biology',45)])==([('Biology',45),('Physics',96),('Chemistry',97)])", "difficulty": "code"} {"input": "Write a function of recursion list sum.", "answer": "def recursive_list_sum(data_list):\r\n\ttotal = 0\r\n\tfor element in data_list:\r\n\t\tif type(element) == type([]):\r\n\t\t\ttotal = total + recursive_list_sum(element)\r\n\t\telse:\r\n\t\t\ttotal = total + element\r\n\treturn total", "source": "mbpp", "task_id": "65", "test_cases": "assert recursive_list_sum(([1, 2, [3,4],[5,6]]))==21\nassert recursive_list_sum(([7, 10, [15,14],[19,41]]))==106\nassert recursive_list_sum(([10, 20, [30,40],[50,60]]))==210", "difficulty": "code"} {"input": "Write a python function to count positive numbers in a list.", "answer": "def pos_count(list):\r\n pos_count= 0\r\n for num in list: \r\n if num >= 0: \r\n pos_count += 1\r\n return pos_count", "source": "mbpp", "task_id": "66", "test_cases": "assert pos_count([1,-2,3,-4]) == 2\nassert pos_count([3,4,5,-1]) == 3\nassert pos_count([1,2,3,4]) == 4", "difficulty": "code"} {"input": "Write a function to find the number of ways to partition a set of bell numbers.", "answer": "def bell_number(n): \r\n bell = [[0 for i in range(n+1)] for j in range(n+1)] \r\n bell[0][0] = 1\r\n for i in range(1, n+1): \r\n bell[i][0] = bell[i-1][i-1] \r\n for j in range(1, i+1): \r\n bell[i][j] = bell[i-1][j-1] + bell[i][j-1] \r\n return bell[n][0]", "source": "mbpp", "task_id": "67", "test_cases": "assert bell_number(2)==2\nassert bell_number(10)==115975\nassert bell_number(56)==6775685320645824322581483068371419745979053216268760300", "difficulty": "code"} {"input": "Write a python function to check whether the given array is monotonic or not.", "answer": "def is_Monotonic(A): \r\n return (all(A[i] <= A[i + 1] for i in range(len(A) - 1)) or\r\n all(A[i] >= A[i + 1] for i in range(len(A) - 1)))", "source": "mbpp", "task_id": "68", "test_cases": "assert is_Monotonic([6, 5, 4, 4]) == True\nassert is_Monotonic([1, 2, 2, 3]) == True\nassert is_Monotonic([1, 3, 2]) == False", "difficulty": "code"} {"input": "Write a function to check whether a list contains the given sublist or not.", "answer": "def is_sublist(l, s):\r\n\tsub_set = False\r\n\tif s == []:\r\n\t\tsub_set = True\r\n\telif s == l:\r\n\t\tsub_set = True\r\n\telif len(s) > len(l):\r\n\t\tsub_set = False\r\n\telse:\r\n\t\tfor i in range(len(l)):\r\n\t\t\tif l[i] == s[0]:\r\n\t\t\t\tn = 1\r\n\t\t\t\twhile (n < len(s)) and (l[i+n] == s[n]):\r\n\t\t\t\t\tn += 1\t\t\t\t\r\n\t\t\t\tif n == len(s):\r\n\t\t\t\t\tsub_set = True\r\n\treturn sub_set", "source": "mbpp", "task_id": "69", "test_cases": "assert is_sublist([2,4,3,5,7],[3,7])==False\nassert is_sublist([2,4,3,5,7],[4,3])==True\nassert is_sublist([2,4,3,5,7],[1,6])==False", "difficulty": "code"} {"input": "Write a function to find whether all the given tuples have equal length or not.", "answer": "def find_equal_tuple(Input, k):\r\n flag = 1\r\n for tuple in Input:\r\n if len(tuple) != k:\r\n flag = 0\r\n break\r\n return flag\r\ndef get_equal(Input, k):\r\n if find_equal_tuple(Input, k) == 1:\r\n return (\"All tuples have same length\")\r\n else:\r\n return (\"All tuples do not have same length\")", "source": "mbpp", "task_id": "70", "test_cases": "assert get_equal([(11, 22, 33), (44, 55, 66)], 3) == 'All tuples have same length'\nassert get_equal([(1, 2, 3), (4, 5, 6, 7)], 3) == 'All tuples do not have same length'\nassert get_equal([(1, 2), (3, 4)], 2) == 'All tuples have same length'", "difficulty": "code"} {"input": "Write a function to sort a list of elements using comb sort.", "answer": "def comb_sort(nums):\r\n shrink_fact = 1.3\r\n gaps = len(nums)\r\n swapped = True\r\n i = 0\r\n while gaps > 1 or swapped:\r\n gaps = int(float(gaps) / shrink_fact)\r\n swapped = False\r\n i = 0\r\n while gaps + i < len(nums):\r\n if nums[i] > nums[i+gaps]:\r\n nums[i], nums[i+gaps] = nums[i+gaps], nums[i]\r\n swapped = True\r\n i += 1\r\n return nums", "source": "mbpp", "task_id": "71", "test_cases": "assert comb_sort([5, 15, 37, 25, 79]) == [5, 15, 25, 37, 79]\nassert comb_sort([41, 32, 15, 19, 22]) == [15, 19, 22, 32, 41]\nassert comb_sort([99, 15, 13, 47]) == [13, 15, 47, 99]", "difficulty": "code"} {"input": "Write a python function to check whether the given number can be represented as difference of two squares or not.", "answer": "def dif_Square(n): \r\n if (n % 4 != 2): \r\n return True\r\n return False", "source": "mbpp", "task_id": "72", "test_cases": "assert dif_Square(5) == True\nassert dif_Square(10) == False\nassert dif_Square(15) == True", "difficulty": "code"} {"input": "Write a function to split the given string with multiple delimiters by using regex.", "answer": "import re\r\ndef multiple_split(text):\r\n return (re.split('; |, |\\*|\\n',text))", "source": "mbpp", "task_id": "73", "test_cases": "assert multiple_split('Forces of the \\ndarkness*are coming into the play.') == ['Forces of the ', 'darkness', 'are coming into the play.']\nassert multiple_split('Mi Box runs on the \\n Latest android*which has google assistance and chromecast.') == ['Mi Box runs on the ', ' Latest android', 'which has google assistance and chromecast.']\nassert multiple_split('Certain services\\nare subjected to change*over the seperate subscriptions.') == ['Certain services', 'are subjected to change', 'over the seperate subscriptions.']", "difficulty": "code"} {"input": "Write a function to check whether it follows the sequence given in the patterns array.", "answer": "def is_samepatterns(colors, patterns): \r\n if len(colors) != len(patterns):\r\n return False \r\n sdict = {}\r\n pset = set()\r\n sset = set() \r\n for i in range(len(patterns)):\r\n pset.add(patterns[i])\r\n sset.add(colors[i])\r\n if patterns[i] not in sdict.keys():\r\n sdict[patterns[i]] = []\r\n\r\n keys = sdict[patterns[i]]\r\n keys.append(colors[i])\r\n sdict[patterns[i]] = keys\r\n\r\n if len(pset) != len(sset):\r\n return False \r\n\r\n for values in sdict.values():\r\n\r\n for i in range(len(values) - 1):\r\n if values[i] != values[i+1]:\r\n return False\r\n\r\n return True", "source": "mbpp", "task_id": "74", "test_cases": "assert is_samepatterns([\"red\",\"green\",\"green\"], [\"a\", \"b\", \"b\"])==True \nassert is_samepatterns([\"red\",\"green\",\"greenn\"], [\"a\",\"b\",\"b\"])==False \nassert is_samepatterns([\"red\",\"green\",\"greenn\"], [\"a\",\"b\"])==False ", "difficulty": "code"} {"input": "Write a function to find tuples which have all elements divisible by k from the given list of tuples.", "answer": "def find_tuples(test_list, K):\r\n res = [sub for sub in test_list if all(ele % K == 0 for ele in sub)]\r\n return (str(res))", "source": "mbpp", "task_id": "75", "test_cases": "assert find_tuples([(6, 24, 12), (7, 9, 6), (12, 18, 21)], 6) == '[(6, 24, 12)]'\nassert find_tuples([(5, 25, 30), (4, 2, 3), (7, 8, 9)], 5) == '[(5, 25, 30)]'\nassert find_tuples([(7, 9, 16), (8, 16, 4), (19, 17, 18)], 4) == '[(8, 16, 4)]'", "difficulty": "code"} {"input": "Write a python function to count the number of squares in a rectangle.", "answer": "def count_Squares(m,n):\r\n if(n < m):\r\n temp = m\r\n m = n\r\n n = temp\r\n return ((m * (m + 1) * (2 * m + 1) / 6 + (n - m) * m * (m + 1) / 2))", "source": "mbpp", "task_id": "76", "test_cases": "assert count_Squares(4,3) == 20\nassert count_Squares(2,2) == 5\nassert count_Squares(1,1) == 1", "difficulty": "code"} {"input": "Write a python function to find the difference between sum of even and odd digits.", "answer": "def is_Diff(n): \r\n return (n % 11 == 0)", "source": "mbpp", "task_id": "77", "test_cases": "assert is_Diff (12345) == False\nassert is_Diff(1212112) == True\nassert is_Diff(1212) == False", "difficulty": "code"} {"input": "Write a python function to find number of integers with odd number of set bits.", "answer": "def count_With_Odd_SetBits(n): \r\n if (n % 2 != 0): \r\n return (n + 1) / 2\r\n count = bin(n).count('1') \r\n ans = n / 2\r\n if (count % 2 != 0): \r\n ans += 1\r\n return ans", "source": "mbpp", "task_id": "78", "test_cases": "assert count_With_Odd_SetBits(5) == 3\nassert count_With_Odd_SetBits(10) == 5\nassert count_With_Odd_SetBits(15) == 8", "difficulty": "code"} {"input": "Write a python function to check whether the length of the word is odd or not.", "answer": "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", "source": "mbpp", "task_id": "79", "test_cases": "assert word_len(\"Hadoop\") == False\nassert word_len(\"great\") == True\nassert word_len(\"structure\") == True", "difficulty": "code"} {"input": "Write a function to find the nth tetrahedral number.", "answer": "def tetrahedral_number(n): \r\n\treturn (n * (n + 1) * (n + 2)) / 6", "source": "mbpp", "task_id": "80", "test_cases": "assert tetrahedral_number(5) == 35.0\nassert tetrahedral_number(6) == 56.0\nassert tetrahedral_number(7) == 84.0", "difficulty": "code"} {"input": "Write a function to zip the two given tuples.", "answer": "def zip_tuples(test_tup1, test_tup2):\r\n res = []\r\n for i, j in enumerate(test_tup1):\r\n res.append((j, test_tup2[i % len(test_tup2)])) \r\n return (res)", "source": "mbpp", "task_id": "81", "test_cases": "assert zip_tuples((7, 8, 4, 5, 9, 10),(1, 5, 6) ) == [(7, 1), (8, 5), (4, 6), (5, 1), (9, 5), (10, 6)]\nassert zip_tuples((8, 9, 5, 6, 10, 11),(2, 6, 7) ) == [(8, 2), (9, 6), (5, 7), (6, 2), (10, 6), (11, 7)]\nassert zip_tuples((9, 10, 6, 7, 11, 12),(3, 7, 8) ) == [(9, 3), (10, 7), (6, 8), (7, 3), (11, 7), (12, 8)]", "difficulty": "code"} {"input": "Write a function to find the volume of a sphere.", "answer": "import math\r\ndef volume_sphere(r):\r\n volume=(4/3)*math.pi*r*r*r\r\n return volume", "source": "mbpp", "task_id": "82", "test_cases": "assert volume_sphere(10)==4188.790204786391\nassert volume_sphere(25)==65449.84694978735\nassert volume_sphere(20)==33510.32163829113", "difficulty": "code"} {"input": "Write a python function to find the character made by adding all the characters of the given string.", "answer": "def get_Char(strr): \r\n summ = 0\r\n for i in range(len(strr)): \r\n summ += (ord(strr[i]) - ord('a') + 1) \r\n if (summ % 26 == 0): \r\n return ord('z') \r\n else: \r\n summ = summ % 26\r\n return chr(ord('a') + summ - 1)", "source": "mbpp", "task_id": "83", "test_cases": "assert get_Char(\"abc\") == \"f\"\nassert get_Char(\"gfg\") == \"t\"\nassert get_Char(\"ab\") == \"c\"", "difficulty": "code"} {"input": "Write a function to find the n-th number in newman conway sequence.", "answer": "def sequence(n): \r\n\tif n == 1 or n == 2: \r\n\t\treturn 1\r\n\telse: \r\n\t\treturn sequence(sequence(n-1)) + sequence(n-sequence(n-1))", "source": "mbpp", "task_id": "84", "test_cases": "assert sequence(10) == 6\nassert sequence(2) == 1\nassert sequence(3) == 2", "difficulty": "code"} {"input": "Write a function to find the surface area of a sphere.", "answer": "import math\r\ndef surfacearea_sphere(r):\r\n surfacearea=4*math.pi*r*r\r\n return surfacearea", "source": "mbpp", "task_id": "85", "test_cases": "assert surfacearea_sphere(10)==1256.6370614359173\nassert surfacearea_sphere(15)==2827.4333882308138\nassert surfacearea_sphere(20)==5026.548245743669", "difficulty": "code"} {"input": "Write a function to find nth centered hexagonal number.", "answer": "def centered_hexagonal_number(n):\r\n return 3 * n * (n - 1) + 1", "source": "mbpp", "task_id": "86", "test_cases": "assert centered_hexagonal_number(10) == 271\nassert centered_hexagonal_number(2) == 7\nassert centered_hexagonal_number(9) == 217", "difficulty": "code"} {"input": "Write a function to merge three dictionaries into a single expression.", "answer": "import collections as ct\r\ndef merge_dictionaries_three(dict1,dict2, dict3):\r\n merged_dict = dict(ct.ChainMap({},dict1,dict2,dict3))\r\n return merged_dict", "source": "mbpp", "task_id": "87", "test_cases": "assert merge_dictionaries_three({ \"R\": \"Red\", \"B\": \"Black\", \"P\": \"Pink\" }, { \"G\": \"Green\", \"W\": \"White\" },{ \"O\": \"Orange\", \"W\": \"White\", \"B\": \"Black\" })=={'B': 'Black', 'R': 'Red', 'P': 'Pink', 'G': 'Green', 'W': 'White', 'O': 'Orange'}\nassert merge_dictionaries_three({ \"R\": \"Red\", \"B\": \"Black\", \"P\": \"Pink\" }, { \"G\": \"Green\", \"W\": \"White\" },{\"L\":\"lavender\",\"B\":\"Blue\"})=={'W': 'White', 'P': 'Pink', 'B': 'Black', 'R': 'Red', 'G': 'Green', 'L': 'lavender'}\nassert merge_dictionaries_three({ \"R\": \"Red\", \"B\": \"Black\", \"P\": \"Pink\" },{\"L\":\"lavender\",\"B\":\"Blue\"},{ \"G\": \"Green\", \"W\": \"White\" })=={'B': 'Black', 'P': 'Pink', 'R': 'Red', 'G': 'Green', 'L': 'lavender', 'W': 'White'}", "difficulty": "code"} {"input": "Write a function to get the frequency of the elements in a list.", "answer": "import collections\r\ndef freq_count(list1):\r\n freq_count= collections.Counter(list1)\r\n return freq_count", "source": "mbpp", "task_id": "88", "test_cases": "assert freq_count([10,10,10,10,20,20,20,20,40,40,50,50,30])==({10: 4, 20: 4, 40: 2, 50: 2, 30: 1}) \nassert freq_count([1,2,3,4,3,2,4,1,3,1,4])==({1:3, 2:2,3:3,4:3}) \nassert freq_count([5,6,7,4,9,10,4,5,6,7,9,5])==({10:1,5:3,6:2,7:2,4:2,9:2}) ", "difficulty": "code"} {"input": "Write a function to find the closest smaller number than n.", "answer": "def closest_num(N):\r\n return (N - 1)", "source": "mbpp", "task_id": "89", "test_cases": "assert closest_num(11) == 10\nassert closest_num(7) == 6\nassert closest_num(12) == 11", "difficulty": "code"} {"input": "Write a python function to find the length of the longest word.", "answer": "def len_log(list1):\r\n max=len(list1[0])\r\n for i in list1:\r\n if len(i)>max:\r\n max=len(i)\r\n return max", "source": "mbpp", "task_id": "90", "test_cases": "assert len_log([\"python\",\"PHP\",\"bigdata\"]) == 7\nassert len_log([\"a\",\"ab\",\"abc\"]) == 3\nassert len_log([\"small\",\"big\",\"tall\"]) == 5", "difficulty": "code"} {"input": "Write a function to check if a substring is present in a given list of string values.", "answer": "def find_substring(str1, sub_str):\r\n if any(sub_str in s for s in str1):\r\n return True\r\n return False", "source": "mbpp", "task_id": "91", "test_cases": "assert find_substring([\"red\", \"black\", \"white\", \"green\", \"orange\"],\"ack\")==True\nassert find_substring([\"red\", \"black\", \"white\", \"green\", \"orange\"],\"abc\")==False\nassert find_substring([\"red\", \"black\", \"white\", \"green\", \"orange\"],\"ange\")==True", "difficulty": "code"} {"input": "Write a function to check whether the given number is undulating or not.", "answer": "def is_undulating(n): \r\n\tif (len(n) <= 2): \r\n\t\treturn False\r\n\tfor i in range(2, len(n)): \r\n\t\tif (n[i - 2] != n[i]): \r\n\t\t\treturn False\r\n\treturn True", "source": "mbpp", "task_id": "92", "test_cases": "assert is_undulating(\"1212121\") == True\nassert is_undulating(\"1991\") == False\nassert is_undulating(\"121\") == True", "difficulty": "code"} {"input": "Write a function to calculate the value of 'a' to the power 'b'.", "answer": "def power(a,b):\r\n\tif b==0:\r\n\t\treturn 1\r\n\telif a==0:\r\n\t\treturn 0\r\n\telif b==1:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn a*power(a,b-1)", "source": "mbpp", "task_id": "93", "test_cases": "assert power(3,4) == 81\nassert power(2,3) == 8\nassert power(5,5) == 3125", "difficulty": "code"} {"input": "Write a function to extract the index minimum value record from the given tuples.", "answer": "from operator import itemgetter \r\ndef index_minimum(test_list):\r\n res = min(test_list, key = itemgetter(1))[0]\r\n return (res)", "source": "mbpp", "task_id": "94", "test_cases": "assert index_minimum([('Rash', 143), ('Manjeet', 200), ('Varsha', 100)]) == 'Varsha'\nassert index_minimum([('Yash', 185), ('Dawood', 125), ('Sanya', 175)]) == 'Dawood'\nassert index_minimum([('Sai', 345), ('Salman', 145), ('Ayesha', 96)]) == 'Ayesha'", "difficulty": "code"} {"input": "Write a python function to find the minimum length of sublist.", "answer": "def Find_Min_Length(lst): \r\n minLength = min(len(x) for x in lst )\r\n return minLength", "source": "mbpp", "task_id": "95", "test_cases": "assert Find_Min_Length([[1],[1,2]]) == 1\nassert Find_Min_Length([[1,2],[1,2,3],[1,2,3,4]]) == 2\nassert Find_Min_Length([[3,3,3],[4,4,4,4]]) == 3", "difficulty": "code"} {"input": "Write a python function to find the number of divisors of a given integer.", "answer": "def divisor(n):\r\n for i in range(n):\r\n x = len([i for i in range(1,n+1) if not n % i])\r\n return x", "source": "mbpp", "task_id": "96", "test_cases": "assert divisor(15) == 4 \nassert divisor(12) == 6\nassert divisor(9) == 3", "difficulty": "code"} {"input": "Write a function to find frequency count of list of lists.", "answer": "def frequency_lists(list1):\r\n list1 = [item for sublist in list1 for item in sublist]\r\n dic_data = {}\r\n for num in list1:\r\n if num in dic_data.keys():\r\n dic_data[num] += 1\r\n else:\r\n key = num\r\n value = 1\r\n dic_data[key] = value\r\n return dic_data", "source": "mbpp", "task_id": "97", "test_cases": "assert frequency_lists([[1, 2, 3, 2], [4, 5, 6, 2], [7, 8, 9, 5]])=={1: 1, 2: 3, 3: 1, 4: 1, 5: 2, 6: 1, 7: 1, 8: 1, 9: 1}\nassert frequency_lists([[1,2,3,4],[5,6,7,8],[9,10,11,12]])=={1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1, 7: 1, 8: 1, 9: 1,10:1,11:1,12:1}\nassert frequency_lists([[20,30,40,17],[18,16,14,13],[10,20,30,40]])=={20:2,30:2,40:2,17: 1,18:1, 16: 1,14: 1,13: 1, 10: 1}", "difficulty": "code"} {"input": "Write a function to multiply all the numbers in a list and divide with the length of the list.", "answer": "def multiply_num(numbers): \r\n total = 1\r\n for x in numbers:\r\n total *= x \r\n return total/len(numbers)", "source": "mbpp", "task_id": "98", "test_cases": "assert multiply_num((8, 2, 3, -1, 7))==-67.2\nassert multiply_num((-10,-20,-30))==-2000.0\nassert multiply_num((19,15,18))==1710.0", "difficulty": "code"} {"input": "Write a function to convert the given decimal number to its binary equivalent.", "answer": "def decimal_to_binary(n): \r\n return bin(n).replace(\"0b\",\"\")", "source": "mbpp", "task_id": "99", "test_cases": "assert decimal_to_binary(8) == '1000'\nassert decimal_to_binary(18) == '10010'\nassert decimal_to_binary(7) == '111' ", "difficulty": "code"} {"input": "Write a function to find the next smallest palindrome of a specified number.", "answer": "import sys\r\ndef next_smallest_palindrome(num):\r\n numstr = str(num)\r\n for i in range(num+1,sys.maxsize):\r\n if str(i) == str(i)[::-1]:\r\n return i", "source": "mbpp", "task_id": "100", "test_cases": "assert next_smallest_palindrome(99)==101\nassert next_smallest_palindrome(1221)==1331\nassert next_smallest_palindrome(120)==121", "difficulty": "code"} {"input": "Write a function to find the kth element in the given array.", "answer": "def kth_element(arr, n, k):\r\n for i in range(n):\r\n for j in range(0, n-i-1):\r\n if arr[j] > arr[j+1]:\r\n arr[j], arr[j+1] == arr[j+1], arr[j]\r\n return arr[k-1]", "source": "mbpp", "task_id": "101", "test_cases": "assert kth_element([12,3,5,7,19], 5, 2) == 3\nassert kth_element([17,24,8,23], 4, 3) == 8\nassert kth_element([16,21,25,36,4], 5, 4) == 36", "difficulty": "code"} {"input": "Write a function to convert snake case string to camel case string.", "answer": "def snake_to_camel(word):\r\n import re\r\n return ''.join(x.capitalize() or '_' for x in word.split('_'))", "source": "mbpp", "task_id": "102", "test_cases": "assert snake_to_camel('python_program')=='PythonProgram'\nassert snake_to_camel('python_language')==('PythonLanguage')\nassert snake_to_camel('programming_language')==('ProgrammingLanguage')", "difficulty": "code"} {"input": "Write a function to find eulerian number a(n, m).", "answer": "def eulerian_num(n, m): \r\n\tif (m >= n or n == 0): \r\n\t\treturn 0 \r\n\tif (m == 0): \r\n\t\treturn 1 \r\n\treturn ((n - m) * eulerian_num(n - 1, m - 1) +(m + 1) * eulerian_num(n - 1, m))", "source": "mbpp", "task_id": "103", "test_cases": "assert eulerian_num(3, 1) == 4\nassert eulerian_num(4, 1) == 11\nassert eulerian_num(5, 3) == 26", "difficulty": "code"} {"input": "Write a function to sort each sublist of strings in a given list of lists using lambda function.", "answer": "def sort_sublists(input_list):\r\n result = [sorted(x, key = lambda x:x[0]) for x in input_list] \r\n return result", "source": "mbpp", "task_id": "104", "test_cases": "assert sort_sublists(([\"green\", \"orange\"], [\"black\", \"white\"], [\"white\", \"black\", \"orange\"]))==[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']]\nassert sort_sublists(([\" red \",\"green\" ],[\"blue \",\" black\"],[\" orange\",\"brown\"]))==[[' red ', 'green'], [' black', 'blue '], [' orange', 'brown']]\nassert sort_sublists(([\"zilver\",\"gold\"], [\"magnesium\",\"aluminium\"], [\"steel\", \"bronze\"]))==[['gold', 'zilver'],['aluminium', 'magnesium'], ['bronze', 'steel']]", "difficulty": "code"} {"input": "Write a python function to count true booleans in the given list.", "answer": "def count(lst): \r\n return sum(lst)", "source": "mbpp", "task_id": "105", "test_cases": "assert count([True,False,True]) == 2\nassert count([False,False]) == 0\nassert count([True,True,True]) == 3", "difficulty": "code"} {"input": "Write a function to add the given list to the given tuples.", "answer": "def add_lists(test_list, test_tup):\r\n res = tuple(list(test_tup) + test_list)\r\n return (res)", "source": "mbpp", "task_id": "106", "test_cases": "assert add_lists([5, 6, 7], (9, 10)) == (9, 10, 5, 6, 7)\nassert add_lists([6, 7, 8], (10, 11)) == (10, 11, 6, 7, 8)\nassert add_lists([7, 8, 9], (11, 12)) == (11, 12, 7, 8, 9)", "difficulty": "code"} {"input": "Write a python function to count hexadecimal numbers for a given range.", "answer": "def count_Hexadecimal(L,R) : \r\n count = 0; \r\n for i in range(L,R + 1) : \r\n if (i >= 10 and i <= 15) : \r\n count += 1; \r\n elif (i > 15) : \r\n k = i; \r\n while (k != 0) : \r\n if (k % 16 >= 10) : \r\n count += 1; \r\n k = k // 16; \r\n return count;", "source": "mbpp", "task_id": "107", "test_cases": "assert count_Hexadecimal(10,15) == 6\nassert count_Hexadecimal(2,4) == 0\nassert count_Hexadecimal(15,16) == 1", "difficulty": "code"} {"input": "Write a function to merge multiple sorted inputs into a single sorted iterator using heap queue algorithm.", "answer": "import heapq\r\ndef merge_sorted_list(num1,num2,num3):\r\n num1=sorted(num1)\r\n num2=sorted(num2)\r\n num3=sorted(num3)\r\n result = heapq.merge(num1,num2,num3)\r\n return list(result)", "source": "mbpp", "task_id": "108", "test_cases": "assert merge_sorted_list([25, 24, 15, 4, 5, 29, 110],[19, 20, 11, 56, 25, 233, 154],[24, 26, 54, 48])==[4, 5, 11, 15, 19, 20, 24, 24, 25, 25, 26, 29, 48, 54, 56, 110, 154, 233]\nassert merge_sorted_list([1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12])==[1, 1, 2, 3, 4, 5, 5, 6, 7, 7, 8, 8, 9, 11, 12]\nassert merge_sorted_list([18, 14, 10, 9, 8, 7, 9, 3, 2, 4, 1],[25, 35, 22, 85, 14, 65, 75, 25, 58],[12, 74, 9, 50, 61, 41])==[1, 2, 3, 4, 7, 8, 9, 9, 9, 10, 12, 14, 14, 18, 22, 25, 25, 35, 41, 50, 58, 61, 65, 74, 75, 85]", "difficulty": "code"} {"input": "Write a python function to find the count of rotations of a binary string with odd value.", "answer": "def odd_Equivalent(s,n): \r\n count=0\r\n for i in range(0,n): \r\n if (s[i] == '1'): \r\n count = count + 1\r\n return count", "source": "mbpp", "task_id": "109", "test_cases": "assert odd_Equivalent(\"011001\",6) == 3\nassert odd_Equivalent(\"11011\",5) == 4\nassert odd_Equivalent(\"1010\",4) == 2", "difficulty": "code"} {"input": "Write a function to extract the ranges that are missing from the given list with the given start range and end range values.", "answer": "def extract_missing(test_list, strt_val, stop_val):\r\n res = []\r\n for sub in test_list:\r\n if sub[0] > strt_val:\r\n res.append((strt_val, sub[0]))\r\n strt_val = sub[1]\r\n if strt_val < stop_val:\r\n res.append((strt_val, stop_val))\r\n return (res)", "source": "mbpp", "task_id": "110", "test_cases": "assert extract_missing([(6, 9), (15, 34), (48, 70)], 2, 100) == [(2, 6), (9, 100), (9, 15), (34, 100), (34, 48), (70, 100)]\nassert extract_missing([(7, 2), (15, 19), (38, 50)], 5, 60) == [(5, 7), (2, 60), (2, 15), (19, 60), (19, 38), (50, 60)]\nassert extract_missing([(7, 2), (15, 19), (38, 50)], 1, 52) == [(1, 7), (2, 52), (2, 15), (19, 52), (19, 38), (50, 52)]", "difficulty": "code"} {"input": "Write a function to find common elements in given nested lists. * list item * list item * list item * list item", "answer": "def common_in_nested_lists(nestedlist):\r\n result = list(set.intersection(*map(set, nestedlist)))\r\n return result", "source": "mbpp", "task_id": "111", "test_cases": "assert common_in_nested_lists([[12, 18, 23, 25, 45], [7, 12, 18, 24, 28], [1, 5, 8, 12, 15, 16, 18]])==[18, 12]\nassert common_in_nested_lists([[12, 5, 23, 25, 45], [7, 11, 5, 23, 28], [1, 5, 8, 18, 23, 16]])==[5,23]\nassert common_in_nested_lists([[2, 3,4, 1], [4, 5], [6,4, 8],[4, 5], [6, 8,4]])==[4]", "difficulty": "code"} {"input": "Write a python function to find the perimeter of a cylinder.", "answer": "def perimeter(diameter,height) : \r\n return 2*(diameter+height)", "source": "mbpp", "task_id": "112", "test_cases": "assert perimeter(2,4) == 12\nassert perimeter(1,2) == 6\nassert perimeter(3,1) == 8", "difficulty": "code"} {"input": "Write a function to check if a string represents an integer or not.", "answer": "def check_integer(text):\r\n text = text.strip()\r\n if len(text) < 1:\r\n return None\r\n else:\r\n if all(text[i] in \"0123456789\" for i in range(len(text))):\r\n return True\r\n elif (text[0] in \"+-\") and \\\r\n all(text[i] in \"0123456789\" for i in range(1,len(text))):\r\n return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "113", "test_cases": "assert check_integer(\"python\")==False\nassert check_integer(\"1\")==True\nassert check_integer(\"12345\")==True", "difficulty": "code"} {"input": "Write a function to assign frequency to each tuple in the given tuple list.", "answer": "from collections import Counter \r\ndef assign_freq(test_list):\r\n res = [(*key, val) for key, val in Counter(test_list).items()]\r\n return (str(res))", "source": "mbpp", "task_id": "114", "test_cases": "assert assign_freq([(6, 5, 8), (2, 7), (6, 5, 8), (6, 5, 8), (9, ), (2, 7)] ) == '[(6, 5, 8, 3), (2, 7, 2), (9, 1)]'\nassert assign_freq([(4, 2, 4), (7, 1), (4, 8), (4, 2, 4), (9, 2), (7, 1)] ) == '[(4, 2, 4, 2), (7, 1, 2), (4, 8, 1), (9, 2, 1)]'\nassert assign_freq([(11, 13, 10), (17, 21), (4, 2, 3), (17, 21), (9, 2), (4, 2, 3)] ) == '[(11, 13, 10, 1), (17, 21, 2), (4, 2, 3, 2), (9, 2, 1)]'", "difficulty": "code"} {"input": "Write a function to check whether all dictionaries in a list are empty or not.", "answer": "def empty_dit(list1):\r\n empty_dit=all(not d for d in list1)\r\n return empty_dit", "source": "mbpp", "task_id": "115", "test_cases": "assert empty_dit([{},{},{}])==True\nassert empty_dit([{1,2},{},{}])==False\nassert empty_dit({})==True", "difficulty": "code"} {"input": "Write a function to convert a given tuple of positive integers into an integer.", "answer": "def tuple_to_int(nums):\r\n result = int(''.join(map(str,nums)))\r\n return result", "source": "mbpp", "task_id": "116", "test_cases": "assert tuple_to_int((1,2,3))==123\nassert tuple_to_int((4,5,6))==456\nassert tuple_to_int((5,6,7))==567", "difficulty": "code"} {"input": "Write a function to convert all possible convertible elements in the list to float.", "answer": "def list_to_float(test_list):\r\n res = []\r\n for tup in test_list:\r\n temp = []\r\n for ele in tup:\r\n if ele.isalpha():\r\n temp.append(ele)\r\n else:\r\n temp.append(float(ele))\r\n res.append((temp[0],temp[1])) \r\n return (str(res))", "source": "mbpp", "task_id": "117", "test_cases": "assert list_to_float( [(\"3\", \"4\"), (\"1\", \"26.45\"), (\"7.32\", \"8\"), (\"4\", \"8\")] ) == '[(3.0, 4.0), (1.0, 26.45), (7.32, 8.0), (4.0, 8.0)]'\nassert list_to_float( [(\"4\", \"4\"), (\"2\", \"27\"), (\"4.12\", \"9\"), (\"7\", \"11\")] ) == '[(4.0, 4.0), (2.0, 27.0), (4.12, 9.0), (7.0, 11.0)]'\nassert list_to_float( [(\"6\", \"78\"), (\"5\", \"26.45\"), (\"1.33\", \"4\"), (\"82\", \"13\")] ) == '[(6.0, 78.0), (5.0, 26.45), (1.33, 4.0), (82.0, 13.0)]'", "difficulty": "code"} {"input": "[link text](https:// [link text](https:// [link text](https://)))write a function to convert a string to a list.", "answer": "def string_to_list(string): \r\n lst = list(string.split(\" \")) \r\n return lst", "source": "mbpp", "task_id": "118", "test_cases": "assert string_to_list(\"python programming\")==['python','programming']\nassert string_to_list(\"lists tuples strings\")==['lists','tuples','strings']\nassert string_to_list(\"write a program\")==['write','a','program']", "difficulty": "code"} {"input": "Write a python function to find the element that appears only once in a sorted array.", "answer": "def search(arr,n) :\r\n XOR = 0\r\n for i in range(n) :\r\n XOR = XOR ^ arr[i]\r\n return (XOR)", "source": "mbpp", "task_id": "119", "test_cases": "assert search([1,1,2,2,3],5) == 3\nassert search([1,1,3,3,4,4,5,5,7,7,8],11) == 8\nassert search([1,2,2,3,3,4,4],7) == 1", "difficulty": "code"} {"input": "Write a function to find the maximum product from the pairs of tuples within a given list.", "answer": "def max_product_tuple(list1):\r\n result_max = max([abs(x * y) for x, y in list1] )\r\n return result_max", "source": "mbpp", "task_id": "120", "test_cases": "assert max_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==36\nassert max_product_tuple([(10,20), (15,2), (5,10)] )==200\nassert max_product_tuple([(11,44), (10,15), (20,5), (12, 9)] )==484", "difficulty": "code"} {"input": "Write a function to find the triplet with sum of the given array", "answer": "def check_triplet(A, n, sum, count):\r\n if count == 3 and sum == 0:\r\n return True\r\n if count == 3 or n == 0 or sum < 0:\r\n return False\r\n return check_triplet(A, n - 1, sum - A[n - 1], count + 1) or\\\r\n check_triplet(A, n - 1, sum, count)", "source": "mbpp", "task_id": "121", "test_cases": "assert check_triplet([2, 7, 4, 0, 9, 5, 1, 3], 8, 6, 0) == True\nassert check_triplet([1, 4, 5, 6, 7, 8, 5, 9], 8, 6, 0) == False\nassert check_triplet([10, 4, 2, 3, 5], 5, 15, 0) == True", "difficulty": "code"} {"input": "Write a function to find n’th smart number.", "answer": "MAX = 3000 \r\ndef smartNumber(n): \r\n\tprimes = [0] * MAX \r\n\tresult = [] \r\n\tfor i in range(2, MAX): \r\n\t\tif (primes[i] == 0): \r\n\t\t\tprimes[i] = 1 \r\n\t\t\tj = i * 2 \r\n\t\t\twhile (j < MAX): \r\n\t\t\t\tprimes[j] -= 1 \r\n\t\t\t\tif ( (primes[j] + 3) == 0): \r\n\t\t\t\t\tresult.append(j) \r\n\t\t\t\tj = j + i \r\n\tresult.sort() \r\n\treturn result[n - 1]", "source": "mbpp", "task_id": "122", "test_cases": "assert smartNumber(1) == 30\nassert smartNumber(50) == 273\nassert smartNumber(1000) == 2664", "difficulty": "code"} {"input": "Write a function to sum all amicable numbers from 1 to a specified number.", "answer": "def amicable_numbers_sum(limit):\r\n if not isinstance(limit, int):\r\n return \"Input is not an integer!\"\r\n if limit < 1:\r\n return \"Input must be bigger than 0!\"\r\n amicables = set()\r\n for num in range(2, limit+1):\r\n if num in amicables:\r\n continue\r\n sum_fact = sum([fact for fact in range(1, num) if num % fact == 0])\r\n sum_fact2 = sum([fact for fact in range(1, sum_fact) if sum_fact % fact == 0])\r\n if num == sum_fact2 and num != sum_fact:\r\n amicables.add(num)\r\n amicables.add(sum_fact2)\r\n return sum(amicables)", "source": "mbpp", "task_id": "123", "test_cases": "assert amicable_numbers_sum(999)==504\nassert amicable_numbers_sum(9999)==31626\nassert amicable_numbers_sum(99)==0", "difficulty": "code"} {"input": "Write a function to get the angle of a complex number.", "answer": "import cmath\r\ndef angle_complex(a,b):\r\n cn=complex(a,b)\r\n angle=cmath.phase(a+b)\r\n return angle", "source": "mbpp", "task_id": "124", "test_cases": "assert angle_complex(0,1j)==1.5707963267948966 \nassert angle_complex(2,1j)==0.4636476090008061\nassert angle_complex(0,2j)==1.5707963267948966", "difficulty": "code"} {"input": "Write a function to find the maximum difference between the number of 0s and number of 1s in any sub-string of the given binary string.", "answer": "def find_length(string, n): \r\n\tcurrent_sum = 0\r\n\tmax_sum = 0\r\n\tfor i in range(n): \r\n\t\tcurrent_sum += (1 if string[i] == '0' else -1) \r\n\t\tif current_sum < 0: \r\n\t\t\tcurrent_sum = 0\r\n\t\tmax_sum = max(current_sum, max_sum) \r\n\treturn max_sum if max_sum else 0", "source": "mbpp", "task_id": "125", "test_cases": "assert find_length(\"11000010001\", 11) == 6\nassert find_length(\"10111\", 5) == 1\nassert find_length(\"11011101100101\", 14) == 2 ", "difficulty": "code"} {"input": "Write a python function to find the sum of common divisors of two given numbers.", "answer": "def sum(a,b): \r\n sum = 0\r\n for i in range (1,min(a,b)): \r\n if (a % i == 0 and b % i == 0): \r\n sum += i \r\n return sum", "source": "mbpp", "task_id": "126", "test_cases": "assert sum(10,15) == 6\nassert sum(100,150) == 93\nassert sum(4,6) == 3", "difficulty": "code"} {"input": "Write a function to multiply two integers without using the * operator in python.", "answer": "def multiply_int(x, y):\r\n if y < 0:\r\n return -multiply_int(x, -y)\r\n elif y == 0:\r\n return 0\r\n elif y == 1:\r\n return x\r\n else:\r\n return x + multiply_int(x, y - 1)", "source": "mbpp", "task_id": "127", "test_cases": "assert multiply_int(10,20)==200\nassert multiply_int(5,10)==50\nassert multiply_int(4,8)==32", "difficulty": "code"} {"input": "Write a function to shortlist words that are longer than n from a given list of words.", "answer": "def long_words(n, str):\r\n word_len = []\r\n txt = str.split(\" \")\r\n for x in txt:\r\n if len(x) > n:\r\n word_len.append(x)\r\n return word_len", "source": "mbpp", "task_id": "128", "test_cases": "assert long_words(3,\"python is a programming language\")==['python','programming','language']\nassert long_words(2,\"writing a program\")==['writing','program']\nassert long_words(5,\"sorting list\")==['sorting']", "difficulty": "code"} {"input": "Write a function to calculate magic square.", "answer": "def magic_square_test(my_matrix):\r\n iSize = len(my_matrix[0])\r\n sum_list = []\r\n sum_list.extend([sum (lines) for lines in my_matrix]) \r\n for col in range(iSize):\r\n sum_list.append(sum(row[col] for row in my_matrix))\r\n result1 = 0\r\n for i in range(0,iSize):\r\n result1 +=my_matrix[i][i]\r\n sum_list.append(result1) \r\n result2 = 0\r\n for i in range(iSize-1,-1,-1):\r\n result2 +=my_matrix[i][i]\r\n sum_list.append(result2)\r\n if len(set(sum_list))>1:\r\n return False\r\n return True", "source": "mbpp", "task_id": "129", "test_cases": "assert magic_square_test([[7, 12, 1, 14], [2, 13, 8, 11], [16, 3, 10, 5], [9, 6, 15, 4]])==True\nassert magic_square_test([[2, 7, 6], [9, 5, 1], [4, 3, 8]])==True\nassert magic_square_test([[2, 7, 6], [9, 5, 1], [4, 3, 7]])==False", "difficulty": "code"} {"input": "Write a function to find the item with maximum frequency in a given list.", "answer": "from collections import defaultdict\r\ndef max_occurrences(nums):\r\n dict = defaultdict(int)\r\n for i in nums:\r\n dict[i] += 1\r\n result = max(dict.items(), key=lambda x: x[1]) \r\n return result", "source": "mbpp", "task_id": "130", "test_cases": "assert max_occurrences([2,3,8,4,7,9,8,2,6,5,1,6,1,2,3,2,4,6,9,1,2])==(2, 5)\nassert max_occurrences([2,3,8,4,7,9,8,7,9,15,14,10,12,13,16,16,18])==(8, 2)\nassert max_occurrences([10,20,20,30,40,90,80,50,30,20,50,10])==(20, 3)", "difficulty": "code"} {"input": "Write a python function to reverse only the vowels of a given string.", "answer": "def reverse_vowels(str1):\r\n\tvowels = \"\"\r\n\tfor char in str1:\r\n\t\tif char in \"aeiouAEIOU\":\r\n\t\t\tvowels += char\r\n\tresult_string = \"\"\r\n\tfor char in str1:\r\n\t\tif char in \"aeiouAEIOU\":\r\n\t\t\tresult_string += vowels[-1]\r\n\t\t\tvowels = vowels[:-1]\r\n\t\telse:\r\n\t\t\tresult_string += char\r\n\treturn result_string", "source": "mbpp", "task_id": "131", "test_cases": "assert reverse_vowels(\"Python\") == \"Python\"\nassert reverse_vowels(\"USA\") == \"ASU\"\nassert reverse_vowels(\"ab\") == \"ab\"", "difficulty": "code"} {"input": "Write a function to convert tuple to a string.", "answer": "def tup_string(tup1):\r\n str = ''.join(tup1)\r\n return str", "source": "mbpp", "task_id": "132", "test_cases": "assert tup_string(('e', 'x', 'e', 'r', 'c', 'i', 's', 'e', 's'))==(\"exercises\")\nassert tup_string(('p','y','t','h','o','n'))==(\"python\")\nassert tup_string(('p','r','o','g','r','a','m'))==(\"program\")", "difficulty": "code"} {"input": "Write a function to calculate the sum of the negative numbers of a given list of numbers using lambda function.", "answer": "def sum_negativenum(nums):\r\n sum_negativenum = list(filter(lambda nums:nums<0,nums))\r\n return sum(sum_negativenum)", "source": "mbpp", "task_id": "133", "test_cases": "assert sum_negativenum([2, 4, -6, -9, 11, -12, 14, -5, 17])==-32\nassert sum_negativenum([10,15,-14,13,-18,12,-20])==-52\nassert sum_negativenum([19, -65, 57, 39, 152,-639, 121, 44, 90, -190])==-894", "difficulty": "code"} {"input": "Write a python function to check whether the last element of given array is even or odd after performing an operation p times.", "answer": "def check_last (arr,n,p): \r\n _sum = 0\r\n for i in range(n): \r\n _sum = _sum + arr[i] \r\n if p == 1: \r\n if _sum % 2 == 0: \r\n return \"ODD\"\r\n else: \r\n return \"EVEN\"\r\n return \"EVEN\"", "source": "mbpp", "task_id": "134", "test_cases": "assert check_last([5,7,10],3,1) == \"ODD\"\nassert check_last([2,3],2,3) == \"EVEN\"\nassert check_last([1,2,3],3,1) == \"ODD\"", "difficulty": "code"} {"input": "Write a function to find the nth hexagonal number.", "answer": "def hexagonal_num(n): \r\n\treturn n*(2*n - 1)", "source": "mbpp", "task_id": "135", "test_cases": "assert hexagonal_num(10) == 190\nassert hexagonal_num(5) == 45\nassert hexagonal_num(7) == 91", "difficulty": "code"} {"input": "Write a function to calculate electricity bill.", "answer": "def cal_electbill(units):\r\n if(units < 50):\r\n amount = units * 2.60\r\n surcharge = 25\r\n elif(units <= 100):\r\n amount = 130 + ((units - 50) * 3.25)\r\n surcharge = 35\r\n elif(units <= 200):\r\n amount = 130 + 162.50 + ((units - 100) * 5.26)\r\n surcharge = 45\r\n else:\r\n amount = 130 + 162.50 + 526 + ((units - 200) * 8.45)\r\n surcharge = 75\r\n total = amount + surcharge\r\n return total", "source": "mbpp", "task_id": "136", "test_cases": "assert cal_electbill(75)==246.25\nassert cal_electbill(265)==1442.75\nassert cal_electbill(100)==327.5", "difficulty": "code"} {"input": "Write a function to find the ration of zeroes in an array of integers.", "answer": "from array import array\r\ndef zero_count(nums):\r\n n = len(nums)\r\n n1 = 0\r\n for x in nums:\r\n if x == 0:\r\n n1 += 1\r\n else:\r\n None\r\n return round(n1/n,2)", "source": "mbpp", "task_id": "137", "test_cases": "assert zero_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.15\nassert zero_count([2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==0.00\nassert zero_count([2, 4, -6, -9, 11, -12, 14, -5, 17])==0.00", "difficulty": "code"} {"input": "Write a python function to check whether the given number can be represented as sum of non-zero powers of 2 or not.", "answer": "def is_Sum_Of_Powers_Of_Two(n): \r\n if (n % 2 == 1): \r\n return False\r\n else: \r\n return True", "source": "mbpp", "task_id": "138", "test_cases": "assert is_Sum_Of_Powers_Of_Two(10) == True\nassert is_Sum_Of_Powers_Of_Two(7) == False\nassert is_Sum_Of_Powers_Of_Two(14) == True", "difficulty": "code"} {"input": "Write a function to find the circumference of a circle.", "answer": "def circle_circumference(r):\r\n perimeter=2*3.1415*r\r\n return perimeter", "source": "mbpp", "task_id": "139", "test_cases": "assert circle_circumference(10)==62.830000000000005\nassert circle_circumference(5)==31.415000000000003\nassert circle_circumference(4)==25.132", "difficulty": "code"} {"input": "Write a function to extract elements that occur singly in the given tuple list.", "answer": "def extract_singly(test_list):\r\n res = []\r\n temp = set()\r\n for inner in test_list:\r\n for ele in inner:\r\n if not ele in temp:\r\n temp.add(ele)\r\n res.append(ele)\r\n return (res)", "source": "mbpp", "task_id": "140", "test_cases": "assert extract_singly([(3, 4, 5), (4, 5, 7), (1, 4)]) == [3, 4, 5, 7, 1]\nassert extract_singly([(1, 2, 3), (4, 2, 3), (7, 8)]) == [1, 2, 3, 4, 7, 8]\nassert extract_singly([(7, 8, 9), (10, 11, 12), (10, 11)]) == [7, 8, 9, 10, 11, 12]", "difficulty": "code"} {"input": "Write a function to sort a list of elements using pancake sort.", "answer": "def pancake_sort(nums):\r\n arr_len = len(nums)\r\n while arr_len > 1:\r\n mi = nums.index(max(nums[0:arr_len]))\r\n nums = nums[mi::-1] + nums[mi+1:len(nums)]\r\n nums = nums[arr_len-1::-1] + nums[arr_len:len(nums)]\r\n arr_len -= 1\r\n return nums", "source": "mbpp", "task_id": "141", "test_cases": "assert pancake_sort([15, 79, 25, 38, 69]) == [15, 25, 38, 69, 79]\nassert pancake_sort([98, 12, 54, 36, 85]) == [12, 36, 54, 85, 98]\nassert pancake_sort([41, 42, 32, 12, 23]) == [12, 23, 32, 41, 42]", "difficulty": "code"} {"input": "Write a function to count the same pair in three given lists.", "answer": "def count_samepair(list1,list2,list3):\r\n result = sum(m == n == o for m, n, o in zip(list1,list2,list3))\r\n return result", "source": "mbpp", "task_id": "142", "test_cases": "assert count_samepair([1,2,3,4,5,6,7,8],[2,2,3,1,2,6,7,9],[2,1,3,1,2,6,7,9])==3\nassert count_samepair([1,2,3,4,5,6,7,8],[2,2,3,1,2,6,7,8],[2,1,3,1,2,6,7,8])==4\nassert count_samepair([1,2,3,4,2,6,7,8],[2,2,3,1,2,6,7,8],[2,1,3,1,2,6,7,8])==5", "difficulty": "code"} {"input": "Write a function to find number of lists present in the given tuple.", "answer": "def find_lists(Input): \r\n\tif isinstance(Input, list): \r\n\t\treturn 1\r\n\telse: \r\n\t\treturn len(Input)", "source": "mbpp", "task_id": "143", "test_cases": "assert find_lists(([1, 2, 3, 4], [5, 6, 7, 8])) == 2\nassert find_lists(([1, 2], [3, 4], [5, 6])) == 3\nassert find_lists(([9, 8, 7, 6, 5, 4, 3, 2, 1])) == 1", "difficulty": "code"} {"input": "Write a python function to find the sum of absolute differences in all pairs of the given array.", "answer": "def sum_Pairs(arr,n): \r\n sum = 0\r\n for i in range(n - 1,-1,-1): \r\n sum += i*arr[i] - (n-1-i) * arr[i] \r\n return sum", "source": "mbpp", "task_id": "144", "test_cases": "assert sum_Pairs([1,8,9,15,16],5) == 74\nassert sum_Pairs([1,2,3,4],4) == 10\nassert sum_Pairs([1,2,3,4,5,7,9,11,14],9) == 188", "difficulty": "code"} {"input": "Write a python function to find the maximum difference between any two elements in a given array.", "answer": "def max_Abs_Diff(arr,n): \r\n minEle = arr[0] \r\n maxEle = arr[0] \r\n for i in range(1, n): \r\n minEle = min(minEle,arr[i]) \r\n maxEle = max(maxEle,arr[i]) \r\n return (maxEle - minEle)", "source": "mbpp", "task_id": "145", "test_cases": "assert max_Abs_Diff((2,1,5,3),4) == 4\nassert max_Abs_Diff((9,3,2,5,1),5) == 8\nassert max_Abs_Diff((3,2,1),3) == 2", "difficulty": "code"} {"input": "Write a function to find the ascii value of total characters in a string.", "answer": "def ascii_value_string(str1):\r\n for i in range(len(str1)):\r\n return ord(str1[i])", "source": "mbpp", "task_id": "146", "test_cases": "assert ascii_value_string(\"python\")==112\nassert ascii_value_string(\"Program\")==80\nassert ascii_value_string(\"Language\")==76", "difficulty": "code"} {"input": "Write a function to find the maximum total path sum in the given triangle.", "answer": "def max_path_sum(tri, m, n): \r\n\tfor i in range(m-1, -1, -1): \r\n\t\tfor j in range(i+1): \r\n\t\t\tif (tri[i+1][j] > tri[i+1][j+1]): \r\n\t\t\t\ttri[i][j] += tri[i+1][j] \r\n\t\t\telse: \r\n\t\t\t\ttri[i][j] += tri[i+1][j+1] \r\n\treturn tri[0][0]", "source": "mbpp", "task_id": "147", "test_cases": "assert max_path_sum([[1, 0, 0], [4, 8, 0], [1, 5, 3]], 2, 2) == 14\nassert max_path_sum([[13, 0, 0], [7, 4, 0], [2, 4, 6]], 2, 2) == 24 \nassert max_path_sum([[2, 0, 0], [11, 18, 0], [21, 25, 33]], 2, 2) == 53", "difficulty": "code"} {"input": "Write a function to divide a number into two parts such that the sum of digits is maximum.", "answer": "def sum_digits_single(x) : \r\n ans = 0\r\n while x : \r\n ans += x % 10\r\n x //= 10 \r\n return ans \r\ndef closest(x) : \r\n ans = 0\r\n while (ans * 10 + 9 <= x) : \r\n ans = ans * 10 + 9 \r\n return ans \r\ndef sum_digits_twoparts(N) : \r\n A = closest(N) \r\n return sum_digits_single(A) + sum_digits_single(N - A)", "source": "mbpp", "task_id": "148", "test_cases": "assert sum_digits_twoparts(35)==17\nassert sum_digits_twoparts(7)==7\nassert sum_digits_twoparts(100)==19", "difficulty": "code"} {"input": "Write a function to find the longest subsequence such that the difference between adjacents is one for the given array.", "answer": "def longest_subseq_with_diff_one(arr, n): \r\n\tdp = [1 for i in range(n)] \r\n\tfor i in range(n): \r\n\t\tfor j in range(i): \r\n\t\t\tif ((arr[i] == arr[j]+1) or (arr[i] == arr[j]-1)): \r\n\t\t\t\tdp[i] = max(dp[i], dp[j]+1) \r\n\tresult = 1\r\n\tfor i in range(n): \r\n\t\tif (result < dp[i]): \r\n\t\t\tresult = dp[i] \r\n\treturn result", "source": "mbpp", "task_id": "149", "test_cases": "assert longest_subseq_with_diff_one([1, 2, 3, 4, 5, 3, 2], 7) == 6\nassert longest_subseq_with_diff_one([10, 9, 4, 5, 4, 8, 6], 7) == 3\nassert longest_subseq_with_diff_one([1, 2, 3, 2, 3, 7, 2, 1], 8) == 7", "difficulty": "code"} {"input": "Write a python function to find whether the given number is present in the infinite sequence or not.", "answer": "def does_Contain_B(a,b,c): \r\n if (a == b): \r\n return True\r\n if ((b - a) * c > 0 and (b - a) % c == 0): \r\n return True\r\n return False", "source": "mbpp", "task_id": "150", "test_cases": "assert does_Contain_B(1,7,3) == True\nassert does_Contain_B(1,-3,5) == False\nassert does_Contain_B(3,2,5) == False", "difficulty": "code"} {"input": "Write a python function to check whether the given number is co-prime or not.", "answer": "def gcd(p,q):\r\n while q != 0:\r\n p, q = q,p%q\r\n return p\r\ndef is_coprime(x,y):\r\n return gcd(x,y) == 1", "source": "mbpp", "task_id": "151", "test_cases": "assert is_coprime(17,13) == True\nassert is_coprime(15,21) == False\nassert is_coprime(25,45) == False", "difficulty": "code"} {"input": "Write a function to sort the given array by using merge sort.", "answer": "def merge(a,b):\r\n c = []\r\n while len(a) != 0 and len(b) != 0:\r\n if a[0] < b[0]:\r\n c.append(a[0])\r\n a.remove(a[0])\r\n else:\r\n c.append(b[0])\r\n b.remove(b[0])\r\n if len(a) == 0:\r\n c += b\r\n else:\r\n c += a\r\n return c\r\ndef merge_sort(x):\r\n if len(x) == 0 or len(x) == 1:\r\n return x\r\n else:\r\n middle = len(x)//2\r\n a = merge_sort(x[:middle])\r\n b = merge_sort(x[middle:])\r\n return merge(a,b)", "source": "mbpp", "task_id": "152", "test_cases": "assert merge_sort([3, 4, 2, 6, 5, 7, 1, 9]) == [1, 2, 3, 4, 5, 6, 7, 9]\nassert merge_sort([7, 25, 45, 78, 11, 33, 19]) == [7, 11, 19, 25, 33, 45, 78]\nassert merge_sort([3, 1, 4, 9, 8]) == [1, 3, 4, 8, 9]", "difficulty": "code"} {"input": "Write a function to find the vertex of a parabola.", "answer": "def parabola_vertex(a, b, c): \r\n vertex=(((-b / (2 * a)),(((4 * a * c) - (b * b)) / (4 * a))))\r\n return vertex", "source": "mbpp", "task_id": "153", "test_cases": "assert parabola_vertex(5,3,2)==(-0.3, 1.55)\nassert parabola_vertex(9,8,4)==(-0.4444444444444444, 2.2222222222222223)\nassert parabola_vertex(2,4,6)==(-1.0, 4.0)", "difficulty": "code"} {"input": "Write a function to extract every specified element from a given two dimensional list.", "answer": "def specified_element(nums, N):\r\n result = [i[N] for i in nums]\r\n return result", "source": "mbpp", "task_id": "154", "test_cases": "assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],0)==[1, 4, 7]\nassert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],2)==[3, 6, 9]\nassert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],3)==[2,2,5]", "difficulty": "code"} {"input": "Write a python function to toggle all even bits of a given number.", "answer": "def even_bit_toggle_number(n) : \r\n res = 0; count = 0; temp = n \r\n while (temp > 0) : \r\n if (count % 2 == 1) : \r\n res = res | (1 << count) \r\n count = count + 1\r\n temp >>= 1 \r\n return n ^ res", "source": "mbpp", "task_id": "155", "test_cases": "assert even_bit_toggle_number(10) == 0\nassert even_bit_toggle_number(20) == 30\nassert even_bit_toggle_number(30) == 20", "difficulty": "code"} {"input": "Write a function to convert a tuple of string values to a tuple of integer values.", "answer": "def tuple_int_str(tuple_str):\r\n result = tuple((int(x[0]), int(x[1])) for x in tuple_str)\r\n return result", "source": "mbpp", "task_id": "156", "test_cases": "assert tuple_int_str((('333', '33'), ('1416', '55')))==((333, 33), (1416, 55))\nassert tuple_int_str((('999', '99'), ('1000', '500')))==((999, 99), (1000, 500))\nassert tuple_int_str((('666', '66'), ('1500', '555')))==((666, 66), (1500, 555))", "difficulty": "code"} {"input": "Write a function to reflect the run-length encoding from a list.", "answer": "from itertools import groupby\r\ndef encode_list(list1):\r\n return [[len(list(group)), key] for key, group in groupby(list1)]", "source": "mbpp", "task_id": "157", "test_cases": "assert encode_list([1,1,2,3,4,4.3,5,1])==[[2, 1], [1, 2], [1, 3], [1, 4], [1, 4.3], [1, 5], [1, 1]]\nassert encode_list('automatically')==[[1, 'a'], [1, 'u'], [1, 't'], [1, 'o'], [1, 'm'], [1, 'a'], [1, 't'], [1, 'i'], [1, 'c'], [1, 'a'], [2, 'l'], [1, 'y']]\nassert encode_list('python')==[[1, 'p'], [1, 'y'], [1, 't'], [1, 'h'], [1, 'o'], [1, 'n']]", "difficulty": "code"} {"input": "Write a python function to find k number of operations required to make all elements equal.", "answer": "def min_Ops(arr,n,k): \r\n max1 = max(arr) \r\n res = 0\r\n for i in range(0,n): \r\n if ((max1 - arr[i]) % k != 0): \r\n return -1 \r\n else: \r\n res += (max1 - arr[i]) / k \r\n return int(res)", "source": "mbpp", "task_id": "158", "test_cases": "assert min_Ops([2,2,2,2],4,3) == 0\nassert min_Ops([4,2,6,8],4,3) == -1\nassert min_Ops([21,33,9,45,63],5,6) == 24", "difficulty": "code"} {"input": "Write a function to print the season for the given month and day.", "answer": "def month_season(month,days):\r\n if month in ('January', 'February', 'March'):\r\n\t season = 'winter'\r\n elif month in ('April', 'May', 'June'):\r\n\t season = 'spring'\r\n elif month in ('July', 'August', 'September'):\r\n\t season = 'summer'\r\n else:\r\n\t season = 'autumn'\r\n if (month == 'March') and (days > 19):\r\n\t season = 'spring'\r\n elif (month == 'June') and (days > 20):\r\n\t season = 'summer'\r\n elif (month == 'September') and (days > 21):\r\n\t season = 'autumn'\r\n elif (month == 'October') and (days > 21):\r\n\t season = 'autumn'\r\n elif (month == 'November') and (days > 21):\r\n\t season = 'autumn'\r\n elif (month == 'December') and (days > 20):\r\n\t season = 'winter'\r\n return season", "source": "mbpp", "task_id": "159", "test_cases": "assert month_season('January',4)==('winter')\nassert month_season('October',28)==('autumn')\nassert month_season('June',6)==('spring')", "difficulty": "code"} {"input": "Write a function to find x and y that satisfies ax + by = n.", "answer": "def solution (a, b, n): \r\n\ti = 0\r\n\twhile i * a <= n: \r\n\t\tif (n - (i * a)) % b == 0: \r\n\t\t\treturn (\"x = \",i ,\", y = \", \r\n\t\t\tint((n - (i * a)) / b)) \r\n\t\t\treturn 0\r\n\t\ti = i + 1\r\n\treturn (\"No solution\")", "source": "mbpp", "task_id": "160", "test_cases": "assert solution(2, 3, 7) == ('x = ', 2, ', y = ', 1)\nassert solution(4, 2, 7) == 'No solution'\nassert solution(1, 13, 17) == ('x = ', 4, ', y = ', 1)", "difficulty": "code"} {"input": "Write a function to remove all elements from a given list present in another list.", "answer": "def remove_elements(list1, list2):\r\n result = [x for x in list1 if x not in list2]\r\n return result", "source": "mbpp", "task_id": "161", "test_cases": "assert remove_elements([1,2,3,4,5,6,7,8,9,10],[2,4,6,8])==[1, 3, 5, 7, 9, 10]\nassert remove_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],[1, 3, 5, 7])==[2, 4, 6, 8, 9, 10]\nassert remove_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],[5,7])==[1, 2, 3, 4, 6, 8, 9, 10]", "difficulty": "code"} {"input": "Write a function to calculate the sum of the positive integers of n+(n-2)+(n-4)... (until n-x =< 0).", "answer": "def sum_series(n):\r\n if n < 1:\r\n return 0\r\n else:\r\n return n + sum_series(n - 2)", "source": "mbpp", "task_id": "162", "test_cases": "assert sum_series(6)==12\nassert sum_series(10)==30\nassert sum_series(9)==25", "difficulty": "code"} {"input": "Write a function to calculate the area of a regular polygon.", "answer": "from math import tan, pi\r\ndef area_polygon(s,l):\r\n area = s * (l ** 2) / (4 * tan(pi / s))\r\n return area", "source": "mbpp", "task_id": "163", "test_cases": "assert area_polygon(4,20)==400.00000000000006\nassert area_polygon(10,15)==1731.1969896610804\nassert area_polygon(9,7)==302.90938549487214", "difficulty": "code"} {"input": "Write a python function to check whether the sum of divisors are same or not.", "answer": "import math \r\ndef divSum(n): \r\n sum = 1; \r\n i = 2; \r\n while(i * i <= n): \r\n if (n % i == 0): \r\n sum = (sum + i +math.floor(n / i)); \r\n i += 1; \r\n return sum; \r\ndef areEquivalent(num1,num2): \r\n return divSum(num1) == divSum(num2);", "source": "mbpp", "task_id": "164", "test_cases": "assert areEquivalent(36,57) == False\nassert areEquivalent(2,4) == False\nassert areEquivalent(23,47) == True", "difficulty": "code"} {"input": "Write a python function to count characters at same position in a given string (lower and uppercase characters) as in english alphabet.", "answer": "def count_char_position(str1): \r\n count_chars = 0\r\n for i in range(len(str1)):\r\n if ((i == ord(str1[i]) - ord('A')) or \r\n (i == ord(str1[i]) - ord('a'))): \r\n count_chars += 1\r\n return count_chars", "source": "mbpp", "task_id": "165", "test_cases": "assert count_char_position(\"xbcefg\") == 2\nassert count_char_position(\"ABcED\") == 3\nassert count_char_position(\"AbgdeF\") == 5", "difficulty": "code"} {"input": "Write a python function to count the pairs with xor as an even number.", "answer": "def find_even_Pair(A,N): \r\n evenPair = 0\r\n for i in range(0,N): \r\n for j in range(i+1,N): \r\n if ((A[i] ^ A[j]) % 2 == 0): \r\n evenPair+=1\r\n return evenPair;", "source": "mbpp", "task_id": "166", "test_cases": "assert find_even_Pair([5,4,7,2,1],5) == 4\nassert find_even_Pair([7,2,8,1,0,5,11],7) == 9\nassert find_even_Pair([1,2,3],3) == 1", "difficulty": "code"} {"input": "Write a python function to find smallest power of 2 greater than or equal to n.", "answer": "def next_Power_Of_2(n): \r\n count = 0; \r\n if (n and not(n & (n - 1))): \r\n return n \r\n while( n != 0): \r\n n >>= 1\r\n count += 1\r\n return 1 << count;", "source": "mbpp", "task_id": "167", "test_cases": "assert next_Power_Of_2(0) == 1\nassert next_Power_Of_2(5) == 8\nassert next_Power_Of_2(17) == 32", "difficulty": "code"} {"input": "Write a python function to find the frequency of a number in a given array.", "answer": "def frequency(a,x): \r\n count = 0 \r\n for i in a: \r\n if i == x: count += 1\r\n return count", "source": "mbpp", "task_id": "168", "test_cases": "assert frequency([1,2,3],4) == 0\nassert frequency([1,2,2,3,3,3,4],3) == 3\nassert frequency([0,1,2,3,1,2],1) == 2", "difficulty": "code"} {"input": "Write a function to calculate the nth pell number.", "answer": "def get_pell(n): \r\n\tif (n <= 2): \r\n\t\treturn n \r\n\ta = 1\r\n\tb = 2\r\n\tfor i in range(3, n+1): \r\n\t\tc = 2 * b + a \r\n\t\ta = b \r\n\t\tb = c \r\n\treturn b", "source": "mbpp", "task_id": "169", "test_cases": "assert get_pell(4) == 12\nassert get_pell(7) == 169\nassert get_pell(8) == 408", "difficulty": "code"} {"input": "Write a function to find sum of the numbers in a list between the indices of a specified range.", "answer": "def sum_range_list(list1, m, n): \r\n sum_range = 0 \r\n for i in range(m, n+1, 1): \r\n sum_range += list1[i] \r\n return sum_range", "source": "mbpp", "task_id": "170", "test_cases": "assert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],8,10)==29\nassert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],5,7)==16\nassert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],7,10)==38", "difficulty": "code"} {"input": "Write a function to find the perimeter of a pentagon.", "answer": "import math\r\ndef perimeter_pentagon(a):\r\n perimeter=(5*a)\r\n return perimeter", "source": "mbpp", "task_id": "171", "test_cases": "assert perimeter_pentagon(5)==25\nassert perimeter_pentagon(10)==50\nassert perimeter_pentagon(15)==75", "difficulty": "code"} {"input": "Write a function to find the occurence of characters 'std' in the given string 1. list item 1. list item 1. list item 2. list item 2. list item 2. list item", "answer": "def count_occurance(s):\r\n count=0\r\n for i in range(len(s)):\r\n if (s[i]== 's' and s[i+1]=='t' and s[i+2]== 'd'):\r\n count = count + 1\r\n return count", "source": "mbpp", "task_id": "172", "test_cases": "assert count_occurance(\"letstdlenstdporstd\") == 3\nassert count_occurance(\"truststdsolensporsd\") == 1\nassert count_occurance(\"makestdsostdworthit\") == 2", "difficulty": "code"} {"input": "Write a function to remove everything except alphanumeric characters from a string.", "answer": "import re\r\ndef remove_splchar(text): \r\n pattern = re.compile('[\\W_]+')\r\n return (pattern.sub('', text))", "source": "mbpp", "task_id": "173", "test_cases": "assert remove_splchar('python @#&^%$*program123')==('pythonprogram123')\nassert remove_splchar('python %^$@!^&*() programming24%$^^() language')==('pythonprogramming24language')\nassert remove_splchar('python ^%&^()(+_)(_^&67) program')==('python67program')", "difficulty": "code"} {"input": "Write a function to group a sequence of key-value pairs into a dictionary of lists.", "answer": "def group_keyvalue(l):\r\n result = {}\r\n for k, v in l:\r\n result.setdefault(k, []).append(v)\r\n return result", "source": "mbpp", "task_id": "174", "test_cases": "assert group_keyvalue([('yellow', 1), ('blue', 2), ('yellow', 3), ('blue', 4), ('red', 1)])=={'yellow': [1, 3], 'blue': [2, 4], 'red': [1]}\nassert group_keyvalue([('python', 1), ('python', 2), ('python', 3), ('python', 4), ('python', 5)])=={'python': [1,2,3,4,5]}\nassert group_keyvalue([('yellow',100), ('blue', 200), ('yellow', 300), ('blue', 400), ('red', 100)])=={'yellow': [100, 300], 'blue': [200, 400], 'red': [100]}", "difficulty": "code"} {"input": "Write a function to verify validity of a string of parentheses.", "answer": "def is_valid_parenthese( str1):\r\n stack, pchar = [], {\"(\": \")\", \"{\": \"}\", \"[\": \"]\"}\r\n for parenthese in str1:\r\n if parenthese in pchar:\r\n stack.append(parenthese)\r\n elif len(stack) == 0 or pchar[stack.pop()] != parenthese:\r\n return False\r\n return len(stack) == 0", "source": "mbpp", "task_id": "175", "test_cases": "assert is_valid_parenthese(\"(){}[]\")==True\nassert is_valid_parenthese(\"()[{)}\")==False\nassert is_valid_parenthese(\"()\")==True", "difficulty": "code"} {"input": "Write a function to find the perimeter of a triangle.", "answer": "def perimeter_triangle(a,b,c):\r\n perimeter=a+b+c\r\n return perimeter", "source": "mbpp", "task_id": "176", "test_cases": "assert perimeter_triangle(10,20,30)==60\nassert perimeter_triangle(3,4,5)==12\nassert perimeter_triangle(25,35,45)==105", "difficulty": "code"} {"input": "Write a python function to find two distinct numbers such that their lcm lies within the given range.", "answer": "def answer(L,R): \r\n if (2 * L <= R): \r\n return (L ,2*L)\r\n else: \r\n return (-1)", "source": "mbpp", "task_id": "177", "test_cases": "assert answer(3,8) == (3,6)\nassert answer(2,6) == (2,4)\nassert answer(1,3) == (1,2)", "difficulty": "code"} {"input": "Write a function to search some literals strings in a string.", "answer": "import re\r\ndef string_literals(patterns,text):\r\n for pattern in patterns:\r\n if re.search(pattern, text):\r\n return ('Matched!')\r\n else:\r\n return ('Not Matched!')", "source": "mbpp", "task_id": "178", "test_cases": "assert string_literals(['language'],'python language')==('Matched!')\nassert string_literals(['program'],'python language')==('Not Matched!')\nassert string_literals(['python'],'programming language')==('Not Matched!')", "difficulty": "code"} {"input": "Write a function to find if the given number is a keith number or not.", "answer": "def is_num_keith(x): \r\n\tterms = [] \r\n\ttemp = x \r\n\tn = 0 \r\n\twhile (temp > 0): \r\n\t\tterms.append(temp % 10) \r\n\t\ttemp = int(temp / 10) \r\n\t\tn+=1 \r\n\tterms.reverse() \r\n\tnext_term = 0 \r\n\ti = n \r\n\twhile (next_term < x): \r\n\t\tnext_term = 0 \r\n\t\tfor j in range(1,n+1): \r\n\t\t\tnext_term += terms[i - j] \r\n\t\tterms.append(next_term) \r\n\t\ti+=1 \r\n\treturn (next_term == x)", "source": "mbpp", "task_id": "179", "test_cases": "assert is_num_keith(14) == True\nassert is_num_keith(12) == False\nassert is_num_keith(197) == True", "difficulty": "code"} {"input": "Write a function to calculate distance between two points using latitude and longitude.", "answer": "from math import radians, sin, cos, acos\r\ndef distance_lat_long(slat,slon,elat,elon):\r\n dist = 6371.01 * acos(sin(slat)*sin(elat) + cos(slat)*cos(elat)*cos(slon - elon))\r\n return dist", "source": "mbpp", "task_id": "180", "test_cases": "assert distance_lat_long(23.5,67.5,25.5,69.5)==12179.372041317429\nassert distance_lat_long(10.5,20.5,30.5,40.5)==6069.397933300514\nassert distance_lat_long(10,20,30,40)==6783.751974994595", "difficulty": "code"} {"input": "Write a function to find the longest common prefix in the given set of strings.", "answer": "def common_prefix_util(str1, str2): \r\n\tresult = \"\"; \r\n\tn1 = len(str1) \r\n\tn2 = len(str2) \r\n\ti = 0\r\n\tj = 0\r\n\twhile i <= n1 - 1 and j <= n2 - 1: \r\n\t\tif (str1[i] != str2[j]): \r\n\t\t\tbreak\r\n\t\tresult += str1[i] \r\n\t\ti += 1\r\n\t\tj += 1\r\n\treturn (result) \r\ndef common_prefix (arr, n): \r\n\tprefix = arr[0] \r\n\tfor i in range (1, n): \r\n\t\tprefix = common_prefix_util(prefix, arr[i]) \r\n\treturn (prefix)", "source": "mbpp", "task_id": "181", "test_cases": "assert common_prefix([\"tablets\", \"tables\", \"taxi\", \"tamarind\"], 4) == 'ta'\nassert common_prefix([\"apples\", \"ape\", \"april\"], 3) == 'ap'\nassert common_prefix([\"teens\", \"teenager\", \"teenmar\"], 3) == 'teen'", "difficulty": "code"} {"input": "Write a function to find uppercase, lowercase, special character and numeric values using regex.", "answer": "import re\r\ndef find_character(string):\r\n uppercase_characters = re.findall(r\"[A-Z]\", string) \r\n lowercase_characters = re.findall(r\"[a-z]\", string) \r\n numerical_characters = re.findall(r\"[0-9]\", string) \r\n special_characters = re.findall(r\"[, .!?]\", string) \r\n return uppercase_characters, lowercase_characters, numerical_characters, special_characters", "source": "mbpp", "task_id": "182", "test_cases": "assert find_character(\"ThisIsGeeksforGeeks\") == (['T', 'I', 'G', 'G'], ['h', 'i', 's', 's', 'e', 'e', 'k', 's', 'f', 'o', 'r', 'e', 'e', 'k', 's'], [], [])\nassert find_character(\"Hithere2\") == (['H'], ['i', 't', 'h', 'e', 'r', 'e'], ['2'], [])\nassert find_character(\"HeyFolks32\") == (['H', 'F'], ['e', 'y', 'o', 'l', 'k', 's'], ['3', '2'], [])", "difficulty": "code"} {"input": "Write a function to count all the distinct pairs having a difference of k in any array.", "answer": "def count_pairs(arr, n, k):\r\n count=0;\r\n for i in range(0,n):\r\n for j in range(i+1, n):\r\n if arr[i] - arr[j] == k or arr[j] - arr[i] == k:\r\n count += 1\r\n return count", "source": "mbpp", "task_id": "183", "test_cases": "assert count_pairs([1, 5, 3, 4, 2], 5, 3) == 2\nassert count_pairs([8, 12, 16, 4, 0, 20], 6, 4) == 5\nassert count_pairs([2, 4, 1, 3, 4], 5, 2) == 3", "difficulty": "code"} {"input": "Write a function to find all the values in a list that are greater than a specified number.", "answer": "def greater_specificnum(list,num):\r\n greater_specificnum=all(x >= num for x in list)\r\n return greater_specificnum", "source": "mbpp", "task_id": "184", "test_cases": "assert greater_specificnum([220, 330, 500],200)==True\nassert greater_specificnum([12, 17, 21],20)==False\nassert greater_specificnum([1,2,3,4],10)==False", "difficulty": "code"} {"input": "Write a function to find the focus of a parabola.", "answer": "def parabola_focus(a, b, c): \r\n focus= (((-b / (2 * a)),(((4 * a * c) - (b * b) + 1) / (4 * a))))\r\n return focus", "source": "mbpp", "task_id": "185", "test_cases": "assert parabola_focus(5,3,2)==(-0.3, 1.6)\nassert parabola_focus(9,8,4)==(-0.4444444444444444, 2.25)\nassert parabola_focus(2,4,6)==(-1.0, 4.125)", "difficulty": "code"} {"input": "Write a function to search some literals strings in a string by using regex.", "answer": "import re\r\ndef check_literals(text, patterns):\r\n for pattern in patterns:\r\n if re.search(pattern, text):\r\n return ('Matched!')\r\n else:\r\n return ('Not Matched!')", "source": "mbpp", "task_id": "186", "test_cases": "assert check_literals('The quick brown fox jumps over the lazy dog.',['fox']) == 'Matched!'\nassert check_literals('The quick brown fox jumps over the lazy dog.',['horse']) == 'Not Matched!'\nassert check_literals('The quick brown fox jumps over the lazy dog.',['lazy']) == 'Matched!'", "difficulty": "code"} {"input": "Write a function to find the longest common subsequence for the given two sequences.", "answer": "def longest_common_subsequence(X, Y, m, n): \r\n if m == 0 or n == 0: \r\n return 0 \r\n elif X[m-1] == Y[n-1]: \r\n return 1 + longest_common_subsequence(X, Y, m-1, n-1) \r\n else: \r\n return max(longest_common_subsequence(X, Y, m, n-1), longest_common_subsequence(X, Y, m-1, n))", "source": "mbpp", "task_id": "187", "test_cases": "assert longest_common_subsequence(\"AGGTAB\" , \"GXTXAYB\", 6, 7) == 4\nassert longest_common_subsequence(\"ABCDGH\" , \"AEDFHR\", 6, 6) == 3\nassert longest_common_subsequence(\"AXYT\" , \"AYZX\", 4, 4) == 2", "difficulty": "code"} {"input": "Write a python function to check whether the given number can be represented by product of two squares or not.", "answer": "def prod_Square(n):\r\n for i in range(2,(n) + 1):\r\n if (i*i < (n+1)):\r\n for j in range(2,n + 1):\r\n if ((i*i*j*j) == n):\r\n return True;\r\n return False;", "source": "mbpp", "task_id": "188", "test_cases": "assert prod_Square(25) == False\nassert prod_Square(30) == False\nassert prod_Square(16) == True", "difficulty": "code"} {"input": "Write a python function to find the first missing positive number.", "answer": "def first_Missing_Positive(arr,n): \r\n ptr = 0\r\n for i in range(n):\r\n if arr[i] == 1:\r\n ptr = 1\r\n break\r\n if ptr == 0:\r\n return(1)\r\n for i in range(n):\r\n if arr[i] <= 0 or arr[i] > n:\r\n arr[i] = 1\r\n for i in range(n):\r\n arr[(arr[i] - 1) % n] += n\r\n for i in range(n):\r\n if arr[i] <= n:\r\n return(i + 1)\r\n return(n + 1)", "source": "mbpp", "task_id": "189", "test_cases": "assert first_Missing_Positive([1,2,3,-1,5],5) == 4\nassert first_Missing_Positive([0,-1,-2,1,5,8],6) == 2\nassert first_Missing_Positive([0,1,2,5,-8],5) == 3", "difficulty": "code"} {"input": "Write a python function to count the number of integral co-ordinates that lie inside a square.", "answer": "def count_Intgral_Points(x1,y1,x2,y2): \r\n return ((y2 - y1 - 1) * (x2 - x1 - 1))", "source": "mbpp", "task_id": "190", "test_cases": "assert count_Intgral_Points(1,1,4,4) == 4\nassert count_Intgral_Points(1,2,1,2) == 1\nassert count_Intgral_Points(4,2,6,4) == 1", "difficulty": "code"} {"input": "Write a function to check whether the given month name contains 30 days or not.", "answer": "def check_monthnumber(monthname3):\r\n if monthname3 ==\"April\" or monthname3== \"June\" or monthname3== \"September\" or monthname3== \"November\":\r\n return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "191", "test_cases": "assert check_monthnumber(\"February\")==False\nassert check_monthnumber(\"June\")==True\nassert check_monthnumber(\"April\")==True", "difficulty": "code"} {"input": "Write a python function to check whether a string has atleast one letter and one number.", "answer": "def check_String(str): \r\n flag_l = False\r\n flag_n = False\r\n for i in str: \r\n if i.isalpha(): \r\n flag_l = True \r\n if i.isdigit(): \r\n flag_n = True\r\n return flag_l and flag_n", "source": "mbpp", "task_id": "192", "test_cases": "assert check_String('thishasboth29') == True\nassert check_String('python') == False\nassert check_String ('string') == False", "difficulty": "code"} {"input": "Write a function to remove the duplicates from the given tuple.", "answer": "def remove_tuple(test_tup):\r\n res = tuple(set(test_tup))\r\n return (res)", "source": "mbpp", "task_id": "193", "test_cases": "assert remove_tuple((1, 3, 5, 2, 3, 5, 1, 1, 3)) == (1, 2, 3, 5)\nassert remove_tuple((2, 3, 4, 4, 5, 6, 6, 7, 8, 8)) == (2, 3, 4, 5, 6, 7, 8)\nassert remove_tuple((11, 12, 13, 11, 11, 12, 14, 13)) == (11, 12, 13, 14)", "difficulty": "code"} {"input": "Write a python function to convert octal number to decimal number.", "answer": "def octal_To_Decimal(n): \r\n num = n; \r\n dec_value = 0; \r\n base = 1; \r\n temp = num; \r\n while (temp): \r\n last_digit = temp % 10; \r\n temp = int(temp / 10); \r\n dec_value += last_digit*base; \r\n base = base * 8; \r\n return dec_value;", "source": "mbpp", "task_id": "194", "test_cases": "assert octal_To_Decimal(25) == 21\nassert octal_To_Decimal(30) == 24\nassert octal_To_Decimal(40) == 32", "difficulty": "code"} {"input": "Write a python function to find the first position of an element in a sorted array.", "answer": "def first(arr,x,n): \r\n low = 0\r\n high = n - 1\r\n res = -1 \r\n while (low <= high):\r\n mid = (low + high) // 2 \r\n if arr[mid] > x:\r\n high = mid - 1\r\n elif arr[mid] < x:\r\n low = mid + 1\r\n else:\r\n res = mid\r\n high = mid - 1\r\n return res", "source": "mbpp", "task_id": "195", "test_cases": "assert first([1,2,3,4,5,6,6],6,6) == 5\nassert first([1,2,2,2,3,2,2,4,2],2,9) == 1\nassert first([1,2,3],1,3) == 0", "difficulty": "code"} {"input": "Write a function to remove all the tuples with length k.", "answer": "def remove_tuples(test_list, K):\r\n res = [ele for ele in test_list if len(ele) != K]\r\n return (res)", "source": "mbpp", "task_id": "196", "test_cases": "assert remove_tuples([(4, 5), (4, ), (8, 6, 7), (1, ), (3, 4, 6, 7)] , 1) == [(4, 5), (8, 6, 7), (3, 4, 6, 7)]\nassert remove_tuples([(4, 5), (4,5), (6, 7), (1, 2, 3), (3, 4, 6, 7)] ,2) == [(1, 2, 3), (3, 4, 6, 7)]\nassert remove_tuples([(1, 4, 4), (4, 3), (8, 6, 7), (1, ), (3, 6, 7)] , 3) == [(4, 3), (1,)]", "difficulty": "code"} {"input": "Write a function to perform the exponentiation of the given two tuples.", "answer": "def find_exponentio(test_tup1, test_tup2):\r\n res = tuple(ele1 ** ele2 for ele1, ele2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "197", "test_cases": "assert find_exponentio((10, 4, 5, 6), (5, 6, 7, 5)) == (100000, 4096, 78125, 7776)\nassert find_exponentio((11, 5, 6, 7), (6, 7, 8, 6)) == (1771561, 78125, 1679616, 117649)\nassert find_exponentio((12, 6, 7, 8), (7, 8, 9, 7)) == (35831808, 1679616, 40353607, 2097152)", "difficulty": "code"} {"input": "Write a function to find the largest triangle that can be inscribed in an ellipse.", "answer": "import math\r\ndef largest_triangle(a,b): \r\n if (a < 0 or b < 0): \r\n return -1 \r\n area = (3 * math.sqrt(3) * pow(a, 2)) / (4 * b); \r\n return area", "source": "mbpp", "task_id": "198", "test_cases": "assert largest_triangle(4,2)==10.392304845413264\nassert largest_triangle(5,7)==4.639421805988064\nassert largest_triangle(9,1)==105.2220865598093", "difficulty": "code"} {"input": "Write a python function to find highest power of 2 less than or equal to given number.", "answer": "def highest_Power_of_2(n): \r\n res = 0; \r\n for i in range(n, 0, -1): \r\n if ((i & (i - 1)) == 0): \r\n res = i; \r\n break; \r\n return res;", "source": "mbpp", "task_id": "199", "test_cases": "assert highest_Power_of_2(10) == 8\nassert highest_Power_of_2(19) == 16\nassert highest_Power_of_2(32) == 32", "difficulty": "code"} {"input": "Write a function to find all index positions of the maximum values in a given list.", "answer": "def position_max(list1):\r\n max_val = max(list1)\r\n max_result = [i for i, j in enumerate(list1) if j == max_val]\r\n return max_result", "source": "mbpp", "task_id": "200", "test_cases": "assert position_max([12,33,23,10,67,89,45,667,23,12,11,10,54])==[7]\nassert position_max([1,2,2,2,4,4,4,5,5,5,5])==[7,8,9,10]\nassert position_max([2,1,5,6,8,3,4,9,10,11,8,12])==[11]", "difficulty": "code"} {"input": "Write a python function to check whether the elements in a list are same or not.", "answer": "def chkList(lst): \r\n return len(set(lst)) == 1", "source": "mbpp", "task_id": "201", "test_cases": "assert chkList(['one','one','one']) == True\nassert chkList(['one','Two','Three']) == False\nassert chkList(['bigdata','python','Django']) == False", "difficulty": "code"} {"input": "Write a function to remove even characters in a string.", "answer": "def remove_even(str1):\r\n str2 = ''\r\n for i in range(1, len(str1) + 1):\r\n if(i % 2 != 0):\r\n str2 = str2 + str1[i - 1]\r\n return str2", "source": "mbpp", "task_id": "202", "test_cases": "assert remove_even(\"python\")==(\"pto\")\nassert remove_even(\"program\")==(\"porm\")\nassert remove_even(\"language\")==(\"lnug\")", "difficulty": "code"} {"input": "Write a python function to find the hamming distance between given two integers.", "answer": "def hamming_Distance(n1,n2) : \r\n x = n1 ^ n2 \r\n setBits = 0\r\n while (x > 0) : \r\n setBits += x & 1\r\n x >>= 1\r\n return setBits", "source": "mbpp", "task_id": "203", "test_cases": "assert hamming_Distance(4,8) == 2\nassert hamming_Distance(2,4) == 2\nassert hamming_Distance(1,2) == 2", "difficulty": "code"} {"input": "Write a python function to count the occurrence of a given character in a string.", "answer": "def count(s,c) : \r\n res = 0 \r\n for i in range(len(s)) : \r\n if (s[i] == c): \r\n res = res + 1\r\n return res", "source": "mbpp", "task_id": "204", "test_cases": "assert count(\"abcc\",\"c\") == 2\nassert count(\"ababca\",\"a\") == 3\nassert count(\"mnmm0pm\",\"m\") == 4", "difficulty": "code"} {"input": "Write a function to find the inversions of tuple elements in the given tuple list.", "answer": "def inversion_elements(test_tup):\r\n res = tuple(list(map(lambda x: ~x, list(test_tup))))\r\n return (res)", "source": "mbpp", "task_id": "205", "test_cases": "assert inversion_elements((7, 8, 9, 1, 10, 7)) == (-8, -9, -10, -2, -11, -8)\nassert inversion_elements((2, 4, 5, 6, 1, 7)) == (-3, -5, -6, -7, -2, -8)\nassert inversion_elements((8, 9, 11, 14, 12, 13)) == (-9, -10, -12, -15, -13, -14)", "difficulty": "code"} {"input": "Write a function to perform the adjacent element concatenation in the given tuples.", "answer": "def concatenate_elements(test_tup):\r\n res = tuple(i + j for i, j in zip(test_tup, test_tup[1:]))\r\n return (res)", "source": "mbpp", "task_id": "206", "test_cases": "assert concatenate_elements((\"DSP \", \"IS \", \"BEST \", \"FOR \", \"ALL \", \"UTS\")) == ('DSP IS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL UTS')\nassert concatenate_elements((\"RES \", \"IS \", \"BEST \", \"FOR \", \"ALL \", \"QESR\")) == ('RES IS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL QESR')\nassert concatenate_elements((\"MSAM\", \"IS \", \"BEST \", \"FOR \", \"ALL \", \"SKD\")) == ('MSAMIS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL SKD')", "difficulty": "code"} {"input": "Write a function to count the longest repeating subsequences such that the two subsequences don’t have same string characters at same positions.", "answer": "def find_longest_repeating_subseq(str): \r\n\tn = len(str) \r\n\tdp = [[0 for k in range(n+1)] for l in range(n+1)] \r\n\tfor i in range(1, n+1): \r\n\t\tfor j in range(1, n+1): \r\n\t\t\tif (str[i-1] == str[j-1] and i != j): \r\n\t\t\t\tdp[i][j] = 1 + dp[i-1][j-1] \r\n\t\t\telse: \r\n\t\t\t\tdp[i][j] = max(dp[i][j-1], dp[i-1][j]) \r\n\treturn dp[n][n]", "source": "mbpp", "task_id": "207", "test_cases": "assert find_longest_repeating_subseq(\"AABEBCDD\") == 3\nassert find_longest_repeating_subseq(\"aabb\") == 2\nassert find_longest_repeating_subseq(\"aab\") == 1", "difficulty": "code"} {"input": "Write a function to check the given decimal with a precision of 2 by using regex.", "answer": "import re\r\ndef is_decimal(num):\r\n num_fetch = re.compile(r\"\"\"^[0-9]+(\\.[0-9]{1,2})?$\"\"\")\r\n result = num_fetch.search(num)\r\n return bool(result)", "source": "mbpp", "task_id": "208", "test_cases": "assert is_decimal('123.11') == True\nassert is_decimal('0.21') == True\nassert is_decimal('123.1214') == False", "difficulty": "code"} {"input": "Write a function to delete the smallest element from the given heap and then insert a new item.", "answer": "import heapq as hq\r\ndef heap_replace(heap,a):\r\n hq.heapify(heap)\r\n hq.heapreplace(heap, a)\r\n return heap", "source": "mbpp", "task_id": "209", "test_cases": "assert heap_replace( [25, 44, 68, 21, 39, 23, 89],21)==[21, 25, 23, 44, 39, 68, 89]\nassert heap_replace([25, 44, 68, 21, 39, 23, 89],110)== [23, 25, 68, 44, 39, 110, 89]\nassert heap_replace([25, 44, 68, 21, 39, 23, 89],500)==[23, 25, 68, 44, 39, 500, 89]", "difficulty": "code"} {"input": "Write a function to check that the given string contains only a certain set of characters(in this case a-z, a-z and 0-9) by using regex.", "answer": "import re\r\ndef is_allowed_specific_char(string):\r\n get_char = re.compile(r'[^a-zA-Z0-9.]')\r\n string = get_char.search(string)\r\n return not bool(string)", "source": "mbpp", "task_id": "210", "test_cases": "assert is_allowed_specific_char(\"ABCDEFabcdef123450\") == True\nassert is_allowed_specific_char(\"*&%@#!}{\") == False\nassert is_allowed_specific_char(\"HELLOhowareyou98765\") == True", "difficulty": "code"} {"input": "Write a python function to count numbers whose oth and nth bits are set.", "answer": "def count_Num(n): \r\n if (n == 1): \r\n return 1\r\n count = pow(2,n - 2) \r\n return count", "source": "mbpp", "task_id": "211", "test_cases": "assert count_Num(2) == 1\nassert count_Num(3) == 2\nassert count_Num(1) == 1", "difficulty": "code"} {"input": "Write a python function to find the sum of fourth power of n natural numbers.", "answer": "import math \r\ndef fourth_Power_Sum(n): \r\n sum = 0\r\n for i in range(1,n+1) : \r\n sum = sum + (i*i*i*i) \r\n return sum", "source": "mbpp", "task_id": "212", "test_cases": "assert fourth_Power_Sum(2) == 17\nassert fourth_Power_Sum(4) == 354\nassert fourth_Power_Sum(6) == 2275", "difficulty": "code"} {"input": "Write a function to perform the concatenation of two string tuples.", "answer": "def concatenate_strings(test_tup1, test_tup2):\r\n res = tuple(ele1 + ele2 for ele1, ele2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "213", "test_cases": "assert concatenate_strings((\"Manjeet\", \"Nikhil\", \"Akshat\"), (\" Singh\", \" Meherwal\", \" Garg\")) == ('Manjeet Singh', 'Nikhil Meherwal', 'Akshat Garg')\nassert concatenate_strings((\"Shaik\", \"Ayesha\", \"Sanya\"), (\" Dawood\", \" Begum\", \" Singh\")) == ('Shaik Dawood', 'Ayesha Begum', 'Sanya Singh')\nassert concatenate_strings((\"Harpreet\", \"Priyanka\", \"Muskan\"), (\"Kour\", \" Agarwal\", \"Sethi\")) == ('HarpreetKour', 'Priyanka Agarwal', 'MuskanSethi')", "difficulty": "code"} {"input": "Write a function to convert radians to degrees.", "answer": "import math\r\ndef degree_radian(radian):\r\n degree = radian*(180/math.pi)\r\n return degree", "source": "mbpp", "task_id": "214", "test_cases": "assert degree_radian(90)==5156.620156177409\nassert degree_radian(60)==3437.746770784939\nassert degree_radian(120)==6875.493541569878", "difficulty": "code"} {"input": "Write a function to decode a run-length encoded given list.", "answer": "def decode_list(alist):\r\n def aux(g):\r\n if isinstance(g, list):\r\n return [(g[1], range(g[0]))]\r\n else:\r\n return [(g, [0])]\r\n return [x for g in alist for x, R in aux(g) for i in R]", "source": "mbpp", "task_id": "215", "test_cases": "assert decode_list([[2, 1], 2, 3, [2, 4], 5,1])==[1,1,2,3,4,4,5,1]\nassert decode_list(['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', [2, 'l'], 'y'])==['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', 'l', 'l', 'y']\nassert decode_list(['p', 'y', 't', 'h', 'o', 'n'])==['p', 'y', 't', 'h', 'o', 'n']", "difficulty": "code"} {"input": "Write a function to check if a nested list is a subset of another nested list.", "answer": "def check_subset_list(list1, list2): \r\n l1, l2 = list1[0], list2[0] \r\n exist = True\r\n for i in list2: \r\n if i not in list1: \r\n exist = False\r\n return exist", "source": "mbpp", "task_id": "216", "test_cases": "assert check_subset_list([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14],[[12, 18, 23, 25, 45], [7, 11, 19, 24, 28], [1, 5, 8, 18, 15, 16]])==False\nassert check_subset_list([[2, 3, 1], [4, 5], [6, 8]],[[4, 5], [6, 8]])==True\nassert check_subset_list([['a', 'b'], ['e'], ['c', 'd']],[['g']])==False", "difficulty": "code"} {"input": "Write a python function to find the first repeated character in a given string.", "answer": "def first_Repeated_Char(str): \r\n h = {}\r\n for ch in str:\r\n if ch in h: \r\n return ch;\r\n else: \r\n h[ch] = 0\r\n return '\\0'", "source": "mbpp", "task_id": "217", "test_cases": "assert first_Repeated_Char(\"Google\") == \"o\"\nassert first_Repeated_Char(\"data\") == \"a\"\nassert first_Repeated_Char(\"python\") == '\\0'", "difficulty": "code"} {"input": "Write a python function to find the minimum operations required to make two numbers equal.", "answer": "import math \r\ndef min_Operations(A,B): \r\n if (A > B): \r\n swap(A,B) \r\n B = B // math.gcd(A,B); \r\n return B - 1", "source": "mbpp", "task_id": "218", "test_cases": "assert min_Operations(2,4) == 1\nassert min_Operations(4,10) == 4\nassert min_Operations(1,4) == 3", "difficulty": "code"} {"input": "Write a function to extract maximum and minimum k elements in the given tuple.", "answer": "def extract_min_max(test_tup, K):\r\n res = []\r\n test_tup = list(test_tup)\r\n temp = sorted(test_tup)\r\n for idx, val in enumerate(temp):\r\n if idx < K or idx >= len(temp) - K:\r\n res.append(val)\r\n res = tuple(res)\r\n return (res)", "source": "mbpp", "task_id": "219", "test_cases": "assert extract_min_max((5, 20, 3, 7, 6, 8), 2) == (3, 5, 8, 20)\nassert extract_min_max((4, 5, 6, 1, 2, 7), 3) == (1, 2, 4, 5, 6, 7)\nassert extract_min_max((2, 3, 4, 8, 9, 11, 7), 4) == (2, 3, 4, 7, 8, 9, 11)", "difficulty": "code"} {"input": "Write a function to replace maximum n occurrences of spaces, commas, or dots with a colon.", "answer": "import re\r\ndef replace_max_specialchar(text,n):\r\n return (re.sub(\"[ ,.]\", \":\", text, n))", "source": "mbpp", "task_id": "220", "test_cases": "assert replace_max_specialchar('Python language, Programming language.',2)==('Python:language: Programming language.')\nassert replace_max_specialchar('a b c,d e f',3)==('a:b:c:d e f')\nassert replace_max_specialchar('ram reshma,ram rahim',1)==('ram:reshma,ram rahim')", "difficulty": "code"} {"input": "Write a python function to find the first even number in a given list of numbers.", "answer": "def first_even(nums):\r\n first_even = next((el for el in nums if el%2==0),-1)\r\n return first_even", "source": "mbpp", "task_id": "221", "test_cases": "assert first_even ([1, 3, 5, 7, 4, 1, 6, 8]) == 4\nassert first_even([2, 3, 4]) == 2\nassert first_even([5, 6, 7]) == 6", "difficulty": "code"} {"input": "Write a function to check if all the elements in tuple have same data type or not.", "answer": "def check_type(test_tuple):\r\n res = True\r\n for ele in test_tuple:\r\n if not isinstance(ele, type(test_tuple[0])):\r\n res = False\r\n break\r\n return (res)", "source": "mbpp", "task_id": "222", "test_cases": "assert check_type((5, 6, 7, 3, 5, 6) ) == True\nassert check_type((1, 2, \"4\") ) == False\nassert check_type((3, 2, 1, 4, 5) ) == True", "difficulty": "code"} {"input": "Write a function to check for majority element in the given sorted array.", "answer": "def is_majority(arr, n, x):\r\n\ti = binary_search(arr, 0, n-1, x)\r\n\tif i == -1:\r\n\t\treturn False\r\n\tif ((i + n//2) <= (n -1)) and arr[i + n//2] == x:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\ndef binary_search(arr, low, high, x):\r\n\tif high >= low:\r\n\t\tmid = (low + high)//2 \r\n\t\tif (mid == 0 or x > arr[mid-1]) and (arr[mid] == x):\r\n\t\t\treturn mid\r\n\t\telif x > arr[mid]:\r\n\t\t\treturn binary_search(arr, (mid + 1), high, x)\r\n\t\telse:\r\n\t\t\treturn binary_search(arr, low, (mid -1), x)\r\n\treturn -1", "source": "mbpp", "task_id": "223", "test_cases": "assert is_majority([1, 2, 3, 3, 3, 3, 10], 7, 3) == True\nassert is_majority([1, 1, 2, 4, 4, 4, 6, 6], 8, 4) == False\nassert is_majority([1, 1, 1, 2, 2], 5, 1) == True", "difficulty": "code"} {"input": "Write a python function to count set bits of a given number.", "answer": "def count_Set_Bits(n): \r\n count = 0\r\n while (n): \r\n count += n & 1\r\n n >>= 1\r\n return count", "source": "mbpp", "task_id": "224", "test_cases": "assert count_Set_Bits(2) == 1\nassert count_Set_Bits(4) == 1\nassert count_Set_Bits(6) == 2", "difficulty": "code"} {"input": "Write a python function to find the minimum element in a sorted and rotated array.", "answer": "def find_Min(arr,low,high): \r\n while (low < high): \r\n mid = low + (high - low) // 2; \r\n if (arr[mid] == arr[high]): \r\n high -= 1; \r\n elif (arr[mid] > arr[high]): \r\n low = mid + 1; \r\n else: \r\n high = mid; \r\n return arr[high];", "source": "mbpp", "task_id": "225", "test_cases": "assert find_Min([1,2,3,4,5],0,4) == 1\nassert find_Min([4,6,8],0,2) == 4\nassert find_Min([2,3,5,7,9],0,4) == 2", "difficulty": "code"} {"input": "Write a python function to remove the characters which have odd index values of a given string.", "answer": "def odd_values_string(str):\r\n result = \"\" \r\n for i in range(len(str)):\r\n if i % 2 == 0:\r\n result = result + str[i]\r\n return result", "source": "mbpp", "task_id": "226", "test_cases": "assert odd_values_string('abcdef') == 'ace'\nassert odd_values_string('python') == 'pto'\nassert odd_values_string('data') == 'dt'", "difficulty": "code"} {"input": "Write a function to find minimum of three numbers.", "answer": "def min_of_three(a,b,c): \r\n if (a <= b) and (a <= c): \r\n smallest = a \r\n elif (b <= a) and (b <= c): \r\n smallest = b \r\n else: \r\n smallest = c \r\n return smallest", "source": "mbpp", "task_id": "227", "test_cases": "assert min_of_three(10,20,0)==0\nassert min_of_three(19,15,18)==15\nassert min_of_three(-10,-20,-30)==-30", "difficulty": "code"} {"input": "Write a python function to check whether all the bits are unset in the given range or not.", "answer": "def all_Bits_Set_In_The_Given_Range(n,l,r): \r\n num = (((1 << r) - 1) ^ ((1 << (l - 1)) - 1)) \r\n new_num = n & num\r\n if (new_num == 0): \r\n return True\r\n return False", "source": "mbpp", "task_id": "228", "test_cases": "assert all_Bits_Set_In_The_Given_Range(4,1,2) == True\nassert all_Bits_Set_In_The_Given_Range(17,2,4) == True\nassert all_Bits_Set_In_The_Given_Range(39,4,6) == False", "difficulty": "code"} {"input": "Write a function to re-arrange the elements of the given array so that all negative elements appear before positive ones.", "answer": "def re_arrange_array(arr, n):\r\n j=0\r\n for i in range(0, n):\r\n if (arr[i] < 0):\r\n temp = arr[i]\r\n arr[i] = arr[j]\r\n arr[j] = temp\r\n j = j + 1\r\n return arr", "source": "mbpp", "task_id": "229", "test_cases": "assert re_arrange_array([-1, 2, -3, 4, 5, 6, -7, 8, 9], 9) == [-1, -3, -7, 4, 5, 6, 2, 8, 9]\nassert re_arrange_array([12, -14, -26, 13, 15], 5) == [-14, -26, 12, 13, 15]\nassert re_arrange_array([10, 24, 36, -42, -39, -78, 85], 7) == [-42, -39, -78, 10, 24, 36, 85]", "difficulty": "code"} {"input": "Write a function to replace blank spaces with any character in a string.", "answer": "def replace_blank(str1,char):\r\n str2 = str1.replace(' ', char)\r\n return str2", "source": "mbpp", "task_id": "230", "test_cases": "assert replace_blank(\"hello people\",'@')==(\"hello@people\")\nassert replace_blank(\"python program language\",'$')==(\"python$program$language\")\nassert replace_blank(\"blank space\",\"-\")==(\"blank-space\")", "difficulty": "code"} {"input": "Write a function to find the maximum sum in the given right triangle of numbers.", "answer": "def max_sum(tri, n): \r\n\tif n > 1: \r\n\t\ttri[1][1] = tri[1][1]+tri[0][0] \r\n\t\ttri[1][0] = tri[1][0]+tri[0][0] \r\n\tfor i in range(2, n): \r\n\t\ttri[i][0] = tri[i][0] + tri[i-1][0] \r\n\t\ttri[i][i] = tri[i][i] + tri[i-1][i-1] \r\n\t\tfor j in range(1, i): \r\n\t\t\tif tri[i][j]+tri[i-1][j-1] >= tri[i][j]+tri[i-1][j]: \r\n\t\t\t\ttri[i][j] = tri[i][j] + tri[i-1][j-1] \r\n\t\t\telse: \r\n\t\t\t\ttri[i][j] = tri[i][j]+tri[i-1][j] \r\n\treturn (max(tri[n-1]))", "source": "mbpp", "task_id": "231", "test_cases": "assert max_sum([[1], [2,1], [3,3,2]], 3) == 6\nassert max_sum([[1], [1, 2], [4, 1, 12]], 3) == 15 \nassert max_sum([[2], [3,2], [13,23,12]], 3) == 28", "difficulty": "code"} {"input": "Write a function to get the n largest items from a dataset.", "answer": "import heapq\r\ndef larg_nnum(list1,n):\r\n largest=heapq.nlargest(n,list1)\r\n return largest", "source": "mbpp", "task_id": "232", "test_cases": "assert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],2)==[100,90]\nassert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],5)==[100,90,80,70,60]\nassert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],3)==[100,90,80]", "difficulty": "code"} {"input": "Write a function to find the lateral surface area of a cylinder.", "answer": "def lateralsuface_cylinder(r,h):\r\n lateralsurface= 2*3.1415*r*h\r\n return lateralsurface", "source": "mbpp", "task_id": "233", "test_cases": "assert lateralsuface_cylinder(10,5)==314.15000000000003\nassert lateralsuface_cylinder(4,5)==125.66000000000001\nassert lateralsuface_cylinder(4,10)==251.32000000000002", "difficulty": "code"} {"input": "Write a function to find the volume of a cube.", "answer": "def volume_cube(l):\r\n volume = l * l * l\r\n return volume", "source": "mbpp", "task_id": "234", "test_cases": "assert volume_cube(3)==27\nassert volume_cube(2)==8\nassert volume_cube(5)==125", "difficulty": "code"} {"input": "Write a python function to set all even bits of a given number.", "answer": "def even_bit_set_number(n): \r\n count = 0;res = 0;temp = n \r\n while(temp > 0): \r\n if (count % 2 == 1): \r\n res |= (1 << count)\r\n count+=1\r\n temp >>= 1\r\n return (n | res)", "source": "mbpp", "task_id": "235", "test_cases": "assert even_bit_set_number(10) == 10\nassert even_bit_set_number(20) == 30\nassert even_bit_set_number(30) == 30", "difficulty": "code"} {"input": "Write a python function to count the maximum number of equilateral triangles that can be formed within a given equilateral triangle.", "answer": "def No_of_Triangle(N,K):\r\n if (N < K):\r\n return -1;\r\n else:\r\n Tri_up = 0;\r\n Tri_up = ((N - K + 1) *(N - K + 2)) // 2;\r\n Tri_down = 0;\r\n Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;\r\n return Tri_up + Tri_down;", "source": "mbpp", "task_id": "236", "test_cases": "assert No_of_Triangle(4,2) == 7\nassert No_of_Triangle(4,3) == 3\nassert No_of_Triangle(1,3) == -1", "difficulty": "code"} {"input": "Write a function to check the occurrences of records which occur similar times in the given tuples.", "answer": "from collections import Counter \r\ndef check_occurences(test_list):\r\n res = dict(Counter(tuple(ele) for ele in map(sorted, test_list)))\r\n return (res)", "source": "mbpp", "task_id": "237", "test_cases": "assert check_occurences([(3, 1), (1, 3), (2, 5), (5, 2), (6, 3)] ) == {(1, 3): 2, (2, 5): 2, (3, 6): 1}\nassert check_occurences([(4, 2), (2, 4), (3, 6), (6, 3), (7, 4)] ) == {(2, 4): 2, (3, 6): 2, (4, 7): 1}\nassert check_occurences([(13, 2), (11, 23), (12, 25), (25, 12), (16, 23)] ) == {(2, 13): 1, (11, 23): 1, (12, 25): 2, (16, 23): 1}", "difficulty": "code"} {"input": "Write a python function to count number of non-empty substrings of a given string.", "answer": "def number_of_substrings(str): \r\n\tstr_len = len(str); \r\n\treturn int(str_len * (str_len + 1) / 2);", "source": "mbpp", "task_id": "238", "test_cases": "assert number_of_substrings(\"abc\") == 6\nassert number_of_substrings(\"abcd\") == 10\nassert number_of_substrings(\"abcde\") == 15", "difficulty": "code"} {"input": "Write a function to find the number of possible sequences of length n such that each of the next element is greater than or equal to twice of the previous element but less than or equal to m.", "answer": "def get_total_number_of_sequences(m,n): \r\n\tT=[[0 for i in range(n+1)] for i in range(m+1)] \r\n\tfor i in range(m+1): \r\n\t\tfor j in range(n+1): \r\n\t\t\tif i==0 or j==0: \r\n\t\t\t\tT[i][j]=0\r\n\t\t\telif i arr[j] and MSIBS[i] < MSIBS[j] + arr[i]: \r\n\t\t\t\tMSIBS[i] = MSIBS[j] + arr[i] \r\n\tMSDBS = arr[:] \r\n\tfor i in range(1, n + 1): \r\n\t\tfor j in range(1, i): \r\n\t\t\tif arr[-i] > arr[-j] and MSDBS[-i] < MSDBS[-j] + arr[-i]: \r\n\t\t\t\tMSDBS[-i] = MSDBS[-j] + arr[-i] \r\n\tmax_sum = float(\"-Inf\") \r\n\tfor i, j, k in zip(MSIBS, MSDBS, arr): \r\n\t\tmax_sum = max(max_sum, i + j - k) \r\n\treturn max_sum", "source": "mbpp", "task_id": "245", "test_cases": "assert max_sum([1, 15, 51, 45, 33, 100, 12, 18, 9], 9) == 194\nassert max_sum([80, 60, 30, 40, 20, 10], 6) == 210\nassert max_sum([2, 3 ,14, 16, 21, 23, 29, 30], 8) == 138", "difficulty": "code"} {"input": "Write a function for computing square roots using the babylonian method.", "answer": "def babylonian_squareroot(number):\r\n if(number == 0):\r\n return 0;\r\n g = number/2.0;\r\n g2 = g + 1;\r\n while(g != g2):\r\n n = number/ g;\r\n g2 = g;\r\n g = (g + n)/2;\r\n return g;", "source": "mbpp", "task_id": "246", "test_cases": "assert babylonian_squareroot(10)==3.162277660168379\nassert babylonian_squareroot(2)==1.414213562373095\nassert babylonian_squareroot(9)==3.0", "difficulty": "code"} {"input": "Write a function to find the longest palindromic subsequence in the given string.", "answer": "def lps(str): \r\n\tn = len(str) \r\n\tL = [[0 for x in range(n)] for x in range(n)] \r\n\tfor i in range(n): \r\n\t\tL[i][i] = 1\r\n\tfor cl in range(2, n+1): \r\n\t\tfor i in range(n-cl+1): \r\n\t\t\tj = i+cl-1\r\n\t\t\tif str[i] == str[j] and cl == 2: \r\n\t\t\t\tL[i][j] = 2\r\n\t\t\telif str[i] == str[j]: \r\n\t\t\t\tL[i][j] = L[i+1][j-1] + 2\r\n\t\t\telse: \r\n\t\t\t\tL[i][j] = max(L[i][j-1], L[i+1][j]); \r\n\treturn L[0][n-1]", "source": "mbpp", "task_id": "247", "test_cases": "assert lps(\"TENS FOR TENS\") == 5 \nassert lps(\"CARDIO FOR CARDS\") == 7\nassert lps(\"PART OF THE JOURNEY IS PART\") == 9 ", "difficulty": "code"} {"input": "Write a function to calculate the harmonic sum of n-1.", "answer": "def harmonic_sum(n):\r\n if n < 2:\r\n return 1\r\n else:\r\n return 1 / n + (harmonic_sum(n - 1))", "source": "mbpp", "task_id": "248", "test_cases": "assert harmonic_sum(7) == 2.5928571428571425\nassert harmonic_sum(4) == 2.083333333333333\nassert harmonic_sum(19) == 3.547739657143682", "difficulty": "code"} {"input": "Write a function to find the intersection of two arrays using lambda function.", "answer": "def intersection_array(array_nums1,array_nums2):\r\n result = list(filter(lambda x: x in array_nums1, array_nums2)) \r\n return result", "source": "mbpp", "task_id": "249", "test_cases": "assert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[1, 2, 4, 8, 9])==[1, 2, 8, 9]\nassert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[3,5,7,9])==[3,5,7,9]\nassert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[10,20,30,40])==[10]", "difficulty": "code"} {"input": "Write a python function to count the occcurences of an element in a tuple.", "answer": "def count_X(tup, x): \r\n count = 0\r\n for ele in tup: \r\n if (ele == x): \r\n count = count + 1\r\n return count", "source": "mbpp", "task_id": "250", "test_cases": "assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),4) == 0\nassert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),10) == 3\nassert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),8) == 4", "difficulty": "code"} {"input": "Write a function to insert an element before each element of a list.", "answer": "def insert_element(list,element):\r\n list = [v for elt in list for v in (element, elt)]\r\n return list", "source": "mbpp", "task_id": "251", "test_cases": "assert insert_element(['Red', 'Green', 'Black'] ,'c')==['c', 'Red', 'c', 'Green', 'c', 'Black'] \nassert insert_element(['python', 'java'] ,'program')==['program', 'python', 'program', 'java'] \nassert insert_element(['happy', 'sad'] ,'laugh')==['laugh', 'happy', 'laugh', 'sad'] ", "difficulty": "code"} {"input": "Write a python function to convert complex numbers to polar coordinates.", "answer": "import cmath \r\ndef convert(numbers): \r\n num = cmath.polar(numbers) \r\n return (num)", "source": "mbpp", "task_id": "252", "test_cases": "assert convert(1) == (1.0, 0.0)\nassert convert(4) == (4.0,0.0)\nassert convert(5) == (5.0,0.0)", "difficulty": "code"} {"input": "Write a python function to count integers from a given list.", "answer": "def count_integer(list1):\r\n ctr = 0\r\n for i in list1:\r\n if isinstance(i, int):\r\n ctr = ctr + 1\r\n return ctr", "source": "mbpp", "task_id": "253", "test_cases": "assert count_integer([1,2,'abc',1.2]) == 2\nassert count_integer([1,2,3]) == 3\nassert count_integer([1,1.2,4,5.1]) == 2", "difficulty": "code"} {"input": "Write a function to find all words starting with 'a' or 'e' in a given string.", "answer": "import re\r\ndef words_ae(text):\r\n list = re.findall(\"[ae]\\w+\", text)\r\n return list", "source": "mbpp", "task_id": "254", "test_cases": "assert words_ae(\"python programe\")==['ame']\nassert words_ae(\"python programe language\")==['ame','anguage']\nassert words_ae(\"assert statement\")==['assert', 'atement']", "difficulty": "code"} {"input": "Write a function to choose specified number of colours from three different colours and generate all the combinations with repetitions.", "answer": "from itertools import combinations_with_replacement \r\ndef combinations_colors(l, n):\r\n return list(combinations_with_replacement(l,n))", "source": "mbpp", "task_id": "255", "test_cases": "assert combinations_colors( [\"Red\",\"Green\",\"Blue\"],1)==[('Red',), ('Green',), ('Blue',)]\nassert combinations_colors( [\"Red\",\"Green\",\"Blue\"],2)==[('Red', 'Red'), ('Red', 'Green'), ('Red', 'Blue'), ('Green', 'Green'), ('Green', 'Blue'), ('Blue', 'Blue')]\nassert combinations_colors( [\"Red\",\"Green\",\"Blue\"],3)==[('Red', 'Red', 'Red'), ('Red', 'Red', 'Green'), ('Red', 'Red', 'Blue'), ('Red', 'Green', 'Green'), ('Red', 'Green', 'Blue'), ('Red', 'Blue', 'Blue'), ('Green', 'Green', 'Green'), ('Green', 'Green', 'Blue'), ('Green', 'Blue', 'Blue'), ('Blue', 'Blue', 'Blue')]", "difficulty": "code"} {"input": "Write a python function to count the number of prime numbers less than a given non-negative number.", "answer": "def count_Primes_nums(n):\r\n ctr = 0\r\n for num in range(n):\r\n if num <= 1:\r\n continue\r\n for i in range(2,num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n ctr += 1\r\n return ctr", "source": "mbpp", "task_id": "256", "test_cases": "assert count_Primes_nums(5) == 2\nassert count_Primes_nums(10) == 4\nassert count_Primes_nums(100) == 25", "difficulty": "code"} {"input": "Write a function to swap two numbers.", "answer": "def swap_numbers(a,b):\r\n temp = a\r\n a = b\r\n b = temp\r\n return (a,b)", "source": "mbpp", "task_id": "257", "test_cases": "assert swap_numbers(10,20)==(20,10)\nassert swap_numbers(15,17)==(17,15)\nassert swap_numbers(100,200)==(200,100)", "difficulty": "code"} {"input": "Write a function to find number of odd elements in the given list using lambda function.", "answer": "def count_odd(array_nums):\r\n count_odd = len(list(filter(lambda x: (x%2 != 0) , array_nums)))\r\n return count_odd", "source": "mbpp", "task_id": "258", "test_cases": "assert count_odd([1, 2, 3, 5, 7, 8, 10])==4\nassert count_odd([10,15,14,13,-18,12,-20])==2\nassert count_odd([1, 2, 4, 8, 9])==2", "difficulty": "code"} {"input": "Write a function to maximize the given two tuples.", "answer": "def maximize_elements(test_tup1, test_tup2):\r\n res = tuple(tuple(max(a, b) for a, b in zip(tup1, tup2))\r\n for tup1, tup2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "259", "test_cases": "assert maximize_elements(((1, 3), (4, 5), (2, 9), (1, 10)), ((6, 7), (3, 9), (1, 1), (7, 3))) == ((6, 7), (4, 9), (2, 9), (7, 10))\nassert maximize_elements(((2, 4), (5, 6), (3, 10), (2, 11)), ((7, 8), (4, 10), (2, 2), (8, 4))) == ((7, 8), (5, 10), (3, 10), (8, 11))\nassert maximize_elements(((3, 5), (6, 7), (4, 11), (3, 12)), ((8, 9), (5, 11), (3, 3), (9, 5))) == ((8, 9), (6, 11), (4, 11), (9, 12))", "difficulty": "code"} {"input": "Write a function to find the nth newman–shanks–williams prime number.", "answer": "def newman_prime(n): \r\n\tif n == 0 or n == 1: \r\n\t\treturn 1\r\n\treturn 2 * newman_prime(n - 1) + newman_prime(n - 2)", "source": "mbpp", "task_id": "260", "test_cases": "assert newman_prime(3) == 7 \nassert newman_prime(4) == 17\nassert newman_prime(5) == 41", "difficulty": "code"} {"input": "Write a function to perform mathematical division operation across the given tuples.", "answer": "def division_elements(test_tup1, test_tup2):\r\n res = tuple(ele1 // ele2 for ele1, ele2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "261", "test_cases": "assert division_elements((10, 4, 6, 9),(5, 2, 3, 3)) == (2, 2, 2, 3)\nassert division_elements((12, 6, 8, 16),(6, 3, 4, 4)) == (2, 2, 2, 4)\nassert division_elements((20, 14, 36, 18),(5, 7, 6, 9)) == (4, 2, 6, 2)", "difficulty": "code"} {"input": "Write a function to split a given list into two parts where the length of the first part of the list is given.", "answer": "def split_two_parts(list1, L):\r\n return list1[:L], list1[L:]", "source": "mbpp", "task_id": "262", "test_cases": "assert split_two_parts([1,1,2,3,4,4,5,1],3)==([1, 1, 2], [3, 4, 4, 5, 1])\nassert split_two_parts(['a', 'b', 'c', 'd'],2)==(['a', 'b'], ['c', 'd'])\nassert split_two_parts(['p', 'y', 't', 'h', 'o', 'n'],4)==(['p', 'y', 't', 'h'], ['o', 'n'])", "difficulty": "code"} {"input": "Write a function to merge two dictionaries.", "answer": "def merge_dict(d1,d2):\r\n d = d1.copy()\r\n d.update(d2)\r\n return d", "source": "mbpp", "task_id": "263", "test_cases": "assert merge_dict({'a': 100, 'b': 200},{'x': 300, 'y': 200})=={'x': 300, 'y': 200, 'a': 100, 'b': 200}\nassert merge_dict({'a':900,'b':900,'d':900},{'a':900,'b':900,'d':900})=={'a':900,'b':900,'d':900,'a':900,'b':900,'d':900}\nassert merge_dict({'a':10,'b':20},{'x':30,'y':40})=={'x':30,'y':40,'a':10,'b':20}", "difficulty": "code"} {"input": "Write a function to calculate a dog's age in dog's years.", "answer": "def dog_age(h_age):\r\n if h_age < 0:\r\n \texit()\r\n elif h_age <= 2:\r\n\t d_age = h_age * 10.5\r\n else:\r\n\t d_age = 21 + (h_age - 2)*4\r\n return d_age", "source": "mbpp", "task_id": "264", "test_cases": "assert dog_age(12)==61\nassert dog_age(15)==73\nassert dog_age(24)==109", "difficulty": "code"} {"input": "Write a function to split a list for every nth element.", "answer": "def list_split(S, step):\r\n return [S[i::step] for i in range(step)]", "source": "mbpp", "task_id": "265", "test_cases": "assert list_split(['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n'],3)==[['a', 'd', 'g', 'j', 'm'], ['b', 'e', 'h', 'k', 'n'], ['c', 'f', 'i', 'l']] \nassert list_split([1,2,3,4,5,6,7,8,9,10,11,12,13,14],3)==[[1,4,7,10,13], [2,5,8,11,14], [3,6,9,12]] \nassert list_split(['python','java','C','C++','DBMS','SQL'],2)==[['python', 'C', 'DBMS'], ['java', 'C++', 'SQL']] ", "difficulty": "code"} {"input": "Write a function to find the lateral surface area of a cube.", "answer": "def lateralsurface_cube(l):\r\n LSA = 4 * (l * l)\r\n return LSA", "source": "mbpp", "task_id": "266", "test_cases": "assert lateralsurface_cube(5)==100\nassert lateralsurface_cube(9)==324\nassert lateralsurface_cube(10)==400", "difficulty": "code"} {"input": "Write a python function to find the sum of squares of first n odd natural numbers.", "answer": "def square_Sum(n): \r\n return int(n*(4*n*n-1)/3)", "source": "mbpp", "task_id": "267", "test_cases": "assert square_Sum(2) == 10\nassert square_Sum(3) == 35\nassert square_Sum(4) == 84", "difficulty": "code"} {"input": "Write a function to find the n'th star number.", "answer": "def find_star_num(n): \r\n\treturn (6 * n * (n - 1) + 1)", "source": "mbpp", "task_id": "268", "test_cases": "assert find_star_num(3) == 37\nassert find_star_num(4) == 73\nassert find_star_num(5) == 121", "difficulty": "code"} {"input": "Write a function to find the ascii value of a character.", "answer": "def ascii_value(k):\r\n ch=k\r\n return ord(ch)", "source": "mbpp", "task_id": "269", "test_cases": "assert ascii_value('A')==65\nassert ascii_value('R')==82\nassert ascii_value('S')==83", "difficulty": "code"} {"input": "Write a python function to find the sum of even numbers at even positions.", "answer": "def sum_even_and_even_index(arr,n): \r\n i = 0\r\n sum = 0\r\n for i in range(0,n,2): \r\n if (arr[i] % 2 == 0) : \r\n sum += arr[i] \r\n return sum", "source": "mbpp", "task_id": "270", "test_cases": "assert sum_even_and_even_index([5, 6, 12, 1, 18, 8],6) == 30\nassert sum_even_and_even_index([3, 20, 17, 9, 2, 10, 18, 13, 6, 18],10) == 26\nassert sum_even_and_even_index([5, 6, 12, 1],4) == 12", "difficulty": "code"} {"input": "Write a python function to find the sum of fifth power of first n even natural numbers.", "answer": "def even_Power_Sum(n): \r\n sum = 0; \r\n for i in range(1,n+1): \r\n j = 2*i; \r\n sum = sum + (j*j*j*j*j); \r\n return sum;", "source": "mbpp", "task_id": "271", "test_cases": "assert even_Power_Sum(2) == 1056\nassert even_Power_Sum(3) == 8832\nassert even_Power_Sum(1) == 32", "difficulty": "code"} {"input": "Write a function to perfom the rear element extraction from list of tuples records.", "answer": "def rear_extract(test_list):\r\n res = [lis[-1] for lis in test_list]\r\n return (res)", "source": "mbpp", "task_id": "272", "test_cases": "assert rear_extract([(1, 'Rash', 21), (2, 'Varsha', 20), (3, 'Kil', 19)]) == [21, 20, 19]\nassert rear_extract([(1, 'Sai', 36), (2, 'Ayesha', 25), (3, 'Salman', 45)]) == [36, 25, 45]\nassert rear_extract([(1, 'Sudeep', 14), (2, 'Vandana', 36), (3, 'Dawood', 56)]) == [14, 36, 56]", "difficulty": "code"} {"input": "Write a function to substract the contents of one tuple with corresponding index of other tuple.", "answer": "def substract_elements(test_tup1, test_tup2):\r\n res = tuple(map(lambda i, j: i - j, test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "273", "test_cases": "assert substract_elements((10, 4, 5), (2, 5, 18)) == (8, -1, -13)\nassert substract_elements((11, 2, 3), (24, 45 ,16)) == (-13, -43, -13)\nassert substract_elements((7, 18, 9), (10, 11, 12)) == (-3, 7, -3)", "difficulty": "code"} {"input": "Write a python function to find sum of even index binomial coefficients.", "answer": "import math \r\ndef even_binomial_Coeff_Sum( n): \r\n return (1 << (n - 1))", "source": "mbpp", "task_id": "274", "test_cases": "assert even_binomial_Coeff_Sum(4) == 8\nassert even_binomial_Coeff_Sum(6) == 32\nassert even_binomial_Coeff_Sum(2) == 2", "difficulty": "code"} {"input": "Write a python function to find the position of the last removed element from the given array.", "answer": "import math as mt \r\ndef get_Position(a,n,m): \r\n for i in range(n): \r\n a[i] = (a[i] // m + (a[i] % m != 0)) \r\n result,maxx = -1,-1\r\n for i in range(n - 1,-1,-1): \r\n if (maxx < a[i]): \r\n maxx = a[i] \r\n result = i \r\n return result + 1", "source": "mbpp", "task_id": "275", "test_cases": "assert get_Position([2,5,4],3,2) == 2\nassert get_Position([4,3],2,2) == 2\nassert get_Position([1,2,3,4],4,1) == 4", "difficulty": "code"} {"input": "Write a function to find the volume of a cylinder.", "answer": "def volume_cylinder(r,h):\r\n volume=3.1415*r*r*h\r\n return volume", "source": "mbpp", "task_id": "276", "test_cases": "assert volume_cylinder(10,5)==1570.7500000000002\nassert volume_cylinder(4,5)==251.32000000000002\nassert volume_cylinder(4,10)==502.64000000000004", "difficulty": "code"} {"input": "Write a function to filter a dictionary based on values.", "answer": "def dict_filter(dict,n):\r\n result = {key:value for (key, value) in dict.items() if value >=n}\r\n return result", "source": "mbpp", "task_id": "277", "test_cases": "assert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},170)=={'Cierra Vega': 175, 'Alden Cantrell': 180, 'Pierre Cox': 190}\nassert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},180)=={ 'Alden Cantrell': 180, 'Pierre Cox': 190}\nassert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},190)=={ 'Pierre Cox': 190}", "difficulty": "code"} {"input": "Write a function to find the element count that occurs before the record in the given tuple.", "answer": "def count_first_elements(test_tup):\r\n for count, ele in enumerate(test_tup):\r\n if isinstance(ele, tuple):\r\n break\r\n return (count)", "source": "mbpp", "task_id": "278", "test_cases": "assert count_first_elements((1, 5, 7, (4, 6), 10) ) == 3\nassert count_first_elements((2, 9, (5, 7), 11) ) == 2\nassert count_first_elements((11, 15, 5, 8, (2, 3), 8) ) == 4", "difficulty": "code"} {"input": "Write a function to find the nth decagonal number.", "answer": "def is_num_decagonal(n): \r\n\treturn 4 * n * n - 3 * n", "source": "mbpp", "task_id": "279", "test_cases": "assert is_num_decagonal(3) == 27\nassert is_num_decagonal(7) == 175\nassert is_num_decagonal(10) == 370", "difficulty": "code"} {"input": "Write a function to search an element in the given array by using sequential search.", "answer": "def sequential_search(dlist, item):\r\n pos = 0\r\n found = False\r\n while pos < len(dlist) and not found:\r\n if dlist[pos] == item:\r\n found = True\r\n else:\r\n pos = pos + 1\r\n return found, pos", "source": "mbpp", "task_id": "280", "test_cases": "assert sequential_search([11,23,58,31,56,77,43,12,65,19],31) == (True, 3)\nassert sequential_search([12, 32, 45, 62, 35, 47, 44, 61],61) == (True, 7)\nassert sequential_search([9, 10, 17, 19, 22, 39, 48, 56],48) == (True, 6)", "difficulty": "code"} {"input": "Write a python function to check if the elements of a given list are unique or not.", "answer": "def all_unique(test_list):\r\n if len(test_list) > len(set(test_list)):\r\n return False\r\n return True", "source": "mbpp", "task_id": "281", "test_cases": "assert all_unique([1,2,3]) == True\nassert all_unique([1,2,1,2]) == False\nassert all_unique([1,2,3,4,5]) == True", "difficulty": "code"} {"input": "Write a function to substaract two lists using map and lambda function.", "answer": "def sub_list(nums1,nums2):\r\n result = map(lambda x, y: x - y, nums1, nums2)\r\n return list(result)", "source": "mbpp", "task_id": "282", "test_cases": "assert sub_list([1, 2, 3],[4,5,6])==[-3,-3,-3]\nassert sub_list([1,2],[3,4])==[-2,-2]\nassert sub_list([90,120],[50,70])==[40,50]", "difficulty": "code"} {"input": "Write a python function to check whether the frequency of each digit is less than or equal to the digit itself.", "answer": "def validate(n): \r\n for i in range(10): \r\n temp = n; \r\n count = 0; \r\n while (temp): \r\n if (temp % 10 == i): \r\n count+=1; \r\n if (count > i): \r\n return False\r\n temp //= 10; \r\n return True", "source": "mbpp", "task_id": "283", "test_cases": "assert validate(1234) == True\nassert validate(51241) == False\nassert validate(321) == True", "difficulty": "code"} {"input": "Write a function to check whether all items of a list are equal to a given string.", "answer": "def check_element(list,element):\r\n check_element=all(v== element for v in list)\r\n return check_element", "source": "mbpp", "task_id": "284", "test_cases": "assert check_element([\"green\", \"orange\", \"black\", \"white\"],'blue')==False\nassert check_element([1,2,3,4],7)==False\nassert check_element([\"green\", \"green\", \"green\", \"green\"],'green')==True", "difficulty": "code"} {"input": "Write a function that matches a string that has an a followed by two to three 'b'.", "answer": "import re\r\ndef text_match_two_three(text):\r\n patterns = 'ab{2,3}'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')", "source": "mbpp", "task_id": "285", "test_cases": "assert text_match_two_three(\"ac\")==('Not matched!')\nassert text_match_two_three(\"dc\")==('Not matched!')\nassert text_match_two_three(\"abbbba\")==('Found a match!')", "difficulty": "code"} {"input": "Write a function to find the largest sum of contiguous array in the modified array which is formed by repeating the given array k times.", "answer": "def max_sub_array_sum_repeated(a, n, k): \r\n\tmax_so_far = -2147483648\r\n\tmax_ending_here = 0\r\n\tfor i in range(n*k): \r\n\t\tmax_ending_here = max_ending_here + a[i%n] \r\n\t\tif (max_so_far < max_ending_here): \r\n\t\t\tmax_so_far = max_ending_here \r\n\t\tif (max_ending_here < 0): \r\n\t\t\tmax_ending_here = 0\r\n\treturn max_so_far", "source": "mbpp", "task_id": "286", "test_cases": "assert max_sub_array_sum_repeated([10, 20, -30, -1], 4, 3) == 30\nassert max_sub_array_sum_repeated([-1, 10, 20], 3, 2) == 59\nassert max_sub_array_sum_repeated([-1, -2, -3], 3, 3) == -1", "difficulty": "code"} {"input": "Write a python function to find the sum of squares of first n even natural numbers.", "answer": "def square_Sum(n): \r\n return int(2*n*(n+1)*(2*n+1)/3)", "source": "mbpp", "task_id": "287", "test_cases": "assert square_Sum(2) == 20\nassert square_Sum(3) == 56\nassert square_Sum(4) == 120", "difficulty": "code"} {"input": "Write a function to count array elements having modular inverse under given prime number p equal to itself.", "answer": "def modular_inverse(arr, N, P):\r\n\tcurrent_element = 0\r\n\tfor i in range(0, N):\r\n\t\tif ((arr[i] * arr[i]) % P == 1):\r\n\t\t\tcurrent_element = current_element + 1\r\n\treturn current_element", "source": "mbpp", "task_id": "288", "test_cases": "assert modular_inverse([ 1, 6, 4, 5 ], 4, 7) == 2\nassert modular_inverse([1, 3, 8, 12, 12], 5, 13) == 3\nassert modular_inverse([2, 3, 4, 5], 4, 6) == 1", "difficulty": "code"} {"input": "Write a python function to calculate the number of odd days in a given year.", "answer": "def odd_Days(N): \r\n hund1 = N // 100\r\n hund4 = N // 400\r\n leap = N >> 2\r\n ordd = N - leap \r\n if (hund1): \r\n ordd += hund1 \r\n leap -= hund1 \r\n if (hund4): \r\n ordd -= hund4 \r\n leap += hund4 \r\n days = ordd + leap * 2\r\n odd = days % 7\r\n return odd", "source": "mbpp", "task_id": "289", "test_cases": "assert odd_Days(100) == 5\nassert odd_Days(50) ==6\nassert odd_Days(75) == 2", "difficulty": "code"} {"input": "Write a function to find the list of lists with maximum length.", "answer": "def max_length(list1):\r\n max_length = max(len(x) for x in list1 ) \r\n max_list = max((x) for x in list1)\r\n return(max_length, max_list)", "source": "mbpp", "task_id": "290", "test_cases": "assert max_length([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(3, [13, 15, 17])\nassert max_length([[1], [5, 7], [10, 12, 14,15]])==(4, [10, 12, 14,15])\nassert max_length([[5], [15,20,25]])==(3, [15,20,25])", "difficulty": "code"} {"input": "Write a function to find out the number of ways of painting the fence such that at most 2 adjacent posts have the same color for the given fence with n posts and k colors.", "answer": "def count_no_of_ways(n, k): \r\n\tdp = [0] * (n + 1) \r\n\ttotal = k \r\n\tmod = 1000000007\r\n\tdp[1] = k \r\n\tdp[2] = k * k\t \r\n\tfor i in range(3,n+1): \r\n\t\tdp[i] = ((k - 1) * (dp[i - 1] + dp[i - 2])) % mod \r\n\treturn dp[n]", "source": "mbpp", "task_id": "291", "test_cases": "assert count_no_of_ways(2, 4) == 16\nassert count_no_of_ways(3, 2) == 6\nassert count_no_of_ways(4, 4) == 228", "difficulty": "code"} {"input": "Write a python function to find quotient of two numbers.", "answer": "def find(n,m): \r\n q = n//m \r\n return (q)", "source": "mbpp", "task_id": "292", "test_cases": "assert find(10,3) == 3\nassert find(4,2) == 2\nassert find(20,5) == 4", "difficulty": "code"} {"input": "Write a function to find the third side of a right angled triangle.", "answer": "import math\r\ndef otherside_rightangle(w,h):\r\n s=math.sqrt((w*w)+(h*h))\r\n return s", "source": "mbpp", "task_id": "293", "test_cases": "assert otherside_rightangle(7,8)==10.63014581273465\nassert otherside_rightangle(3,4)==5\nassert otherside_rightangle(7,15)==16.55294535724685", "difficulty": "code"} {"input": "Write a function to find the maximum value in a given heterogeneous list.", "answer": "def max_val(listval):\r\n max_val = max(i for i in listval if isinstance(i, int)) \r\n return(max_val)", "source": "mbpp", "task_id": "294", "test_cases": "assert max_val(['Python', 3, 2, 4, 5, 'version'])==5\nassert max_val(['Python', 15, 20, 25])==25\nassert max_val(['Python', 30, 20, 40, 50, 'version'])==50", "difficulty": "code"} {"input": "Write a function to return the sum of all divisors of a number.", "answer": "def sum_div(number):\r\n divisors = [1]\r\n for i in range(2, number):\r\n if (number % i)==0:\r\n divisors.append(i)\r\n return sum(divisors)", "source": "mbpp", "task_id": "295", "test_cases": "assert sum_div(8)==7\nassert sum_div(12)==16\nassert sum_div(7)==1", "difficulty": "code"} {"input": "Write a python function to count inversions in an array.", "answer": "def get_Inv_Count(arr,n): \r\n inv_count = 0\r\n for i in range(n): \r\n for j in range(i + 1,n): \r\n if (arr[i] > arr[j]): \r\n inv_count += 1\r\n return inv_count", "source": "mbpp", "task_id": "296", "test_cases": "assert get_Inv_Count([1,20,6,4,5],5) == 5\nassert get_Inv_Count([1,2,1],3) == 1\nassert get_Inv_Count([1,2,5,6,1],5) == 3", "difficulty": "code"} {"input": "Write a function to flatten a given nested list structure.", "answer": "def flatten_list(list1):\r\n result_list = []\r\n if not list1: return result_list\r\n stack = [list(list1)]\r\n while stack:\r\n c_num = stack.pop()\r\n next = c_num.pop()\r\n if c_num: stack.append(c_num)\r\n if isinstance(next, list):\r\n if next: stack.append(list(next))\r\n else: result_list.append(next)\r\n result_list.reverse()\r\n return result_list", "source": "mbpp", "task_id": "297", "test_cases": "assert flatten_list([0, 10, [20, 30], 40, 50, [60, 70, 80], [90, 100, 110, 120]])==[0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120]\nassert flatten_list([[10, 20], [40], [30, 56, 25], [10, 20], [33], [40]])==[10, 20, 40, 30, 56, 25, 10, 20, 33, 40]\nassert flatten_list([[1,2,3], [4,5,6], [10,11,12], [7,8,9]])==[1, 2, 3, 4, 5, 6, 10, 11, 12, 7, 8, 9]", "difficulty": "code"} {"input": "Write a function to find the nested list elements which are present in another list.", "answer": "def intersection_nested_lists(l1, l2):\r\n result = [[n for n in lst if n in l1] for lst in l2]\r\n return result", "source": "mbpp", "task_id": "298", "test_cases": "assert intersection_nested_lists( [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14],[[12, 18, 23, 25, 45], [7, 11, 19, 24, 28], [1, 5, 8, 18, 15, 16]])==[[12], [7, 11], [1, 5, 8]]\nassert intersection_nested_lists([[2, 3, 1], [4, 5], [6, 8]], [[4, 5], [6, 8]])==[[], []]\nassert intersection_nested_lists(['john','amal','joel','george'],[['john'],['jack','john','mary'],['howard','john'],['jude']])==[['john'], ['john'], ['john'], []]", "difficulty": "code"} {"input": "Write a function to calculate the maximum aggregate from the list of tuples.", "answer": "from collections import defaultdict\r\ndef max_aggregate(stdata):\r\n temp = defaultdict(int)\r\n for name, marks in stdata:\r\n temp[name] += marks\r\n return max(temp.items(), key=lambda x: x[1])", "source": "mbpp", "task_id": "299", "test_cases": "assert max_aggregate([('Juan Whelan',90),('Sabah Colley',88),('Peter Nichols',7),('Juan Whelan',122),('Sabah Colley',84)])==('Juan Whelan', 212)\nassert max_aggregate([('Juan Whelan',50),('Sabah Colley',48),('Peter Nichols',37),('Juan Whelan',22),('Sabah Colley',14)])==('Juan Whelan', 72)\nassert max_aggregate([('Juan Whelan',10),('Sabah Colley',20),('Peter Nichols',30),('Juan Whelan',40),('Sabah Colley',50)])==('Sabah Colley', 70)", "difficulty": "code"} {"input": "Write a function to find the count of all binary sequences of length 2n such that sum of first n bits is same as sum of last n bits.", "answer": "def count_binary_seq(n): \r\n\tnCr = 1\r\n\tres = 1\r\n\tfor r in range(1, n + 1): \r\n\t\tnCr = (nCr * (n + 1 - r)) / r \r\n\t\tres += nCr * nCr \r\n\treturn res", "source": "mbpp", "task_id": "300", "test_cases": "assert count_binary_seq(1) == 2.0\nassert count_binary_seq(2) == 6.0\nassert count_binary_seq(3) == 20.0", "difficulty": "code"} {"input": "Write a function to find the depth of a dictionary.", "answer": "def dict_depth(d):\r\n if isinstance(d, dict):\r\n return 1 + (max(map(dict_depth, d.values())) if d else 0)\r\n return 0", "source": "mbpp", "task_id": "301", "test_cases": "assert dict_depth({'a':1, 'b': {'c': {'d': {}}}})==4\nassert dict_depth({'a':1, 'b': {'c':'python'}})==2\nassert dict_depth({1: 'Sun', 2: {3: {4:'Mon'}}})==3", "difficulty": "code"} {"input": "Write a python function to find the most significant bit number which is also a set bit.", "answer": "def set_Bit_Number(n): \r\n if (n == 0): \r\n return 0; \r\n msb = 0; \r\n n = int(n / 2); \r\n while (n > 0): \r\n n = int(n / 2); \r\n msb += 1; \r\n return (1 << msb)", "source": "mbpp", "task_id": "302", "test_cases": "assert set_Bit_Number(6) == 4\nassert set_Bit_Number(10) == 8\nassert set_Bit_Number(18) == 16", "difficulty": "code"} {"input": "Write a python function to check whether the count of inversion of two types are same or not.", "answer": "import sys \r\ndef solve(a,n): \r\n mx = -sys.maxsize - 1\r\n for j in range(1,n): \r\n if (mx > a[j]): \r\n return False \r\n mx = max(mx,a[j - 1]) \r\n return True", "source": "mbpp", "task_id": "303", "test_cases": "assert solve([1,0,2],3) == True\nassert solve([1,2,0],3) == False\nassert solve([1,2,1],3) == True", "difficulty": "code"} {"input": "Write a python function to find element at a given index after number of rotations.", "answer": "def find_Element(arr,ranges,rotations,index) : \r\n for i in range(rotations - 1,-1,-1 ) : \r\n left = ranges[i][0] \r\n right = ranges[i][1] \r\n if (left <= index and right >= index) : \r\n if (index == left) : \r\n index = right \r\n else : \r\n index = index - 1 \r\n return arr[index]", "source": "mbpp", "task_id": "304", "test_cases": "assert find_Element([1,2,3,4,5],[[0,2],[0,3]],2,1) == 3\nassert find_Element([1,2,3,4],[[0,1],[0,2]],1,2) == 3\nassert find_Element([1,2,3,4,5,6],[[0,1],[0,2]],1,1) == 1", "difficulty": "code"} {"input": "Write a function to match two words from a list of words starting with letter 'p'.", "answer": "import re\r\ndef start_withp(words):\r\n for w in words:\r\n m = re.match(\"(P\\w+)\\W(P\\w+)\", w)\r\n if m:\r\n return m.groups()", "source": "mbpp", "task_id": "305", "test_cases": "assert start_withp([\"Python PHP\", \"Java JavaScript\", \"c c++\"])==('Python', 'PHP')\nassert start_withp([\"Python Programming\",\"Java Programming\"])==('Python','Programming')\nassert start_withp([\"Pqrst Pqr\",\"qrstuv\"])==('Pqrst','Pqr')", "difficulty": "code"} {"input": "Write a function to find the maximum sum of increasing subsequence from prefix till ith index and also including a given kth element which is after i, i.e., k > i .", "answer": "def max_sum_increasing_subseq(a, n, index, k):\r\n\tdp = [[0 for i in range(n)] \r\n\t\t\tfor i in range(n)]\r\n\tfor i in range(n):\r\n\t\tif a[i] > a[0]:\r\n\t\t\tdp[0][i] = a[i] + a[0]\r\n\t\telse:\r\n\t\t\tdp[0][i] = a[i]\r\n\tfor i in range(1, n):\r\n\t\tfor j in range(n):\r\n\t\t\tif a[j] > a[i] and j > i:\r\n\t\t\t\tif dp[i - 1][i] + a[j] > dp[i - 1][j]:\r\n\t\t\t\t\tdp[i][j] = dp[i - 1][i] + a[j]\r\n\t\t\t\telse:\r\n\t\t\t\t\tdp[i][j] = dp[i - 1][j]\r\n\t\t\telse:\r\n\t\t\t\tdp[i][j] = dp[i - 1][j]\r\n\treturn dp[index][k]", "source": "mbpp", "task_id": "306", "test_cases": "assert max_sum_increasing_subseq([1, 101, 2, 3, 100, 4, 5 ], 7, 4, 6) == 11\nassert max_sum_increasing_subseq([1, 101, 2, 3, 100, 4, 5 ], 7, 2, 5) == 7\nassert max_sum_increasing_subseq([11, 15, 19, 21, 26, 28, 31], 7, 2, 4) == 71", "difficulty": "code"} {"input": "Write a function to get a colon of a tuple.", "answer": "from copy import deepcopy\r\ndef colon_tuplex(tuplex,m,n):\r\n tuplex_colon = deepcopy(tuplex)\r\n tuplex_colon[m].append(n)\r\n return tuplex_colon", "source": "mbpp", "task_id": "307", "test_cases": "assert colon_tuplex((\"HELLO\", 5, [], True) ,2,50)==(\"HELLO\", 5, [50], True) \nassert colon_tuplex((\"HELLO\", 5, [], True) ,2,100)==((\"HELLO\", 5, [100],True))\nassert colon_tuplex((\"HELLO\", 5, [], True) ,2,500)==(\"HELLO\", 5, [500], True)", "difficulty": "code"} {"input": "Write a function to find the specified number of largest products from two given lists.", "answer": "def large_product(nums1, nums2, N):\r\n result = sorted([x*y for x in nums1 for y in nums2], reverse=True)[:N]\r\n return result", "source": "mbpp", "task_id": "308", "test_cases": "assert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],3)==[60, 54, 50]\nassert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],4)==[60, 54, 50, 48]\nassert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],5)==[60, 54, 50, 48, 45]", "difficulty": "code"} {"input": "Write a python function to find the maximum of two numbers.", "answer": "def maximum(a,b): \r\n if a >= b: \r\n return a \r\n else: \r\n return b", "source": "mbpp", "task_id": "309", "test_cases": "assert maximum(5,10) == 10\nassert maximum(-1,-2) == -1\nassert maximum(9,7) == 9", "difficulty": "code"} {"input": "Write a function to convert a given string to a tuple.", "answer": "def string_to_tuple(str1):\r\n result = tuple(x for x in str1 if not x.isspace()) \r\n return result", "source": "mbpp", "task_id": "310", "test_cases": "assert string_to_tuple(\"python 3.0\")==('p', 'y', 't', 'h', 'o', 'n', '3', '.', '0')\nassert string_to_tuple(\"item1\")==('i', 't', 'e', 'm', '1')\nassert string_to_tuple(\"15.10\")==('1', '5', '.', '1', '0')", "difficulty": "code"} {"input": "Write a python function to set the left most unset bit.", "answer": "def set_left_most_unset_bit(n): \r\n if not (n & (n + 1)): \r\n return n \r\n pos, temp, count = 0, n, 0 \r\n while temp: \r\n if not (temp & 1): \r\n pos = count \r\n count += 1; temp>>=1\r\n return (n | (1 << (pos)))", "source": "mbpp", "task_id": "311", "test_cases": "assert set_left_most_unset_bit(10) == 14\nassert set_left_most_unset_bit(12) == 14\nassert set_left_most_unset_bit(15) == 15", "difficulty": "code"} {"input": "Write a function to find the volume of a cone.", "answer": "import math\r\ndef volume_cone(r,h):\r\n volume = (1.0/3) * math.pi * r * r * h\r\n return volume", "source": "mbpp", "task_id": "312", "test_cases": "assert volume_cone(5,12)==314.15926535897927\nassert volume_cone(10,15)==1570.7963267948965\nassert volume_cone(19,17)==6426.651371693521", "difficulty": "code"} {"input": "Write a python function to print positive numbers in a list.", "answer": "def pos_nos(list1):\r\n for num in list1: \r\n if num >= 0: \r\n return num", "source": "mbpp", "task_id": "313", "test_cases": "assert pos_nos([-1,-2,1,2]) == 1,2\nassert pos_nos([3,4,-5]) == 3,4\nassert pos_nos([-2,-3,1]) == 1", "difficulty": "code"} {"input": "Write a function to find out the maximum sum such that no two chosen numbers are adjacent for the given rectangular grid of dimension 2 x n.", "answer": "def max_sum_rectangular_grid(grid, n) : \r\n\tincl = max(grid[0][0], grid[1][0]) \r\n\texcl = 0\r\n\tfor i in range(1, n) : \r\n\t\texcl_new = max(excl, incl) \r\n\t\tincl = excl + max(grid[0][i], grid[1][i]) \r\n\t\texcl = excl_new \r\n\treturn max(excl, incl)", "source": "mbpp", "task_id": "314", "test_cases": "assert max_sum_rectangular_grid([ [1, 4, 5], [2, 0, 0 ] ], 3) == 7\nassert max_sum_rectangular_grid([ [ 1, 2, 3, 4, 5], [ 6, 7, 8, 9, 10] ], 5) == 24\nassert max_sum_rectangular_grid([ [7, 9, 11, 15, 19], [21, 25, 28, 31, 32] ], 5) == 81", "difficulty": "code"} {"input": "Write a python function to find the first maximum length of even word.", "answer": "def find_Max_Len_Even(str): \r\n n = len(str) \r\n i = 0\r\n currlen = 0\r\n maxlen = 0\r\n st = -1\r\n while (i < n): \r\n if (str[i] == ' '): \r\n if (currlen % 2 == 0): \r\n if (maxlen < currlen): \r\n maxlen = currlen \r\n st = i - currlen \r\n currlen = 0 \r\n else : \r\n currlen += 1\r\n i += 1\r\n if (currlen % 2 == 0): \r\n if (maxlen < currlen): \r\n maxlen = currlen \r\n st = i - currlen \r\n if (st == -1): \r\n return \"-1\" \r\n return str[st: st + maxlen]", "source": "mbpp", "task_id": "315", "test_cases": "assert find_Max_Len_Even(\"python language\") == \"language\"\nassert find_Max_Len_Even(\"maximum even length\") == \"length\"\nassert find_Max_Len_Even(\"eve\") == \"-1\"", "difficulty": "code"} {"input": "Write a function to find the index of the last occurrence of a given number in a sorted array.", "answer": "def find_last_occurrence(A, x):\r\n (left, right) = (0, len(A) - 1)\r\n result = -1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if x == A[mid]:\r\n result = mid\r\n left = mid + 1\r\n elif x < A[mid]:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n return result", "source": "mbpp", "task_id": "316", "test_cases": "assert find_last_occurrence([2, 5, 5, 5, 6, 6, 8, 9, 9, 9], 5) == 3\nassert find_last_occurrence([2, 3, 5, 8, 6, 6, 8, 9, 9, 9], 9) == 9\nassert find_last_occurrence([2, 2, 1, 5, 6, 6, 6, 9, 9, 9], 6) == 6", "difficulty": "code"} {"input": "Write a function to reflect the modified run-length encoding from a list.", "answer": "from itertools import groupby\r\ndef modified_encode(alist):\r\n def ctr_ele(el):\r\n if len(el)>1: return [len(el), el[0]]\r\n else: return el[0]\r\n return [ctr_ele(list(group)) for key, group in groupby(alist)]", "source": "mbpp", "task_id": "317", "test_cases": "assert modified_encode([1,1,2,3,4,4,5,1])==[[2, 1], 2, 3, [2, 4], 5, 1]\nassert modified_encode('automatically')==['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', [2, 'l'], 'y']\nassert modified_encode('python')==['p', 'y', 't', 'h', 'o', 'n']", "difficulty": "code"} {"input": "Write a python function to find the maximum volume of a cuboid with given sum of sides.", "answer": "def max_volume (s): \r\n maxvalue = 0\r\n i = 1\r\n for i in range(s - 1): \r\n j = 1\r\n for j in range(s): \r\n k = s - i - j \r\n maxvalue = max(maxvalue, i * j * k) \r\n return maxvalue", "source": "mbpp", "task_id": "318", "test_cases": "assert max_volume(8) == 18\nassert max_volume(4) == 2\nassert max_volume(1) == 0", "difficulty": "code"} {"input": "Write a function to find all five characters long word in the given string by using regex.", "answer": "import re\r\ndef find_long_word(text):\r\n return (re.findall(r\"\\b\\w{5}\\b\", text))", "source": "mbpp", "task_id": "319", "test_cases": "assert find_long_word('Please move back to strem') == ['strem']\nassert find_long_word('4K Ultra HD streaming player') == ['Ultra']\nassert find_long_word('Streaming Media Player') == ['Media']", "difficulty": "code"} {"input": "Write a function to calculate the difference between the squared sum of first n natural numbers and the sum of squared first n natural numbers.", "answer": "def sum_difference(n):\r\n sumofsquares = 0\r\n squareofsum = 0\r\n for num in range(1, n+1):\r\n sumofsquares += num * num\r\n squareofsum += num\r\n squareofsum = squareofsum ** 2\r\n return squareofsum - sumofsquares", "source": "mbpp", "task_id": "320", "test_cases": "assert sum_difference(12)==5434\nassert sum_difference(20)==41230\nassert sum_difference(54)==2151270", "difficulty": "code"} {"input": "Write a function to find the demlo number for the given number.", "answer": "def find_demlo(s): \r\n\tl = len(s) \r\n\tres = \"\" \r\n\tfor i in range(1,l+1): \r\n\t\tres = res + str(i) \r\n\tfor i in range(l-1,0,-1): \r\n\t\tres = res + str(i) \r\n\treturn res", "source": "mbpp", "task_id": "321", "test_cases": "assert find_demlo(\"111111\") == '12345654321'\nassert find_demlo(\"1111\") == '1234321'\nassert find_demlo(\"13333122222\") == '123456789101110987654321'", "difficulty": "code"} {"input": "Write a function to find all index positions of the minimum values in a given list.", "answer": "def position_min(list1):\r\n min_val = min(list1)\r\n min_result = [i for i, j in enumerate(list1) if j == min_val]\r\n return min_result", "source": "mbpp", "task_id": "322", "test_cases": "assert position_min([12,33,23,10,67,89,45,667,23,12,11,10,54])==[3,11]\nassert position_min([1,2,2,2,4,4,4,5,5,5,5])==[0]\nassert position_min([2,1,5,6,8,3,4,9,10,11,8,12])==[1]", "difficulty": "code"} {"input": "Write a function to re-arrange the given array in alternating positive and negative items.", "answer": "def right_rotate(arr, n, out_of_place, cur):\r\n\ttemp = arr[cur]\r\n\tfor i in range(cur, out_of_place, -1):\r\n\t\tarr[i] = arr[i - 1]\r\n\tarr[out_of_place] = temp\r\n\treturn arr\r\ndef re_arrange(arr, n):\r\n\tout_of_place = -1\r\n\tfor index in range(n):\r\n\t\tif (out_of_place >= 0):\r\n\t\t\tif ((arr[index] >= 0 and arr[out_of_place] < 0) or\r\n\t\t\t(arr[index] < 0 and arr[out_of_place] >= 0)):\r\n\t\t\t\tarr = right_rotate(arr, n, out_of_place, index)\r\n\t\t\t\tif (index-out_of_place > 2):\r\n\t\t\t\t\tout_of_place += 2\r\n\t\t\t\telse:\r\n\t\t\t\t\tout_of_place = - 1\r\n\t\tif (out_of_place == -1):\r\n\t\t\tif ((arr[index] >= 0 and index % 2 == 0) or\r\n\t\t\t (arr[index] < 0 and index % 2 == 1)):\r\n\t\t\t\tout_of_place = index\r\n\treturn arr", "source": "mbpp", "task_id": "323", "test_cases": "assert re_arrange([-5, -2, 5, 2, 4,\t7, 1, 8, 0, -8], 10) == [-5, 5, -2, 2, -8, 4, 7, 1, 8, 0]\nassert re_arrange([1, 2, 3, -4, -1, 4], 6) == [-4, 1, -1, 2, 3, 4]\nassert re_arrange([4, 7, 9, 77, -4, 5, -3, -9], 8) == [-4, 4, -3, 7, -9, 9, 77, 5]", "difficulty": "code"} {"input": "Write a function to extract the sum of alternate chains of tuples.", "answer": "def sum_of_alternates(test_tuple):\r\n sum1 = 0\r\n sum2 = 0\r\n for idx, ele in enumerate(test_tuple):\r\n if idx % 2:\r\n sum1 += ele\r\n else:\r\n sum2 += ele\r\n return ((sum1),(sum2))", "source": "mbpp", "task_id": "324", "test_cases": "assert sum_of_alternates((5, 6, 3, 6, 10, 34)) == (46, 18)\nassert sum_of_alternates((1, 2, 3, 4, 5)) == (6, 9)\nassert sum_of_alternates((6, 7, 8, 9, 4, 5)) == (21, 18)", "difficulty": "code"} {"input": "Write a python function to find the minimum number of squares whose sum is equal to a given number.", "answer": "def get_Min_Squares(n):\r\n if n <= 3:\r\n return n;\r\n res = n \r\n for x in range(1,n + 1):\r\n temp = x * x;\r\n if temp > n:\r\n break\r\n else:\r\n res = min(res,1 + get_Min_Squares(n - temp)) \r\n return res;", "source": "mbpp", "task_id": "325", "test_cases": "assert get_Min_Squares(6) == 3\nassert get_Min_Squares(2) == 2\nassert get_Min_Squares(4) == 1", "difficulty": "code"} {"input": "Write a function to get the word with most number of occurrences in the given strings list.", "answer": "from collections import defaultdict \r\n\r\ndef most_occurrences(test_list):\r\n temp = defaultdict(int)\r\n for sub in test_list:\r\n for wrd in sub.split():\r\n temp[wrd] += 1\r\n res = max(temp, key=temp.get)\r\n return (str(res))", "source": "mbpp", "task_id": "326", "test_cases": "assert most_occurrences([\"UTS is best for RTF\", \"RTF love UTS\", \"UTS is best\"] ) == 'UTS'\nassert most_occurrences([\"Its been a great year\", \"this year is so worse\", \"this year is okay\"] ) == 'year'\nassert most_occurrences([\"Families can be reunited\", \"people can be reunited\", \"Tasks can be achieved \"] ) == 'can'", "difficulty": "code"} {"input": "Write a function to print check if the triangle is isosceles or not.", "answer": "def check_isosceles(x,y,z):\r\n if x==y or y==z or z==x:\r\n\t return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "327", "test_cases": "assert check_isosceles(6,8,12)==False \nassert check_isosceles(6,6,12)==True\nassert check_isosceles(6,16,20)==False", "difficulty": "code"} {"input": "Write a function to rotate a given list by specified number of items to the left direction.", "answer": "def rotate_left(list1,m,n):\r\n result = list1[m:]+list1[:n]\r\n return result", "source": "mbpp", "task_id": "328", "test_cases": "assert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],3,4)==[4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4]\nassert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],2,2)==[3, 4, 5, 6, 7, 8, 9, 10, 1, 2]\nassert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],5,2)==[6, 7, 8, 9, 10, 1, 2]", "difficulty": "code"} {"input": "Write a python function to count negative numbers in a list.", "answer": "def neg_count(list):\r\n neg_count= 0\r\n for num in list: \r\n if num <= 0: \r\n neg_count += 1\r\n return neg_count", "source": "mbpp", "task_id": "329", "test_cases": "assert neg_count([-1,-2,3,-4,-5]) == 4\nassert neg_count([1,2,3]) == 0\nassert neg_count([1,2,-3,-10,20]) == 2", "difficulty": "code"} {"input": "Write a function to find all three, four, five characters long words in the given string by using regex.", "answer": "import re\r\ndef find_char(text):\r\n return (re.findall(r\"\\b\\w{3,5}\\b\", text))", "source": "mbpp", "task_id": "330", "test_cases": "assert find_char('For the four consumer complaints contact manager AKR reddy') == ['For', 'the', 'four', 'AKR', 'reddy']\nassert find_char('Certain service are subject to change MSR') == ['are', 'MSR']\nassert find_char('Third party legal desclaimers') == ['Third', 'party', 'legal']", "difficulty": "code"} {"input": "Write a python function to count unset bits of a given number.", "answer": "def count_unset_bits(n): \r\n count = 0\r\n x = 1\r\n while(x < n + 1): \r\n if ((x & n) == 0): \r\n count += 1\r\n x = x << 1\r\n return count", "source": "mbpp", "task_id": "331", "test_cases": "assert count_unset_bits(2) == 1\nassert count_unset_bits(4) == 2\nassert count_unset_bits(6) == 1", "difficulty": "code"} {"input": "Write a function to count character frequency of a given string.", "answer": "def char_frequency(str1):\r\n dict = {}\r\n for n in str1:\r\n keys = dict.keys()\r\n if n in keys:\r\n dict[n] += 1\r\n else:\r\n dict[n] = 1\r\n return dict", "source": "mbpp", "task_id": "332", "test_cases": "assert char_frequency('python')=={'p': 1, 'y': 1, 't': 1, 'h': 1, 'o': 1, 'n': 1}\nassert char_frequency('program')=={'p': 1, 'r': 2, 'o': 1, 'g': 1, 'a': 1, 'm': 1}\nassert char_frequency('language')=={'l': 1, 'a': 2, 'n': 1, 'g': 2, 'u': 1, 'e': 1}", "difficulty": "code"} {"input": "Write a python function to sort a list according to the second element in sublist.", "answer": "def Sort(sub_li): \r\n sub_li.sort(key = lambda x: x[1]) \r\n return sub_li", "source": "mbpp", "task_id": "333", "test_cases": "assert Sort([['a', 10], ['b', 5], ['c', 20], ['d', 15]]) == [['b', 5], ['a', 10], ['d', 15], ['c', 20]]\nassert Sort([['452', 10], ['256', 5], ['100', 20], ['135', 15]]) == [['256', 5], ['452', 10], ['135', 15], ['100', 20]]\nassert Sort([['rishi', 10], ['akhil', 5], ['ramya', 20], ['gaur', 15]]) == [['akhil', 5], ['rishi', 10], ['gaur', 15], ['ramya', 20]]", "difficulty": "code"} {"input": "Write a python function to check whether the triangle is valid or not if sides are given.", "answer": "def check_Validity(a,b,c): \r\n if (a + b <= c) or (a + c <= b) or (b + c <= a) : \r\n return False\r\n else: \r\n return True", "source": "mbpp", "task_id": "334", "test_cases": "assert check_Validity(1,2,3) == False\nassert check_Validity(2,3,5) == False\nassert check_Validity(7,10,5) == True", "difficulty": "code"} {"input": "Write a function to find the sum of arithmetic progression.", "answer": "def ap_sum(a,n,d):\r\n total = (n * (2 * a + (n - 1) * d)) / 2\r\n return total", "source": "mbpp", "task_id": "335", "test_cases": "assert ap_sum(1,5,2)==25\nassert ap_sum(2,6,4)==72\nassert ap_sum(1,4,5)==34", "difficulty": "code"} {"input": "Write a function to check whether the given month name contains 28 days or not.", "answer": "def check_monthnum(monthname1):\r\n if monthname1 == \"February\":\r\n return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "336", "test_cases": "assert check_monthnum(\"February\")==True\nassert check_monthnum(\"January\")==False\nassert check_monthnum(\"March\")==False", "difficulty": "code"} {"input": "Write a function that matches a word at the end of a string, with optional punctuation.", "answer": "import re\r\ndef text_match_word(text):\r\n patterns = '\\w+\\S*$'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return 'Not matched!'", "source": "mbpp", "task_id": "337", "test_cases": "assert text_match_word(\"python.\")==('Found a match!')\nassert text_match_word(\"python.\")==('Found a match!')\nassert text_match_word(\" lang .\")==('Not matched!')", "difficulty": "code"} {"input": "Write a python function to count the number of substrings with same first and last characters.", "answer": "def check_Equality(s): \r\n return (ord(s[0]) == ord(s[len(s) - 1])); \r\ndef count_Substring_With_Equal_Ends(s): \r\n result = 0; \r\n n = len(s); \r\n for i in range(n):\r\n for j in range(1,n-i+1): \r\n if (check_Equality(s[i:i+j])): \r\n result+=1; \r\n return result;", "source": "mbpp", "task_id": "338", "test_cases": "assert count_Substring_With_Equal_Ends('aba') == 4\nassert count_Substring_With_Equal_Ends('abcab') == 7\nassert count_Substring_With_Equal_Ends('abc') == 3", "difficulty": "code"} {"input": "Write a python function to find the maximum occuring divisor in an interval.", "answer": "def find_Divisor(x,y): \r\n if (x==y): \r\n return y \r\n return 2", "source": "mbpp", "task_id": "339", "test_cases": "assert find_Divisor(2,2) == 2\nassert find_Divisor(2,5) == 2\nassert find_Divisor(5,10) == 2", "difficulty": "code"} {"input": "Write a python function to find the sum of the three lowest positive numbers from a given list of numbers.", "answer": "def sum_three_smallest_nums(lst):\r\n\treturn sum(sorted([x for x in lst if x > 0])[:3])", "source": "mbpp", "task_id": "340", "test_cases": "assert sum_three_smallest_nums([10,20,30,40,50,60,7]) == 37\nassert sum_three_smallest_nums([1,2,3,4,5]) == 6\nassert sum_three_smallest_nums([0,1,2,3,4,5]) == 6", "difficulty": "code"} {"input": "Write a function to convert the given set into ordered tuples.", "answer": "def set_to_tuple(s):\r\n t = tuple(sorted(s))\r\n return (t)", "source": "mbpp", "task_id": "341", "test_cases": "assert set_to_tuple({1, 2, 3, 4, 5}) == (1, 2, 3, 4, 5)\nassert set_to_tuple({6, 7, 8, 9, 10, 11}) == (6, 7, 8, 9, 10, 11)\nassert set_to_tuple({12, 13, 14, 15, 16}) == (12, 13, 14, 15, 16)", "difficulty": "code"} {"input": "Write a function to find the smallest range that includes at-least one element from each of the given arrays.", "answer": "from heapq import heappop, heappush\r\nclass Node:\r\n def __init__(self, value, list_num, index):\r\n self.value = value\r\n self.list_num = list_num\r\n self.index = index\r\n def __lt__(self, other):\r\n return self.value < other.value\r\ndef find_minimum_range(list):\r\n high = float('-inf')\r\n p = (0, float('inf'))\r\n pq = []\r\n for i in range(len(list)):\r\n heappush(pq, Node(list[i][0], i, 0))\r\n high = max(high, list[i][0])\r\n while True:\r\n top = heappop(pq)\r\n low = top.value\r\n i = top.list_num\r\n j = top.index\r\n if high - low < p[1] - p[0]:\r\n p = (low, high)\r\n if j == len(list[i]) - 1:\r\n return p\r\n heappush(pq, Node(list[i][j + 1], i, j + 1))\r\n high = max(high, list[i][j + 1])", "source": "mbpp", "task_id": "342", "test_cases": "assert find_minimum_range([[3, 6, 8, 10, 15], [1, 5, 12], [4, 8, 15, 16], [2, 6]]) == (4, 6)\nassert find_minimum_range([[ 2, 3, 4, 8, 10, 15 ], [1, 5, 12], [7, 8, 15, 16], [3, 6]]) == (4, 7)\nassert find_minimum_range([[4, 7, 9, 11, 16], [2, 6, 13], [5, 9, 16, 17], [3, 7]]) == (5, 7)", "difficulty": "code"} {"input": "Write a function to calculate the number of digits and letters in a string.", "answer": "def dig_let(s):\r\n d=l=0\r\n for c in s:\r\n if c.isdigit():\r\n d=d+1\r\n elif c.isalpha():\r\n l=l+1\r\n else:\r\n pass\r\n return (l,d)", "source": "mbpp", "task_id": "343", "test_cases": "assert dig_let(\"python\")==(6,0)\nassert dig_let(\"program\")==(7,0)\nassert dig_let(\"python3.0\")==(6,2)", "difficulty": "code"} {"input": "Write a python function to find number of elements with odd factors in a given range.", "answer": "def count_Odd_Squares(n,m): \r\n return int(m**0.5) - int((n-1)**0.5)", "source": "mbpp", "task_id": "344", "test_cases": "assert count_Odd_Squares(5,100) == 8\nassert count_Odd_Squares(8,65) == 6\nassert count_Odd_Squares(2,5) == 1", "difficulty": "code"} {"input": "Write a function to find the difference between two consecutive numbers in a given list.", "answer": "def diff_consecutivenums(nums):\r\n result = [b-a for a, b in zip(nums[:-1], nums[1:])]\r\n return result", "source": "mbpp", "task_id": "345", "test_cases": "assert diff_consecutivenums([1, 1, 3, 4, 4, 5, 6, 7])==[0, 2, 1, 0, 1, 1, 1]\nassert diff_consecutivenums([4, 5, 8, 9, 6, 10])==[1, 3, 1, -3, 4]\nassert diff_consecutivenums([0, 1, 2, 3, 4, 4, 4, 4, 5, 7])==[1, 1, 1, 1, 0, 0, 0, 1, 2]", "difficulty": "code"} {"input": "Write a function to find entringer number e(n, k).", "answer": "def zigzag(n, k): \r\n\tif (n == 0 and k == 0): \r\n\t\treturn 1\r\n\tif (k == 0): \r\n\t\treturn 0\r\n\treturn zigzag(n, k - 1) + zigzag(n - 1, n - k)", "source": "mbpp", "task_id": "346", "test_cases": "assert zigzag(4, 3) == 5\nassert zigzag(4, 2) == 4\nassert zigzag(3, 1) == 1", "difficulty": "code"} {"input": "Write a python function to count the number of squares in a rectangle.", "answer": "def count_Squares(m,n): \r\n if (n < m): \r\n temp = m \r\n m = n \r\n n = temp \r\n return n * (n + 1) * (3 * m - n + 1) // 6", "source": "mbpp", "task_id": "347", "test_cases": "assert count_Squares(4,3) == 20\nassert count_Squares(1,2) == 2\nassert count_Squares(2,2) == 5", "difficulty": "code"} {"input": "Write a function to count sequences of given length having non-negative prefix sums that can be generated by given values.", "answer": "def bin_coff(n, r): \r\n\tval = 1\r\n\tif (r > (n - r)): \r\n\t\tr = (n - r) \r\n\tfor i in range(0, r): \r\n\t\tval *= (n - i) \r\n\t\tval //= (i + 1) \r\n\treturn val \r\ndef find_ways(M): \r\n\tn = M // 2\r\n\ta = bin_coff(2 * n, n) \r\n\tb = a // (n + 1) \r\n\treturn (b)", "source": "mbpp", "task_id": "348", "test_cases": "assert find_ways(4) == 2\nassert find_ways(6) == 5\nassert find_ways(8) == 14", "difficulty": "code"} {"input": "Write a python function to check whether the given string is a binary string or not.", "answer": "def check(string) :\r\n p = set(string) \r\n s = {'0', '1'} \r\n if s == p or p == {'0'} or p == {'1'}: \r\n return (\"Yes\") \r\n else : \r\n return (\"No\")", "source": "mbpp", "task_id": "349", "test_cases": "assert check(\"01010101010\") == \"Yes\"\nassert check(\"name0\") == \"No\"\nassert check(\"101\") == \"Yes\"", "difficulty": "code"} {"input": "Write a python function to minimize the length of the string by removing occurrence of only one character.", "answer": "def minimum_Length(s) : \r\n maxOcc = 0\r\n n = len(s) \r\n arr = [0]*26\r\n for i in range(n) : \r\n arr[ord(s[i]) -ord('a')] += 1\r\n for i in range(26) : \r\n if arr[i] > maxOcc : \r\n maxOcc = arr[i] \r\n return n - maxOcc", "source": "mbpp", "task_id": "350", "test_cases": "assert minimum_Length(\"mnm\") == 1\nassert minimum_Length(\"abcda\") == 3\nassert minimum_Length(\"abcb\") == 2", "difficulty": "code"} {"input": "Write a python function to find the first element occurring k times in a given array.", "answer": "def first_Element(arr,n,k): \r\n count_map = {}; \r\n for i in range(0, n): \r\n if(arr[i] in count_map.keys()): \r\n count_map[arr[i]] += 1\r\n else: \r\n count_map[arr[i]] = 1\r\n i += 1\r\n for i in range(0, n): \r\n if (count_map[arr[i]] == k): \r\n return arr[i] \r\n i += 1 \r\n return -1", "source": "mbpp", "task_id": "351", "test_cases": "assert first_Element([0,1,2,3,4,5],6,1) == 0\nassert first_Element([1,2,1,3,4],5,2) == 1\nassert first_Element([2,3,4,3,5,7,1,2,3,5],10,2) == 2", "difficulty": "code"} {"input": "Write a python function to check whether all the characters in a given string are unique.", "answer": "def unique_Characters(str):\r\n for i in range(len(str)):\r\n for j in range(i + 1,len(str)): \r\n if (str[i] == str[j]):\r\n return False;\r\n return True;", "source": "mbpp", "task_id": "352", "test_cases": "assert unique_Characters('aba') == False\nassert unique_Characters('abc') == True\nassert unique_Characters('abab') == False", "difficulty": "code"} {"input": "Write a function to remove a specified column from a given nested list.", "answer": "def remove_column(list1, n):\r\n for i in list1: \r\n del i[n] \r\n return list1", "source": "mbpp", "task_id": "353", "test_cases": "assert remove_column([[1, 2, 3], [2, 4, 5], [1, 1, 1]],0)==[[2, 3], [4, 5], [1, 1]]\nassert remove_column([[1, 2, 3], [-2, 4, -5], [1, -1, 1]],2)==[[1, 2], [-2, 4], [1, -1]]\nassert remove_column([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]],0)==[[3], [7], [3], [15, 17], [7], [11]]", "difficulty": "code"} {"input": "Write a function to find t-nth term of arithemetic progression.", "answer": "def tn_ap(a,n,d):\r\n tn = a + (n - 1) * d\r\n return tn", "source": "mbpp", "task_id": "354", "test_cases": "assert tn_ap(1,5,2)==9\nassert tn_ap(2,6,4)==22\nassert tn_ap(1,4,5)==16", "difficulty": "code"} {"input": "Write a python function to count the number of rectangles in a circle of radius r.", "answer": "def count_Rectangles(radius): \r\n rectangles = 0 \r\n diameter = 2 * radius \r\n diameterSquare = diameter * diameter \r\n for a in range(1, 2 * radius): \r\n for b in range(1, 2 * radius): \r\n diagnalLengthSquare = (a * a + b * b) \r\n if (diagnalLengthSquare <= diameterSquare) : \r\n rectangles += 1\r\n return rectangles", "source": "mbpp", "task_id": "355", "test_cases": "assert count_Rectangles(2) == 8\nassert count_Rectangles(1) == 1\nassert count_Rectangles(0) == 0", "difficulty": "code"} {"input": "Write a function to find the third angle of a triangle using two angles.", "answer": "def find_angle(a,b):\r\n c = 180 - (a + b)\r\n return c", "source": "mbpp", "task_id": "356", "test_cases": "assert find_angle(47,89)==44\nassert find_angle(45,95)==40\nassert find_angle(50,40)==90", "difficulty": "code"} {"input": "Write a function to find the maximum element of all the given tuple records.", "answer": "def find_max(test_list):\r\n res = max(int(j) for i in test_list for j in i)\r\n return (res)", "source": "mbpp", "task_id": "357", "test_cases": "assert find_max([(2, 4), (6, 7), (5, 1), (6, 10), (8, 7)]) == 10\nassert find_max([(3, 5), (7, 8), (6, 2), (7, 11), (9, 8)]) == 11\nassert find_max([(4, 6), (8, 9), (7, 3), (8, 12), (10, 9)]) == 12", "difficulty": "code"} {"input": "Write a function to find modulo division of two lists using map and lambda function.", "answer": "def moddiv_list(nums1,nums2):\r\n result = map(lambda x, y: x % y, nums1, nums2)\r\n return list(result)", "source": "mbpp", "task_id": "358", "test_cases": "assert moddiv_list([4,5,6],[1, 2, 3])==[0, 1, 0]\nassert moddiv_list([3,2],[1,4])==[0, 2]\nassert moddiv_list([90,120],[50,70])==[40, 50]", "difficulty": "code"} {"input": "Write a python function to check whether one root of the quadratic equation is twice of the other or not.", "answer": "def Check_Solution(a,b,c): \r\n if (2*b*b == 9*a*c): \r\n return (\"Yes\"); \r\n else: \r\n return (\"No\");", "source": "mbpp", "task_id": "359", "test_cases": "assert Check_Solution(1,3,2) == \"Yes\"\nassert Check_Solution(1,2,3) == \"No\"\nassert Check_Solution(1,-5,6) == \"No\"", "difficulty": "code"} {"input": "Write a function to find the n’th carol number.", "answer": "def get_carol(n): \r\n\tresult = (2**n) - 1\r\n\treturn result * result - 2", "source": "mbpp", "task_id": "360", "test_cases": "assert get_carol(2) == 7\nassert get_carol(4) == 223\nassert get_carol(5) == 959", "difficulty": "code"} {"input": "Write a function to remove empty lists from a given list of lists.", "answer": "def remove_empty(list1):\r\n remove_empty = [x for x in list1 if x]\r\n return remove_empty", "source": "mbpp", "task_id": "361", "test_cases": "assert remove_empty([[], [], [], 'Red', 'Green', [1,2], 'Blue', [], []])==['Red', 'Green', [1, 2], 'Blue']\nassert remove_empty([[], [], [],[],[], 'Green', [1,2], 'Blue', [], []])==[ 'Green', [1, 2], 'Blue']\nassert remove_empty([[], [], [], 'Python',[],[], 'programming', 'language',[],[],[], [], []])==['Python', 'programming', 'language']", "difficulty": "code"} {"input": "Write a python function to find the item with maximum occurrences in a given list.", "answer": "def max_occurrences(nums):\r\n max_val = 0\r\n result = nums[0] \r\n for i in nums:\r\n occu = nums.count(i)\r\n if occu > max_val:\r\n max_val = occu\r\n result = i \r\n return result", "source": "mbpp", "task_id": "362", "test_cases": "assert max_occurrences([1,2,3,1,2,3,12,4,2]) == 2\nassert max_occurrences([1,2,6,7,0,1,0,1,0]) == 1,0\nassert max_occurrences([1,2,3,1,2,4,1]) == 1", "difficulty": "code"} {"input": "Write a function to add the k elements to each element in the tuple.", "answer": "def add_K_element(test_list, K):\r\n res = [tuple(j + K for j in sub ) for sub in test_list]\r\n return (res)", "source": "mbpp", "task_id": "363", "test_cases": "assert add_K_element([(1, 3, 4), (2, 4, 6), (3, 8, 1)], 4) == [(5, 7, 8), (6, 8, 10), (7, 12, 5)]\nassert add_K_element([(1, 2, 3), (4, 5, 6), (7, 8, 9)], 8) == [(9, 10, 11), (12, 13, 14), (15, 16, 17)]\nassert add_K_element([(11, 12, 13), (14, 15, 16), (17, 18, 19)], 9) == [(20, 21, 22), (23, 24, 25), (26, 27, 28)]", "difficulty": "code"} {"input": "Write a function to find the number of flips required to make the given binary string a sequence of alternate characters.", "answer": "def make_flip(ch): \r\n\treturn '1' if (ch == '0') else '0'\r\ndef get_flip_with_starting_charcter(str, expected): \r\n\tflip_count = 0\r\n\tfor i in range(len( str)): \r\n\t\tif (str[i] != expected): \r\n\t\t\tflip_count += 1\r\n\t\texpected = make_flip(expected) \r\n\treturn flip_count \r\ndef min_flip_to_make_string_alternate(str): \r\n\treturn min(get_flip_with_starting_charcter(str, '0'),get_flip_with_starting_charcter(str, '1'))", "source": "mbpp", "task_id": "364", "test_cases": "assert min_flip_to_make_string_alternate(\"0001010111\") == 2\nassert min_flip_to_make_string_alternate(\"001\") == 1\nassert min_flip_to_make_string_alternate(\"010111011\") == 2 ", "difficulty": "code"} {"input": "Write a python function to count the number of digits of a given number.", "answer": "def count_Digit(n):\r\n count = 0\r\n while n != 0:\r\n n //= 10\r\n count += 1\r\n return count", "source": "mbpp", "task_id": "365", "test_cases": "assert count_Digit(12345) == 5\nassert count_Digit(11223305) == 8\nassert count_Digit(4123459) == 7", "difficulty": "code"} {"input": "Write a python function to find the largest product of the pair of adjacent elements from a given list of integers.", "answer": "def adjacent_num_product(list_nums):\r\n return max(a*b for a, b in zip(list_nums, list_nums[1:]))", "source": "mbpp", "task_id": "366", "test_cases": "assert adjacent_num_product([1,2,3,4,5,6]) == 30\nassert adjacent_num_product([1,2,3,4,5]) == 20\nassert adjacent_num_product([2,3]) == 6", "difficulty": "code"} {"input": "Write a function to check if a binary tree is balanced or not.", "answer": "class Node: \r\n\tdef __init__(self, data): \r\n\t\tself.data = data \r\n\t\tself.left = None\r\n\t\tself.right = None\r\ndef get_height(root): \r\n\tif root is None: \r\n\t\treturn 0\r\n\treturn max(get_height(root.left), get_height(root.right)) + 1\r\ndef is_tree_balanced(root): \r\n\tif root is None: \r\n\t\treturn True\r\n\tlh = get_height(root.left) \r\n\trh = get_height(root.right) \r\n\tif (abs(lh - rh) <= 1) and is_tree_balanced( \r\n\troot.left) is True and is_tree_balanced( root.right) is True: \r\n\t\treturn True\r\n\treturn False", "source": "mbpp", "task_id": "367", "test_cases": "assert is_tree_balanced(root) == False\nassert is_tree_balanced(root1) == True\nassert is_tree_balanced(root2) == False ", "difficulty": "code"} {"input": "Write a function to repeat the given tuple n times.", "answer": "def repeat_tuples(test_tup, N):\r\n res = ((test_tup, ) * N)\r\n return (res)", "source": "mbpp", "task_id": "368", "test_cases": "assert repeat_tuples((1, 3), 4) == ((1, 3), (1, 3), (1, 3), (1, 3))\nassert repeat_tuples((1, 2), 3) == ((1, 2), (1, 2), (1, 2))\nassert repeat_tuples((3, 4), 5) == ((3, 4), (3, 4), (3, 4), (3, 4), (3, 4))", "difficulty": "code"} {"input": "Write a function to find the lateral surface area of cuboid", "answer": "def lateralsurface_cuboid(l,w,h):\r\n LSA = 2*h*(l+w)\r\n return LSA", "source": "mbpp", "task_id": "369", "test_cases": "assert lateralsurface_cuboid(8,5,6)==156\nassert lateralsurface_cuboid(7,9,10)==320\nassert lateralsurface_cuboid(10,20,30)==1800", "difficulty": "code"} {"input": "Write a function to sort a tuple by its float element.", "answer": "def float_sort(price):\r\n float_sort=sorted(price, key=lambda x: float(x[1]), reverse=True)\r\n return float_sort", "source": "mbpp", "task_id": "370", "test_cases": "assert float_sort([('item1', '12.20'), ('item2', '15.10'), ('item3', '24.5')])==[('item3', '24.5'), ('item2', '15.10'), ('item1', '12.20')] \nassert float_sort([('item1', '15'), ('item2', '10'), ('item3', '20')])==[('item3', '20'), ('item1', '15'), ('item2', '10')] \nassert float_sort([('item1', '5'), ('item2', '10'), ('item3', '14')])==[('item3', '14'), ('item2', '10'), ('item1', '5')] ", "difficulty": "code"} {"input": "Write a function to find the smallest missing element in a sorted array.", "answer": "def smallest_missing(A, left_element, right_element):\r\n if left_element > right_element:\r\n return left_element\r\n mid = left_element + (right_element - left_element) // 2\r\n if A[mid] == mid:\r\n return smallest_missing(A, mid + 1, right_element)\r\n else:\r\n return smallest_missing(A, left_element, mid - 1)", "source": "mbpp", "task_id": "371", "test_cases": "assert smallest_missing([0, 1, 2, 3, 4, 5, 6], 0, 6) == 7\nassert smallest_missing([0, 1, 2, 6, 9, 11, 15], 0, 6) == 3\nassert smallest_missing([1, 2, 3, 4, 6, 9, 11, 15], 0, 7) == 0", "difficulty": "code"} {"input": "Write a function to sort a given list of elements in ascending order using heap queue algorithm.", "answer": "import heapq as hq\r\ndef heap_assending(nums):\r\n hq.heapify(nums)\r\n s_result = [hq.heappop(nums) for i in range(len(nums))]\r\n return s_result", "source": "mbpp", "task_id": "372", "test_cases": "assert heap_assending([18, 14, 10, 9, 8, 7, 9, 3, 2, 4, 1])==[1, 2, 3, 4, 7, 8, 9, 9, 10, 14, 18]\nassert heap_assending([25, 35, 22, 85, 14, 65, 75, 25, 58])==[14, 22, 25, 25, 35, 58, 65, 75, 85]\nassert heap_assending([1, 3, 5, 7, 9, 2, 4, 6, 8, 0])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]", "difficulty": "code"} {"input": "Write a function to find the volume of a cuboid.", "answer": "def volume_cuboid(l,w,h):\r\n volume=l*w*h\r\n return volume", "source": "mbpp", "task_id": "373", "test_cases": "assert volume_cuboid(1,2,3)==6\nassert volume_cuboid(5,7,9)==315\nassert volume_cuboid(10,15,21)==3150", "difficulty": "code"} {"input": "Write a function to print all permutations of a given string including duplicates.", "answer": "def permute_string(str):\r\n if len(str) == 0:\r\n return ['']\r\n prev_list = permute_string(str[1:len(str)])\r\n next_list = []\r\n for i in range(0,len(prev_list)):\r\n for j in range(0,len(str)):\r\n new_str = prev_list[i][0:j]+str[0]+prev_list[i][j:len(str)-1]\r\n if new_str not in next_list:\r\n next_list.append(new_str)\r\n return next_list", "source": "mbpp", "task_id": "374", "test_cases": "assert permute_string('ab')==['ab', 'ba']\nassert permute_string('abc')==['abc', 'bac', 'bca', 'acb', 'cab', 'cba']\nassert permute_string('abcd')==['abcd', 'bacd', 'bcad', 'bcda', 'acbd', 'cabd', 'cbad', 'cbda', 'acdb', 'cadb', 'cdab', 'cdba', 'abdc', 'badc', 'bdac', 'bdca', 'adbc', 'dabc', 'dbac', 'dbca', 'adcb', 'dacb', 'dcab', 'dcba']", "difficulty": "code"} {"input": "Write a function to round the given number to the nearest multiple of a specific number.", "answer": "def round_num(n,m):\r\n a = (n //m) * m\r\n b = a + m\r\n return (b if n - a > b - n else a)", "source": "mbpp", "task_id": "375", "test_cases": "assert round_num(4722,10)==4720\nassert round_num(1111,5)==1110\nassert round_num(219,2)==218", "difficulty": "code"} {"input": "Write a function to remove tuple elements that occur more than once and replace the duplicates with some custom value.", "answer": "def remove_replica(test_tup):\r\n temp = set()\r\n res = tuple(ele if ele not in temp and not temp.add(ele) \r\n\t\t\t\telse 'MSP' for ele in test_tup)\r\n return (res)", "source": "mbpp", "task_id": "376", "test_cases": "assert remove_replica((1, 1, 4, 4, 4, 5, 5, 6, 7, 7)) == (1, 'MSP', 4, 'MSP', 'MSP', 5, 'MSP', 6, 7, 'MSP')\nassert remove_replica((2, 3, 4, 4, 5, 6, 6, 7, 8, 9, 9)) == (2, 3, 4, 'MSP', 5, 6, 'MSP', 7, 8, 9, 'MSP')\nassert remove_replica((2, 2, 5, 4, 5, 7, 5, 6, 7, 7)) == (2, 'MSP', 5, 4, 'MSP', 7, 'MSP', 6, 'MSP', 'MSP')", "difficulty": "code"} {"input": "Write a python function to remove all occurrences of a character in a given string.", "answer": "def remove_Char(s,c) : \r\n counts = s.count(c) \r\n s = list(s) \r\n while counts : \r\n s.remove(c) \r\n counts -= 1 \r\n s = '' . join(s) \r\n return (s)", "source": "mbpp", "task_id": "377", "test_cases": "assert remove_Char(\"aba\",'a') == \"b\"\nassert remove_Char(\"toggle\",'g') == \"tole\"\nassert remove_Char(\"aabbc\",'b') == \"aac\"", "difficulty": "code"} {"input": "Write a python function to shift last element to first position in the given list.", "answer": "def move_first(test_list):\r\n test_list = test_list[-1:] + test_list[:-1] \r\n return test_list", "source": "mbpp", "task_id": "378", "test_cases": "assert move_first([1,2,3,4]) == [4,1,2,3]\nassert move_first([0,1,2,3]) == [3,0,1,2]\nassert move_first([9,8,7,1]) == [1,9,8,7]", "difficulty": "code"} {"input": "Write a function to find the surface area of a cuboid.", "answer": "def surfacearea_cuboid(l,w,h):\r\n SA = 2*(l*w + l * h + w * h)\r\n return SA", "source": "mbpp", "task_id": "379", "test_cases": "assert surfacearea_cuboid(1,2,3)==22\nassert surfacearea_cuboid(5,7,9)==286\nassert surfacearea_cuboid(10,15,21)==1350", "difficulty": "code"} {"input": "Write a function to generate a two-dimensional array.", "answer": "def multi_list(rownum,colnum):\r\n multi_list = [[0 for col in range(colnum)] for row in range(rownum)]\r\n for row in range(rownum):\r\n for col in range(colnum):\r\n multi_list[row][col]= row*col\r\n return multi_list", "source": "mbpp", "task_id": "380", "test_cases": "assert multi_list(3,4)==[[0, 0, 0, 0], [0, 1, 2, 3], [0, 2, 4, 6]] \nassert multi_list(5,7)==[[0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 5, 6], [0, 2, 4, 6, 8, 10, 12], [0, 3, 6, 9, 12, 15, 18], [0, 4, 8, 12, 16, 20, 24]]\nassert multi_list(10,15)==[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], [0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28], [0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42], [0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56], [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70], [0, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84], [0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, 98], [0, 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112], [0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126]]", "difficulty": "code"} {"input": "Write a function to sort a list of lists by a given index of the inner list.", "answer": "from operator import itemgetter\r\ndef index_on_inner_list(list_data, index_no):\r\n result = sorted(list_data, key=itemgetter(index_no))\r\n return result", "source": "mbpp", "task_id": "381", "test_cases": "assert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,0)==[('Beau Turnbull', 94, 98), ('Brady Kent', 97, 96), ('Greyson Fulton', 98, 99), ('Wyatt Knott', 91, 94)]\nassert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,1)==[('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98), ('Brady Kent', 97, 96), ('Greyson Fulton', 98, 99)]\nassert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,2)==[('Wyatt Knott', 91, 94), ('Brady Kent', 97, 96), ('Beau Turnbull', 94, 98), ('Greyson Fulton', 98, 99)]", "difficulty": "code"} {"input": "Write a function to find the number of rotations in a circularly sorted array.", "answer": "def find_rotation_count(A):\r\n (left, right) = (0, len(A) - 1)\r\n while left <= right:\r\n if A[left] <= A[right]:\r\n return left\r\n mid = (left + right) // 2\r\n next = (mid + 1) % len(A)\r\n prev = (mid - 1 + len(A)) % len(A)\r\n if A[mid] <= A[next] and A[mid] <= A[prev]:\r\n return mid\r\n elif A[mid] <= A[right]:\r\n right = mid - 1\r\n elif A[mid] >= A[left]:\r\n left = mid + 1\r\n return -1", "source": "mbpp", "task_id": "382", "test_cases": "assert find_rotation_count([8, 9, 10, 1, 2, 3, 4, 5, 6, 7]) == 3\nassert find_rotation_count([8, 9, 10,2, 5, 6]) == 3\nassert find_rotation_count([2, 5, 6, 8, 9, 10]) == 0", "difficulty": "code"} {"input": "Write a python function to toggle all odd bits of a given number.", "answer": "def even_bit_toggle_number(n) : \r\n res = 0; count = 0; temp = n \r\n while(temp > 0 ) : \r\n if (count % 2 == 0) : \r\n res = res | (1 << count) \r\n count = count + 1\r\n temp >>= 1 \r\n return n ^ res", "source": "mbpp", "task_id": "383", "test_cases": "assert even_bit_toggle_number(10) == 15\nassert even_bit_toggle_number(20) == 1\nassert even_bit_toggle_number(30) == 11", "difficulty": "code"} {"input": "Write a python function to find the frequency of the smallest value in a given array.", "answer": "def frequency_Of_Smallest(n,arr): \r\n mn = arr[0] \r\n freq = 1\r\n for i in range(1,n): \r\n if (arr[i] < mn): \r\n mn = arr[i] \r\n freq = 1\r\n elif (arr[i] == mn): \r\n freq += 1\r\n return freq", "source": "mbpp", "task_id": "384", "test_cases": "assert frequency_Of_Smallest(5,[1,2,3,4,3]) == 1\nassert frequency_Of_Smallest(7,[3,1,2,5,6,2,3]) == 1\nassert frequency_Of_Smallest(7,[3,3,6,3,7,4,9]) == 3", "difficulty": "code"} {"input": "Write a function to find the n'th perrin number using recursion.", "answer": "def get_perrin(n):\r\n if (n == 0):\r\n return 3\r\n if (n == 1):\r\n return 0\r\n if (n == 2):\r\n return 2 \r\n return get_perrin(n - 2) + get_perrin(n - 3)", "source": "mbpp", "task_id": "385", "test_cases": "assert get_perrin(9) == 12\nassert get_perrin(4) == 2\nassert get_perrin(6) == 5", "difficulty": "code"} {"input": "Write a function to find out the minimum no of swaps required for bracket balancing in the given string.", "answer": "def swap_count(s):\r\n\tchars = s\r\n\tcount_left = 0\r\n\tcount_right = 0\r\n\tswap = 0\r\n\timbalance = 0; \r\n\tfor i in range(len(chars)):\r\n\t\tif chars[i] == '[':\r\n\t\t\tcount_left += 1\r\n\t\t\tif imbalance > 0:\r\n\t\t\t\tswap += imbalance\r\n\t\t\t\timbalance -= 1\r\n\t\telif chars[i] == ']':\r\n\t\t\tcount_right += 1\r\n\t\t\timbalance = (count_right - count_left) \r\n\treturn swap", "source": "mbpp", "task_id": "386", "test_cases": "assert swap_count(\"[]][][\") == 2\nassert swap_count(\"[[][]]\") == 0\nassert swap_count(\"[[][]]][\") == 1", "difficulty": "code"} {"input": "Write a python function to check whether the hexadecimal number is even or odd.", "answer": "def even_or_odd(N): \r\n l = len(N) \r\n if (N[l-1] =='0'or N[l-1] =='2'or \r\n N[l-1] =='4'or N[l-1] =='6'or \r\n N[l-1] =='8'or N[l-1] =='A'or \r\n N[l-1] =='C'or N[l-1] =='E'): \r\n return (\"Even\") \r\n else: \r\n return (\"Odd\")", "source": "mbpp", "task_id": "387", "test_cases": "assert even_or_odd(\"AB3454D\") ==\"Odd\"\nassert even_or_odd(\"ABC\") == \"Even\"\nassert even_or_odd(\"AAD\") == \"Odd\"", "difficulty": "code"} {"input": "Write a python function to find the highest power of 2 that is less than or equal to n.", "answer": "def highest_Power_of_2(n): \r\n res = 0; \r\n for i in range(n, 0, -1): \r\n if ((i & (i - 1)) == 0): \r\n res = i; \r\n break; \r\n return res;", "source": "mbpp", "task_id": "388", "test_cases": "assert highest_Power_of_2(10) == 8\nassert highest_Power_of_2(19) == 16\nassert highest_Power_of_2(32) == 32", "difficulty": "code"} {"input": "Write a function to find the n'th lucas number.", "answer": "def find_lucas(n): \r\n\tif (n == 0): \r\n\t\treturn 2\r\n\tif (n == 1): \r\n\t\treturn 1\r\n\treturn find_lucas(n - 1) + find_lucas(n - 2)", "source": "mbpp", "task_id": "389", "test_cases": "assert find_lucas(9) == 76\nassert find_lucas(4) == 7\nassert find_lucas(3) == 4", "difficulty": "code"} {"input": "Write a function to insert a given string at the beginning of all items in a list.", "answer": "def add_string(list,string):\r\n add_string=[string.format(i) for i in list]\r\n return add_string", "source": "mbpp", "task_id": "390", "test_cases": "assert add_string([1,2,3,4],'temp{0}')==['temp1', 'temp2', 'temp3', 'temp4']\nassert add_string(['a','b','c','d'], 'python{0}')==[ 'pythona', 'pythonb', 'pythonc', 'pythond']\nassert add_string([5,6,7,8],'string{0}')==['string5', 'string6', 'string7', 'string8']", "difficulty": "code"} {"input": "Write a function to convert more than one list to nested dictionary.", "answer": "def convert_list_dictionary(l1, l2, l3):\r\n result = [{x: {y: z}} for (x, y, z) in zip(l1, l2, l3)]\r\n return result", "source": "mbpp", "task_id": "391", "test_cases": "assert convert_list_dictionary([\"S001\", \"S002\", \"S003\", \"S004\"],[\"Adina Park\", \"Leyton Marsh\", \"Duncan Boyle\", \"Saim Richards\"] ,[85, 98, 89, 92])==[{'S001': {'Adina Park': 85}}, {'S002': {'Leyton Marsh': 98}}, {'S003': {'Duncan Boyle': 89}}, {'S004': {'Saim Richards': 92}}]\nassert convert_list_dictionary([\"abc\",\"def\",\"ghi\",\"jkl\"],[\"python\",\"program\",\"language\",\"programs\"],[100,200,300,400])==[{'abc':{'python':100}},{'def':{'program':200}},{'ghi':{'language':300}},{'jkl':{'programs':400}}]\nassert convert_list_dictionary([\"A1\",\"A2\",\"A3\",\"A4\"],[\"java\",\"C\",\"C++\",\"DBMS\"],[10,20,30,40])==[{'A1':{'java':10}},{'A2':{'C':20}},{'A3':{'C++':30}},{'A4':{'DBMS':40}}]", "difficulty": "code"} {"input": "Write a function to find the maximum sum possible by using the given equation f(n) = max( (f(n/2) + f(n/3) + f(n/4) + f(n/5)), n).", "answer": "def get_max_sum (n):\r\n\tres = list()\r\n\tres.append(0)\r\n\tres.append(1)\r\n\ti = 2\r\n\twhile i b:\r\n if a < c:\r\n median = a\r\n elif b > c:\r\n median = b\r\n else:\r\n median = c\r\n else:\r\n if a > c:\r\n median = a\r\n elif b < c:\r\n median = b\r\n else:\r\n median = c\r\n return median", "source": "mbpp", "task_id": "397", "test_cases": "assert median_numbers(25,55,65)==55.0\nassert median_numbers(20,10,30)==20.0\nassert median_numbers(15,45,75)==45.0", "difficulty": "code"} {"input": "Write a function to compute the sum of digits of each number of a given list.", "answer": "def sum_of_digits(nums):\r\n return sum(int(el) for n in nums for el in str(n) if el.isdigit())", "source": "mbpp", "task_id": "398", "test_cases": "assert sum_of_digits([10,2,56])==14\nassert sum_of_digits([[10,20,4,5,'b',70,'a']])==19\nassert sum_of_digits([10,20,-4,5,-70])==19", "difficulty": "code"} {"input": "Write a function to perform the mathematical bitwise xor operation across the given tuples.", "answer": "def bitwise_xor(test_tup1, test_tup2):\r\n res = tuple(ele1 ^ ele2 for ele1, ele2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "399", "test_cases": "assert bitwise_xor((10, 4, 6, 9), (5, 2, 3, 3)) == (15, 6, 5, 10)\nassert bitwise_xor((11, 5, 7, 10), (6, 3, 4, 4)) == (13, 6, 3, 14)\nassert bitwise_xor((12, 6, 8, 11), (7, 4, 5, 6)) == (11, 2, 13, 13)", "difficulty": "code"} {"input": "Write a function to extract the frequency of unique tuples in the given list order irrespective.", "answer": "def extract_freq(test_list):\r\n res = len(list(set(tuple(sorted(sub)) for sub in test_list)))\r\n return (res)", "source": "mbpp", "task_id": "400", "test_cases": "assert extract_freq([(3, 4), (1, 2), (4, 3), (5, 6)] ) == 3\nassert extract_freq([(4, 15), (2, 3), (5, 4), (6, 7)] ) == 4\nassert extract_freq([(5, 16), (2, 3), (6, 5), (6, 9)] ) == 4", "difficulty": "code"} {"input": "Write a function to perform index wise addition of tuple elements in the given two nested tuples.", "answer": "def add_nested_tuples(test_tup1, test_tup2):\r\n res = tuple(tuple(a + b for a, b in zip(tup1, tup2))\r\n for tup1, tup2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "401", "test_cases": "assert add_nested_tuples(((1, 3), (4, 5), (2, 9), (1, 10)), ((6, 7), (3, 9), (1, 1), (7, 3))) == ((7, 10), (7, 14), (3, 10), (8, 13))\nassert add_nested_tuples(((2, 4), (5, 6), (3, 10), (2, 11)), ((7, 8), (4, 10), (2, 2), (8, 4))) == ((9, 12), (9, 16), (5, 12), (10, 15))\nassert add_nested_tuples(((3, 5), (6, 7), (4, 11), (3, 12)), ((8, 9), (5, 11), (3, 3), (9, 5))) == ((11, 14), (11, 18), (7, 14), (12, 17))", "difficulty": "code"} {"input": "Write a function to compute the value of ncr%p.", "answer": "def ncr_modp(n, r, p): \r\n C = [0 for i in range(r+1)] \r\n C[0] = 1\r\n for i in range(1, n+1): \r\n for j in range(min(i, r), 0, -1): \r\n C[j] = (C[j] + C[j-1]) % p \r\n return C[r]", "source": "mbpp", "task_id": "402", "test_cases": "assert ncr_modp(10,2,13)==6\nassert ncr_modp(15,12,43)==25\nassert ncr_modp(17,9,18)==10", "difficulty": "code"} {"input": "Write a function to check if a url is valid or not using regex.", "answer": "import re\r\ndef is_valid_URL(str):\r\n\tregex = (\"((http|https)://)(www.)?\" +\r\n\t\t\t\"[a-zA-Z0-9@:%._\\\\+~#?&//=]\" +\r\n\t\t\t\"{2,256}\\\\.[a-z]\" +\r\n\t\t\t\"{2,6}\\\\b([-a-zA-Z0-9@:%\" +\r\n\t\t\t\"._\\\\+~#?&//=]*)\")\r\n\tp = re.compile(regex)\r\n\tif (str == None):\r\n\t\treturn False\r\n\tif(re.search(p, str)):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False", "source": "mbpp", "task_id": "403", "test_cases": "assert is_valid_URL(\"https://www.google.com\") == True\nassert is_valid_URL(\"https:/www.gmail.com\") == False\nassert is_valid_URL(\"https:// www.redit.com\") == False", "difficulty": "code"} {"input": "Write a python function to find the minimum of two numbers.", "answer": "def minimum(a,b): \r\n if a <= b: \r\n return a \r\n else: \r\n return b", "source": "mbpp", "task_id": "404", "test_cases": "assert minimum(1,2) == 1\nassert minimum(-5,-4) == -5\nassert minimum(0,0) == 0", "difficulty": "code"} {"input": "Write a function to check whether an element exists within a tuple.", "answer": "def check_tuplex(tuplex,tuple1): \r\n if tuple1 in tuplex:\r\n return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "405", "test_cases": "assert check_tuplex((\"w\", 3, \"r\", \"e\", \"s\", \"o\", \"u\", \"r\", \"c\", \"e\"),'r')==True\nassert check_tuplex((\"w\", 3, \"r\", \"e\", \"s\", \"o\", \"u\", \"r\", \"c\", \"e\"),'5')==False\nassert check_tuplex((\"w\", 3, \"r\", \"e\", \"s\", \"o\", \"u\", \"r\", \"c\",\"e\"),3)==True", "difficulty": "code"} {"input": "Write a python function to find the parity of a given number.", "answer": "def find_Parity(x): \r\n y = x ^ (x >> 1); \r\n y = y ^ (y >> 2); \r\n y = y ^ (y >> 4); \r\n y = y ^ (y >> 8); \r\n y = y ^ (y >> 16); \r\n if (y & 1): \r\n return (\"Odd Parity\"); \r\n return (\"Even Parity\");", "source": "mbpp", "task_id": "406", "test_cases": "assert find_Parity(12) == \"Even Parity\"\nassert find_Parity(7) == \"Odd Parity\"\nassert find_Parity(10) == \"Even Parity\"", "difficulty": "code"} {"input": "Write a function to create the next bigger number by rearranging the digits of a given number.", "answer": "def rearrange_bigger(n):\r\n nums = list(str(n))\r\n for i in range(len(nums)-2,-1,-1):\r\n if nums[i] < nums[i+1]:\r\n z = nums[i:]\r\n y = min(filter(lambda x: x > z[0], z))\r\n z.remove(y)\r\n z.sort()\r\n nums[i:] = [y] + z\r\n return int(\"\".join(nums))\r\n return False", "source": "mbpp", "task_id": "407", "test_cases": "assert rearrange_bigger(12)==21\nassert rearrange_bigger(10)==False\nassert rearrange_bigger(102)==120", "difficulty": "code"} {"input": "Write a function to find k number of pairs which consist of one element from the first array and one element from the second array.", "answer": "import heapq\r\ndef k_smallest_pairs(nums1, nums2, k):\r\n queue = []\r\n def push(i, j):\r\n if i < len(nums1) and j < len(nums2):\r\n heapq.heappush(queue, [nums1[i] + nums2[j], i, j])\r\n push(0, 0)\r\n pairs = []\r\n while queue and len(pairs) < k:\r\n _, i, j = heapq.heappop(queue)\r\n pairs.append([nums1[i], nums2[j]])\r\n push(i, j + 1)\r\n if j == 0:\r\n push(i + 1, 0)\r\n return pairs", "source": "mbpp", "task_id": "408", "test_cases": "assert k_smallest_pairs([1,3,7],[2,4,6],2)==[[1, 2], [1, 4]]\nassert k_smallest_pairs([1,3,7],[2,4,6],1)==[[1, 2]]\nassert k_smallest_pairs([1,3,7],[2,4,6],7)==[[1, 2], [1, 4], [3, 2], [1, 6], [3, 4], [3, 6], [7, 2]]", "difficulty": "code"} {"input": "Write a function to find the minimum product from the pairs of tuples within a given list.", "answer": "def min_product_tuple(list1):\r\n result_min = min([abs(x * y) for x, y in list1] )\r\n return result_min", "source": "mbpp", "task_id": "409", "test_cases": "assert min_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==8\nassert min_product_tuple([(10,20), (15,2), (5,10)] )==30\nassert min_product_tuple([(11,44), (10,15), (20,5), (12, 9)] )==100", "difficulty": "code"} {"input": "Write a function to find the minimum value in a given heterogeneous list.", "answer": "def min_val(listval):\r\n min_val = min(i for i in listval if isinstance(i, int))\r\n return min_val", "source": "mbpp", "task_id": "410", "test_cases": "assert min_val(['Python', 3, 2, 4, 5, 'version'])==2\nassert min_val(['Python', 15, 20, 25])==15\nassert min_val(['Python', 30, 20, 40, 50, 'version'])==20", "difficulty": "code"} {"input": "Write a function to convert the given snake case string to camel case string by using regex.", "answer": "import re\r\ndef snake_to_camel(word):\r\n return ''.join(x.capitalize() or '_' for x in word.split('_'))", "source": "mbpp", "task_id": "411", "test_cases": "assert snake_to_camel('android_tv') == 'AndroidTv'\nassert snake_to_camel('google_pixel') == 'GooglePixel'\nassert snake_to_camel('apple_watch') == 'AppleWatch'", "difficulty": "code"} {"input": "Write a python function to remove odd numbers from a given list.", "answer": "def remove_odd(l):\r\n for i in l:\r\n if i % 2 != 0:\r\n l.remove(i)\r\n return l", "source": "mbpp", "task_id": "412", "test_cases": "assert remove_odd([1,2,3]) == [2]\nassert remove_odd([2,4,6]) == [2,4,6]\nassert remove_odd([10,20,3]) == [10,20]", "difficulty": "code"} {"input": "Write a function to extract the nth element from a given list of tuples.", "answer": "def extract_nth_element(list1, n):\r\n result = [x[n] for x in list1]\r\n return result", "source": "mbpp", "task_id": "413", "test_cases": "assert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,0)==['Greyson Fulton', 'Brady Kent', 'Wyatt Knott', 'Beau Turnbull']\nassert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,2)==[99, 96, 94, 98]\nassert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)],1)==[98, 97, 91, 94]", "difficulty": "code"} {"input": "Write a python function to check whether the value exists in a sequence or not.", "answer": "def overlapping(list1,list2): \r\n c=0\r\n d=0\r\n for i in list1: \r\n c+=1\r\n for i in list2: \r\n d+=1\r\n for i in range(0,c): \r\n for j in range(0,d): \r\n if(list1[i]==list2[j]): \r\n return 1\r\n return 0", "source": "mbpp", "task_id": "414", "test_cases": "assert overlapping([1,2,3,4,5],[6,7,8,9]) == False\nassert overlapping([1,2,3],[4,5,6]) == False\nassert overlapping([1,4,5],[1,4,5]) == True", "difficulty": "code"} {"input": "Write a python function to find a pair with highest product from a given array of integers.", "answer": "def max_Product(arr): \r\n arr_len = len(arr) \r\n if (arr_len < 2): \r\n return (\"No pairs exists\") \r\n x = arr[0]; y = arr[1] \r\n for i in range(0,arr_len): \r\n for j in range(i + 1,arr_len): \r\n if (arr[i] * arr[j] > x * y): \r\n x = arr[i]; y = arr[j] \r\n return x,y", "source": "mbpp", "task_id": "415", "test_cases": "assert max_Product([1,2,3,4,7,0,8,4]) == (7,8)\nassert max_Product([0,-1,-2,-4,5,0,-6]) == (-4,-6)\nassert max_Product([1,2,3]) == (2,3)", "difficulty": "code"} {"input": "Write a function to find the maximum sum we can make by dividing number in three parts recursively and summing them up together for the given number.", "answer": "MAX = 1000000\r\ndef breakSum(n): \r\n\tdp = [0]*(n+1) \r\n\tdp[0] = 0\r\n\tdp[1] = 1\r\n\tfor i in range(2, n+1): \r\n\t\tdp[i] = max(dp[int(i/2)] + dp[int(i/3)] + dp[int(i/4)], i); \r\n\treturn dp[n]", "source": "mbpp", "task_id": "416", "test_cases": "assert breakSum(12) == 13\nassert breakSum(24) == 27\nassert breakSum(23) == 23", "difficulty": "code"} {"input": "Write a function to find common first element in given list of tuple.", "answer": "def group_tuples(Input): \r\n\tout = {} \r\n\tfor elem in Input: \r\n\t\ttry: \r\n\t\t\tout[elem[0]].extend(elem[1:]) \r\n\t\texcept KeyError: \r\n\t\t\tout[elem[0]] = list(elem) \r\n\treturn [tuple(values) for values in out.values()]", "source": "mbpp", "task_id": "417", "test_cases": "assert group_tuples([('x', 'y'), ('x', 'z'), ('w', 't')]) == [('x', 'y', 'z'), ('w', 't')]\nassert group_tuples([('a', 'b'), ('a', 'c'), ('d', 'e')]) == [('a', 'b', 'c'), ('d', 'e')]\nassert group_tuples([('f', 'g'), ('f', 'g'), ('h', 'i')]) == [('f', 'g', 'g'), ('h', 'i')]", "difficulty": "code"} {"input": "Write a python function to find the sublist having maximum length.", "answer": "def Find_Max(lst): \r\n maxList = max((x) for x in lst) \r\n return maxList", "source": "mbpp", "task_id": "418", "test_cases": "assert Find_Max([['A'],['A','B'],['A','B','C']]) == ['A','B','C']\nassert Find_Max([[1],[1,2],[1,2,3]]) == [1,2,3]\nassert Find_Max([[1,1],[1,2,3],[1,5,6,1]]) == [1,5,6,1]", "difficulty": "code"} {"input": "Write a function to round every number of a given list of numbers and print the total sum multiplied by the length of the list.", "answer": "def round_and_sum(list1):\r\n lenght=len(list1)\r\n round_and_sum=sum(list(map(round,list1))* lenght)\r\n return round_and_sum", "source": "mbpp", "task_id": "419", "test_cases": "assert round_and_sum([22.4, 4.0, -16.22, -9.10, 11.00, -12.22, 14.20, -5.20, 17.50])==243\nassert round_and_sum([5,2,9,24.3,29])==345\nassert round_and_sum([25.0,56.7,89.2])==513", "difficulty": "code"} {"input": "Write a python function to find the cube sum of first n even natural numbers.", "answer": "def cube_Sum(n): \r\n sum = 0\r\n for i in range(1,n + 1): \r\n sum += (2*i)*(2*i)*(2*i) \r\n return sum", "source": "mbpp", "task_id": "420", "test_cases": "assert cube_Sum(2) == 72\nassert cube_Sum(3) == 288\nassert cube_Sum(4) == 800", "difficulty": "code"} {"input": "Write a function to concatenate each element of tuple by the delimiter.", "answer": "def concatenate_tuple(test_tup):\r\n delim = \"-\"\r\n res = ''.join([str(ele) + delim for ele in test_tup])\r\n res = res[ : len(res) - len(delim)]\r\n return (str(res))", "source": "mbpp", "task_id": "421", "test_cases": "assert concatenate_tuple((\"ID\", \"is\", 4, \"UTS\") ) == 'ID-is-4-UTS'\nassert concatenate_tuple((\"QWE\", \"is\", 4, \"RTY\") ) == 'QWE-is-4-RTY'\nassert concatenate_tuple((\"ZEN\", \"is\", 4, \"OP\") ) == 'ZEN-is-4-OP'", "difficulty": "code"} {"input": "Write a python function to find the average of cubes of first n natural numbers.", "answer": "def find_Average_Of_Cube(n): \r\n sum = 0\r\n for i in range(1, n + 1): \r\n sum += i * i * i \r\n return round(sum / n, 6)", "source": "mbpp", "task_id": "422", "test_cases": "assert find_Average_Of_Cube(2) == 4.5\nassert find_Average_Of_Cube(3) == 12\nassert find_Average_Of_Cube(1) == 1", "difficulty": "code"} {"input": "Write a function to solve gold mine problem.", "answer": "def get_maxgold(gold, m, n): \r\n goldTable = [[0 for i in range(n)] \r\n for j in range(m)] \r\n for col in range(n-1, -1, -1): \r\n for row in range(m): \r\n if (col == n-1): \r\n right = 0\r\n else: \r\n right = goldTable[row][col+1] \r\n if (row == 0 or col == n-1): \r\n right_up = 0\r\n else: \r\n right_up = goldTable[row-1][col+1] \r\n if (row == m-1 or col == n-1): \r\n right_down = 0\r\n else: \r\n right_down = goldTable[row+1][col+1] \r\n goldTable[row][col] = gold[row][col] + max(right, right_up, right_down) \r\n res = goldTable[0][0] \r\n for i in range(1, m): \r\n res = max(res, goldTable[i][0]) \r\n return res", "source": "mbpp", "task_id": "423", "test_cases": "assert get_maxgold([[1, 3, 1, 5],[2, 2, 4, 1],[5, 0, 2, 3],[0, 6, 1, 2]],4,4)==16\nassert get_maxgold([[10,20],[30,40]],2,2)==70\nassert get_maxgold([[4,9],[3,7]],2,2)==13", "difficulty": "code"} {"input": "Write a function to extract only the rear index element of each string in the given tuple.", "answer": "def extract_rear(test_tuple):\r\n res = list(sub[len(sub) - 1] for sub in test_tuple)\r\n return (res)", "source": "mbpp", "task_id": "424", "test_cases": "assert extract_rear(('Mers', 'for', 'Vers') ) == ['s', 'r', 's']\nassert extract_rear(('Avenge', 'for', 'People') ) == ['e', 'r', 'e']\nassert extract_rear(('Gotta', 'get', 'go') ) == ['a', 't', 'o']", "difficulty": "code"} {"input": "Write a function to count the number of sublists containing a particular element.", "answer": "def count_element_in_list(list1, x): \r\n ctr = 0\r\n for i in range(len(list1)): \r\n if x in list1[i]: \r\n ctr+= 1 \r\n return ctr", "source": "mbpp", "task_id": "425", "test_cases": "assert count_element_in_list([[1, 3], [5, 7], [1, 11], [1, 15, 7]],1)==3\nassert count_element_in_list([['A', 'B'], ['A', 'C'], ['A', 'D', 'E'], ['B', 'C', 'D']],'A')==3\nassert count_element_in_list([['A', 'B'], ['A', 'C'], ['A', 'D', 'E'], ['B', 'C', 'D']],'E')==1", "difficulty": "code"} {"input": "Write a function to filter odd numbers using lambda function.", "answer": "def filter_oddnumbers(nums):\r\n odd_nums = list(filter(lambda x: x%2 != 0, nums))\r\n return odd_nums", "source": "mbpp", "task_id": "426", "test_cases": "assert filter_oddnumbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1,3,5,7,9]\nassert filter_oddnumbers([10,20,45,67,84,93])==[45,67,93]\nassert filter_oddnumbers([5,7,9,8,6,4,3])==[5,7,9,3]", "difficulty": "code"} {"input": "Write a function to convert a date of yyyy-mm-dd format to dd-mm-yyyy format by using regex.", "answer": "import re\r\ndef change_date_format(dt):\r\n return re.sub(r'(\\d{4})-(\\d{1,2})-(\\d{1,2})', '\\\\3-\\\\2-\\\\1', dt)", "source": "mbpp", "task_id": "427", "test_cases": "assert change_date_format(\"2026-01-02\") == '02-01-2026'\nassert change_date_format(\"2020-11-13\") == '13-11-2020'\nassert change_date_format(\"2021-04-26\") == '26-04-2021'", "difficulty": "code"} {"input": "Write a function to sort the given array by using shell sort.", "answer": "def shell_sort(my_list):\r\n gap = len(my_list) // 2\r\n while gap > 0:\r\n for i in range(gap, len(my_list)):\r\n current_item = my_list[i]\r\n j = i\r\n while j >= gap and my_list[j - gap] > current_item:\r\n my_list[j] = my_list[j - gap]\r\n j -= gap\r\n my_list[j] = current_item\r\n gap //= 2\r\n\r\n return my_list", "source": "mbpp", "task_id": "428", "test_cases": "assert shell_sort([12, 23, 4, 5, 3, 2, 12, 81, 56, 95]) == [2, 3, 4, 5, 12, 12, 23, 56, 81, 95]\nassert shell_sort([24, 22, 39, 34, 87, 73, 68]) == [22, 24, 34, 39, 68, 73, 87]\nassert shell_sort([32, 30, 16, 96, 82, 83, 74]) == [16, 30, 32, 74, 82, 83, 96]", "difficulty": "code"} {"input": "Write a function to extract the elementwise and tuples from the given two tuples.", "answer": "def and_tuples(test_tup1, test_tup2):\r\n res = tuple(ele1 & ele2 for ele1, ele2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "429", "test_cases": "assert and_tuples((10, 4, 6, 9), (5, 2, 3, 3)) == (0, 0, 2, 1)\nassert and_tuples((1, 2, 3, 4), (5, 6, 7, 8)) == (1, 2, 3, 0)\nassert and_tuples((8, 9, 11, 12), (7, 13, 14, 17)) == (0, 9, 10, 0)", "difficulty": "code"} {"input": "Write a function to find the directrix of a parabola.", "answer": "def parabola_directrix(a, b, c): \r\n directrix=((int)(c - ((b * b) + 1) * 4 * a ))\r\n return directrix", "source": "mbpp", "task_id": "430", "test_cases": "assert parabola_directrix(5,3,2)==-198\nassert parabola_directrix(9,8,4)==-2336\nassert parabola_directrix(2,4,6)==-130", "difficulty": "code"} {"input": "Write a function that takes two lists and returns true if they have at least one common element.", "answer": "def common_element(list1, list2):\r\n result = False\r\n for x in list1:\r\n for y in list2:\r\n if x == y:\r\n result = True\r\n return result", "source": "mbpp", "task_id": "431", "test_cases": "assert common_element([1,2,3,4,5], [5,6,7,8,9])==True\nassert common_element([1,2,3,4,5], [6,7,8,9])==None\nassert common_element(['a','b','c'], ['d','b','e'])==True", "difficulty": "code"} {"input": "Write a function to find the median of a trapezium.", "answer": "def median_trapezium(base1,base2,height):\r\n median = 0.5 * (base1+ base2)\r\n return median", "source": "mbpp", "task_id": "432", "test_cases": "assert median_trapezium(15,25,35)==20\nassert median_trapezium(10,20,30)==15\nassert median_trapezium(6,9,4)==7.5", "difficulty": "code"} {"input": "Write a function to check whether the entered number is greater than the elements of the given array.", "answer": "def check_greater(arr, number):\r\n arr.sort()\r\n if number > arr[-1]:\r\n return ('Yes, the entered number is greater than those in the array')\r\n else:\r\n return ('No, entered number is less than those in the array')", "source": "mbpp", "task_id": "433", "test_cases": "assert check_greater([1, 2, 3, 4, 5], 4) == 'No, entered number is less than those in the array'\nassert check_greater([2, 3, 4, 5, 6], 8) == 'Yes, the entered number is greater than those in the array'\nassert check_greater([9, 7, 4, 8, 6, 1], 11) == 'Yes, the entered number is greater than those in the array'", "difficulty": "code"} {"input": "Write a function that matches a string that has an a followed by one or more b's.", "answer": "import re\r\ndef text_match_one(text):\r\n patterns = 'ab+?'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')", "source": "mbpp", "task_id": "434", "test_cases": "assert text_match_one(\"ac\")==('Not matched!')\nassert text_match_one(\"dc\")==('Not matched!')\nassert text_match_one(\"abba\")==('Found a match!')", "difficulty": "code"} {"input": "Write a python function to find the last digit of a given number.", "answer": "def last_Digit(n) :\r\n return (n % 10)", "source": "mbpp", "task_id": "435", "test_cases": "assert last_Digit(123) == 3\nassert last_Digit(25) == 5\nassert last_Digit(30) == 0", "difficulty": "code"} {"input": "Write a python function to print negative numbers in a list.", "answer": "def neg_nos(list1):\r\n for num in list1: \r\n if num < 0: \r\n return num", "source": "mbpp", "task_id": "436", "test_cases": "assert neg_nos([-1,4,5,-6]) == -1,-6\nassert neg_nos([-1,-2,3,4]) == -1,-2\nassert neg_nos([-7,-6,8,9]) == -7,-6", "difficulty": "code"} {"input": "Write a function to remove odd characters in a string.", "answer": "def remove_odd(str1):\r\n str2 = ''\r\n for i in range(1, len(str1) + 1):\r\n if(i % 2 == 0):\r\n str2 = str2 + str1[i - 1]\r\n return str2", "source": "mbpp", "task_id": "437", "test_cases": "assert remove_odd(\"python\")==(\"yhn\")\nassert remove_odd(\"program\")==(\"rga\")\nassert remove_odd(\"language\")==(\"agae\")", "difficulty": "code"} {"input": "Write a function to count bidirectional tuple pairs.", "answer": "def count_bidirectional(test_list):\r\n res = 0\r\n for idx in range(0, len(test_list)):\r\n for iidx in range(idx + 1, len(test_list)):\r\n if test_list[iidx][0] == test_list[idx][1] and test_list[idx][1] == test_list[iidx][0]:\r\n res += 1\r\n return (str(res))", "source": "mbpp", "task_id": "438", "test_cases": "assert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 1), (6, 5), (2, 1)] ) == '3'\nassert count_bidirectional([(5, 6), (1, 3), (6, 5), (9, 1), (6, 5), (2, 1)] ) == '2'\nassert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 2), (6, 5), (2, 1)] ) == '4'", "difficulty": "code"} {"input": "Write a function to convert a list of multiple integers into a single integer.", "answer": "def multiple_to_single(L):\r\n x = int(\"\".join(map(str, L)))\r\n return x", "source": "mbpp", "task_id": "439", "test_cases": "assert multiple_to_single([11, 33, 50])==113350\nassert multiple_to_single([-1,2,3,4,5,6])==-123456\nassert multiple_to_single([10,15,20,25])==10152025", "difficulty": "code"} {"input": "Write a function to find all adverbs and their positions in a given sentence.", "answer": "import re\r\ndef find_adverb_position(text):\r\n for m in re.finditer(r\"\\w+ly\", text):\r\n return (m.start(), m.end(), m.group(0))", "source": "mbpp", "task_id": "440", "test_cases": "assert find_adverb_position(\"clearly!! we can see the sky\")==(0, 7, 'clearly')\nassert find_adverb_position(\"seriously!! there are many roses\")==(0, 9, 'seriously')\nassert find_adverb_position(\"unfortunately!! sita is going to home\")==(0, 13, 'unfortunately')", "difficulty": "code"} {"input": "Write a function to find the surface area of a cube.", "answer": "def surfacearea_cube(l):\r\n surfacearea= 6*l*l\r\n return surfacearea", "source": "mbpp", "task_id": "441", "test_cases": "assert surfacearea_cube(5)==150\nassert surfacearea_cube(3)==54\nassert surfacearea_cube(10)==600", "difficulty": "code"} {"input": "Write a function to find the ration of positive numbers in an array of integers.", "answer": "from array import array\r\ndef positive_count(nums):\r\n n = len(nums)\r\n n1 = 0\r\n for x in nums:\r\n if x > 0:\r\n n1 += 1\r\n else:\r\n None\r\n return round(n1/n,2)", "source": "mbpp", "task_id": "442", "test_cases": "assert positive_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.54\nassert positive_count([2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==0.69\nassert positive_count([2, 4, -6, -9, 11, -12, 14, -5, 17])==0.56", "difficulty": "code"} {"input": "Write a python function to find the largest negative number from the given list.", "answer": "def largest_neg(list1): \r\n max = list1[0] \r\n for x in list1: \r\n if x < max : \r\n max = x \r\n return max", "source": "mbpp", "task_id": "443", "test_cases": "assert largest_neg([1,2,3,-4,-6]) == -6\nassert largest_neg([1,2,3,-8,-9]) == -9\nassert largest_neg([1,2,3,4,-1]) == -1", "difficulty": "code"} {"input": "Write a function to trim each tuple by k in the given tuple list.", "answer": "def trim_tuple(test_list, K):\r\n res = []\r\n for ele in test_list:\r\n N = len(ele)\r\n res.append(tuple(list(ele)[K: N - K]))\r\n return (str(res))", "source": "mbpp", "task_id": "444", "test_cases": "assert trim_tuple([(5, 3, 2, 1, 4), (3, 4, 9, 2, 1),(9, 1, 2, 3, 5), (4, 8, 2, 1, 7)], 2) == '[(2,), (9,), (2,), (2,)]'\nassert trim_tuple([(5, 3, 2, 1, 4), (3, 4, 9, 2, 1), (9, 1, 2, 3, 5), (4, 8, 2, 1, 7)], 1) == '[(3, 2, 1), (4, 9, 2), (1, 2, 3), (8, 2, 1)]'\nassert trim_tuple([(7, 8, 4, 9), (11, 8, 12, 4),(4, 1, 7, 8), (3, 6, 9, 7)], 1) == '[(8, 4), (8, 12), (1, 7), (6, 9)]'", "difficulty": "code"} {"input": "Write a function to perform index wise multiplication of tuple elements in the given two tuples.", "answer": "def index_multiplication(test_tup1, test_tup2):\r\n res = tuple(tuple(a * b for a, b in zip(tup1, tup2))\r\n for tup1, tup2 in zip(test_tup1, test_tup2))\r\n return (res)", "source": "mbpp", "task_id": "445", "test_cases": "assert index_multiplication(((1, 3), (4, 5), (2, 9), (1, 10)),((6, 7), (3, 9), (1, 1), (7, 3)) ) == ((6, 21), (12, 45), (2, 9), (7, 30))\nassert index_multiplication(((2, 4), (5, 6), (3, 10), (2, 11)),((7, 8), (4, 10), (2, 2), (8, 4)) ) == ((14, 32), (20, 60), (6, 20), (16, 44))\nassert index_multiplication(((3, 5), (6, 7), (4, 11), (3, 12)),((8, 9), (5, 11), (3, 3), (9, 5)) ) == ((24, 45), (30, 77), (12, 33), (27, 60))", "difficulty": "code"} {"input": "Write a python function to count the occurence of all elements of list in a tuple.", "answer": "from collections import Counter \r\ndef count_Occurrence(tup, lst): \r\n count = 0\r\n for item in tup: \r\n if item in lst: \r\n count+= 1 \r\n return count", "source": "mbpp", "task_id": "446", "test_cases": "assert count_Occurrence(('a', 'a', 'c', 'b', 'd'),['a', 'b'] ) == 3\nassert count_Occurrence((1, 2, 3, 1, 4, 6, 7, 1, 4),[1, 4, 7]) == 6\nassert count_Occurrence((1,2,3,4,5,6),[1,2]) == 2", "difficulty": "code"} {"input": "Write a function to find cubes of individual elements in a list using lambda function.", "answer": "def cube_nums(nums):\r\n cube_nums = list(map(lambda x: x ** 3, nums))\r\n return cube_nums", "source": "mbpp", "task_id": "447", "test_cases": "assert cube_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]\nassert cube_nums([10,20,30])==([1000, 8000, 27000])\nassert cube_nums([12,15])==([1728, 3375])", "difficulty": "code"} {"input": "Write a function to calculate the sum of perrin numbers.", "answer": "def cal_sum(n): \r\n\ta = 3\r\n\tb = 0\r\n\tc = 2\r\n\tif (n == 0): \r\n\t\treturn 3\r\n\tif (n == 1): \r\n\t\treturn 3\r\n\tif (n == 2): \r\n\t\treturn 5\r\n\tsum = 5\r\n\twhile (n > 2): \r\n\t\td = a + b \r\n\t\tsum = sum + d \r\n\t\ta = b \r\n\t\tb = c \r\n\t\tc = d \r\n\t\tn = n-1\r\n\treturn sum", "source": "mbpp", "task_id": "448", "test_cases": "assert cal_sum(9) == 49\nassert cal_sum(10) == 66\nassert cal_sum(11) == 88", "difficulty": "code"} {"input": "Write a python function to check whether the triangle is valid or not if 3 points are given.", "answer": "def check_Triangle(x1,y1,x2,y2,x3,y3): \r\n a = (x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2)) \r\n if a == 0: \r\n return ('No') \r\n else: \r\n return ('Yes')", "source": "mbpp", "task_id": "449", "test_cases": "assert check_Triangle(1,5,2,5,4,6) == 'Yes'\nassert check_Triangle(1,1,1,4,1,5) == 'No'\nassert check_Triangle(1,1,1,1,1,1) == 'No'", "difficulty": "code"} {"input": "Write a function to extract specified size of strings from a give list of string values.", "answer": "def extract_string(str, l):\r\n result = [e for e in str if len(e) == l] \r\n return result", "source": "mbpp", "task_id": "450", "test_cases": "assert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,8)==['practice', 'solution']\nassert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,6)==['Python']\nassert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,9)==['exercises']", "difficulty": "code"} {"input": "Write a function to remove all whitespaces from the given string using regex.", "answer": "import re\r\ndef remove_whitespaces(text1):\r\n return (re.sub(r'\\s+', '',text1))", "source": "mbpp", "task_id": "451", "test_cases": "assert remove_whitespaces(' Google Flutter ') == 'GoogleFlutter'\nassert remove_whitespaces(' Google Dart ') == 'GoogleDart'\nassert remove_whitespaces(' iOS Swift ') == 'iOSSwift'", "difficulty": "code"} {"input": "Write a function that gives loss amount if the given amount has loss else return none.", "answer": "def loss_amount(actual_cost,sale_amount): \r\n if(sale_amount > actual_cost):\r\n amount = sale_amount - actual_cost\r\n return amount\r\n else:\r\n return None", "source": "mbpp", "task_id": "452", "test_cases": "assert loss_amount(1500,1200)==None\nassert loss_amount(100,200)==100\nassert loss_amount(2000,5000)==3000", "difficulty": "code"} {"input": "Write a python function to find the sum of even factors of a number.", "answer": "import math \r\ndef sumofFactors(n) : \r\n if (n % 2 != 0) : \r\n return 0\r\n res = 1\r\n for i in range(2, (int)(math.sqrt(n)) + 1) : \r\n count = 0\r\n curr_sum = 1\r\n curr_term = 1\r\n while (n % i == 0) : \r\n count= count + 1\r\n n = n // i \r\n if (i == 2 and count == 1) : \r\n curr_sum = 0\r\n curr_term = curr_term * i \r\n curr_sum = curr_sum + curr_term \r\n res = res * curr_sum \r\n if (n >= 2) : \r\n res = res * (1 + n) \r\n return res", "source": "mbpp", "task_id": "453", "test_cases": "assert sumofFactors(18) == 26\nassert sumofFactors(30) == 48\nassert sumofFactors(6) == 8", "difficulty": "code"} {"input": "Write a function that matches a word containing 'z'.", "answer": "import re\r\ndef text_match_wordz(text):\r\n patterns = '\\w*z.\\w*'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')", "source": "mbpp", "task_id": "454", "test_cases": "assert text_match_wordz(\"pythonz.\")==('Found a match!')\nassert text_match_wordz(\"xyz.\")==('Found a match!')\nassert text_match_wordz(\" lang .\")==('Not matched!')", "difficulty": "code"} {"input": "Write a function to check whether the given month number contains 31 days or not.", "answer": "def check_monthnumb_number(monthnum2):\r\n if(monthnum2==1 or monthnum2==3 or monthnum2==5 or monthnum2==7 or monthnum2==8 or monthnum2==10 or monthnum2==12):\r\n return True\r\n else:\r\n return False", "source": "mbpp", "task_id": "455", "test_cases": "assert check_monthnumb_number(5)==True\nassert check_monthnumb_number(2)==False\nassert check_monthnumb_number(6)==False", "difficulty": "code"} {"input": "Write a function to reverse strings in a given list of string values.", "answer": "def reverse_string_list(stringlist):\r\n result = [x[::-1] for x in stringlist]\r\n return result", "source": "mbpp", "task_id": "456", "test_cases": "assert reverse_string_list(['Red', 'Green', 'Blue', 'White', 'Black'])==['deR', 'neerG', 'eulB', 'etihW', 'kcalB']\nassert reverse_string_list(['john','amal','joel','george'])==['nhoj','lama','leoj','egroeg']\nassert reverse_string_list(['jack','john','mary'])==['kcaj','nhoj','yram']", "difficulty": "code"} {"input": "Write a python function to find the sublist having minimum length.", "answer": "def Find_Min(lst): \r\n minList = min((x) for x in lst) \r\n return minList", "source": "mbpp", "task_id": "457", "test_cases": "assert Find_Min([[1],[1,2],[1,2,3]]) == [1]\nassert Find_Min([[1,1],[1,1,1],[1,2,7,8]]) == [1,1]\nassert Find_Min([['x'],['x','y'],['x','y','z']]) == ['x']", "difficulty": "code"} {"input": "Write a function to find the area of a rectangle.", "answer": "def rectangle_area(l,b):\r\n area=l*b\r\n return area", "source": "mbpp", "task_id": "458", "test_cases": "assert rectangle_area(10,20)==200\nassert rectangle_area(10,5)==50\nassert rectangle_area(4,2)==8", "difficulty": "code"} {"input": "Write a function to remove uppercase substrings from a given string by using regex.", "answer": "import re\r\ndef remove_uppercase(str1):\r\n remove_upper = lambda text: re.sub('[A-Z]', '', text)\r\n result = remove_upper(str1)\r\n return (result)", "source": "mbpp", "task_id": "459", "test_cases": "assert remove_uppercase('cAstyoUrFavoRitETVshoWs') == 'cstyoravoitshos'\nassert remove_uppercase('wAtchTheinTernEtrAdIo') == 'wtchheinerntrdo'\nassert remove_uppercase('VoicESeaRchAndreComMendaTionS') == 'oiceachndreomendaion'", "difficulty": "code"} {"input": "Write a python function to get the first element of each sublist.", "answer": "def Extract(lst): \r\n return [item[0] for item in lst]", "source": "mbpp", "task_id": "460", "test_cases": "assert Extract([[1, 2], [3, 4, 5], [6, 7, 8, 9]]) == [1, 3, 6]\nassert Extract([[1,2,3],[4, 5]]) == [1,4]\nassert Extract([[9,8,1],[1,2]]) == [9,1]", "difficulty": "code"} {"input": "Write a python function to count the upper case characters in a given string.", "answer": "def upper_ctr(str):\r\n upper_ctr = 0\r\n for i in range(len(str)):\r\n if str[i] >= 'A' and str[i] <= 'Z': upper_ctr += 1\r\n return upper_ctr", "source": "mbpp", "task_id": "461", "test_cases": "assert upper_ctr('PYthon') == 1\nassert upper_ctr('BigData') == 1\nassert upper_ctr('program') == 0", "difficulty": "code"} {"input": "Write a function to find all possible combinations of the elements of a given list.", "answer": "def combinations_list(list1):\r\n if len(list1) == 0:\r\n return [[]]\r\n result = []\r\n for el in combinations_list(list1[1:]):\r\n result += [el, el+[list1[0]]]\r\n return result", "source": "mbpp", "task_id": "462", "test_cases": "assert combinations_list(['orange', 'red', 'green', 'blue'])==[[], ['orange'], ['red'], ['red', 'orange'], ['green'], ['green', 'orange'], ['green', 'red'], ['green', 'red', 'orange'], ['blue'], ['blue', 'orange'], ['blue', 'red'], ['blue', 'red', 'orange'], ['blue', 'green'], ['blue', 'green', 'orange'], ['blue', 'green', 'red'], ['blue', 'green', 'red', 'orange']]\nassert combinations_list(['red', 'green', 'blue', 'white', 'black', 'orange'])==[[], ['red'], ['green'], ['green', 'red'], ['blue'], ['blue', 'red'], ['blue', 'green'], ['blue', 'green', 'red'], ['white'], ['white', 'red'], ['white', 'green'], ['white', 'green', 'red'], ['white', 'blue'], ['white', 'blue', 'red'], ['white', 'blue', 'green'], ['white', 'blue', 'green', 'red'], ['black'], ['black', 'red'], ['black', 'green'], ['black', 'green', 'red'], ['black', 'blue'], ['black', 'blue', 'red'], ['black', 'blue', 'green'], ['black', 'blue', 'green', 'red'], ['black', 'white'], ['black', 'white', 'red'], ['black', 'white', 'green'], ['black', 'white', 'green', 'red'], ['black', 'white', 'blue'], ['black', 'white', 'blue', 'red'], ['black', 'white', 'blue', 'green'], ['black', 'white', 'blue', 'green', 'red'], ['orange'], ['orange', 'red'], ['orange', 'green'], ['orange', 'green', 'red'], ['orange', 'blue'], ['orange', 'blue', 'red'], ['orange', 'blue', 'green'], ['orange', 'blue', 'green', 'red'], ['orange', 'white'], ['orange', 'white', 'red'], ['orange', 'white', 'green'], ['orange', 'white', 'green', 'red'], ['orange', 'white', 'blue'], ['orange', 'white', 'blue', 'red'], ['orange', 'white', 'blue', 'green'], ['orange', 'white', 'blue', 'green', 'red'], ['orange', 'black'], ['orange', 'black', 'red'], ['orange', 'black', 'green'], ['orange', 'black', 'green', 'red'], ['orange', 'black', 'blue'], ['orange', 'black', 'blue', 'red'], ['orange', 'black', 'blue', 'green'], ['orange', 'black', 'blue', 'green', 'red'], ['orange', 'black', 'white'], ['orange', 'black', 'white', 'red'], ['orange', 'black', 'white', 'green'], ['orange', 'black', 'white', 'green', 'red'], ['orange', 'black', 'white', 'blue'], ['orange', 'black', 'white', 'blue', 'red'], ['orange', 'black', 'white', 'blue', 'green'], ['orange', 'black', 'white', 'blue', 'green', 'red']]\nassert combinations_list(['red', 'green', 'black', 'orange'])==[[], ['red'], ['green'], ['green', 'red'], ['black'], ['black', 'red'], ['black', 'green'], ['black', 'green', 'red'], ['orange'], ['orange', 'red'], ['orange', 'green'], ['orange', 'green', 'red'], ['orange', 'black'], ['orange', 'black', 'red'], ['orange', 'black', 'green'], ['orange', 'black', 'green', 'red']]", "difficulty": "code"} {"input": "Write a function to find the maximum product subarray of the given array.", "answer": "def max_subarray_product(arr):\r\n\tn = len(arr)\r\n\tmax_ending_here = 1\r\n\tmin_ending_here = 1\r\n\tmax_so_far = 0\r\n\tflag = 0\r\n\tfor i in range(0, n):\r\n\t\tif arr[i] > 0:\r\n\t\t\tmax_ending_here = max_ending_here * arr[i]\r\n\t\t\tmin_ending_here = min (min_ending_here * arr[i], 1)\r\n\t\t\tflag = 1\r\n\t\telif arr[i] == 0:\r\n\t\t\tmax_ending_here = 1\r\n\t\t\tmin_ending_here = 1\r\n\t\telse:\r\n\t\t\ttemp = max_ending_here\r\n\t\t\tmax_ending_here = max (min_ending_here * arr[i], 1)\r\n\t\t\tmin_ending_here = temp * arr[i]\r\n\t\tif (max_so_far < max_ending_here):\r\n\t\t\tmax_so_far = max_ending_here\r\n\tif flag == 0 and max_so_far == 0:\r\n\t\treturn 0\r\n\treturn max_so_far", "source": "mbpp", "task_id": "463", "test_cases": "assert max_subarray_product([1, -2, -3, 0, 7, -8, -2]) == 112\nassert max_subarray_product([6, -3, -10, 0, 2]) == 180 \nassert max_subarray_product([-2, -40, 0, -2, -3]) == 80", "difficulty": "code"} {"input": "Write a function to check if all values are same in a dictionary.", "answer": "def check_value(dict, n):\r\n result = all(x == n for x in dict.values()) \r\n return result", "source": "mbpp", "task_id": "464", "test_cases": "assert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},10)==False\nassert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},12)==True\nassert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},5)==False", "difficulty": "code"} {"input": "Write a function to drop empty items from a given dictionary.", "answer": "def drop_empty(dict1):\r\n dict1 = {key:value for (key, value) in dict1.items() if value is not None}\r\n return dict1", "source": "mbpp", "task_id": "465", "test_cases": "assert drop_empty({'c1': 'Red', 'c2': 'Green', 'c3':None})=={'c1': 'Red', 'c2': 'Green'}\nassert drop_empty({'c1': 'Red', 'c2': None, 'c3':None})=={'c1': 'Red'}\nassert drop_empty({'c1': None, 'c2': 'Green', 'c3':None})=={ 'c2': 'Green'}", "difficulty": "code"} {"input": "Write a function to find the peak element in the given array.", "answer": "def find_peak_util(arr, low, high, n): \r\n\tmid = low + (high - low)/2\r\n\tmid = int(mid) \r\n\tif ((mid == 0 or arr[mid - 1] <= arr[mid]) and\r\n\t\t(mid == n - 1 or arr[mid + 1] <= arr[mid])): \r\n\t\treturn mid \r\n\telif (mid > 0 and arr[mid - 1] > arr[mid]): \r\n\t\treturn find_peak_util(arr, low, (mid - 1), n) \r\n\telse: \r\n\t\treturn find_peak_util(arr, (mid + 1), high, n) \r\ndef find_peak(arr, n): \r\n\treturn find_peak_util(arr, 0, n - 1, n)", "source": "mbpp", "task_id": "466", "test_cases": "assert find_peak([1, 3, 20, 4, 1, 0], 6) == 2\nassert find_peak([2, 3, 4, 5, 6], 5) == 4\nassert find_peak([8, 9, 11, 12, 14, 15], 6) == 5 ", "difficulty": "code"} {"input": "Write a python function to convert decimal number to octal number.", "answer": "def decimal_to_Octal(deciNum):\r\n octalNum = 0\r\n countval = 1;\r\n dNo = deciNum;\r\n while (deciNum!= 0):\r\n remainder= deciNum % 8;\r\n octalNum+= remainder*countval;\r\n countval= countval*10;\r\n deciNum //= 8; \r\n return (octalNum)", "source": "mbpp", "task_id": "467", "test_cases": "assert decimal_to_Octal(10) == 12\nassert decimal_to_Octal(2) == 2\nassert decimal_to_Octal(33) == 41", "difficulty": "code"} {"input": "Write a function to find the maximum product formed by multiplying numbers of an increasing subsequence of that array.", "answer": "def max_product(arr, n ): \r\n\tmpis =[0] * (n) \r\n\tfor i in range(n): \r\n\t\tmpis[i] = arr[i] \r\n\tfor i in range(1, n): \r\n\t\tfor j in range(i): \r\n\t\t\tif (arr[i] > arr[j] and\r\n\t\t\t\t\tmpis[i] < (mpis[j] * arr[i])): \r\n\t\t\t\t\t\tmpis[i] = mpis[j] * arr[i] \r\n\treturn max(mpis)", "source": "mbpp", "task_id": "468", "test_cases": "assert max_product([3, 100, 4, 5, 150, 6], 6) == 45000 \nassert max_product([4, 42, 55, 68, 80], 5) == 50265600\nassert max_product([10, 22, 9, 33, 21, 50, 41, 60], 8) == 21780000 ", "difficulty": "code"} {"input": "Write a function to find the maximum profit earned from a maximum of k stock transactions", "answer": "def max_profit(price, k):\r\n n = len(price)\r\n final_profit = [[None for x in range(n)] for y in range(k + 1)]\r\n for i in range(k + 1):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n final_profit[i][j] = 0\r\n else:\r\n max_so_far = 0\r\n for x in range(j):\r\n curr_price = price[j] - price[x] + final_profit[i-1][x]\r\n if max_so_far < curr_price:\r\n max_so_far = curr_price\r\n final_profit[i][j] = max(final_profit[i][j-1], max_so_far)\r\n return final_profit[k][n-1]", "source": "mbpp", "task_id": "469", "test_cases": "assert max_profit([1, 5, 2, 3, 7, 6, 4, 5], 3) == 10\nassert max_profit([2, 4, 7, 5, 4, 3, 5], 2) == 7\nassert max_profit([10, 6, 8, 4, 2], 2) == 2", "difficulty": "code"} {"input": "Write a function to find the pairwise addition of the elements of the given tuples.", "answer": "def add_pairwise(test_tup):\r\n res = tuple(i + j for i, j in zip(test_tup, test_tup[1:]))\r\n return (res)", "source": "mbpp", "task_id": "470", "test_cases": "assert add_pairwise((1, 5, 7, 8, 10)) == (6, 12, 15, 18)\nassert add_pairwise((2, 6, 8, 9, 11)) == (8, 14, 17, 20)\nassert add_pairwise((3, 7, 9, 10, 12)) == (10, 16, 19, 22)", "difficulty": "code"} {"input": "Write a python function to find remainder of array multiplication divided by n.", "answer": "def find_remainder(arr, lens, n): \r\n mul = 1\r\n for i in range(lens): \r\n mul = (mul * (arr[i] % n)) % n \r\n return mul % n", "source": "mbpp", "task_id": "471", "test_cases": "assert find_remainder([ 100, 10, 5, 25, 35, 14 ],6,11) ==9\nassert find_remainder([1,1,1],3,1) == 0\nassert find_remainder([1,2,1],3,2) == 0", "difficulty": "code"} {"input": "Write a python function to check whether the given list contains consecutive numbers or not.", "answer": "def check_Consecutive(l): \r\n return sorted(l) == list(range(min(l),max(l)+1))", "source": "mbpp", "task_id": "472", "test_cases": "assert check_Consecutive([1,2,3,4,5]) == True\nassert check_Consecutive([1,2,3,5,6]) == False\nassert check_Consecutive([1,2,1]) == False", "difficulty": "code"} {"input": "Write a function to find the tuple intersection of elements in the given tuple list irrespective of their order.", "answer": "def tuple_intersection(test_list1, test_list2):\r\n res = set([tuple(sorted(ele)) for ele in test_list1]) & set([tuple(sorted(ele)) for ele in test_list2])\r\n return (res)", "source": "mbpp", "task_id": "473", "test_cases": "assert tuple_intersection([(3, 4), (5, 6), (9, 10), (4, 5)] , [(5, 4), (3, 4), (6, 5), (9, 11)]) == {(4, 5), (3, 4), (5, 6)}\nassert tuple_intersection([(4, 1), (7, 4), (11, 13), (17, 14)] , [(1, 4), (7, 4), (16, 12), (10, 13)]) == {(4, 7), (1, 4)}\nassert tuple_intersection([(2, 1), (3, 2), (1, 3), (1, 4)] , [(11, 2), (2, 3), (6, 2), (1, 3)]) == {(1, 3), (2, 3)}", "difficulty": "code"} {"input": "Write a function to replace characters in a string.", "answer": "def replace_char(str1,ch,newch):\r\n str2 = str1.replace(ch, newch)\r\n return str2", "source": "mbpp", "task_id": "474", "test_cases": "assert replace_char(\"polygon\",'y','l')==(\"pollgon\")\nassert replace_char(\"character\",'c','a')==(\"aharaater\")\nassert replace_char(\"python\",'l','a')==(\"python\")", "difficulty": "code"} {"input": "Write a function to sort counter by value.", "answer": "from collections import Counter\r\ndef sort_counter(dict1):\r\n x = Counter(dict1)\r\n sort_counter=x.most_common()\r\n return sort_counter", "source": "mbpp", "task_id": "475", "test_cases": "assert sort_counter({'Math':81, 'Physics':83, 'Chemistry':87})==[('Chemistry', 87), ('Physics', 83), ('Math', 81)]\nassert sort_counter({'Math':400, 'Physics':300, 'Chemistry':250})==[('Math', 400), ('Physics', 300), ('Chemistry', 250)]\nassert sort_counter({'Math':900, 'Physics':1000, 'Chemistry':1250})==[('Chemistry', 1250), ('Physics', 1000), ('Math', 900)]", "difficulty": "code"} {"input": "Write a python function to find the sum of the largest and smallest value in a given array.", "answer": "def big_sum(nums):\r\n sum= max(nums)+min(nums)\r\n return sum", "source": "mbpp", "task_id": "476", "test_cases": "assert big_sum([1,2,3]) == 4\nassert big_sum([-1,2,3,4]) == 3\nassert big_sum([2,3,6]) == 8", "difficulty": "code"} {"input": "Write a python function to convert the given string to lower case.", "answer": "def is_lower(string):\r\n return (string.lower())", "source": "mbpp", "task_id": "477", "test_cases": "assert is_lower(\"InValid\") == \"invalid\"\nassert is_lower(\"TruE\") == \"true\"\nassert is_lower(\"SenTenCE\") == \"sentence\"", "difficulty": "code"} {"input": "Write a function to remove lowercase substrings from a given string.", "answer": "import re\r\ndef remove_lowercase(str1):\r\n remove_lower = lambda text: re.sub('[a-z]', '', text)\r\n result = remove_lower(str1)\r\n return result", "source": "mbpp", "task_id": "478", "test_cases": "assert remove_lowercase(\"PYTHon\")==('PYTH')\nassert remove_lowercase(\"FInD\")==('FID')\nassert remove_lowercase(\"STRinG\")==('STRG')", "difficulty": "code"} {"input": "Write a python function to find the first digit of a given number.", "answer": "def first_Digit(n) : \r\n while n >= 10: \r\n n = n / 10; \r\n return int(n)", "source": "mbpp", "task_id": "479", "test_cases": "assert first_Digit(123) == 1\nassert first_Digit(456) == 4\nassert first_Digit(12) == 1", "difficulty": "code"} {"input": "Write a python function to find the maximum occurring character in a given string.", "answer": "def get_max_occuring_char(str1):\r\n ASCII_SIZE = 256\r\n ctr = [0] * ASCII_SIZE\r\n max = -1\r\n ch = ''\r\n for i in str1:\r\n ctr[ord(i)]+=1;\r\n for i in str1:\r\n if max < ctr[ord(i)]:\r\n max = ctr[ord(i)]\r\n ch = i\r\n return ch", "source": "mbpp", "task_id": "480", "test_cases": "assert get_max_occuring_char(\"data\") == \"a\"\nassert get_max_occuring_char(\"create\") == \"e\"\nassert get_max_occuring_char(\"brilliant girl\") == \"i\"", "difficulty": "code"} {"input": "Write a function to determine if there is a subset of the given set with sum equal to the given sum.", "answer": "def is_subset_sum(set, n, sum):\r\n\tif (sum == 0):\r\n\t\treturn True\r\n\tif (n == 0):\r\n\t\treturn False\r\n\tif (set[n - 1] > sum):\r\n\t\treturn is_subset_sum(set, n - 1, sum)\r\n\treturn is_subset_sum(set, n-1, sum) or is_subset_sum(set, n-1, sum-set[n-1])", "source": "mbpp", "task_id": "481", "test_cases": "assert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 9) == True\nassert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 30) == False\nassert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 15) == True", "difficulty": "code"} {"input": "Write a function to find sequences of one upper case letter followed by lower case letters in the given string by using regex.", "answer": "import re \r\ndef match(text): \r\n\t\tpattern = '[A-Z]+[a-z]+$'\r\n\t\tif re.search(pattern, text): \r\n\t\t\t\treturn('Yes') \r\n\t\telse: \r\n\t\t\t\treturn('No')", "source": "mbpp", "task_id": "482", "test_cases": "assert match(\"Geeks\") == 'Yes'\nassert match(\"geeksforGeeks\") == 'Yes'\nassert match(\"geeks\") == 'No'", "difficulty": "code"} {"input": "Write a python function to find the first natural number whose factorial is divisible by x.", "answer": "def first_Factorial_Divisible_Number(x): \r\n i = 1;\r\n fact = 1; \r\n for i in range(1,x): \r\n fact = fact * i \r\n if (fact % x == 0): \r\n break\r\n return i", "source": "mbpp", "task_id": "483", "test_cases": "assert first_Factorial_Divisible_Number(10) == 5\nassert first_Factorial_Divisible_Number(15) == 5\nassert first_Factorial_Divisible_Number(5) == 4", "difficulty": "code"} {"input": "Write a function to remove the matching tuples from the given two tuples.", "answer": "def remove_matching_tuple(test_list1, test_list2):\r\n res = [sub for sub in test_list1 if sub not in test_list2]\r\n return (res)", "source": "mbpp", "task_id": "484", "test_cases": "assert remove_matching_tuple([('Hello', 'dude'), ('How', 'are'), ('you', '?')], [('Hello', 'dude'), ('How', 'are')]) == [('you', '?')]\nassert remove_matching_tuple([('Part', 'of'), ('the', 'journey'), ('is ', 'end')], [('Journey', 'the'), ('is', 'end')]) == [('Part', 'of'), ('the', 'journey'), ('is ', 'end')]\nassert remove_matching_tuple([('Its', 'been'), ('a', 'long'), ('day', 'without')], [('a', 'long'), ('my', 'friend')]) == [('Its', 'been'), ('day', 'without')]", "difficulty": "code"} {"input": "Write a function to find the largest palindromic number in the given array.", "answer": "def is_palindrome(n) : \r\n\tdivisor = 1\r\n\twhile (n / divisor >= 10) : \r\n\t\tdivisor *= 10\r\n\twhile (n != 0) : \r\n\t\tleading = n // divisor \r\n\t\ttrailing = n % 10\r\n\t\tif (leading != trailing) : \r\n\t\t\treturn False\r\n\t\tn = (n % divisor) // 10\r\n\t\tdivisor = divisor // 100\r\n\treturn True\r\ndef largest_palindrome(A, n) : \r\n\tA.sort() \r\n\tfor i in range(n - 1, -1, -1) : \r\n\t\tif (is_palindrome(A[i])) : \r\n\t\t\treturn A[i] \r\n\treturn -1", "source": "mbpp", "task_id": "485", "test_cases": "assert largest_palindrome([1, 232, 54545, 999991], 4) == 54545\nassert largest_palindrome([1, 2, 3, 4, 5, 50], 6) == 5\nassert largest_palindrome([1, 3, 7, 9, 45], 5) == 9", "difficulty": "code"} {"input": "Write a function to compute binomial probability for the given number.", "answer": "def nCr(n, r): \r\n\tif (r > n / 2): \r\n\t\tr = n - r \r\n\tanswer = 1 \r\n\tfor i in range(1, r + 1): \r\n\t\tanswer *= (n - r + i) \r\n\t\tanswer /= i \r\n\treturn answer \r\ndef binomial_probability(n, k, p): \r\n\treturn (nCr(n, k) * pow(p, k) *\tpow(1 - p, n - k))", "source": "mbpp", "task_id": "486", "test_cases": "assert binomial_probability(10, 5, 1.0/3) == 0.13656454808718185\nassert binomial_probability(11, 6, 2.0/4) == 0.2255859375\nassert binomial_probability(12, 7, 3.0/5) == 0.227030335488", "difficulty": "code"} {"input": "Write a function to sort a list of tuples in increasing order by the last element in each tuple.", "answer": "def sort_tuple(tup): \r\n\tlst = len(tup) \r\n\tfor i in range(0, lst): \r\n\t\tfor j in range(0, lst-i-1): \r\n\t\t\tif (tup[j][-1] > tup[j + 1][-1]): \r\n\t\t\t\ttemp = tup[j] \r\n\t\t\t\ttup[j]= tup[j + 1] \r\n\t\t\t\ttup[j + 1]= temp \r\n\treturn tup", "source": "mbpp", "task_id": "487", "test_cases": "assert sort_tuple([(1, 3), (3, 2), (2, 1)] ) == [(2, 1), (3, 2), (1, 3)]\nassert sort_tuple([(2, 4), (3, 3), (1, 1)] ) == [(1, 1), (3, 3), (2, 4)]\nassert sort_tuple([(3, 9), (6, 7), (4, 3)] ) == [(4, 3), (6, 7), (3, 9)]", "difficulty": "code"} {"input": "Write a function to find the area of a pentagon.", "answer": "import math\r\ndef area_pentagon(a):\r\n area=(math.sqrt(5*(5+2*math.sqrt(5)))*pow(a,2))/4.0\r\n return area", "source": "mbpp", "task_id": "488", "test_cases": "assert area_pentagon(5)==43.01193501472417\nassert area_pentagon(10)==172.0477400588967\nassert area_pentagon(15)==387.10741513251753", "difficulty": "code"} {"input": "Write a python function to find the frequency of the largest value in a given array.", "answer": "def frequency_Of_Largest(n,arr): \r\n mn = arr[0] \r\n freq = 1\r\n for i in range(1,n): \r\n if (arr[i] >mn): \r\n mn = arr[i] \r\n freq = 1\r\n elif (arr[i] == mn): \r\n freq += 1\r\n return freq", "source": "mbpp", "task_id": "489", "test_cases": "assert frequency_Of_Largest(5,[1,2,3,4,4]) == 2\nassert frequency_Of_Largest(3,[5,6,5]) == 1\nassert frequency_Of_Largest(4,[2,7,7,7]) == 3", "difficulty": "code"} {"input": "Write a function to extract all the pairs which are symmetric in the given tuple list.", "answer": "def extract_symmetric(test_list):\r\n temp = set(test_list) & {(b, a) for a, b in test_list}\r\n res = {(a, b) for a, b in temp if a < b}\r\n return (res)", "source": "mbpp", "task_id": "490", "test_cases": "assert extract_symmetric([(6, 7), (2, 3), (7, 6), (9, 8), (10, 2), (8, 9)] ) == {(8, 9), (6, 7)}\nassert extract_symmetric([(7, 8), (3, 4), (8, 7), (10, 9), (11, 3), (9, 10)] ) == {(9, 10), (7, 8)}\nassert extract_symmetric([(8, 9), (4, 5), (9, 8), (11, 10), (12, 4), (10, 11)] ) == {(8, 9), (10, 11)}", "difficulty": "code"} {"input": "Write a function to find the sum of geometric progression series.", "answer": "import math\r\ndef sum_gp(a,n,r):\r\n total = (a * (1 - math.pow(r, n ))) / (1- r)\r\n return total", "source": "mbpp", "task_id": "491", "test_cases": "assert sum_gp(1,5,2)==31\nassert sum_gp(1,5,4)==341\nassert sum_gp(2,6,3)==728", "difficulty": "code"} {"input": "Write a function to search an element in the given array by using binary search.", "answer": "def binary_search(item_list,item):\r\n\tfirst = 0\r\n\tlast = len(item_list)-1\r\n\tfound = False\r\n\twhile( first<=last and not found):\r\n\t\tmid = (first + last)//2\r\n\t\tif item_list[mid] == item :\r\n\t\t\tfound = True\r\n\t\telse:\r\n\t\t\tif item < item_list[mid]:\r\n\t\t\t\tlast = mid - 1\r\n\t\t\telse:\r\n\t\t\t\tfirst = mid + 1\t\r\n\treturn found", "source": "mbpp", "task_id": "492", "test_cases": "assert binary_search([1,2,3,5,8], 6) == False\nassert binary_search([7, 8, 9, 10, 13], 10) == True\nassert binary_search([11, 13, 14, 19, 22, 36], 23) == False", "difficulty": "code"} {"input": "Write a function to calculate a grid of hexagon coordinates where function returns a list of lists containing 6 tuples of x, y point coordinates.", "answer": "import math\r\ndef calculate_polygons(startx, starty, endx, endy, radius):\r\n sl = (2 * radius) * math.tan(math.pi / 6)\r\n p = sl * 0.5\r\n b = sl * math.cos(math.radians(30))\r\n w = b * 2\r\n h = 2 * sl \r\n startx = startx - w\r\n starty = starty - h\r\n endx = endx + w\r\n endy = endy + h\r\n origx = startx\r\n origy = starty\r\n xoffset = b\r\n yoffset = 3 * p\r\n polygons = []\r\n row = 1\r\n counter = 0\r\n while starty < endy:\r\n if row % 2 == 0:\r\n startx = origx + xoffset\r\n else:\r\n startx = origx\r\n while startx < endx:\r\n p1x = startx\r\n p1y = starty + p\r\n p2x = startx\r\n p2y = starty + (3 * p)\r\n p3x = startx + b\r\n p3y = starty + h\r\n p4x = startx + w\r\n p4y = starty + (3 * p)\r\n p5x = startx + w\r\n p5y = starty + p\r\n p6x = startx + b\r\n p6y = starty\r\n poly = [\r\n (p1x, p1y),\r\n (p2x, p2y),\r\n (p3x, p3y),\r\n (p4x, p4y),\r\n (p5x, p5y),\r\n (p6x, p6y),\r\n (p1x, p1y)]\r\n polygons.append(poly)\r\n counter += 1\r\n startx += w\r\n starty += yoffset\r\n row += 1\r\n return polygons", "source": "mbpp", "task_id": "493", "test_cases": "assert calculate_polygons(1,1, 4, 4, 3)==[[(-5.0, -4.196152422706632), (-5.0, -0.7320508075688767), (-2.0, 1.0), (1.0, -0.7320508075688767), (1.0, -4.196152422706632), (-2.0, -5.928203230275509), (-5.0, -4.196152422706632)], [(1.0, -4.196152422706632), (1.0, -0.7320508075688767), (4.0, 1.0), (7.0, -0.7320508075688767), (7.0, -4.196152422706632), (4.0, -5.928203230275509), (1.0, -4.196152422706632)], [(7.0, -4.196152422706632), (7.0, -0.7320508075688767), (10.0, 1.0), (13.0, -0.7320508075688767), (13.0, -4.196152422706632), (10.0, -5.928203230275509), (7.0, -4.196152422706632)], [(-2.0, 1.0000000000000004), (-2.0, 4.464101615137755), (1.0, 6.196152422706632), (4.0, 4.464101615137755), (4.0, 1.0000000000000004), (1.0, -0.7320508075688767), (-2.0, 1.0000000000000004)], [(4.0, 1.0000000000000004), (4.0, 4.464101615137755), (7.0, 6.196152422706632), (10.0, 4.464101615137755), (10.0, 1.0000000000000004), (7.0, -0.7320508075688767), (4.0, 1.0000000000000004)], [(-5.0, 6.196152422706632), (-5.0, 9.660254037844387), (-2.0, 11.392304845413264), (1.0, 9.660254037844387), (1.0, 6.196152422706632), (-2.0, 4.464101615137755), (-5.0, 6.196152422706632)], [(1.0, 6.196152422706632), (1.0, 9.660254037844387), (4.0, 11.392304845413264), (7.0, 9.660254037844387), (7.0, 6.196152422706632), (4.0, 4.464101615137755), (1.0, 6.196152422706632)], [(7.0, 6.196152422706632), (7.0, 9.660254037844387), (10.0, 11.392304845413264), (13.0, 9.660254037844387), (13.0, 6.196152422706632), (10.0, 4.464101615137755), (7.0, 6.196152422706632)], [(-2.0, 11.392304845413264), (-2.0, 14.85640646055102), (1.0, 16.588457268119896), (4.0, 14.85640646055102), (4.0, 11.392304845413264), (1.0, 9.660254037844387), (-2.0, 11.392304845413264)], [(4.0, 11.392304845413264), (4.0, 14.85640646055102), (7.0, 16.588457268119896), (10.0, 14.85640646055102), (10.0, 11.392304845413264), (7.0, 9.660254037844387), (4.0, 11.392304845413264)]]\nassert calculate_polygons(5,4,7,9,8)==[[(-11.0, -9.856406460551018), (-11.0, -0.6188021535170058), (-3.0, 4.0), (5.0, -0.6188021535170058), (5.0, -9.856406460551018), (-3.0, -14.475208614068023), (-11.0, -9.856406460551018)], [(5.0, -9.856406460551018), (5.0, -0.6188021535170058), (13.0, 4.0), (21.0, -0.6188021535170058), (21.0, -9.856406460551018), (13.0, -14.475208614068023), (5.0, -9.856406460551018)], [(21.0, -9.856406460551018), (21.0, -0.6188021535170058), (29.0, 4.0), (37.0, -0.6188021535170058), (37.0, -9.856406460551018), (29.0, -14.475208614068023), (21.0, -9.856406460551018)], [(-3.0, 4.0), (-3.0, 13.237604307034012), (5.0, 17.856406460551018), (13.0, 13.237604307034012), (13.0, 4.0), (5.0, -0.6188021535170058), (-3.0, 4.0)], [(13.0, 4.0), (13.0, 13.237604307034012), (21.0, 17.856406460551018), (29.0, 13.237604307034012), (29.0, 4.0), (21.0, -0.6188021535170058), (13.0, 4.0)], [(-11.0, 17.856406460551018), (-11.0, 27.09401076758503), (-3.0, 31.712812921102035), (5.0, 27.09401076758503), (5.0, 17.856406460551018), (-3.0, 13.237604307034012), (-11.0, 17.856406460551018)], [(5.0, 17.856406460551018), (5.0, 27.09401076758503), (13.0, 31.712812921102035), (21.0, 27.09401076758503), (21.0, 17.856406460551018), (13.0, 13.237604307034012), (5.0, 17.856406460551018)], [(21.0, 17.856406460551018), (21.0, 27.09401076758503), (29.0, 31.712812921102035), (37.0, 27.09401076758503), (37.0, 17.856406460551018), (29.0, 13.237604307034012), (21.0, 17.856406460551018)], [(-3.0, 31.712812921102035), (-3.0, 40.95041722813605), (5.0, 45.569219381653056), (13.0, 40.95041722813605), (13.0, 31.712812921102035), (5.0, 27.09401076758503), (-3.0, 31.712812921102035)], [(13.0, 31.712812921102035), (13.0, 40.95041722813605), (21.0, 45.569219381653056), (29.0, 40.95041722813605), (29.0, 31.712812921102035), (21.0, 27.09401076758503), (13.0, 31.712812921102035)]]\nassert calculate_polygons(9,6,4,3,2)==[[(5.0, 2.5358983848622456), (5.0, 4.8452994616207485), (7.0, 6.0), (9.0, 4.8452994616207485), (9.0, 2.5358983848622456), (7.0, 1.3811978464829942), (5.0, 2.5358983848622456)], [(7.0, 6.0), (7.0, 8.309401076758503), (9.0, 9.464101615137753), (11.0, 8.309401076758503), (11.0, 6.0), (9.0, 4.8452994616207485), (7.0, 6.0)]]", "difficulty": "code"} {"input": "Write a function to convert the given binary tuple to integer.", "answer": "def binary_to_integer(test_tup):\r\n res = int(\"\".join(str(ele) for ele in test_tup), 2)\r\n return (str(res))", "source": "mbpp", "task_id": "494", "test_cases": "assert binary_to_integer((1, 1, 0, 1, 0, 0, 1)) == '105'\nassert binary_to_integer((0, 1, 1, 0, 0, 1, 0, 1)) == '101'\nassert binary_to_integer((1, 1, 0, 1, 0, 1)) == '53'", "difficulty": "code"} {"input": "Write a function to remove lowercase substrings from a given string by using regex.", "answer": "import re\r\ndef remove_lowercase(str1):\r\n remove_lower = lambda text: re.sub('[a-z]', '', text)\r\n result = remove_lower(str1)\r\n return (result)", "source": "mbpp", "task_id": "495", "test_cases": "assert remove_lowercase('KDeoALOklOOHserfLoAJSIskdsf') == 'KDALOOOHLAJSI'\nassert remove_lowercase('ProducTnamEstreAmIngMediAplAYer') == 'PTEAIMAAY'\nassert remove_lowercase('maNufacTuredbYSheZenTechNolOGIes') == 'NTYSZTNOGI'", "difficulty": "code"} {"input": "Write a function to find the smallest integers from a given list of numbers using heap queue algorithm.", "answer": "import heapq as hq\r\ndef heap_queue_smallest(nums,n):\r\n smallest_nums = hq.nsmallest(n, nums)\r\n return smallest_nums", "source": "mbpp", "task_id": "496", "test_cases": "assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],3)==[14, 22, 25] \nassert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],2)==[14, 22]\nassert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[14, 22, 22, 25, 35]", "difficulty": "code"} {"input": "Write a function to find the surface area of a cone.", "answer": "import math\r\ndef surfacearea_cone(r,h):\r\n l = math.sqrt(r * r + h * h)\r\n SA = math.pi * r * (r + l)\r\n return SA", "source": "mbpp", "task_id": "497", "test_cases": "assert surfacearea_cone(5,12)==282.7433388230814\nassert surfacearea_cone(10,15)==880.5179353159282\nassert surfacearea_cone(19,17)==2655.923961165254", "difficulty": "code"} {"input": "Write a python function to find gcd of two positive integers.", "answer": "def gcd(x, y):\r\n gcd = 1\r\n if x % y == 0:\r\n return y\r\n for k in range(int(y / 2), 0, -1):\r\n if x % k == 0 and y % k == 0:\r\n gcd = k\r\n break \r\n return gcd", "source": "mbpp", "task_id": "498", "test_cases": "assert gcd(12, 17) == 1\nassert gcd(4,6) == 2\nassert gcd(2,9) == 1", "difficulty": "code"} {"input": "Write a function to find the diameter of a circle.", "answer": "def diameter_circle(r):\r\n diameter=2*r\r\n return diameter", "source": "mbpp", "task_id": "499", "test_cases": "assert diameter_circle(10)==20\nassert diameter_circle(40)==80\nassert diameter_circle(15)==30", "difficulty": "code"} {"input": "Write a function to concatenate all elements of the given list into a string.", "answer": "def concatenate_elements(list):\r\n ans = ' '\r\n for i in list:\r\n ans = ans+ ' '+i\r\n return (ans)", "source": "mbpp", "task_id": "500", "test_cases": "assert concatenate_elements(['hello','there','have','a','rocky','day'] ) == ' hello there have a rocky day'\nassert concatenate_elements([ 'Hi', 'there', 'How','are', 'you'] ) == ' Hi there How are you'\nassert concatenate_elements([ 'Part', 'of', 'the','journey', 'is', 'end'] ) == ' Part of the journey is end'", "difficulty": "code"} {"input": "Write a python function to find common divisor between two numbers in a given pair.", "answer": "def ngcd(x,y):\r\n i=1\r\n while(i<=x and i<=y):\r\n if(x%i==0 and y%i == 0):\r\n gcd=i;\r\n i+=1\r\n return gcd;\r\ndef num_comm_div(x,y):\r\n n = ngcd(x,y)\r\n result = 0\r\n z = int(n**0.5)\r\n i = 1\r\n while(i <= z):\r\n if(n % i == 0):\r\n result += 2 \r\n if(i == n/i):\r\n result-=1\r\n i+=1\r\n return result", "source": "mbpp", "task_id": "501", "test_cases": "assert num_comm_div(2,4) == 2\nassert num_comm_div(2,8) == 2\nassert num_comm_div(12,24) == 6", "difficulty": "code"} {"input": "Write a python function to find remainder of two numbers.", "answer": "def find(n,m):\r\n r = n%m\r\n return (r)", "source": "mbpp", "task_id": "502", "test_cases": "assert find(3,3) == 0\nassert find(10,3) == 1\nassert find(16,5) == 1", "difficulty": "code"} {"input": "Write a function to add consecutive numbers of a given list.", "answer": "def add_consecutive_nums(nums):\r\n result = [b+a for a, b in zip(nums[:-1], nums[1:])]\r\n return result", "source": "mbpp", "task_id": "503", "test_cases": "assert add_consecutive_nums([1, 1, 3, 4, 4, 5, 6, 7])==[2, 4, 7, 8, 9, 11, 13]\nassert add_consecutive_nums([4, 5, 8, 9, 6, 10])==[9, 13, 17, 15, 16]\nassert add_consecutive_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[3, 5, 7, 9, 11, 13, 15, 17, 19]", "difficulty": "code"} {"input": "Write a python function to find the cube sum of first n natural numbers.", "answer": "def sum_Of_Series(n): \r\n sum = 0\r\n for i in range(1,n + 1): \r\n sum += i * i*i \r\n return sum", "source": "mbpp", "task_id": "504", "test_cases": "assert sum_Of_Series(5) == 225\nassert sum_Of_Series(2) == 9\nassert sum_Of_Series(3) == 36", "difficulty": "code"} {"input": "Write a function to move all zeroes to the end of the given array.", "answer": "def re_order(A):\r\n k = 0\r\n for i in A:\r\n if i:\r\n A[k] = i\r\n k = k + 1\r\n for i in range(k, len(A)):\r\n A[i] = 0\r\n return A", "source": "mbpp", "task_id": "505", "test_cases": "assert re_order([6, 0, 8, 2, 3, 0, 4, 0, 1]) == [6, 8, 2, 3, 4, 1, 0, 0, 0]\nassert re_order([4, 0, 2, 7, 0, 9, 0, 12, 0]) == [4, 2, 7, 9, 12, 0, 0, 0, 0]\nassert re_order([3, 11, 0, 74, 14, 0, 1, 0, 2]) == [3, 11, 74, 14, 1, 2, 0, 0, 0]", "difficulty": "code"} {"input": "Write a function to calculate the permutation coefficient of given p(n, k).", "answer": "def permutation_coefficient(n, k): \r\n\tP = [[0 for i in range(k + 1)] \r\n\t\t\tfor j in range(n + 1)] \r\n\tfor i in range(n + 1): \r\n\t\tfor j in range(min(i, k) + 1): \r\n\t\t\tif (j == 0): \r\n\t\t\t\tP[i][j] = 1\r\n\t\t\telse: \r\n\t\t\t\tP[i][j] = P[i - 1][j] + ( \r\n\t\t\t\t\t\tj * P[i - 1][j - 1]) \r\n\t\t\tif (j < k): \r\n\t\t\t\tP[i][j + 1] = 0\r\n\treturn P[n][k]", "source": "mbpp", "task_id": "506", "test_cases": "assert permutation_coefficient(10, 2) == 90\nassert permutation_coefficient(10, 3) == 720\nassert permutation_coefficient(10, 1) == 10", "difficulty": "code"} {"input": "Write a function to remove specific words from a given list.", "answer": "def remove_words(list1, removewords):\r\n for word in list(list1):\r\n if word in removewords:\r\n list1.remove(word)\r\n return list1", "source": "mbpp", "task_id": "507", "test_cases": "assert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['white', 'orange'])==['red', 'green', 'blue', 'black']\nassert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['black', 'orange'])==['red', 'green', 'blue', 'white']\nassert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['blue', 'white'])==['red', 'green', 'black', 'orange']", "difficulty": "code"} {"input": "Write a function to check if the common elements between two given lists are in the same order or not.", "answer": "def same_order(l1, l2):\r\n common_elements = set(l1) & set(l2)\r\n l1 = [e for e in l1 if e in common_elements]\r\n l2 = [e for e in l2 if e in common_elements]\r\n return l1 == l2", "source": "mbpp", "task_id": "508", "test_cases": "assert same_order([\"red\",\"green\",\"black\",\"orange\"],[\"red\",\"pink\",\"green\",\"white\",\"black\"])==True\nassert same_order([\"red\",\"pink\",\"green\",\"white\",\"black\"],[\"white\",\"orange\",\"pink\",\"black\"])==False\nassert same_order([\"red\",\"green\",\"black\",\"orange\"],[\"red\",\"pink\",\"green\",\"white\",\"black\"])==True", "difficulty": "code"} {"input": "Write a python function to find the average of odd numbers till a given odd number.", "answer": "def average_Odd(n) : \r\n if (n%2==0) : \r\n return (\"Invalid Input\") \r\n return -1 \r\n sm =0\r\n count =0\r\n while (n>=1) : \r\n count=count+1\r\n sm = sm + n \r\n n = n-2\r\n return sm//count", "source": "mbpp", "task_id": "509", "test_cases": "assert average_Odd(9) == 5\nassert average_Odd(5) == 3\nassert average_Odd(11) == 6", "difficulty": "code"} {"input": "Write a function to find the number of subsequences having product smaller than k for the given non negative array.", "answer": "def no_of_subsequences(arr, k): \r\n\tn = len(arr) \r\n\tdp = [[0 for i in range(n + 1)] \r\n\t\t\tfor j in range(k + 1)] \r\n\tfor i in range(1, k + 1): \r\n\t\tfor j in range(1, n + 1): \r\n\t\t\tdp[i][j] = dp[i][j - 1] \r\n\t\t\tif arr[j - 1] <= i and arr[j - 1] > 0: \r\n\t\t\t\tdp[i][j] += dp[i // arr[j - 1]][j - 1] + 1\r\n\treturn dp[k][n]", "source": "mbpp", "task_id": "510", "test_cases": "assert no_of_subsequences([1,2,3,4], 10) == 11\nassert no_of_subsequences([4,8,7,2], 50) == 9\nassert no_of_subsequences([5,6,7,8], 15) == 4", "difficulty": "code"}