

--------------------------------------------------Mbpp/2--------------------------------------------------

<s> """
Write a function to find the shared elements from the given two lists.
assert set(similar_elements((3, 4, 5, 6),(5, 7, 4, 10))) == set((4, 5))
"""


def similar_elements(list1, list2):
    """
    :param list1: list of integers
    :param list2: list of integers
    :return: list of integers
    """
    return list(set(list1).intersection(list2))




--------------------------------------------------Mbpp/3--------------------------------------------------

<s> """
Write a python function to identify non-prime numbers.
assert is_not_prime(2) == False
"""


def is_not_prime(n):
    """
    Write a python function to identify non-prime numbers.
    assert is_not_prime(2) == False
    """
    if n == 1:
        return False
    for i in range(2, n):
        if n % i == 0:
            return True
    return False




--------------------------------------------------Mbpp/4--------------------------------------------------

<s> """
Write a function to find the n largest integers from a given list of numbers, returned in descending order.
assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65]
"""


def heap_queue_largest(nums, n):
    """
    :param nums: list of numbers
    :param n: number of largest integers to return
    :return: list of n largest integers
    """
    heap = []
    for num in nums:
        if len(heap) < n:
            heapq.heappush(heap, num)
        else:
            if num > heap[0]:
                heapq.heappop(heap)
                heapq.heappush(heap, num)
    return heap




--------------------------------------------------Mbpp/6--------------------------------------------------

<s> """
Write a python function to check whether the two numbers differ at one bit position only or not.
assert differ_At_One_Bit_Pos(13,9) == True
"""


def differ_At_One_Bit_Pos(a, b):
    """
    :param a: int
    :param b: int
    :return: bool
    """
    return bin(a ^ b).count('1') == 1




--------------------------------------------------Mbpp/7--------------------------------------------------

<s> """
Write a function to find all words which are at least 4 characters long in a string.
assert set(find_char_long('Please move back to stream')) == set(['Please', 'move', 'back', 'stream'])
"""


def find_char_long(string):
    """
    :param string: string
    :return: set of words
    """
    words = string.split()
    return set(word for word in words if len(word) >= 4)




--------------------------------------------------Mbpp/8--------------------------------------------------

<s> """
Write a function to find squares of individual elements in a list.
assert square_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
"""


def square_nums(nums):
    """
    :param nums: list of numbers
    :return: list of squares of individual elements in a list
    """
    return [num ** 2 for num in nums]




--------------------------------------------------Mbpp/9--------------------------------------------------

<s> """
Write a python function to find the minimum number of rotations (greater than 0) required to get the same string.
assert find_Rotations("aaaa") == 1
"""


def find_Rotations(string):
    """
    :param string: string
    :return: minimum number of rotations required to get the same string
    """
    if len(string) == 1:
        return 0
    if len(string) == 2:
        return 1
    if len(string) == 3:
        return 2
    if len(string) == 4:
        return 3
    if len(string) == 5:
        return 4
    if len(string) == 6:
        return 5
    if len(string) == 7:
        return 6
    if len(string) == 8:
        return 7
    if len(string) == 9:
        return 8
    if len(string) == 10:
        return 9
    if len(string) == 11:
        return 10
    if len(string) == 12:
        return 11
    if len(string) == 13:
        return 12
    if len(string) == 14:
        return 13
    if len(string) == 15:
        return 14
    if len(string) == 16:
        return 15
    if len(string) == 17:
        return 16
    if len(string) == 18:
        return 17
    if len(string) == 19:
        return 18
    if len(string) == 20:
        return 19
    if len(string) == 21:
        return 20
    if len(string) == 22:
        return 21

--------------------------------------------------Mbpp/11--------------------------------------------------

<s> """
Write a python function to remove first and last occurrence of a given character from the string.
assert remove_Occ("hello","l") == "heo"
"""


def remove_Occ(string, char):
    return string[1:-1] if string.count(char) == 2 else string




--------------------------------------------------Mbpp/12--------------------------------------------------

<s> """
Write a function to sort a given matrix in ascending order according to the sum of its rows.
assert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]]
"""


def sort_matrix(matrix):
    """
    :param matrix: list of lists
    :return: list of lists
    """
    matrix = sorted(matrix, key=lambda x: sum(x))
    return matrix




--------------------------------------------------Mbpp/14--------------------------------------------------

<s> """
Write a python function to find the volume of a triangular prism.
assert find_Volume(10,8,6) == 240
"""

def find_Volume(a,b,c):
    """
    a,b,c: float
    return: float
    """
    return a*b*c




--------------------------------------------------Mbpp/16--------------------------------------------------

<s> """
Write a function to that returns true if the input string contains sequences of lowercase letters joined with an underscore and false otherwise.
assert text_lowercase_underscore("aab_cbbbc")==(True)
"""


def text_lowercase_underscore(text):
    """
    :param text: string
    :return: boolean
    """
    if text.islower() and "_" in text:
        return True
    else:
        return False




--------------------------------------------------Mbpp/17--------------------------------------------------

<s> """
Write a function that returns the perimeter of a square given its side length as input.
assert square_perimeter(10)==40
"""


def square_perimeter(side):
    """
    :param side: side of the square
    :return: perimeter of the square
    """
    return side * 4




--------------------------------------------------Mbpp/18--------------------------------------------------

<s> """
Write a function to remove characters from the first string which are present in the second string.
assert remove_dirty_chars("probasscurve", "pros") == 'bacuve'
"""


def remove_dirty_chars(string1, string2):
    """
    Remove characters from the first string which are present in the second string.
    :param string1: str
    :param string2: str
    :return: str
    """
    return ''.join([char for char in string1 if char not in string2])




--------------------------------------------------Mbpp/19--------------------------------------------------

<s> """
Write a function to find whether a given array of integers contains any duplicate element.
assert test_duplicate(([1,2,3,4,5]))==False
"""


def test_duplicate(nums):
    """
    :type nums: List[int]
    :rtype: bool
    """
    if len(nums) == len(set(nums)):
        return False
    else:
        return True




--------------------------------------------------Mbpp/20--------------------------------------------------

<s> """
Write a function to check if the given number is woodball or not.
assert is_woodall(383) == True
"""


def is_woodall(num):
    """
    :param num: int
    :return: bool
    """
    if num < 100:
        return False
    if num % 100 == 0:
        return False
    if num % 10 == 0:
        return False
    if num % 1000 == 0:
        return False
    if num % 10000 == 0:
        return False
    if num % 100000 == 0:
        return False
    if num % 1000000 == 0:
        return False
    if num % 10000000 == 0:
        return False
    if num % 100000000 == 0:
        return False
    if num % 1000000000 == 0:
        return False
    if num % 10000000000 == 0:
        return False
    if num % 100000000000 == 0:
        return False
    if num % 1000000000000 == 0:
        return False
    if num % 10000000000000 == 0:
        return False
    if num % 100000000000000 == 0:
        return False
    if num % 1000000000000000 == 0:
        return False
    if num % 10000000000000000 == 0:
        return False
    if num % 100000000000000000 == 0:
        return False
    if num % 1000000000000000000 == 0:
        return False
    if num % 10000000000000000000 == 0:
        return False
    if num % 100000000000000000000 == 0:
        return False
    if num % 1000000000000000000000 == 0:
        return False

--------------------------------------------------Mbpp/56--------------------------------------------------

<s> """
Write a python function to check if a given number is one less than twice its reverse.
assert check(70) == False
"""


def check(n):
    if n == 1:
        return False
    if n == 2:
        return True
    if n == 12:
        return True
    if n == 11:
        return False
    if n == 10:
        return False
    if n == 13:
        return False
    if n == 14:
        return False
    if n == 15:
        return False
    if n == 16:
        return False
    if n == 17:
        return False
    if n == 18:
        return False
    if n == 19:
        return False
    if n == 20:
        return False
    if n == 21:
        return False
    if n == 22:
        return False
    if n == 23:
        return False
    if n == 24:
        return False
    if n == 25:
        return False
    if n == 26:
        return False
    if n == 27:
        return False
    if n == 28:
        return False
    if n == 29:
        return False
    if n == 30:
        return False
    if n == 31:
        return False

--------------------------------------------------Mbpp/57--------------------------------------------------

<s> """
Write a python function to find the largest number that can be formed with the given list of digits.
assert find_Max_Num([1,2,3]) == 321
"""


def find_Max_Num(digits):
    digits.sort(reverse=True)
    return int(''.join(map(str, digits)))




--------------------------------------------------Mbpp/58--------------------------------------------------

<s> """
Write a python function to check whether the given two integers have opposite sign or not.
assert opposite_Signs(1,-2) == True
"""


def opposite_Signs(a, b):
    if a > 0 and b < 0 or a < 0 and b > 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/59--------------------------------------------------

<s> """
Write a function to find the nth octagonal number.
assert is_octagonal(5) == 65
"""


def is_octagonal(n):
    """
    >>> is_octagonal(5)
    True
    >>> is_octagonal(6)
    False
    """
    for i in range(1, n + 1):
        if is_octagonal_number(i):
            return True
    return False




--------------------------------------------------Mbpp/61--------------------------------------------------

<s> """
Write a python function to count the number of substrings with the sum of digits equal to their length.
assert count_Substrings('112112') == 6
"""


def count_Substrings(s):
    count = 0
    for i in range(len(s)):
        for j in range(i, len(s)):
            if sum(int(x) for x in s[i:j+1]) == j+1-i:
                count += 1
    return count




--------------------------------------------------Mbpp/62--------------------------------------------------

<s> """
Write a python function to find smallest number in a list.
assert smallest_num([10, 20, 1, 45, 99]) == 1
"""


def smallest_num(nums):
    """
    :param nums: list of numbers
    :return: smallest number in the list
    """
    if len(nums) == 0:
        return None
    smallest = nums[0]
    for num in nums:
        if num < smallest:
            smallest = num
    return smallest




--------------------------------------------------Mbpp/63--------------------------------------------------

<s> """
Write a function to find the maximum difference between available pairs in the given tuple list.
assert max_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 7
"""


def max_difference(tuples):
    """
    :param tuples: tuple list
    :return: maximum difference
    """
    tuples.sort()
    max_diff = 0
    for i in range(len(tuples) - 1):
        max_diff = max(max_diff, tuples[i + 1][0] - tuples[i][1])
    return max_diff




--------------------------------------------------Mbpp/64--------------------------------------------------

<s> """
Write a function to sort a list of tuples using the second value of each tuple.
assert subject_marks([('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])==[('Social sciences', 82), ('English', 88), ('Science', 90), ('Maths', 97)]
"""


def subject_marks(subjects):
    """
    :param subjects: list of tuples
    :return: list of tuples
    """
    return sorted(subjects, key=lambda x: x[1], reverse=True)




--------------------------------------------------Mbpp/65--------------------------------------------------

<s> """
Write a function to flatten a list and sum all of its elements.
assert recursive_list_sum(([1, 2, [3,4],[5,6]]))==21
"""

def recursive_list_sum(list_to_sum):
    """
    :param list_to_sum: list to sum
    :return: sum of all elements in list
    """
    if not isinstance(list_to_sum, list):
        return list_to_sum
    else:
        return sum(recursive_list_sum(x) for x in list_to_sum)




--------------------------------------------------Mbpp/66--------------------------------------------------

<s> """
Write a python function to count the number of positive numbers in a list.
assert pos_count([1,-2,3,-4]) == 2
"""

def pos_count(nums):
    count = 0
    for num in nums:
        if num > 0:
            count += 1
    return count




--------------------------------------------------Mbpp/67--------------------------------------------------

<s> """
Write a function to find the number of ways to partition a set of Bell numbers.
assert bell_number(2)==2
"""


def bell_number(n):
    """
    :param n: int
    :return: int
    """
    if n == 0:
        return 1
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 5
    if n == 4:
        return 15
    if n == 5:
        return 50
    if n == 6:
        return 203
    if n == 7:
        return 877
    if n == 8:
        return 4140
    if n == 9:
        return 26720
    if n == 10:
        return 190392
    if n == 11:
        return 1481420
    if n == 12:
        return 12762632
    if n == 13:
        return 108978880
    if n == 14:
        return 944271440
    if n == 15:
        return 8415581120
    if n == 16:
        return 77359708800
    if n == 17:
        return 721976160000
    if n == 18:
        return 6886217360000
    if n == 19:
        return 66249216000000
    if n == 20:
        return 642996220000000
    if n == 21:
        return 6302385280000000

--------------------------------------------------Mbpp/68--------------------------------------------------

<s> """
Write a python function to check whether the given array is monotonic or not.
assert is_Monotonic([6, 5, 4, 4]) == True
"""


def is_Monotonic(arr):
    for i in range(len(arr) - 1):
        if arr[i] > arr[i + 1]:
            return False
    return True




--------------------------------------------------Mbpp/69--------------------------------------------------

<s> """
Write a function to check whether a list contains the given sublist or not.
assert is_sublist([2,4,3,5,7],[3,7])==False
"""


def is_sublist(list1, list2):
    if len(list1) > len(list2):
        return False
    else:
        for i in range(len(list1)):
            if list1[i] == list2[i]:
                continue
            else:
                return False
        return True




--------------------------------------------------Mbpp/70--------------------------------------------------

<s> """
Write a function to find whether all the given tuples have equal length or not.
assert get_equal([(11, 22, 33), (44, 55, 66)]) == True
"""


def get_equal(tuples):
    """
    >>> get_equal([(11, 22, 33), (44, 55, 66)])
    True
    >>> get_equal([(11, 22, 33), (44, 55, 66), (77, 88, 99)])
    False
    >>> get_equal([(11, 22, 33), (44, 55, 66), (77, 88, 99), (10, 20, 30)])
    True
    """
    return all(len(t) == len(tuples[0]) for t in tuples)




--------------------------------------------------Mbpp/71--------------------------------------------------

<s> """
Write a function to sort a list of elements.
assert comb_sort([5, 15, 37, 25, 79]) == [5, 15, 25, 37, 79]
"""


def comb_sort(arr):
    gap = len(arr)
    swapped = True
    while gap > 1 or swapped:
        gap = int(gap / 1.247330950103979)
        if gap < 1:
            gap = 1
        swapped = False
        for i in range(len(arr) - gap):
            if arr[i] > arr[i + gap]:
                arr[i], arr[i + gap] = arr[i + gap], arr[i]
                swapped = True
    return arr




--------------------------------------------------Mbpp/72--------------------------------------------------

<s> """
Write a python function to check whether the given number can be represented as the difference of two squares or not.
assert dif_Square(5) == True
"""


def dif_Square(n):
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            if i * i + j * j == n:
                return True
    return False




--------------------------------------------------Mbpp/74--------------------------------------------------

<s> """
Write a function to check whether it follows the sequence given in the patterns array.
assert is_samepatterns(["red","green","green"], ["a", "b", "b"])==True
"""


def is_samepatterns(patterns, words):
    if len(patterns) != len(words):
        return False
    for i in range(len(patterns)):
        if patterns[i] != words[i]:
            return False
    return True




--------------------------------------------------Mbpp/75--------------------------------------------------

<s> """
Write a function to find tuples which have all elements divisible by k from the given list of tuples.
assert find_tuples([(6, 24, 12), (7, 9, 6), (12, 18, 21)], 6) == [(6, 24, 12)]
"""


def find_tuples(tuples, k):
    return [t for t in tuples if all(i % k == 0 for i in t)]




--------------------------------------------------Mbpp/77--------------------------------------------------

<s> """
Write a python function to find whether a number is divisible by 11.
assert is_Diff (12345) == False
"""


def is_Diff(num):
    if num % 11 == 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/79--------------------------------------------------

<s> """
Write a python function to check whether the length of the word is odd or not.
assert word_len("Hadoop") == False
"""


def word_len(word):
    if len(word) % 2 == 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/80--------------------------------------------------

<s> """
Write a function to find the nth tetrahedral number.
assert tetrahedral_number(5) == 35
"""


def tetrahedral_number(n):
    """
    Write a function to find the nth tetrahedral number.
    assert tetrahedral_number(5) == 35
    """
    return (n * (n + 1) * (n + 2)) // 6




--------------------------------------------------Mbpp/82--------------------------------------------------

<s> """
Write a function to find the volume of a sphere.
assert math.isclose(volume_sphere(10), 4188.790204786391, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/83--------------------------------------------------

<s> """
Write a python function to find the character made by adding the ASCII value of all the characters of the given string modulo 26.
assert get_Char("abc") == "f"
"""


def get_Char(string):
    """
    :param string: string
    :return: character
    """
    return chr((sum(ord(i) for i in string) % 26) + 97)




--------------------------------------------------Mbpp/84--------------------------------------------------

<s> """
Write a function to find the nth number in the newman conway sequence.
assert sequence(10) == 6
"""


def sequence(n):
    """
    Write a function to find the nth number in the newman conway sequence.
    assert sequence(10) == 6
    """
    if n == 1:
        return 1
    elif n == 2:
        return 1
    else:
        return sequence(sequence(n - 1)) + sequence(n - sequence(n - 1))




--------------------------------------------------Mbpp/85--------------------------------------------------

<s> """
Write a function to find the surface area of a sphere.
assert math.isclose(surfacearea_sphere(10), 1256.6370614359173, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/86--------------------------------------------------

<s> """
Write a function to find nth centered hexagonal number.
assert centered_hexagonal_number(10) == 271
"""


def centered_hexagonal_number(n):
    """
    >>> centered_hexagonal_number(10)
    271
    """
    return (2 * n - 1) * (2 * n - 1)




--------------------------------------------------Mbpp/87--------------------------------------------------

<s> """
Write a function to merge three dictionaries into a single dictionary.
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'}
"""


def merge_dictionaries_three(dict1, dict2, dict3):
    """
    Merge three dictionaries into a single dictionary.
    :param dict1: First dictionary
    :param dict2: Second dictionary
    :param dict3: Third dictionary
    :return: Merged dictionary
    """
    merged_dict = dict1.copy()
    merged_dict.update(dict2)
    merged_dict.update(dict3)
    return merged_dict




--------------------------------------------------Mbpp/88--------------------------------------------------

<s> """
Write a function to get the frequency of all the elements in a list, returned as a dictionary.
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})
"""


def freq_count(lst):
    """
    :param lst: list
    :return: dict
    """
    return {x: lst.count(x) for x in lst}




--------------------------------------------------Mbpp/89--------------------------------------------------

<s> """
Write a function to find the closest smaller number than n.
assert closest_num(11) == 10
"""


def closest_num(n):
    """
    :param n: int
    :return: int
    """
    if n == 1:
        return 1
    if n == 2:
        return 1
    if n == 3:
        return 2
    if n == 4:
        return 2
    if n == 5:
        return 3
    if n == 6:
        return 3
    if n == 7:
        return 4
    if n == 8:
        return 4
    if n == 9:
        return 5
    if n == 10:
        return 5
    if n == 11:
        return 6
    if n == 12:
        return 6
    if n == 13:
        return 7
    if n == 14:
        return 7
    if n == 15:
        return 8
    if n == 16:
        return 8
    if n == 17:
        return 9
    if n == 18:
        return 9
    if n == 19:
        return 10
    if n == 20:
        return 10
    if n == 21:
        return 11
    if n == 22:
        return 11

--------------------------------------------------Mbpp/90--------------------------------------------------

<s> """
Write a python function to find the length of the longest word.
assert len_log(["python","PHP","bigdata"]) == 7
"""


def len_log(words):
    """
    :param words: list of words
    :return: length of the longest word
    """
    return max(len(word) for word in words)




--------------------------------------------------Mbpp/91--------------------------------------------------

<s> """
Write a function to check if a string is present as a substring in a given list of string values.
assert find_substring(["red", "black", "white", "green", "orange"],"ack")==True
"""


def find_substring(list_of_strings, substring):
    for string in list_of_strings:
        if substring in string:
            return True
    return False




--------------------------------------------------Mbpp/92--------------------------------------------------

<s> """
Write a function to check whether the given number is undulating or not.
assert is_undulating(1212121) == True
"""


def is_undulating(num):
    """
    :param num: int
    :return: bool
    """
    if num == 0:
        return False
    if num == 1:
        return True
    if num == 2:
        return False
    if num == 3:
        return True
    if num == 4:
        return False
    if num == 5:
        return True
    if num == 6:
        return False
    if num == 7:
        return True
    if num == 8:
        return False
    if num == 9:
        return True
    if num == 10:
        return False
    if num == 11:
        return True
    if num == 12:
        return False
    if num == 13:
        return True
    if num == 14:
        return False
    if num == 15:
        return True
    if num == 16:
        return False
    if num == 17:
        return True
    if num == 18:
        return False
    if num == 19:
        return True
    if num == 20:
        return False
    if num == 21:
        return True

--------------------------------------------------Mbpp/93--------------------------------------------------

<s> """
Write a function to calculate the value of 'a' to the power 'b'.
assert power(3,4) == 81
"""


def power(a, b):
    """
    :param a: int
    :param b: int
    :return: int
    """
    if b == 0:
        return 1
    elif b % 2 == 0:
        return power(a, b // 2) * power(a, b // 2)
    else:
        return a * power(a, b // 2) * power(a, b // 2)




--------------------------------------------------Mbpp/94--------------------------------------------------

<s> """
Given a list of tuples, write a function that returns the first value of the tuple with the smallest second value.
assert index_minimum([('Rash', 143), ('Manjeet', 200), ('Varsha', 100)]) == 'Varsha'
"""


def index_minimum(tuples):
    """
    >>> index_minimum([('Rash', 143), ('Manjeet', 200), ('Varsha', 100)])
    'Varsha'
    """
    return min(tuples, key=lambda x: x[1])[0]




--------------------------------------------------Mbpp/95--------------------------------------------------

<s> """
Write a python function to find the length of the smallest list in a list of lists.
assert Find_Min_Length([[1],[1,2]]) == 1
"""


def Find_Min_Length(list_of_lists):
    """
    >>> Find_Min_Length([[1],[1,2]])
    1
    >>> Find_Min_Length([[1,2],[1,2,3]])
    2
    >>> Find_Min_Length([[1,2,3],[1,2,3,4]])
    3
    >>> Find_Min_Length([[1,2,3,4],[1,2,3,4,5]])
    4
    """
    return min(len(x) for x in list_of_lists)




--------------------------------------------------Mbpp/96--------------------------------------------------

<s> """
Write a python function to find the number of divisors of a given integer.
assert divisor(15) == 4
"""


def divisor(n):
    """
    :param n: int
    :return: int
    """
    count = 0
    for i in range(1, n + 1):
        if n % i == 0:
            count += 1
    return count




--------------------------------------------------Mbpp/97--------------------------------------------------

<s> """
Write a function to find frequency of each element in a flattened list of lists, returned in a dictionary.
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}
"""


def frequency_lists(lists):
    """
    :param lists: list of lists
    :return: dictionary of frequency of each element in a flattened list of lists
    """
    return {x: lists.count(x) for x in set(sum(lists, []))}




--------------------------------------------------Mbpp/98--------------------------------------------------

<s> """
Write a function to multiply all the numbers in a list and divide with the length of the list.
assert math.isclose(multiply_num((8, 2, 3, -1, 7)), -67.2, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/99--------------------------------------------------

<s> """
Write a function to convert the given decimal number to its binary equivalent, represented as a string with no leading zeros.
assert decimal_to_binary(8) == '1000'
"""


def decimal_to_binary(decimal_number):
    """
    :param decimal_number: int
    :return: str
    """
    if decimal_number == 0:
        return '0'
    binary_number = ''
    while decimal_number > 0:
        binary_number = str(decimal_number % 2) + binary_number
        decimal_number = decimal_number // 2
    return binary_number




--------------------------------------------------Mbpp/100--------------------------------------------------

<s> """
Write a function to find the next smallest palindrome of a specified integer, returned as an integer.
assert next_smallest_palindrome(99)==101
"""


def next_smallest_palindrome(n):
    """
    :param n: int
    :return: int
    """
    if n < 10:
        return n + 1
    if n % 10 == 0:
        return n + 1
    if n % 10 == 1:
        return n - 1
    if n % 10 == 5:
        return n + 2
    if n % 10 == 9:
        return n - 2
    if n % 10 == 7:
        return n + 3
    if n % 10 == 3:
        return n - 3
    if n % 10 == 8:
        return n + 4
    if n % 10 == 4:
        return n - 4
    if n % 10 == 6:
        return n + 5
    if n % 10 == 2:
        return n - 5




--------------------------------------------------Mbpp/101--------------------------------------------------

<s> """
Write a function to find the kth element in the given array using 1-based indexing.
assert kth_element([12,3,5,7,19], 2) == 3
"""


def kth_element(arr, k):
    """
    :param arr: list of integers
    :param k: integer
    :return: integer
    """
    if k > len(arr):
        return None
    return _kth_element(arr, k)




--------------------------------------------------Mbpp/102--------------------------------------------------

<s> """
Write a function to convert a snake case string to camel case string.
assert snake_to_camel('python_program')=='PythonProgram'
"""


def snake_to_camel(snake_str):
    """
    :param snake_str:
    :return:
    """
    components = snake_str.split('_')
    # We capitalize the first letter of each component except the first one
    # with the 'capitalize' method and join them together.
    return components[0] + ''.join(x.capitalize() for x in components[1:])




--------------------------------------------------Mbpp/103--------------------------------------------------

<s> """
Write a function to find the Eulerian number a(n, m).
assert eulerian_num(3, 1) == 4
"""


def eulerian_num(n, m):
    """
    :param n: number of vertices
    :param m: number of edges
    :return: Eulerian number
    """
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 4
    if n == 4:
        return 12
    if n == 5:
        return 24
    if n == 6:
        return 48
    if n == 7:
        return 96
    if n == 8:
        return 192
    if n == 9:
        return 384
    if n == 10:
        return 768
    if n == 11:
        return 1536
    if n == 12:
        return 3072
    if n == 13:
        return 6144
    if n == 14:
        return 12288
    if n == 15:
        return 24576
    if n == 16:
        return 49152
    if n == 17:
        return 98304
    if n == 18:
        return 196608
    if n == 19:
        return 393216
    if n == 20:
        return 786432
    if n == 21:
        return 1572864
    if n == 22:

--------------------------------------------------Mbpp/104--------------------------------------------------

<s> """
Write a function to sort each sublist of strings in a given list of lists.
assert sort_sublists((["green", "orange"], ["black", "white"], ["white", "black", "orange"]))==[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']]
"""


def sort_sublists(lists):
    """
    Sorts each sublist of strings in a given list of lists.
    :param lists: list of lists
    :return: list of lists
    """
    return [sorted(sublist) for sublist in lists]




--------------------------------------------------Mbpp/105--------------------------------------------------

<s> """
Write a python function to count true booleans in the given list.
assert count([True,False,True]) == 2
"""


def count(lst):
    """
    >>> count([True,False,True])
    2
    >>> count([True,True,True])
    3
    >>> count([False,False,False])
    0
    >>> count([])
    0
    """
    return sum(lst)




--------------------------------------------------Mbpp/106--------------------------------------------------

<s> """
Write a function to append the given list to the given tuples.
assert add_lists([5, 6, 7], (9, 10)) == (9, 10, 5, 6, 7)
"""


def add_lists(list_to_add, tuple_to_add):
    """
    Adds the list to the tuple.
    :param list_to_add: list to add
    :param tuple_to_add: tuple to add
    :return: tuple with list added
    """
    return tuple_to_add + tuple(list_to_add)




--------------------------------------------------Mbpp/108--------------------------------------------------

<s> """
Write a function to merge three lists into a single sorted list.
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]
"""


def merge_sorted_list(list1, list2, list3):
    """
    :param list1: list of integers
    :param list2: list of integers
    :param list3: list of integers
    :return: list of integers
    """
    result = []
    i = 0
    j = 0
    k = 0
    while i < len(list1) and j < len(list2) and k < len(list3):
        if list1[i] < list2[j] < list3[k]:
            result.append(list1[i])
            i += 1
        elif list1[i] > list2[j] > list3[k]:
            result.append(list3[k])
            k += 1
        elif list1[i] < list2[j] > list3[k]:
            result.append(list2[j])
            j += 1
        elif list1[i] > list2[j] < list3[k]:
            result.append(list1[i])
            i += 1
        elif list1[i] == list2[j] == list3[k]:
            result.append(list1[i])
            i += 1
            j += 1
            k += 1
    while i < len(list1):
        result.append(list1[i])
        i += 1
    while j < len(list2):
        result.append(list2[j])
        j += 1
    while k < len(list3):
        result.append(list3[k])
        k += 1
    return result




--------------------------------------------------Mbpp/109--------------------------------------------------

<s> """
Write a python function to find the number of numbers with an odd value when rotating a binary string the given number of times.
assert odd_Equivalent("011001",6) == 3
"""


def odd_Equivalent(binary_string, rotations):
    """
    :param binary_string: string
    :param rotations: int
    :return: int
    """
    binary_string = binary_string[::-1]
    for _ in range(rotations):
        binary_string = binary_string[1:] + binary_string[0]
    return binary_string.count('1')




--------------------------------------------------Mbpp/111--------------------------------------------------

<s> """
Write a function to find the common elements in given nested lists.
assert set(common_in_nested_lists([[12, 18, 23, 25, 45], [7, 12, 18, 24, 28], [1, 5, 8, 12, 15, 16, 18]]))==set([18, 12])
"""


def common_in_nested_lists(nested_list):
    """
    :param nested_list: list of lists
    :return: list of common elements
    """
    common_elements = []
    for i in range(len(nested_list)):
        for j in range(i + 1, len(nested_list)):
            common_elements += list(set(nested_list[i]).intersection(set(nested_list[j])))
    return list(set(common_elements))




--------------------------------------------------Mbpp/113--------------------------------------------------

<s> """
Write a function to check if a string represents an integer or not.
assert check_integer("python")==False
"""


def check_integer(string):
    try:
        int(string)
        return True
    except ValueError:
        return False




--------------------------------------------------Mbpp/115--------------------------------------------------

<s> """
Write a function to check whether all dictionaries in a list are empty or not.
assert empty_dit([{},{},{}])==True
"""


def empty_dit(list_of_dicts):
    for i in list_of_dicts:
        if i:
            return False
    return True




--------------------------------------------------Mbpp/116--------------------------------------------------

<s> """
Write a function to convert a given tuple of positive integers into a single integer.
assert tuple_to_int((1,2,3))==123
"""


def tuple_to_int(tup):
    """
    >>> tuple_to_int((1,2,3))
    123
    """
    return int(''.join(map(str, tup)))




--------------------------------------------------Mbpp/117--------------------------------------------------

<s> """
Write a function to convert all possible convertible elements in a list of lists to floats.
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)]
"""

def list_to_float(list_of_lists):
    """
    Convert all possible convertible elements in a list of lists to floats.
    """
    for i in range(len(list_of_lists)):
        for j in range(len(list_of_lists[i])):
            try:
                list_of_lists[i][j] = float(list_of_lists[i][j])
            except ValueError:
                pass
    return list_of_lists




--------------------------------------------------Mbpp/118--------------------------------------------------

<s> """
Write a function to convert a string to a list of strings split on the space character.
assert string_to_list("python programming")==['python','programming']
"""


def string_to_list(string):
    return string.split()




--------------------------------------------------Mbpp/119--------------------------------------------------

<s> """
Write a python function to find the element that appears only once in a sorted array.
assert search([1,1,2,2,3]) == 3
"""


def search(arr):
    if len(arr) == 0:
        return None
    if len(arr) == 1:
        return arr[0]
    if len(arr) == 2:
        return arr[0] if arr[0] != arr[1] else None
    if len(arr) == 3:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] else None
    if len(arr) == 4:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] else None
    if len(arr) == 5:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] else None
    if len(arr) == 6:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] and arr[0] != arr[5] else None
    if len(arr) == 7:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] and arr[0] != arr[5] and arr[0] != arr[6] else None
    if len(arr) == 8:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] and arr[0] != arr[5] and arr[0] != arr[6] and arr[0] != arr[7] else None
    if len(arr) == 9:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] and arr[0] != arr[5] and arr[0] != arr[6] and arr[0] != arr[7] and arr[0] != arr[8] else None
    if len(arr) == 10:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and arr[0] != arr[4] and arr[0] != arr[5] and arr[0] != arr[6] and arr[0] != arr[7] and arr[0] != arr[8] and arr[0] != arr[9] else None
    if len(arr) == 11:
        return arr[0] if arr[0] != arr[1] and arr[0] != arr[2

--------------------------------------------------Mbpp/120--------------------------------------------------

<s> """
Write a function to find the maximum absolute product between numbers in pairs of tuples within a given list.
assert max_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==36
"""

def max_product_tuple(tuples):
    """
    tuples: a list of tuples
    return: the maximum absolute product between numbers in pairs of tuples within a given list
    """
    max_product = 0
    for i in range(len(tuples)):
        for j in range(i+1, len(tuples)):
            max_product = max(max_product, abs(tuples[i][0] * tuples[i][1] * tuples[j][0] * tuples[j][1]))
    return max_product




--------------------------------------------------Mbpp/123--------------------------------------------------

<s> """
Write a function to sum all amicable numbers from 1 to a specified number.
assert amicable_numbers_sum(999)==504
"""


def amicable_numbers_sum(n):
    """
    :param n: int
    :return: int
    """
    sum_ = 0
    for i in range(1, n + 1):
        if i == sum_of_divisors(i):
            sum_ += i
    return sum_




--------------------------------------------------Mbpp/124--------------------------------------------------

<s> """
Write a function to get the angle of a complex number.
assert math.isclose(angle_complex(0,1j), 1.5707963267948966, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/125--------------------------------------------------

<s> """
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.
assert find_length("11000010001") == 6
"""


def find_length(binary_string):
    """
    :param binary_string: str
    :return: int
    """
    if not binary_string:
        return 0

    max_diff = 0
    count_0 = 0
    count_1 = 0

    for char in binary_string:
        if char == '0':
            count_0 += 1
            count_1 = 0
        else:
            count_1 += 1
            count_0 = 0

        max_diff = max(max_diff, count_0, count_1)

    return max_diff




--------------------------------------------------Mbpp/126--------------------------------------------------

<s> """
Write a python function to find the sum of common divisors of two given numbers.
assert sum(10,15) == 6
"""


def sum(a, b):
    """
    :param a: int
    :param b: int
    :return: int
    """
    if a < b:
        a, b = b, a
    result = 0
    for i in range(1, a + 1):
        if a % i == 0 and b % i == 0:
            result += i
    return result




--------------------------------------------------Mbpp/127--------------------------------------------------

<s> """
Write a function to multiply two integers.
assert multiply_int(10,20)==200
"""


def multiply_int(a, b):
    """
    Multiply two integers
    :param a: first integer
    :param b: second integer
    :return: a*b
    """
    if a == 0 or b == 0:
        return 0
    if a < 0:
        a = -a
    if b < 0:
        b = -b
    if a > b:
        return multiply_int(a - b, b) + b
    else:
        return multiply_int(a - b, b) + a




--------------------------------------------------Mbpp/128--------------------------------------------------

<s> """
Write a function to find words that are longer than n characters from a given list of words.
assert long_words(3,"python is a programming language")==['python','programming','language']
"""


def long_words(n, words):
    """
    :param n: int
    :param words: str
    :return: list
    """
    return [word for word in words.split() if len(word) > n]




--------------------------------------------------Mbpp/129--------------------------------------------------

<s> """
Write a function to calculate whether the matrix is a magic square.
assert magic_square_test([[7, 12, 1, 14], [2, 13, 8, 11], [16, 3, 10, 5], [9, 6, 15, 4]])==True
"""

def magic_square_test(matrix):
    """
    :param matrix: a matrix
    :return: True if the matrix is a magic square, False otherwise
    """
    # check if the matrix is a square
    if len(matrix) != len(matrix[0]):
        return False

    # check if the sum of the rows is the same
    for row in matrix:
        if sum(row) != sum(matrix[0]):
            return False

    # check if the sum of the columns is the same
    for i in range(len(matrix[0])):
        if sum(matrix[i]) != sum(matrix[0]):
            return False

    # check if the sum of the diagonals is the same
    if sum(matrix[0][0]) + sum(matrix[1][1]) + sum(matrix[2][2]) != sum(matrix[0]):
        return False

    if sum(matrix[0][2]) + sum(matrix[1][1]) + sum(matrix[2][0]) != sum(matrix[0]):
        return False

    return True




--------------------------------------------------Mbpp/130--------------------------------------------------

<s> """
Write a function to find the item with maximum frequency in a given list.
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
"""


def max_occurrences(lst):
    """
    :param lst: list of integers
    :return: the item with maximum frequency
    """
    # your code here
    d = {}
    for i in lst:
        if i in d:
            d[i] += 1
        else:
            d[i] = 1
    return max(d, key=d.get)




--------------------------------------------------Mbpp/131--------------------------------------------------

<s> """
Write a python function to reverse only the vowels of a given string (where y is not a vowel).
assert reverse_vowels("Python") == "Python"
"""


def reverse_vowels(string):
    vowels = "aeiou"
    vowel_list = []
    for char in string:
        if char in vowels:
            vowel_list.append(char)
    vowel_list.reverse()
    for i in range(len(vowel_list)):
        string = string.replace(vowel_list[i], "", 1)
    for i in range(len(vowel_list)):
        string = string + vowel_list[i]
    return string




--------------------------------------------------Mbpp/132--------------------------------------------------

<s> """
Write a function to convert a tuple to a string.
assert tup_string(('e', 'x', 'e', 'r', 'c', 'i', 's', 'e', 's'))==("exercises")
"""


def tup_string(tup):
    return ''.join(tup)




--------------------------------------------------Mbpp/133--------------------------------------------------

<s> """
Write a function to calculate the sum of the negative numbers of a given list of numbers.
assert sum_negativenum([2, 4, -6, -9, 11, -12, 14, -5, 17])==-32
"""


def sum_negativenum(nums):
    """
    :param nums: list of numbers
    :return: sum of the negative numbers
    """
    return sum(x for x in nums if x < 0)




--------------------------------------------------Mbpp/135--------------------------------------------------

<s> """
Write a function to find the nth hexagonal number.
assert hexagonal_num(10) == 190
"""


def hexagonal_num(n):
    """
    Write a function to find the nth hexagonal number.
    assert hexagonal_num(10) == 190
    """
    return (n * (2 * n - 1)) // 2




--------------------------------------------------Mbpp/137--------------------------------------------------

<s> """
Write a function to find the ratio of zeroes to non-zeroes in an array of integers.
assert math.isclose(zero_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8]), 0.181818, rel_tol=0.001)
"""


def zero_count(arr):
    """
    :param arr: list of integers
    :return: ratio of zeroes to non-zeroes in the array
    """
    zero_count = 0
    non_zero_count = 0
    for i in arr:
        if i == 0:
            zero_count += 1
        else:
            non_zero_count += 1
    return zero_count / non_zero_count




--------------------------------------------------Mbpp/138--------------------------------------------------

<s> """
Write a python function to check whether the given number can be represented as sum of non-zero powers of 2 or not.
assert is_Sum_Of_Powers_Of_Two(10) == True
"""


def is_Sum_Of_Powers_Of_Two(n):
    if n == 0:
        return False
    while n % 2 == 0:
        n = n // 2
    return n == 1




--------------------------------------------------Mbpp/139--------------------------------------------------

<s> """
Write a function to find the circumference of a circle.
assert math.isclose(circle_circumference(10), 62.830000000000005, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/140--------------------------------------------------

<s> """
Write a function to flatten the list of lists into a single set of numbers.
assert set(extract_singly([(3, 4, 5), (4, 5, 7), (1, 4)])) == set([3, 4, 5, 7, 1])
"""


def extract_singly(list_of_lists):
    """
    :param list_of_lists: list of lists
    :return: set of numbers
    """
    return set(sum(list_of_lists, []))




--------------------------------------------------Mbpp/141--------------------------------------------------

<s> """
Write a function to sort a list of elements.
assert pancake_sort([15, 79, 25, 38, 69]) == [15, 25, 38, 69, 79]
"""


def pancake_sort(arr):
    """
    Sorts the list in ascending order.
    :param arr: list of elements
    :return: sorted list
    """
    for i in range(len(arr) - 1, 0, -1):
        max_index = arr.index(max(arr[:i + 1]))
        if max_index != i:
            arr[i], arr[max_index] = arr[max_index], arr[i]
            arr = arr[:max_index + 1] + arr[max_index + 1:i + 1][::-1] + arr[i + 1:]
    return arr




--------------------------------------------------Mbpp/142--------------------------------------------------

<s> """
Write a function to count number items that are identical in the same position of three given lists.
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
"""

def count_samepair(list1, list2, list3):
    count = 0
    for i in range(len(list1)):
        if list1[i] == list2[i] and list1[i] == list3[i]:
            count += 1
    return count



--------------------------------------------------Mbpp/143--------------------------------------------------

<s> """
Write a function to find number of lists present in the given tuple.
assert find_lists(([1, 2, 3, 4], [5, 6, 7, 8])) == 2
"""


def find_lists(tup):
    """
    >>> find_lists(([1, 2, 3, 4], [5, 6, 7, 8]))
    2
    """
    return len([x for x in tup if isinstance(x, list)])




--------------------------------------------------Mbpp/145--------------------------------------------------

<s> """
Write a python function to find the maximum difference between any two elements in a given array.
assert max_Abs_Diff((2,1,5,3)) == 4
"""


def max_Abs_Diff(arr):
    """
    :param arr: array of integers
    :return: maximum difference between any two elements in the array
    """
    max_diff = 0
    for i in range(len(arr)):
        for j in range(i+1, len(arr)):
            if abs(arr[i] - arr[j]) > max_diff:
                max_diff = abs(arr[i] - arr[j])
    return max_diff




--------------------------------------------------Mbpp/160--------------------------------------------------

<s> """
Write a function that returns integers x and y that satisfy ax + by = n as a tuple, or return None if no solution exists.
assert find_solution(2, 3, 7) == (2, 1)
"""


def find_solution(a, b, n):
    """
    >>> find_solution(2, 3, 7)
    (2, 1)
    >>> find_solution(2, 3, 10)
    (1, 2)
    >>> find_solution(2, 3, 11)
    """
    if a == 0:
        return None
    x = n // b
    y = n - a * x
    return x, y




--------------------------------------------------Mbpp/161--------------------------------------------------

<s> """
Write a function to remove all elements from a given list present in another list.
assert remove_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], [2, 4, 6, 8]) == [1, 3, 5, 7, 9, 10]
"""


def remove_elements(list1, list2):
    """
    :param list1: list of elements
    :param list2: list of elements to remove
    :return: list of elements
    """
    return [x for x in list1 if x not in list2]




--------------------------------------------------Mbpp/162--------------------------------------------------

<s> """
Write a function to calculate the sum (n - 2*i) from i=0 to n // 2, for instance n + (n-2) + (n-4)... (until n-x =< 0).
assert sum_series(6) == 12
"""


def sum_series(n):
    """
    >>> sum_series(6)
    12
    >>> sum_series(10)
    30
    >>> sum_series(1)
    0
    >>> sum_series(0)
    0
    """
    if n <= 0:
        return 0
    else:
        return n + sum_series(n - 2)




--------------------------------------------------Mbpp/164--------------------------------------------------

<s> """
Write a function to determine if the sum of the divisors of two integers are the same.
assert are_equivalent(36, 57) == False
"""


def are_equivalent(a, b):
    """
    Determine if the sum of the divisors of two integers are the same.
    :param a: int
    :param b: int
    :return: bool
    """
    return sum(divisors(a)) == sum(divisors(b))




--------------------------------------------------Mbpp/165--------------------------------------------------

<s> """
Write a function to count the number of characters in a string that occur at the same position in the string as in the English alphabet (case insensitive).
assert count_char_position("xbcefg") == 2
"""


def count_char_position(string):
    """
    :param string: string to count characters in
    :return: number of characters in string that occur at the same position in the string as in the English alphabet
    """
    count = 0
    for i in range(len(string)):
        if string[i].lower() == string[ord(string[i].lower()) - 97].lower():
            count += 1
    return count




--------------------------------------------------Mbpp/166--------------------------------------------------

<s> """
Write a function that counts the number of pairs of integers in a list that xor to an even number.
assert find_even_pair([5, 4, 7, 2, 1]) == 4
"""


def find_even_pair(nums):
    """
    :param nums: list of integers
    :return: number of pairs of integers in a list that xor to an even number
    """
    pairs = 0
    for i in range(len(nums)):
        for j in range(i + 1, len(nums)):
            if nums[i] ^ nums[j] % 2 == 0:
                pairs += 1
    return pairs




--------------------------------------------------Mbpp/167--------------------------------------------------

<s> """
Write a python function to find the smallest power of 2 greater than or equal to n.
assert next_power_of_2(0) == 1
"""


def next_power_of_2(n):
    """
    :param n: int
    :return: int
    """
    if n == 0:
        return 1
    return 2 ** (n - 1).bit_length()




--------------------------------------------------Mbpp/168--------------------------------------------------

<s> """
Write a function to count the number of occurrences of a number in a given list.
assert frequency([1,2,3], 4) == 0
"""


def frequency(list, number):
    """
    :param list: list of numbers
    :param number: number to count
    :return: number of occurrences of number in list
    """
    return list.count(number)




--------------------------------------------------Mbpp/170--------------------------------------------------

<s> """
Write a function to find the sum of numbers in a list within a range specified by two indices.
assert sum_range_list([2,1,5,6,8,3,4,9,10,11,8,12], 8, 10) == 29
"""


def sum_range_list(nums, start, end):
    """
    :param nums: list of numbers
    :param start: start index
    :param end: end index
    :return: sum of numbers in the list within the range
    """
    if start < 0 or end < 0 or start > end:
        return 0
    return sum(nums[start:end + 1])




--------------------------------------------------Mbpp/171--------------------------------------------------

<s> """
Write a function to find the perimeter of a regular pentagon from the length of its sides.
assert perimeter_pentagon(5) == 25
"""


def perimeter_pentagon(side):
    """
    :param side: length of the side of the pentagon
    :return: perimeter of the pentagon
    """
    return 5 * side




--------------------------------------------------Mbpp/172--------------------------------------------------

<s> """
Write a function to count the number of occurence of the string 'std' in a given string.
assert count_occurance("letstdlenstdporstd") == 3
"""


def count_occurance(string):
    """
    :param string: string to count occurance of 'std'
    :return: number of occurance of 'std' in string
    """
    return string.count('std')




--------------------------------------------------Mbpp/222--------------------------------------------------

<s> """
Write a function to check if all the elements in tuple have same data type or not.
assert check_type((5, 6, 7, 3, 5, 6) ) == True
"""


def check_type(tup):
    """
    Check if all the elements in tuple have same data type or not.
    :param tup: tuple
    :return: bool
    """
    return all(isinstance(i, type(tup[0])) for i in tup)




--------------------------------------------------Mbpp/223--------------------------------------------------

<s> """
Write a function that takes in a sorted array, its length (n), and an element and returns whether the element is the majority element in the given sorted array. (The majority element is the element that occurs more than n/2 times.)
assert is_majority([1, 2, 3, 3, 3, 3, 10], 7, 3) == True
"""


def is_majority(arr, n, elem):
    """
    :type arr: List[int]
    :type n: int
    :type elem: int
    :rtype: bool
    """
    # Write your code here
    if elem not in arr:
        return False
    start = 0
    end = n - 1
    while start <= end:
        mid = (start + end) // 2
        if arr[mid] == elem:
            if mid == 0 or arr[mid - 1] != elem:
                return True
            else:
                end = mid - 1
        elif arr[mid] < elem:
            start = mid + 1
        else:
            end = mid - 1
    return False




--------------------------------------------------Mbpp/224--------------------------------------------------

<s> """
Write a python function to count the number of set bits (binary digits with value 1) in a given number.
assert count_Set_Bits(2) == 1
"""


def count_Set_Bits(n):
    count = 0
    while n:
        n &= n - 1
        count += 1
    return count




--------------------------------------------------Mbpp/226--------------------------------------------------

<s> """
Write a python function to remove the characters which have odd index values of a given string.
assert odd_values_string('abcdef') == 'ace'
"""


def odd_values_string(string):
    """
    :param string: string
    :return: string without odd index values
    """
    return ''.join([char for index, char in enumerate(string) if index % 2 == 0])




--------------------------------------------------Mbpp/227--------------------------------------------------

<s> """
Write a function to find minimum of three numbers.
assert min_of_three(10,20,0)==0
"""


def min_of_three(a, b, c):
    """
    :param a: int
    :param b: int
    :param c: int
    :return: int
    """
    if a < b and a < c:
        return a
    elif b < a and b < c:
        return b
    else:
        return c




--------------------------------------------------Mbpp/229--------------------------------------------------

<s> """
Write a function that takes in an array and an integer n, and re-arranges the first n elements of the given array so that all negative elements appear before positive ones, and where the relative order among negative and positive elements is preserved.
assert re_arrange_array([-1, 2, -3, 4, 5, 6, -7, 8, 9], 9) == [-1, -3, -7, 4, 5, 6, 2, 8, 9]
"""


def re_arrange_array(arr, n):
    # Write your code here.
    pos = []
    neg = []
    for i in range(n):
        if arr[i] < 0:
            neg.append(arr[i])
        else:
            pos.append(arr[i])
    return neg + pos




--------------------------------------------------Mbpp/230--------------------------------------------------

<s> """
Write a function that takes in a string and character, replaces blank spaces in the string with the character, and returns the string.
assert replace_blank("hello people",'@')==("hello@people")
"""


def replace_blank(string, character):
    return string.replace(" ", character)




--------------------------------------------------Mbpp/232--------------------------------------------------

<s> """
Write a function that takes in a list and an integer n and returns a list containing the n largest items from the list.
assert set(larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],2))==set([100,90])
"""


def larg_nnum(lst, n):
    """
    :param lst: list
    :param n: int
    :return: list
    """
    if n > len(lst):
        return lst
    else:
        return sorted(lst, reverse=True)[:n]




--------------------------------------------------Mbpp/233--------------------------------------------------

<s> """
Write a function to find the lateral surface area of a cylinder.
assert math.isclose(lateralsuface_cylinder(10,5), 314.15000000000003, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/234--------------------------------------------------

<s> """
Write a function to find the volume of a cube given its side length.
assert volume_cube(3)==27
"""


def volume_cube(side):
    """
    :param side: side length of the cube
    :return: volume of the cube
    """
    return side ** 3




--------------------------------------------------Mbpp/235--------------------------------------------------

<s> """
Write a python function to set all even bits of a given number.
assert even_bit_set_number(10) == 10
"""


def even_bit_set_number(number):
    """
    >>> even_bit_set_number(10)
    10
    >>> even_bit_set_number(11)
    12
    >>> even_bit_set_number(12)
    12
    >>> even_bit_set_number(13)
    14
    >>> even_bit_set_number(14)
    14
    >>> even_bit_set_number(15)
    16
    >>> even_bit_set_number(16)
    16
    >>> even_bit_set_number(17)
    18
    >>> even_bit_set_number(18)
    18
    >>> even_bit_set_number(19)
    20
    >>> even_bit_set_number(20)
    20
    >>> even_bit_set_number(21)
    22
    >>> even_bit_set_number(22)
    22
    >>> even_bit_set_number(23)
    24
    >>> even_bit_set_number(24)
    24
    >>> even_bit_set_number(25)
    26
    >>> even_bit_set_number(26)
    26
    >>> even_bit_set_number(27)
    28
    >>> even_bit_set_number(28)
    28
    >>> even_bit_set_number(29)
    30
    >>> even_bit_set_number(30)
    30
    >>> even_bit_set_number(31)
    32
    >>> even_bit_set_number(32)
    32
    >>> even_bit_set_number(33)

--------------------------------------------------Mbpp/237--------------------------------------------------

<s> """
Write a function that takes in a list of tuples and returns a dictionary mapping each unique tuple to the number of times it occurs in the list.
assert check_occurences([(3, 1), (1, 3), (2, 5), (5, 2), (6, 3)] ) == {(1, 3): 2, (2, 5): 2, (3, 6): 1}
"""


def check_occurences(tuples):
    """
    :param tuples: list of tuples
    :return: dictionary mapping each unique tuple to the number of times it occurs in the list
    """
    occurences = {}
    for tuple in tuples:
        if tuple in occurences:
            occurences[tuple] += 1
        else:
            occurences[tuple] = 1
    return occurences




--------------------------------------------------Mbpp/238--------------------------------------------------

<s> """
Write a python function to count the number of non-empty substrings of a given string.
assert number_of_substrings("abc") == 6
"""


def number_of_substrings(string):
    """
    >>> number_of_substrings("abc")
    6
    >>> number_of_substrings("")
    0
    >>> number_of_substrings("a")
    1
    >>> number_of_substrings("ab")
    3
    >>> number_of_substrings("abcde")
    10
    >>> number_of_substrings("abcdeabcde")
    20
    >>> number_of_substrings("abcdeabcdeabcde")
    30
    >>> number_of_substrings("abcdeabcdeabcdeabcde")
    40
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcde")
    50
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcde")
    60
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcde")
    70
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    80
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    90
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    100
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    110
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    120
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    130
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    140
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    150
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    160
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    170
    >>> number_of_substrings("abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde")
    180
    >>> number_of_substrings("abcdeabcdeabc

--------------------------------------------------Mbpp/239--------------------------------------------------

<s> """
Write a function that takes in positive integers m and n and finds the number of possible sequences of length n, such that each element is a positive integer and is greater than or equal to twice the previous element but less than or equal to m.
assert get_total_number_of_sequences(10, 4) == 4
"""


def get_total_number_of_sequences(m, n):
    """
    :param m: positive integer
    :param n: positive integer
    :return: number of possible sequences of length n, such that each element is a positive integer and is greater than or equal to twice the previous element but less than or equal to m
    """
    if n == 1:
        return 1
    if n == 2:
        return m
    if n == 3:
        return m * m
    if n == 4:
        return m * m * m
    if n == 5:
        return m * m * m * m
    if n == 6:
        return m * m * m * m * m
    if n == 7:
        return m * m * m * m * m * m
    if n == 8:
        return m * m * m * m * m * m * m
    if n == 9:
        return m * m * m * m * m * m * m * m
    if n == 10:
        return m * m * m * m * m * m * m * m * m
    if n == 11:
        return m * m * m * m * m * m * m * m * m * m
    if n == 12:
        return m * m * m * m * m * m * m * m * m * m * m
    if n == 13:
        return m * m * m * m * m * m * m * m * m * m * m * m
    if n == 14:
        return m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 15:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 16:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 17:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 18:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 19:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m
    if n == 20:
        return m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m * m *

--------------------------------------------------Mbpp/240--------------------------------------------------

<s> """
Write a function that takes in two lists and replaces the last element of the first list with the elements of the second list.
assert replace_list([1, 3, 5, 7, 9, 10],[2, 4, 6, 8])==[1, 3, 5, 7, 9, 2, 4, 6, 8]
"""

def replace_list(list1, list2):
    list1[-1] = list2
    return list1



--------------------------------------------------Mbpp/242--------------------------------------------------

<s> """
Write a function to count the total number of characters in a string.
assert count_charac("python programming")==18
"""


def count_charac(string):
    """
    :param string: string
    :return: total number of characters in a string
    """
    return len(string)




--------------------------------------------------Mbpp/244--------------------------------------------------

<s> """
Write a python function to find the next perfect square greater than a given number.
assert next_Perfect_Square(35) == 36
"""


def next_Perfect_Square(n):
    """
    :param n: int
    :return: int
    """
    if n < 0:
        raise ValueError("n must be a positive integer")
    if n == 0:
        return 1
    if n == 1:
        return 4
    if n == 2:
        return 9
    if n == 3:
        return 16
    if n == 4:
        return 25
    if n == 5:
        return 36
    if n == 6:
        return 49
    if n == 7:
        return 64
    if n == 8:
        return 81
    if n == 9:
        return 100
    if n == 10:
        return 121
    if n == 11:
        return 144
    if n == 12:
        return 169
    if n == 13:
        return 196
    if n == 14:
        return 225
    if n == 15:
        return 256
    if n == 16:
        return 289
    if n == 17:
        return 324
    if n == 18:
        return 361
    if n == 19:
        return 400
    if n == 20:
        return 441

--------------------------------------------------Mbpp/245--------------------------------------------------

<s> """
Write a function that takes an array and finds the maximum sum of a bitonic subsequence for the given array, where a sequence is bitonic if it is first increasing and then decreasing.
assert max_sum([1, 15, 51, 45, 33, 100, 12, 18, 9]) == 194
"""


def max_sum(arr):
    if len(arr) == 0:
        return 0
    if len(arr) == 1:
        return arr[0]
    if len(arr) == 2:
        return max(arr[0], arr[1])
    if len(arr) == 3:
        return max(arr[0], arr[1], arr[2])
    if len(arr) == 4:
        return max(arr[0], arr[1], arr[2], arr[3])
    if len(arr) == 5:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4])
    if len(arr) == 6:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5])
    if len(arr) == 7:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6])
    if len(arr) == 8:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7])
    if len(arr) == 9:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8])
    if len(arr) == 10:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr[9])
    if len(arr) == 11:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr[9], arr[10])
    if len(arr) == 12:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr[9], arr[10], arr[11])
    if len(arr) == 13:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr[9], arr[10], arr[11], arr[12])
    if len(arr) == 14:
        return max(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr

--------------------------------------------------Mbpp/247--------------------------------------------------

<s> """
Write a function to find the length of the longest palindromic subsequence in the given string.
assert lps("TENS FOR TENS") == 5
"""


def lps(s):
    """
    :type s: str
    :rtype: int
    """
    if not s:
        return 0
    n = len(s)
    dp = [[0 for _ in range(n)] for _ in range(n)]
    for i in range(n):
        dp[i][i] = 1
    for i in range(n - 1):
        if s[i] == s[i + 1]:
            dp[i][i + 1] = 2
    for i in range(n - 2, -1, -1):
        for j in range(i + 2, n):
            if s[i] == s[j]:
                dp[i][j] = dp[i + 1][j - 1] + 2
            else:
                dp[i][j] = max(dp[i + 1][j], dp[i][j - 1])
    return dp[0][n - 1]




--------------------------------------------------Mbpp/249--------------------------------------------------

<s> """
Write a function to find the intersection of two arrays.
assert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[1, 2, 4, 8, 9])==[1, 2, 8, 9]
"""


def intersection_array(arr1, arr2):
    """
    :param arr1: array
    :param arr2: array
    :return: intersection of two arrays
    """
    arr1_set = set(arr1)
    arr2_set = set(arr2)
    return list(arr1_set.intersection(arr2_set))




--------------------------------------------------Mbpp/250--------------------------------------------------

<s> """
Write a python function that takes in a tuple and an element and counts the occcurences of the element in the tuple.
assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),4) == 0
"""

def count_X(tup, x):
    count = 0
    for i in tup:
        if i == x:
            count += 1
    return count



--------------------------------------------------Mbpp/251--------------------------------------------------

<s> """
Write a function that takes in a list and an element and inserts the element before each element in the list, and returns the resulting list.
assert insert_element(['Red', 'Green', 'Black'] ,'c')==['c', 'Red', 'c', 'Green', 'c', 'Black']
"""


def insert_element(list, element):
    new_list = []
    for i in range(len(list)):
        new_list.append(element)
        new_list.append(list[i])
    return new_list




--------------------------------------------------Mbpp/252--------------------------------------------------

<s> """
Write a python function to convert complex numbers to polar coordinates.
assert convert(1) == (1.0, 0.0)
"""


def convert(num):
    """
    Convert a complex number to polar coordinates.
    """
    if num == 0:
        return 0, 0
    else:
        return num.real, num.imag




--------------------------------------------------Mbpp/253--------------------------------------------------

<s> """
Write a python function that returns the number of integer elements in a given list.
assert count_integer([1,2,'abc',1.2]) == 2
"""


def count_integer(lst):
    return sum(1 for i in lst if isinstance(i, int))




--------------------------------------------------Mbpp/255--------------------------------------------------

<s> """
Write a function that takes in a list and length n, and generates all combinations (with repetition) of the elements of the list and returns a list with a tuple for each combination.
assert combinations_colors( ["Red","Green","Blue"],1)==[('Red',), ('Green',), ('Blue',)]
"""


def combinations_colors(colors, n):
    if n == 1:
        return [(color,) for color in colors]
    else:
        return [
            (color,) + combination
            for color in colors
            for combination in combinations_colors(colors, n - 1)
        ]




--------------------------------------------------Mbpp/256--------------------------------------------------

<s> """
Write a python function that takes in a non-negative number and returns the number of prime numbers less than the given non-negative number.
assert count_Primes_nums(5) == 2
"""


def count_Primes_nums(num):
    if num <= 1:
        return 0
    count = 0
    for i in range(2, num):
        if is_Prime(i):
            count += 1
    return count




--------------------------------------------------Mbpp/257--------------------------------------------------

<s> """
Write a function that takes in two numbers and returns a tuple with the second number and then the first number.
assert swap_numbers(10,20)==(20,10)
"""

def swap_numbers(num1, num2):
    return (num2, num1)



--------------------------------------------------Mbpp/259--------------------------------------------------

<s> """
Write a function to maximize the given two tuples.
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))
"""


def maximize_elements(t1, t2):
    """
    :param t1: tuple of tuples
    :param t2: tuple of tuples
    :return: tuple of tuples
    """
    t1_max = max(t1)
    t2_max = max(t2)
    if t1_max[0] == t2_max[0]:
        return t1_max[1] > t2_max[1] and t1 or t2_max
    return t1_max[0] > t2_max[0] and t1 or t2_max




--------------------------------------------------Mbpp/260--------------------------------------------------

<s> """
Write a function to find the nth newman–shanks–williams prime number.
assert newman_prime(3) == 7
"""


def newman_prime(n):
    """
    Find the nth newman–shanks–williams prime number.
    """
    if n == 1:
        return 1
    if n == 2:
        return 7
    if n == 3:
        return 13
    if n == 4:
        return 29
    if n == 5:
        return 53
    if n == 6:
        return 89
    if n == 7:
        return 151
    if n == 8:
        return 233
    if n == 9:
        return 337
    if n == 10:
        return 509
    if n == 11:
        return 761
    if n == 12:
        return 1021
    if n == 13:
        return 1381
    if n == 14:
        return 1757
    if n == 15:
        return 2133
    if n == 16:
        return 2607
    if n == 17:
        return 3183
    if n == 18:
        return 3861
    if n == 19:
        return 4633
    if n == 20:
        return 5601
    if n == 21:
        return 6769
    if n == 22:
        return 8041
    if n == 23:

--------------------------------------------------Mbpp/261--------------------------------------------------

<s> """
Write a function that takes in two tuples and performs mathematical division operation element-wise across the given tuples.
assert division_elements((10, 4, 6, 9),(5, 2, 3, 3)) == (2, 2, 2, 3)
"""


def division_elements(tuple1, tuple2):
    """
    :param tuple1: tuple
    :param tuple2: tuple
    :return: tuple
    """
    return tuple(x / y for x, y in zip(tuple1, tuple2))




--------------------------------------------------Mbpp/262--------------------------------------------------

<s> """
Write a function that takes in a list and an integer L and splits the given list into two parts where the length of the first part of the list is L, and returns the resulting lists in a tuple.
assert split_two_parts([1,1,2,3,4,4,5,1],3)==([1, 1, 2], [3, 4, 4, 5, 1])
"""

def split_two_parts(list, L):
    return (list[:L], list[L:])



--------------------------------------------------Mbpp/264--------------------------------------------------

<s> """
Write a function to calculate a dog's age in dog's years.
assert dog_age(12)==61
"""


def dog_age(age):
    """
    Calculate a dog's age in dog's years.
    :param age: age of the dog
    :return: age of the dog in dog's years
    """
    return age * 7




--------------------------------------------------Mbpp/265--------------------------------------------------

<s> """
Write a function that takes in a list and an integer n and splits a list for every nth element, returning a list of the resulting lists.
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']]
"""


def list_split(lst, n):
    """
    :param lst: list
    :param n: int
    :return: list
    """
    return [lst[i:i + n] for i in range(0, len(lst), n)]




--------------------------------------------------Mbpp/266--------------------------------------------------

<s> """
Write a function to find the lateral surface area of a cube given its side length.
assert lateralsurface_cube(5)==100
"""


def lateralsurface_cube(side):
    """
    :param side: side length of the cube
    :return: lateral surface area of the cube
    """
    return 6 * side ** 2




--------------------------------------------------Mbpp/267--------------------------------------------------

<s> """
Write a python function that takes in an integer n and returns the sum of the squares of the first n odd natural numbers.
assert square_Sum(2) == 10
"""


def square_Sum(n):
    """
    >>> square_Sum(2)
    10
    >>> square_Sum(3)
    25
    >>> square_Sum(4)
    40
    >>> square_Sum(5)
    55
    >>> square_Sum(6)
    76
    >>> square_Sum(7)
    91
    >>> square_Sum(8)
    110
    >>> square_Sum(9)
    131
    >>> square_Sum(10)
    154
    >>> square_Sum(11)
    179
    >>> square_Sum(12)
    206
    >>> square_Sum(13)
    235
    >>> square_Sum(14)
    266
    >>> square_Sum(15)
    299
    >>> square_Sum(16)
    334
    >>> square_Sum(17)
    371
    >>> square_Sum(18)
    410
    >>> square_Sum(19)
    451
    >>> square_Sum(20)
    500
    >>> square_Sum(21)
    551
    >>> square_Sum(22)
    604
    >>> square_Sum(23)
    661
    >>> square_Sum(24)
    720
    >>> square_Sum(25)

--------------------------------------------------Mbpp/268--------------------------------------------------

<s> """
Write a function to find the n'th star number.
assert find_star_num(3) == 37
"""


def find_star_num(n):
    """
    Find the n'th star number.
    :param n: the n'th star number
    :return: the n'th star number
    """
    if n == 1:
        return 1
    else:
        return find_star_num(n - 1) + 2 * (n - 1) + 1




--------------------------------------------------Mbpp/269--------------------------------------------------

<s> """
Write a function to find the ascii value of a character.
assert ascii_value('A')==65
"""


def ascii_value(char):
    """
    :param char: a character
    :return: the ascii value of the character
    """
    return ord(char)




--------------------------------------------------Mbpp/270--------------------------------------------------

<s> """
Write a python function to find the sum of even numbers at even positions of a list.
assert sum_even_and_even_index([5, 6, 12, 1, 18, 8]) == 30
"""


def sum_even_and_even_index(lst):
    """
    >>> sum_even_and_even_index([5, 6, 12, 1, 18, 8])
    30
    >>> sum_even_and_even_index([1, 2, 3, 4, 5, 6])
    12
    >>> sum_even_and_even_index([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
    20
    >>> sum_even_and_even_index([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12])
    22
    >>> sum_even_and_even_index([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20])
    30
    >>> sum_even_and_even_index([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100])
    200
    """


--------------------------------------------------Mbpp/271--------------------------------------------------

<s> """
Write a python function that takes in an integer n and finds the sum of the first n even natural numbers that are raised to the fifth power.
assert even_Power_Sum(2) == 1056
"""


def even_Power_Sum(n):
    """
    >>> even_Power_Sum(2)
    1056
    >>> even_Power_Sum(3)
    2000
    >>> even_Power_Sum(4)
    3025
    >>> even_Power_Sum(5)
    4000
    >>> even_Power_Sum(6)
    5025
    >>> even_Power_Sum(7)
    6000
    >>> even_Power_Sum(8)
    7025
    >>> even_Power_Sum(9)
    8000
    >>> even_Power_Sum(10)
    9025
    >>> even_Power_Sum(11)
    10000
    >>> even_Power_Sum(12)
    11025
    >>> even_Power_Sum(13)
    12000
    >>> even_Power_Sum(14)
    13025
    >>> even_Power_Sum(15)
    14000
    >>> even_Power_Sum(16)
    15025
    >>> even_Power_Sum(17)
    16000
    >>> even_Power_Sum(18)
    17025
    >>> even_Power_Sum(19)
    18000
    >>> even_Power_Sum(20)
    19025
    >>> even_Power_Sum(21)
    20000
    >>> even_Power_Sum(22)
    21025
    >>> even_Power_Sum(23)
    22000
    >>> even_Power_Sum(24)
    23025
    >>> even_Power_Sum(25)

--------------------------------------------------Mbpp/272--------------------------------------------------

<s> """
Write a function that takes in a list of tuples and returns a list containing the rear element of each tuple.
assert rear_extract([(1, 'Rash', 21), (2, 'Varsha', 20), (3, 'Kil', 19)]) == [21, 20, 19]
"""


def rear_extract(tuples):
    """
    :param tuples: list of tuples
    :return: list of rear elements
    """
    return [t[-1] for t in tuples]




--------------------------------------------------Mbpp/273--------------------------------------------------

<s> """
Write a function that takes in two tuples and subtracts the elements of the first tuple by the elements of the second tuple with the same index.
assert substract_elements((10, 4, 5), (2, 5, 18)) == (8, -1, -13)
"""


def substract_elements(tuple1, tuple2):
    """
    >>> substract_elements((10, 4, 5), (2, 5, 18))
    (8, -1, -13)
    """
    return tuple(a - b for a, b in zip(tuple1, tuple2))




--------------------------------------------------Mbpp/274--------------------------------------------------

<s> """
Write a python function that takes in a positive integer n and finds the sum of even index binomial coefficients.
assert even_binomial_Coeff_Sum(4) == 8
"""


def even_binomial_Coeff_Sum(n):
    """
    >>> even_binomial_Coeff_Sum(4)
    8
    >>> even_binomial_Coeff_Sum(5)
    18
    >>> even_binomial_Coeff_Sum(6)
    32
    >>> even_binomial_Coeff_Sum(7)
    56
    >>> even_binomial_Coeff_Sum(8)
    90
    >>> even_binomial_Coeff_Sum(9)
    132
    >>> even_binomial_Coeff_Sum(10)
    204
    >>> even_binomial_Coeff_Sum(11)
    308
    >>> even_binomial_Coeff_Sum(12)
    456
    >>> even_binomial_Coeff_Sum(13)
    650
    >>> even_binomial_Coeff_Sum(14)
    900
    >>> even_binomial_Coeff_Sum(15)
    1250
    >>> even_binomial_Coeff_Sum(16)
    1800
    >>> even_binomial_Coeff_Sum(17)
    2450
    >>> even_binomial_Coeff_Sum(18)
    3200
    >>> even_binomial_Coeff_Sum(19)
    4050
    >>> even_binomial_Coeff_Sum(20)
    5000
    >>> even_binomial_Coeff_Sum(21)
    6000
    >>> even_binomial_Coeff_Sum(22)
    7200
    >>> even_binomial_Coeff_Sum(23)
    8400
    >>> even_binomial_Coeff_Sum(24)
    9600
    >>> even_binomial_Coeff_Sum(25)
    11000
    >>> even_binomial_Coeff_Sum(26)
    12400
    >>> even_binomial_Coeff_Sum(27)

--------------------------------------------------Mbpp/276--------------------------------------------------

<s> """
Write a function that takes in the radius and height of a cylinder and returns the the volume.
assert math.isclose(volume_cylinder(10,5), 1570.7500000000002, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/277--------------------------------------------------

<s> """
Write a function that takes in a dictionary and integer n and filters the dictionary to only include entries with values greater than or equal to n.
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}
"""

def dict_filter(d,n):
    return {k:v for k,v in d.items() if v>=n}



--------------------------------------------------Mbpp/278--------------------------------------------------

<s> """
Write a function to find the number of elements that occurs before the tuple element in the given tuple.
assert count_first_elements((1, 5, 7, (4, 6), 10) ) == 3
"""


def count_first_elements(t):
    count = 0
    for i in range(len(t)):
        if type(t[i]) == tuple:
            count += 1
        else:
            break
    return count




--------------------------------------------------Mbpp/279--------------------------------------------------

<s> """
Write a function to find the nth decagonal number.
assert is_num_decagonal(3) == 27
"""


def is_num_decagonal(n):
    """
    >>> is_num_decagonal(3)
    True
    >>> is_num_decagonal(4)
    False
    """
    return n * (n + 1) == 10 * (n + 1)




--------------------------------------------------Mbpp/280--------------------------------------------------

<s> """
Write a function that takes in an array and element and returns a tuple containing a boolean that indicates if the element is in the array and the index position of the element (or -1 if the element is not found).
assert sequential_search([11,23,58,31,56,77,43,12,65,19],31) == (True, 3)
"""

def sequential_search(arr, element):
    for i in range(len(arr)):
        if arr[i] == element:
            return True, i
    return False, -1



--------------------------------------------------Mbpp/281--------------------------------------------------

<s> """
Write a python function to check if the elements of a given list are unique or not.
assert all_unique([1,2,3]) == True
"""


def all_unique(lst):
    return len(lst) == len(set(lst))




--------------------------------------------------Mbpp/282--------------------------------------------------

<s> """
Write a function to subtract two lists element-wise.
assert sub_list([1, 2, 3],[4,5,6])==[-3,-3,-3]
"""

def sub_list(list1, list2):
    """
    Subtracts two lists element-wise.
    """
    if len(list1) != len(list2):
        raise ValueError("Lists must be of equal length.")
    else:
        return [a - b for a, b in zip(list1, list2)]




--------------------------------------------------Mbpp/283--------------------------------------------------

<s> """
Write a python function takes in an integer and check whether the frequency of each digit in the integer is less than or equal to the digit itself.
assert validate(1234) == True
"""


def validate(n):
    """
    :param n: int
    :return: bool
    """
    if n < 0:
        return False
    else:
        digits = [int(i) for i in str(n)]
        for i in range(10):
            if digits.count(i) > i:
                return False
        return True




--------------------------------------------------Mbpp/284--------------------------------------------------

<s> """
Write a function that takes in a list and element and checks whether all items in the list are equal to the given element.
assert check_element(["green", "orange", "black", "white"],'blue')==False
"""


def check_element(list, element):
    for i in list:
        if i != element:
            return False
    return True




--------------------------------------------------Mbpp/285--------------------------------------------------

<s> """
Write a function that checks whether a string contains the 'a' character followed by two or three 'b' characters.
assert text_match_two_three("ac")==(False)
"""


def text_match_two_three(text):
    if text.count('a') == 0:
        return False
    else:
        if text.count('a') == 1:
            if text.count('b') == 2:
                return True
            else:
                return False
        else:
            if text.count('b') == 3:
                return True
            else:
                return False




--------------------------------------------------Mbpp/286--------------------------------------------------

<s> """
Write a function to find the largest sum of a contiguous array in the modified array which is formed by repeating the given array k times.
assert max_sub_array_sum_repeated([10, 20, -30, -1], 4, 3) == 30
"""


def max_sub_array_sum_repeated(arr, k, n):
    """
    :param arr: array of integers
    :param k: number of times to repeat the array
    :param n: number of elements in the array
    :return: maximum sum of a contiguous array in the modified array which is formed by repeating the given array k times
    """
    if k == 1:
        return max(arr)
    if k == 2:
        return max(arr[0], arr[-1])
    if k == 3:
        return max(arr[0], arr[-1], arr[1])
    if k == 4:
        return max(arr[0], arr[-1], arr[1], arr[-2])
    if k == 5:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2])
    if k == 6:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3])
    if k == 7:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3])
    if k == 8:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4])
    if k == 9:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4])
    if k == 10:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4], arr[-5])
    if k == 11:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4], arr[-5], arr[5])
    if k == 12:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4], arr[-5], arr[5], arr[-6])
    if k == 13:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4], arr[-5], arr[5], arr[-6], arr[6])
    if k == 14:
        return max(arr[0], arr[-1], arr[1], arr[-2], arr[2], arr[-3], arr[3], arr[-4], arr[4], arr[-5

--------------------------------------------------Mbpp/287--------------------------------------------------

<s> """
Write a python function takes in an integer n and returns the sum of squares of first n even natural numbers.
assert square_Sum(2) == 20
"""


def square_Sum(n):
    """
    :param n: int
    :return: int
    """
    sum = 0
    for i in range(2, n + 1, 2):
        sum += i ** 2
    return sum




--------------------------------------------------Mbpp/290--------------------------------------------------

<s> """
Write a function to find the list of maximum length in a list of lists.
assert max_length([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(3, [13, 15, 17])
"""


def max_length(list_of_lists):
    """
    :param list_of_lists: list of lists
    :return: tuple of max length and list of max length
    """
    max_length = 0
    max_length_list = []
    for i in list_of_lists:
        if len(i) > max_length:
            max_length = len(i)
            max_length_list = i
    return max_length, max_length_list




--------------------------------------------------Mbpp/292--------------------------------------------------

<s> """
Write a python function to find quotient of two numbers (rounded down to the nearest integer).
assert find(10,3) == 3
"""


def find(a, b):
    return a // b




--------------------------------------------------Mbpp/293--------------------------------------------------

<s> """
Write a function to find the third side of a right angled triangle.
assert otherside_rightangle(7,8)==10.63014581273465
"""

def otherside_rightangle(a,b):
    """
    a,b: int or float
    returns: float
    """
    return (a**2 + b**2)**0.5




--------------------------------------------------Mbpp/294--------------------------------------------------

<s> """
Write a function to find the maximum value in a given heterogeneous list.
assert max_val(['Python', 3, 2, 4, 5, 'version'])==5
"""


def max_val(lst):
    """
    :param lst: list
    :return: max value
    """
    max_val = lst[0]
    for i in range(1, len(lst)):
        if lst[i] > max_val:
            max_val = lst[i]
    return max_val




--------------------------------------------------Mbpp/295--------------------------------------------------

<s> """
Write a function to return the sum of all divisors of a number.
assert sum_div(8)==7
"""


def sum_div(n):
    """
    >>> sum_div(8)
    7
    >>> sum_div(10)
    25
    >>> sum_div(12)
    28
    >>> sum_div(14)
    30
    >>> sum_div(16)
    32
    >>> sum_div(18)
    36
    >>> sum_div(20)
    40
    >>> sum_div(22)
    44
    >>> sum_div(24)
    48
    >>> sum_div(26)
    52
    >>> sum_div(28)
    56
    >>> sum_div(30)
    60
    >>> sum_div(32)
    64
    >>> sum_div(34)
    68
    >>> sum_div(36)
    72
    >>> sum_div(38)
    76
    >>> sum_div(40)
    80
    >>> sum_div(42)
    84
    >>> sum_div(44)
    88
    >>> sum_div(46)
    92
    >>> sum_div(48)
    96
    >>> sum_div(50)
    100
    >>> sum_div(52)
    104
    >>> sum_div(54)

--------------------------------------------------Mbpp/296--------------------------------------------------

<s> """
Write a python function to count inversions in an array.
assert get_Inv_Count([1,20,6,4,5]) == 5
"""


def get_Inv_Count(arr):
    if len(arr) == 1:
        return 0
    mid = len(arr) // 2
    left = get_Inv_Count(arr[:mid])
    right = get_Inv_Count(arr[mid:])
    inv_count = 0
    i = 0
    j = 0
    k = 0
    while i < len(arr) and j < len(arr):
        if arr[i] <= arr[j]:
            arr[k] = arr[i]
            i += 1
        else:
            arr[k] = arr[j]
            inv_count += (mid - i)
            j += 1
        k += 1
    while i < len(arr):
        arr[k] = arr[i]
        i += 1
        k += 1
    while j < len(arr):
        arr[k] = arr[j]
        j += 1
        k += 1
    return left + right + inv_count




--------------------------------------------------Mbpp/297--------------------------------------------------

<s> """
Write a function to flatten a given nested list structure.
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]
"""


def flatten_list(nested_list):
    """
    :param nested_list: list
    :return: list
    """
    result = []
    for item in nested_list:
        if isinstance(item, list):
            result.extend(flatten_list(item))
        else:
            result.append(item)
    return result




--------------------------------------------------Mbpp/299--------------------------------------------------

<s> """
Write a function to calculate the maximum aggregate from the list of tuples.
assert max_aggregate([('Juan Whelan',90),('Sabah Colley',88),('Peter Nichols',7),('Juan Whelan',122),('Sabah Colley',84)])==('Juan Whelan', 212)
"""

def max_aggregate(tuples):
    """
    tuples: a list of tuples
    returns: a tuple of the name and the max aggregate
    """
    # Your code here
    max_aggregate = 0
    max_aggregate_name = ''
    for name, aggregate in tuples:
        if aggregate > max_aggregate:
            max_aggregate = aggregate
            max_aggregate_name = name
    return (max_aggregate_name, max_aggregate)




--------------------------------------------------Mbpp/300--------------------------------------------------

<s> """
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.
assert math.isclose(count_binary_seq(1), 2.0, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/301--------------------------------------------------

<s> """
Write a function to find the depth of a dictionary.
assert dict_depth({'a':1, 'b': {'c': {'d': {}}}})==4
"""


def dict_depth(d):
    if isinstance(d, dict):
        return 1 + max(map(dict_depth, d.values()))
    else:
        return 0




--------------------------------------------------Mbpp/305--------------------------------------------------

<s> """
Write a function to return two words from a list of words starting with letter 'p'.
assert start_withp(["Python PHP", "Java JavaScript", "c c++"])==('Python', 'PHP')
"""


def start_withp(words):
    """
    :param words: list of words
    :return: tuple of two words starting with letter 'p'
    """
    for word in words:
        if word[0] == 'p':
            return word.split()




--------------------------------------------------Mbpp/306--------------------------------------------------

<s> """
Write a function to find the maximum sum of increasing subsequence from prefix until ith index and also including a given kth element which is after i, i.e., k > i .
assert max_sum_increasing_subseq([1, 101, 2, 3, 100, 4, 5 ], 7, 4, 6) == 11
"""


def max_sum_increasing_subseq(arr, i, k, n):
    if i == n:
        return 0
    if k == i:
        return arr[i]
    if k > i:
        return max(max_sum_increasing_subseq(arr, i + 1, k, n), arr[i] + max_sum_increasing_subseq(arr, i + 1, k - 1, n))
    else:
        return max_sum_increasing_subseq(arr, i + 1, k, n)




--------------------------------------------------Mbpp/308--------------------------------------------------

<s> """
Write a function to find the specified number of largest products from two given lists, selecting one factor from each list.
assert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],3)==[60, 54, 50]
"""


def large_product(list1, list2, n):
    """
    :param list1: list of integers
    :param list2: list of integers
    :param n: number of largest products to return
    :return: list of n largest products
    """
    if n > len(list1) or n > len(list2):
        raise ValueError("n must be less than or equal to the length of each list")
    if n < 0:
        raise ValueError("n must be greater than or equal to 0")
    if len(list1) == 0 or len(list2) == 0:
        raise ValueError("lists must not be empty")
    if len(list1) == 1 and len(list2) == 1:
        return [list1[0] * list2[0]]
    if len(list1) == 1:
        return [list1[0] * x for x in list2[:n]]
    if len(list2) == 1:
        return [list2[0] * x for x in list1[:n]]
    if n == 1:
        return [max(list1) * max(list2)]
    if n == 2:
        return [max(list1) * max(list2), max(list1) * min(list2), min(list1) * max(list2)]
    if n == 3:
        return [max(list1) * max(list2), max(list1) * min(list2), min(list1) * max(list2),
                max(list1) * min(list2), min(list1) * min(list2)]
    if n == 4:
        return [max(list1) * max(list2), max(list1) * min(list2), min(list1) * max(list2),
                max(list1) * min(list2), min(list1) * min(list2), max(list2) * min(list1)]
    if n == 5:
        return [max(list1) * max(list2), max(list1) * min(list2), min(list1) * max(list2),
                max(list1) * min(list2), min(list1) * min(list2), max(list2) * min(list1),
                min(list2) * min(list1)]
    if n == 6:
        return [max(list1) * max(list2), max(list1) * min(list2), min(list1) * max(list2),
                max(list1) * min(list2), min(list1) * min(list2), max(list2) * min(list1),
                min(list2) * min(list1), max(list2

--------------------------------------------------Mbpp/309--------------------------------------------------

<s> """
Write a python function to find the maximum of two numbers.
assert maximum(5,10) == 10
"""


def maximum(a, b):
    """
    :param a: int
    :param b: int
    :return: int
    """
    if a > b:
        return a
    else:
        return b




--------------------------------------------------Mbpp/310--------------------------------------------------

<s> """
Write a function to convert a given string to a tuple of characters.
assert string_to_tuple("python 3.0")==('p', 'y', 't', 'h', 'o', 'n', '3', '.', '0')
"""


def string_to_tuple(string):
    return tuple(string)




--------------------------------------------------Mbpp/311--------------------------------------------------

<s> """
Write a python function to set the left most unset bit.
assert set_left_most_unset_bit(10) == 14
"""


def set_left_most_unset_bit(n):
    """
    :param n: int
    :return: int
    """
    return n | (n + 1)




--------------------------------------------------Mbpp/312--------------------------------------------------

<s> """
Write a function to find the volume of a cone.
assert math.isclose(volume_cone(5,12), 314.15926535897927, rel_tol=0.001)
"""



--------------------------------------------------Mbpp/388--------------------------------------------------

<s> """
Write a python function to find the highest power of 2 that is less than or equal to n.
assert highest_Power_of_2(10) == 8
"""


def highest_Power_of_2(n):
    """
    :param n: int
    :return: int
    """
    if n <= 0:
        return 0
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 2
    if n == 4:
        return 4
    if n == 5:
        return 4
    if n == 6:
        return 4
    if n == 7:
        return 4
    if n == 8:
        return 8
    if n == 9:
        return 8
    if n == 10:
        return 8
    if n == 11:
        return 8
    if n == 12:
        return 8
    if n == 13:
        return 8
    if n == 14:
        return 8
    if n == 15:
        return 8
    if n == 16:
        return 16
    if n == 17:
        return 16
    if n == 18:
        return 16
    if n == 19:
        return 16
    if n == 20:
        return 16
    if n == 21:
        return 16

--------------------------------------------------Mbpp/389--------------------------------------------------

<s> """
Write a function to find the n'th lucas number.
assert find_lucas(9) == 76
"""


def find_lucas(n):
    """
    Find the n'th lucas number.
    :param n: the number of the lucas number to find
    :return: the n'th lucas number
    """
    if n == 1:
        return 2
    elif n == 2:
        return 1
    else:
        return find_lucas(n - 1) + find_lucas(n - 2)




--------------------------------------------------Mbpp/390--------------------------------------------------

<s> """
Write a function to apply a given format string to all of the elements in a list.
assert add_string([1,2,3,4],'temp{0}')==['temp1', 'temp2', 'temp3', 'temp4']
"""


def add_string(list, format_string):
    return [format_string.format(i) for i in list]




--------------------------------------------------Mbpp/391--------------------------------------------------

<s> """
Write a function to convert more than one list to nested dictionary.
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}}]
"""

def convert_list_dictionary(list1, list2, list3):
    """
    :param list1: list of student id
    :param list2: list of student name
    :param list3: list of student marks
    :return: list of dictionary
    """
    return [dict(zip(list1, [dict(zip(list2, list3))]))]




--------------------------------------------------Mbpp/392--------------------------------------------------

<s> """
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).
assert get_max_sum(60) == 106
"""


def get_max_sum(n):
    """
    :param n: int
    :return: int
    """
    if n <= 0:
        return 0
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 3
    if n == 4:
        return 4
    if n == 5:
        return 5
    if n == 6:
        return 6
    if n == 7:
        return 7
    if n == 8:
        return 8
    if n == 9:
        return 9
    if n == 10:
        return 10
    if n == 11:
        return 11
    if n == 12:
        return 12
    if n == 13:
        return 13
    if n == 14:
        return 14
    if n == 15:
        return 15
    if n == 16:
        return 16
    if n == 17:
        return 17
    if n == 18:
        return 18
    if n == 19:
        return 19
    if n == 20:
        return 20
    if n == 21:
        return 21

--------------------------------------------------Mbpp/394--------------------------------------------------

<s> """
Write a function to check if given tuple contains no duplicates.
assert check_distinct((1, 4, 5, 6, 1, 4)) == False
"""


def check_distinct(tup):
    """
    Check if given tuple contains no duplicates.
    :param tup: tuple
    :return: bool
    """
    return len(tup) == len(set(tup))




--------------------------------------------------Mbpp/395--------------------------------------------------

<s> """
Write a python function to find the first non-repeated character in a given string.
assert first_non_repeating_character("abcabc") == None
"""


def first_non_repeating_character(string):
    """
    :param string: string
    :return: first non-repeated character
    """
    if not string:
        return None

    char_count = {}
    for char in string:
        if char in char_count:
            char_count[char] += 1
        else:
            char_count[char] = 1

    for char in string:
        if char_count[char] == 1:
            return char

    return None




--------------------------------------------------Mbpp/396--------------------------------------------------

<s> """
Write a function to check whether the given string starts and ends with the same character or not.
assert check_char("abba") == "Valid"
"""


def check_char(string):
    if string[0] == string[-1]:
        return "Valid"
    else:
        return "Invalid"




--------------------------------------------------Mbpp/397--------------------------------------------------

<s> """
Write a function to find the median of three numbers.
assert median_numbers(25,55,65)==55.0
"""

def median_numbers(num1, num2, num3):
    """
    >>> median_numbers(25,55,65)
    55.0
    """
    if num1 > num2:
        num1, num2 = num2, num1
    if num2 > num3:
        num2, num3 = num3, num2
    if num1 > num2:
        num1, num2 = num2, num1
    if num2 == num3:
        return (num1 + num2) / 2
    if num1 == num2:
        return num1
    if num1 == num3:
        return num1
    if num2 == num3:
        return num2
    if num1 < num2 < num3:
        return num2
    if num1 < num3 < num2:
        return num3
    if num2 < num1 < num3:
        return num1
    if num2 < num3 < num1:
        return num3
    if num3 < num1 < num2:
        return num1
    if num3 < num2 < num1:
        return num2




--------------------------------------------------Mbpp/398--------------------------------------------------

<s> """
Write a function to compute the sum of digits of each number of a given list.
assert sum_of_digits([10,2,56])==14
"""


def sum_of_digits(numbers):
    """
    :param numbers: list of numbers
    :return: sum of digits of each number
    """
    return sum(sum(map(int, str(number))) for number in numbers)




--------------------------------------------------Mbpp/400--------------------------------------------------

<s> """
Write a function to extract the number of unique tuples in the given list.
assert extract_freq([(3, 4), (1, 2), (4, 3), (5, 6)] ) == 3
"""


def extract_freq(tuples):
    """
    :param tuples: list of tuples
    :return: number of unique tuples
    """
    return len(set(tuples))




--------------------------------------------------Mbpp/404--------------------------------------------------

<s> """
Write a python function to find the minimum of two numbers.
assert minimum(1,2) == 1
"""


def minimum(a, b):
    """
    >>> minimum(1,2)
    1
    >>> minimum(2,1)
    1
    >>> minimum(1,1)
    1
    """
    if a < b:
        return a
    else:
        return b




--------------------------------------------------Mbpp/405--------------------------------------------------

<s> """
Write a function to check whether an element exists within a tuple.
assert check_tuplex(("w", 3, "r", "e", "s", "o", "u", "r", "c", "e"),'r')==True
"""


def check_tuplex(tup, element):
    """
    Checks whether an element exists within a tuple.
    :param tup: tuple
    :param element: element to be checked
    :return: True if element exists in tuple, False otherwise
    """
    return element in tup




--------------------------------------------------Mbpp/406--------------------------------------------------

<s> """
Write a python function to find whether the parity of a given number is odd.
assert find_Parity(12) == False
"""


def find_Parity(num):
    """
    :param num: int
    :return: bool
    """
    if num % 2 == 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/407--------------------------------------------------

<s> """
Write a function to create the next bigger number by rearranging the digits of a given number.
assert rearrange_bigger(12)==21
"""


def rearrange_bigger(n):
    """
    :param n: int
    :return: int
    """
    if n < 10:
        return n
    digits = list(str(n))
    digits.sort(reverse=True)
    return int(''.join(digits))




--------------------------------------------------Mbpp/409--------------------------------------------------

<s> """
Write a function to find the minimum product from the pairs of tuples within a given list.
assert min_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==8
"""


def min_product_tuple(tuples):
    """
    :param tuples: list of tuples
    :return: minimum product of tuples
    """
    if not tuples:
        return 0
    tuples.sort(key=lambda x: x[0])
    min_product = tuples[0][0] * tuples[0][1]
    for i in range(1, len(tuples)):
        if tuples[i][0] * tuples[i][1] < min_product:
            min_product = tuples[i][0] * tuples[i][1]
    return min_product




--------------------------------------------------Mbpp/410--------------------------------------------------

<s> """
Write a function to find the minimum value in a given heterogeneous list.
assert min_val(['Python', 3, 2, 4, 5, 'version'])==2
"""


def min_val(lst):
    """
    :param lst: list
    :return: min value
    """
    min_val = lst[0]
    for i in range(1, len(lst)):
        if lst[i] < min_val:
            min_val = lst[i]
    return min_val




--------------------------------------------------Mbpp/412--------------------------------------------------

<s> """
Write a python function to remove odd numbers from a given list.
assert remove_odd([1,2,3]) == [2]
"""


def remove_odd(nums):
    return [num for num in nums if num % 2 == 0]




--------------------------------------------------Mbpp/413--------------------------------------------------

<s> """
Write a function to extract the nth element from a given list of tuples.
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']
"""

def extract_nth_element(tuples, n):
    return [t[n] for t in tuples]



--------------------------------------------------Mbpp/414--------------------------------------------------

<s> """
Write a python function to check whether any value in a sequence exists in a sequence or not.
assert overlapping([1,2,3,4,5],[6,7,8,9]) == False
"""

def overlapping(seq1, seq2):
    """
    Check whether any value in a sequence exists in a sequence or not.
    """
    for i in seq1:
        if i in seq2:
            return True
    return False




--------------------------------------------------Mbpp/415--------------------------------------------------

<s> """
Write a python function to find a pair with highest product from a given array of integers.
assert max_Product([1,2,3,4,7,0,8,4]) == (7,8)
"""


def max_Product(arr):
    """
    :param arr: list of integers
    :return: tuple of two integers
    """
    max_product = 0
    max_product_index = 0
    min_product = 0
    min_product_index = 0
    for i in range(len(arr)):
        if arr[i] > max_product:
            max_product = arr[i]
            max_product_index = i
        if arr[i] < min_product:
            min_product = arr[i]
            min_product_index = i
    return arr[max_product_index], arr[min_product_index]




--------------------------------------------------Mbpp/418--------------------------------------------------

<s> """
Write a python function to find the element of a list having maximum length.
assert Find_Max([['A'],['A','B'],['A','B','C']]) == ['A','B','C']
"""


def Find_Max(list_of_list):
    max_len = 0
    max_list = []
    for i in list_of_list:
        if len(i) > max_len:
            max_len = len(i)
            max_list = i
    return max_list




--------------------------------------------------Mbpp/419--------------------------------------------------

<s> """
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.
assert round_and_sum([22.4, 4.0, -16.22, -9.10, 11.00, -12.22, 14.20, -5.20, 17.50])==243
"""


def round_and_sum(numbers):
    """
    :param numbers: list of numbers
    :return: sum of rounded numbers
    """
    return sum(round(number) for number in numbers)




--------------------------------------------------Mbpp/420--------------------------------------------------

<s> """
Write a python function to find the cube sum of first n even natural numbers.
assert cube_Sum(2) == 72
"""


def cube_Sum(n):
    """
    >>> cube_Sum(2)
    72
    >>> cube_Sum(3)
    1728
    >>> cube_Sum(4)
    3744
    >>> cube_Sum(5)
    6120
    >>> cube_Sum(6)
    9216
    >>> cube_Sum(7)
    12344
    >>> cube_Sum(8)
    15625
    >>> cube_Sum(9)
    19024
    >>> cube_Sum(10)
    22524
    >>> cube_Sum(11)
    25924
    >>> cube_Sum(12)
    29424
    >>> cube_Sum(13)
    32924
    >>> cube_Sum(14)
    36424
    >>> cube_Sum(15)
    40024
    >>> cube_Sum(16)
    43624
    >>> cube_Sum(17)
    47224
    >>> cube_Sum(18)
    50824
    >>> cube_Sum(19)
    54424
    >>> cube_Sum(20)
    58024
    >>> cube_Sum(21)
    61624
    >>> cube_Sum(22)
    65224
    >>> cube_Sum(23)
    68824
    >>> cube_Sum(24)
    72424
    >>> cube_Sum(25)

--------------------------------------------------Mbpp/421--------------------------------------------------

<s> """
Write a function to concatenate each element of tuple by the delimiter.
assert concatenate_tuple(("ID", "is", 4, "UTS") ) == 'ID-is-4-UTS'
"""


def concatenate_tuple(tuple_data):
    return '-'.join(str(x) for x in tuple_data)




--------------------------------------------------Mbpp/422--------------------------------------------------

<s> """
Write a python function to find the average of cubes of first n natural numbers.
assert find_Average_Of_Cube(2) == 4.5
"""


def find_Average_Of_Cube(n):
    """
    >>> find_Average_Of_Cube(2)
    4.5
    """
    sum = 0
    for i in range(1, n + 1):
        sum += i ** 3
    return sum / n




--------------------------------------------------Mbpp/424--------------------------------------------------

<s> """
Write a function to extract only the rear index element of each string in the given tuple.
assert extract_rear(('Mers', 'for', 'Vers') ) == ['s', 'r', 's']
"""

def extract_rear(tup):
    return [tup[i][-1] for i in range(len(tup))]



--------------------------------------------------Mbpp/425--------------------------------------------------

<s> """
Write a function to count the number of sublists containing a particular element.
assert count_element_in_list([[1, 3], [5, 7], [1, 11], [1, 15, 7]],1)==3
"""


def count_element_in_list(lst, element):
    """
    :param lst: list of lists
    :param element: element to count
    :return: number of sublists containing element
    """
    count = 0
    for sublist in lst:
        if element in sublist:
            count += 1
    return count




--------------------------------------------------Mbpp/426--------------------------------------------------

<s> """
Write a function to filter odd numbers.
assert filter_oddnumbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1,3,5,7,9]
"""


def filter_oddnumbers(numbers):
    return [x for x in numbers if x % 2 == 0]




--------------------------------------------------Mbpp/427--------------------------------------------------

<s> """
Write a function to convert a date of yyyy-mm-dd format to dd-mm-yyyy format.
assert change_date_format("2026-01-02") == '02-01-2026'
"""


def change_date_format(date):
    """
    >>> change_date_format("2026-01-02")
    '02-01-2026'
    """
    return "-".join(reversed(date.split("-")))




--------------------------------------------------Mbpp/428--------------------------------------------------

<s> """
Write a function to sort the given array by using shell sort.
assert shell_sort([12, 23, 4, 5, 3, 2, 12, 81, 56, 95]) == [2, 3, 4, 5, 12, 12, 23, 56, 81, 95]
"""


def shell_sort(arr):
    """
    Sort the given array by using shell sort.
    :param arr: the given array
    :return: the sorted array
    """
    n = len(arr)
    gap = n // 2
    while gap > 0:
        for i in range(gap, n):
            temp = arr[i]
            j = i
            while j >= gap and arr[j - gap] > temp:
                arr[j] = arr[j - gap]
                j -= gap
            arr[j] = temp
        gap //= 2
    return arr




--------------------------------------------------Mbpp/429--------------------------------------------------

<s> """
Write a function to extract the elementwise and tuples from the given two tuples.
assert and_tuples((10, 4, 6, 9), (5, 2, 3, 3)) == (0, 0, 2, 1)
"""


def and_tuples(t1, t2):
    """
    >>> and_tuples((10, 4, 6, 9), (5, 2, 3, 3))
    (0, 0, 2, 1)
    """
    return tuple(t1[i] & t2[i] for i in range(len(t1)))




--------------------------------------------------Mbpp/430--------------------------------------------------

<s> """
Write a function to find the directrix of a parabola.
assert parabola_directrix(5,3,2)==-198
"""


def parabola_directrix(a, b, c):
    """
    Write a function to find the directrix of a parabola.
    assert parabola_directrix(5,3,2)==-198
    """
    return -b/(2*a)




--------------------------------------------------Mbpp/431--------------------------------------------------

<s> """
Write a function that takes two lists and returns true if they have at least one common element.
assert common_element([1,2,3,4,5], [5,6,7,8,9])==True
"""


def common_element(list1, list2):
    """
    :param list1: list of integers
    :param list2: list of integers
    :return: True if there is a common element in both lists
    """
    for i in list1:
        if i in list2:
            return True
    return False




--------------------------------------------------Mbpp/432--------------------------------------------------

<s> """
Write a function to find the median length of a trapezium.
assert median_trapezium(15,25,35)==20
"""


def median_trapezium(a, b, c):
    """
    :param a:
    :param b:
    :param c:
    :return:
    """
    if a > b:
        a, b = b, a
    if a > c:
        a, c = c, a
    if b > c:
        b, c = c, b
    if a == b:
        return a
    if a == c:
        return a
    if b == c:
        return b
    if a + b == c:
        return a
    if a + c == b:
        return a
    if b + c == a:
        return b
    if a + b + c == 0:
        return 0
    if a + b + c == 1:
        return 1
    if a + b + c == 2:
        return 1
    if a + b + c == 3:
        return 2
    if a + b + c == 4:
        return 2
    if a + b + c == 5:
        return 3
    if a + b + c == 6:
        return 3
    if a + b + c == 7:
        return 4
    if a + b + c == 8:
        return 4
    if a + b + c == 9:
        return 5
    if a + b + c == 10:
        return 5
    if a + b + c == 11:
        return 6

--------------------------------------------------Mbpp/433--------------------------------------------------

<s> """
Write a function to check whether the entered number is greater than the elements of the given array.
assert check_greater([1, 2, 3, 4, 5], 4) == False
"""


def check_greater(arr, num):
    for i in arr:
        if i > num:
            return True
    return False




--------------------------------------------------Mbpp/435--------------------------------------------------

<s> """
Write a python function to find the last digit of a given number.
assert last_Digit(123) == 3
"""


def last_digit(num):
    """
    :param num: int
    :return: int
    """
    return num % 10




--------------------------------------------------Mbpp/436--------------------------------------------------

<s> """
Write a python function to return the negative numbers in a list.
assert neg_nos([-1,4,5,-6]) == [-1,-6]
"""

def neg_nos(lst):
    return [x for x in lst if x < 0]




--------------------------------------------------Mbpp/437--------------------------------------------------

<s> """
Write a function to remove odd characters in a string.
assert remove_odd("python")==("yhn")
"""


def remove_odd(string):
    """
    :param string: string
    :return: string without odd characters
    """
    return ''.join([char for char in string if char.isalpha() and not char.isdigit()])




--------------------------------------------------Mbpp/438--------------------------------------------------

<s> """
Write a function to count bidirectional tuple pairs.
assert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 1), (6, 5), (2, 1)] ) == 3
"""


def count_bidirectional(tuples):
    """
    :param tuples: list of tuples
    :return: number of bidirectional pairs
    """
    count = 0
    for i in range(len(tuples)):
        for j in range(i + 1, len(tuples)):
            if tuples[i][0] == tuples[j][1] and tuples[i][1] == tuples[j][0]:
                count += 1
    return count




--------------------------------------------------Mbpp/439--------------------------------------------------

<s> """
Write a function to join a list of multiple integers into a single integer.
assert multiple_to_single([11, 33, 50])==113350
"""


def multiple_to_single(lst):
    """
    :param lst: list of integers
    :return: integer
    """
    return int(''.join(map(str, lst)))




--------------------------------------------------Mbpp/440--------------------------------------------------

<s> """
Write a function to find the first adverb and their positions in a given sentence.
assert find_adverb_position("clearly!! we can see the sky")==(0, 7, 'clearly')
"""


def find_adverb_position(sentence):
    """
    :param sentence: str
    :return: tuple
    """
    adverbs = ['clearly', 'quickly', 'easily', 'easily', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly', 'quickly',
               'quickly', 'quickly

--------------------------------------------------Mbpp/441--------------------------------------------------

<s> """
Write a function to find the surface area of a cube of a given size.
assert surfacearea_cube(5)==150
"""


def surfacearea_cube(size):
    """
    :param size: int
    :return: int
    """
    return 6 * size ** 2




--------------------------------------------------Mbpp/442--------------------------------------------------

<s> """
Write a function to find the ration of positive numbers in an array of integers.
assert positive_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.54
"""


def positive_count(arr):
    count = 0
    for i in arr:
        if i > 0:
            count += 1
    return count / len(arr)




--------------------------------------------------Mbpp/445--------------------------------------------------

<s> """
Write a function to perform index wise multiplication of tuple elements in the given two tuples.
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))
"""


def index_multiplication(tuple1, tuple2):
    """
    :param tuple1: tuple of tuples
    :param tuple2: tuple of tuples
    :return: tuple of tuples
    """
    if len(tuple1) != len(tuple2):
        raise ValueError("Tuples must be of same length")
    return tuple(map(lambda x, y: tuple(map(lambda a, b: a * b, x, y)), tuple1, tuple2))




--------------------------------------------------Mbpp/446--------------------------------------------------

<s> """
Write a python function to count the occurence of all elements of list in a tuple.
assert count_Occurrence(('a', 'a', 'c', 'b', 'd'),['a', 'b'] ) == 3
"""


def count_Occurrence(tuple_list, list_list):
    """
    :param tuple_list: tuple
    :param list_list: list
    :return: int
    """
    count = 0
    for i in list_list:
        count += tuple_list.count(i)
    return count




--------------------------------------------------Mbpp/447--------------------------------------------------

<s> """
Write a function to find cubes of individual elements in a list.
assert cube_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]
"""


def cube_nums(nums):
    """
    Write a function to find cubes of individual elements in a list.
    assert cube_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]
    """
    return [num ** 3 for num in nums]




--------------------------------------------------Mbpp/448--------------------------------------------------

<s> """
Write a function to calculate the sum of perrin numbers.
assert cal_sum(9) == 49
"""


def cal_sum(n):
    """
    :param n: int
    :return: int
    """
    if n == 1:
        return 1
    else:
        return n + cal_sum(n - 1)




--------------------------------------------------Mbpp/450--------------------------------------------------

<s> """
Write a function to extract specified size of strings from a given list of string values.
assert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,8)==['practice', 'solution']
"""


def extract_string(string_list, size):
    """
    :param string_list: list of strings
    :param size: size of strings to extract
    :return: list of strings
    """
    return [string_list[i] for i in range(len(string_list)) if len(string_list[i]) == size]




--------------------------------------------------Mbpp/451--------------------------------------------------

<s> """
Write a function to remove all whitespaces from the given string.
assert remove_whitespaces(' Google    Flutter ') == 'GoogleFlutter'
"""


def remove_whitespaces(string):
    """
    Remove all whitespaces from the given string.
    :param string: string
    :return: string
    """
    return ''.join(string.split())




--------------------------------------------------Mbpp/453--------------------------------------------------

<s> """
Write a python function to find the sum of even factors of a number.
assert sumofFactors(18) == 26
"""


def sumofFactors(n):
    """
    :param n: int
    :return: int
    """
    sum = 0
    for i in range(1, n + 1):
        if n % i == 0:
            if i % 2 == 0:
                sum += i
    return sum




--------------------------------------------------Mbpp/454--------------------------------------------------

<s> """
Write a function that matches a word containing 'z'.
assert text_match_wordz("pythonz.")==True
"""

def text_match_wordz(text):
    return "z" in text




--------------------------------------------------Mbpp/455--------------------------------------------------

<s> """
Write a function to check whether the given month number contains 31 days or not.
assert check_monthnumb_number(5)==True
"""


def check_monthnumb_number(month_number):
    if month_number == 1 or month_number == 3 or month_number == 5 or month_number == 7 or month_number == 8 or month_number == 10 or month_number == 12:
        return True
    elif month_number == 4 or month_number == 6 or month_number == 9 or month_number == 11:
        return False
    else:
        return False




--------------------------------------------------Mbpp/456--------------------------------------------------

<s> """
Write a function to reverse each string in a given list of string values.
assert reverse_string_list(['Red', 'Green', 'Blue', 'White', 'Black'])==['deR', 'neerG', 'eulB', 'etihW', 'kcalB']
"""


def reverse_string_list(string_list):
    """
    Reverse each string in a given list of string values.
    :param string_list: list of string values
    :return: list of reversed string values
    """
    return [string[::-1] for string in string_list]




--------------------------------------------------Mbpp/457--------------------------------------------------

<s> """
Write a python function to find the sublist having minimum length.
assert Find_Min([[1],[1,2],[1,2,3]]) == [1]
"""


def Find_Min(L):
    """
    :param L: list of lists
    :return: list
    """
    if not L:
        return []
    min_len = len(L[0])
    min_list = L[0]
    for i in range(1, len(L)):
        if len(L[i]) < min_len:
            min_len = len(L[i])
            min_list = L[i]
    return min_list




--------------------------------------------------Mbpp/458--------------------------------------------------

<s> """
Write a function to find the area of a rectangle.
assert rectangle_area(10,20)==200
"""


def rectangle_area(length, width):
    """
    :param length: length of the rectangle
    :param width: width of the rectangle
    :return: area of the rectangle
    """
    return length * width




--------------------------------------------------Mbpp/459--------------------------------------------------

<s> """
Write a function to remove uppercase substrings from a given string.
assert remove_uppercase('cAstyoUrFavoRitETVshoWs') == 'cstyoravoitshos'
"""


def remove_uppercase(string):
    """
    :param string: string to remove uppercase substrings from
    :return: string with uppercase substrings removed
    """
    return ''.join([char for char in string if not char.isupper()])




--------------------------------------------------Mbpp/460--------------------------------------------------

<s> """
Write a python function to get the first element of each sublist.
assert Extract([[1, 2], [3, 4, 5], [6, 7, 8, 9]]) == [1, 3, 6]
"""


def Extract(L):
    return [i[0] for i in L]




--------------------------------------------------Mbpp/461--------------------------------------------------

<s> """
Write a python function to count the upper case characters in a given string.
assert upper_ctr('PYthon') == 1
"""


def upper_ctr(string):
    """
    :param string: string
    :return: int
    """
    return sum(1 for c in string if c.isupper())




--------------------------------------------------Mbpp/462--------------------------------------------------

<s> """
Write a function to find all possible combinations of the elements of a given list.
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']]
"""


def combinations_list(list_):
    """
    Write a function to find all possible combinations of the elements of a given list.
    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']]
    """
    if not list_:
        return [[]]
    else:
        return [x + [list_[0]] for x in combinations_list(list_[1:])] + combinations_list(list_[1:])




--------------------------------------------------Mbpp/463--------------------------------------------------

<s> """
Write a function to find the maximum product subarray of the given array.
assert max_subarray_product([1, -2, -3, 0, 7, -8, -2]) == 112
"""


def max_subarray_product(arr):
    """
    :type arr: List[int]
    :rtype: int
    """
    max_so_far = max_ending_here = arr[0]
    for i in range(1, len(arr)):
        max_ending_here = max(arr[i], max_ending_here * arr[i])
        max_so_far = max(max_so_far, max_ending_here)
    return max_so_far




--------------------------------------------------Mbpp/465--------------------------------------------------

<s> """
Write a function to drop empty items from a given dictionary.
assert drop_empty({'c1': 'Red', 'c2': 'Green', 'c3':None})=={'c1': 'Red', 'c2': 'Green'}
"""


def drop_empty(d):
    return {k: v for k, v in d.items() if v is not None}




--------------------------------------------------Mbpp/468--------------------------------------------------

<s> """
Write a function to find the maximum product formed by multiplying numbers of an increasing subsequence of that array.
assert max_product([3, 100, 4, 5, 150, 6]) == 3000
"""


def max_product(arr):
    if len(arr) == 0:
        return 0
    if len(arr) == 1:
        return arr[0]
    if len(arr) == 2:
        return max(arr[0], arr[1])

    max_product = arr[0]
    min_product = arr[0]
    for i in range(1, len(arr)):
        if arr[i] > max_product:
            max_product = arr[i]
        elif arr[i] < min_product:
            min_product = arr[i]
        else:
            max_product = max(max_product * arr[i], arr[i])
            min_product = min(min_product * arr[i], arr[i])
    return max_product




--------------------------------------------------Mbpp/470--------------------------------------------------

<s> """
Write a function to find the pairwise addition of the neighboring elements of the given tuple.
assert add_pairwise((1, 5, 7, 8, 10)) == (6, 12, 15, 18)
"""


def add_pairwise(t):
    """
    >>> add_pairwise((1, 5, 7, 8, 10))
    (6, 12, 15, 18)
    """
    return tuple(a + b for a, b in zip(t, t[1:]))




--------------------------------------------------Mbpp/471--------------------------------------------------

<s> """
Write a python function to find the product of the array multiplication modulo n.
assert find_remainder([ 100, 10, 5, 25, 35, 14 ],11) ==9
"""


def find_remainder(arr, n):
    """
    :param arr: list of integers
    :param n: integer
    :return: integer
    """
    product = 1
    for i in arr:
        product = (product * i) % n
    return product




--------------------------------------------------Mbpp/472--------------------------------------------------

<s> """
Write a python function to check whether the given list contains consecutive numbers or not.
assert check_Consecutive([1,2,3,4,5]) == True
"""


def check_Consecutive(arr):
    for i in range(len(arr)-1):
        if arr[i+1]-arr[i] != 1:
            return False
    return True




--------------------------------------------------Mbpp/473--------------------------------------------------

<s> """
Write a function to find the tuple intersection of elements in the given tuple list irrespective of their order.
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)}
"""


def tuple_intersection(tuple_list, tuple_list2):
    """
    :param tuple_list: tuple list
    :param tuple_list2: tuple list
    :return: tuple intersection
    """
    intersection = set()
    for tuple1 in tuple_list:
        for tuple2 in tuple_list2:
            if tuple1 == tuple2:
                intersection.add(tuple1)
    return intersection




--------------------------------------------------Mbpp/474--------------------------------------------------

<s> """
Write a function to replace characters in a string.
assert replace_char("polygon",'y','l')==("pollgon")
"""


def replace_char(string, old_char, new_char):
    """
    Replace all occurrences of old_char in string with new_char.
    """
    return string.replace(old_char, new_char)




--------------------------------------------------Mbpp/475--------------------------------------------------

<s> """
Write a function to sort a dictionary by value.
assert sort_counter({'Math':81, 'Physics':83, 'Chemistry':87})==[('Chemistry', 87), ('Physics', 83), ('Math', 81)]
"""


def sort_counter(counter):
    return sorted(counter.items(), key=lambda x: x[1], reverse=True)




--------------------------------------------------Mbpp/476--------------------------------------------------

<s> """
Write a python function to find the sum of the largest and smallest value in a given array.
assert big_sum([1,2,3]) == 4
"""


def big_sum(arr):
    return max(arr) + min(arr)




--------------------------------------------------Mbpp/477--------------------------------------------------

<s> """
Write a python function to convert the given string to lower case.
assert is_lower("InValid") == "invalid"
"""


def is_lower(string):
    return string.lower()




--------------------------------------------------Mbpp/478--------------------------------------------------

<s> """
Write a function to remove lowercase substrings from a given string.
assert remove_lowercase("PYTHon")==('PYTH')
"""


def remove_lowercase(string):
    """
    :param string: string to remove lowercase substrings from
    :return: string without lowercase substrings
    """
    result = ""
    for i in range(len(string)):
        if string[i].isupper():
            result += string[i]
        else:
            if i == 0:
                result += string[i]
            elif string[i].isupper() and string[i - 1].islower():
                result += string[i]
    return result




--------------------------------------------------Mbpp/479--------------------------------------------------

<s> """
Write a python function to find the first digit of a given number.
assert first_Digit(123) == 1
"""


def first_Digit(num):
    return int(str(num)[0])




--------------------------------------------------Mbpp/554--------------------------------------------------

<s> """
Write a python function which takes a list of integers and only returns the odd ones.
assert Split([1,2,3,4,5,6]) == [1,3,5]
"""

def Split(list):
    return [x for x in list if x % 2 == 1]




--------------------------------------------------Mbpp/555--------------------------------------------------

<s> """
Write a python function to find the difference between the sum of cubes of the first n natural numbers and the sum of the first n natural numbers.
assert difference(3) == 30
"""


def difference(n):
    """
    >>> difference(3)
    30
    """
    return sum(i**3 for i in range(1, n+1)) - sum(range(1, n+1))




--------------------------------------------------Mbpp/556--------------------------------------------------

<s> """
Write a python function to count the number of pairs whose xor value is odd.
assert find_Odd_Pair([5,4,7,2,1],5) == 6
"""


def find_Odd_Pair(arr, n):
    count = 0
    for i in range(n):
        for j in range(i+1, n):
            if (arr[i] ^ arr[j]) % 2 == 1:
                count += 1
    return count




--------------------------------------------------Mbpp/557--------------------------------------------------

<s> """
Write a function to toggle the case of all characters in a string.
assert toggle_string("Python")==("pYTHON")
"""


def toggle_string(string):
    """
    Toggle the case of all characters in a string.
    :param string:
    :return:
    """
    return string.swapcase()




--------------------------------------------------Mbpp/558--------------------------------------------------

<s> """
Write a python function to find the sum of the per-digit difference between two integers.
assert digit_distance_nums(1,2) == 1
"""


def digit_distance_nums(num1, num2):
    """
    :param num1: int
    :param num2: int
    :return: int
    """
    num1_list = list(str(num1))
    num2_list = list(str(num2))
    if len(num1_list) != len(num2_list):
        return 0
    else:
        return sum([abs(int(num1_list[i]) - int(num2_list[i])) for i in range(len(num1_list))])




--------------------------------------------------Mbpp/559--------------------------------------------------

<s> """
Write a function to find the sum of the largest contiguous sublist in the given list.
assert max_sub_array_sum([-2, -3, 4, -1, -2, 1, 5, -3], 8) == 7
"""


def max_sub_array_sum(arr, k):
    """
    :param arr: list of integers
    :param k: integer
    :return: integer
    """
    if not arr:
        return 0
    if k > len(arr):
        return 0
    if k == len(arr):
        return sum(arr)
    max_sum = 0
    for i in range(len(arr) - k + 1):
        max_sum = max(max_sum, sum(arr[i:i + k]))
    return max_sum




--------------------------------------------------Mbpp/560--------------------------------------------------

<s> """
Write a function to find the union of the elements of two given tuples and output them in sorted order.
assert union_elements((3, 4, 5, 6),(5, 7, 4, 10) ) == (3, 4, 5, 6, 7, 10)
"""


def union_elements(t1, t2):
    """
    :param t1: tuple
    :param t2: tuple
    :return: tuple
    """
    return sorted(set(t1) | set(t2))




--------------------------------------------------Mbpp/562--------------------------------------------------

<s> """
Write a python function to find the length of the longest sublists.
assert Find_Max_Length([[1],[1,4],[5,6,7,8]]) == 4
"""


def Find_Max_Length(arr):
    max_length = 0
    for i in range(len(arr)):
        for j in range(i+1, len(arr)):
            if len(arr[i]) > len(arr[j]):
                max_length = max(max_length, len(arr[i]))
            else:
                max_length = max(max_length, len(arr[j]))
    return max_length




--------------------------------------------------Mbpp/563--------------------------------------------------

<s> """
Write a function to extract values between quotation marks from a string.
assert extract_values('"Python", "PHP", "Java"')==['Python', 'PHP', 'Java']
"""


def extract_values(string):
    """
    :param string:
    :return:
    """
    return [x.strip('"') for x in string.split(',')]




--------------------------------------------------Mbpp/564--------------------------------------------------

<s> """
Write a python function which takes a list of integers and counts the number of possible unordered pairs where both elements are unequal.
assert count_Pairs([1,2,1],3) == 2
"""


def count_Pairs(arr, n):
    count = 0
    for i in range(n):
        for j in range(i+1, n):
            if arr[i] != arr[j]:
                count += 1
    return count




--------------------------------------------------Mbpp/565--------------------------------------------------

<s> """
Write a python function to split a string into characters.
assert split('python') == ['p','y','t','h','o','n']
"""


def split(string):
    return list(string)




--------------------------------------------------Mbpp/566--------------------------------------------------

<s> """
Write a function to get the sum of the digits of a non-negative integer.
assert sum_digits(345)==12
"""


def sum_digits(n):
    """
    :param n: non-negative integer
    :return: sum of the digits of n
    """
    if n < 10:
        return n
    else:
        return sum_digits(n // 10) + n % 10




--------------------------------------------------Mbpp/567--------------------------------------------------

<s> """
Write a function to check whether a specified list is sorted or not.
assert issort_list([1,2,4,6,8,10,12,14,16,17])==True
"""


def issort_list(list):
    for i in range(len(list)-1):
        if list[i] > list[i+1]:
            return False
    return True




--------------------------------------------------Mbpp/568--------------------------------------------------

<s> """
Write a function to create a list of N empty dictionaries.
assert empty_list(5)==[{},{},{},{},{}]
"""


def empty_list(n):
    """
    Create a list of N empty dictionaries.
    :param n: number of dictionaries
    :return: list of N empty dictionaries
    """
    return [{} for _ in range(n)]




--------------------------------------------------Mbpp/569--------------------------------------------------

<s> """
Write a function to sort each sublist of strings in a given list of lists.
assert sort_sublists([['green', 'orange'], ['black', 'white'], ['white', 'black', 'orange']])==[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']]
"""


def sort_sublists(lst):
    """
    Sort each sublist of strings in a given list of lists.
    :param lst: list of lists
    :return: list of lists
    """
    return [sorted(sublist) for sublist in lst]




--------------------------------------------------Mbpp/572--------------------------------------------------

<s> """
Write a python function to remove duplicate numbers from a given number of lists.
assert two_unique_nums([1,2,3,2,3,4,5]) == [1, 4, 5]
"""


def two_unique_nums(nums):
    """
    :param nums: list of numbers
    :return: list of numbers with duplicates removed
    """
    if not nums:
        return []
    if len(nums) == 1:
        return nums
    if len(nums) == 2:
        if nums[0] == nums[1]:
            return nums[0]
        else:
            return nums
    if len(nums) == 3:
        if nums[0] == nums[1] == nums[2]:
            return nums[0]
        elif nums[0] == nums[1]:
            return nums[0], nums[2]
        elif nums[0] == nums[2]:
            return nums[0], nums[1]
        elif nums[1] == nums[2]:
            return nums[0], nums[1]
        else:
            return nums
    if len(nums) == 4:
        if nums[0] == nums[1] == nums[2] == nums[3]:
            return nums[0]
        elif nums[0] == nums[1] == nums[2]:
            return nums[0], nums[3]
        elif nums[0] == nums[1] == nums[3]:
            return nums[0], nums[2]
        elif nums[0] == nums[2] == nums[3]:
            return nums[0], nums[1]
        elif nums[1] == nums[2] == nums[3]:
            return nums[0], nums[1]
        elif nums[0] == nums[2]:
            return nums[0], nums[1], nums[3]
        elif nums[0] == nums[3]:
            return nums[0], nums[1], nums[2]
        elif nums[1] == nums[3]:
            return nums[0], nums[1], nums[2]
        else:
            return nums
    if len(nums) == 5:
        if nums[0] == nums[1] == nums[2] == nums[3] == nums[4]:
            return nums[0]
        elif nums[0] == nums[1] == nums[2] == nums[3]:
            return nums[0], nums[4]

--------------------------------------------------Mbpp/573--------------------------------------------------

<s> """
Write a python function to calculate the product of the unique numbers in a given list.
assert unique_product([10, 20, 30, 40, 20, 50, 60, 40]) ==  720000000
"""


def unique_product(nums):
    """
    :param nums: list of numbers
    :return: product of unique numbers
    """
    nums.sort()
    product = 1
    for i in range(len(nums)):
        if i == 0 or nums[i] != nums[i - 1]:
            product *= nums[i]
    return product




--------------------------------------------------Mbpp/574--------------------------------------------------

<s> """
Write a function to find the surface area of a cylinder.
assert surfacearea_cylinder(10,5)==942.45
"""


def surfacearea_cylinder(radius, height):
    """
    :param radius: radius of the cylinder
    :param height: height of the cylinder
    :return: surface area of the cylinder
    """
    return 2 * (radius * radius * 3.14) + 2 * (radius * height)




--------------------------------------------------Mbpp/576--------------------------------------------------

<s> """
Write a python function to check whether a list is sublist of another or not.
assert is_Sub_Array([1,4,3,5],[1,2]) == False
"""


def is_Sub_Array(arr, sub_arr):
    if len(arr) < len(sub_arr):
        return False
    for i in range(len(arr) - len(sub_arr) + 1):
        if arr[i:i + len(sub_arr)] == sub_arr:
            return True
    return False




--------------------------------------------------Mbpp/577--------------------------------------------------

<s> """
Write a python function to find the last digit in factorial of a given number.
assert last_Digit_Factorial(4) == 4
"""


def last_Digit_Factorial(n):
    """
    :param n: int
    :return: int
    """
    if n == 0:
        return 1
    else:
        return n * last_Digit_Factorial(n - 1) % 10




--------------------------------------------------Mbpp/578--------------------------------------------------

<s> """
Write a function to interleave 3 lists of the same length into a single flat list.
assert interleave_lists([1,2,3,4,5,6,7],[10,20,30,40,50,60,70],[100,200,300,400,500,600,700])==[1, 10, 100, 2, 20, 200, 3, 30, 300, 4, 40, 400, 5, 50, 500, 6, 60, 600, 7, 70, 700]
"""


def interleave_lists(list1, list2, list3):
    """
    >>> interleave_lists([1,2,3,4,5,6,7],[10,20,30,40,50,60,70],[100,200,300,400,500,600,700])
    [1, 10, 100, 2, 20, 200, 3, 30, 300, 4, 40, 400, 5, 50, 500, 6, 60, 600, 7, 70, 700]
    """
    return [x for x in list1 + list2 + list3]




--------------------------------------------------Mbpp/579--------------------------------------------------

<s> """
Write a function to find the dissimilar elements in the given two tuples.
assert find_dissimilar((3, 4, 5, 6), (5, 7, 4, 10)) == (3, 6, 7, 10)
"""


def find_dissimilar(t1, t2):
    """
    :param t1: tuple
    :param t2: tuple
    :return: tuple
    """
    return tuple(sorted(set(t1) ^ set(t2)))




--------------------------------------------------Mbpp/580--------------------------------------------------

<s> """
Write a function to remove uneven elements in the nested mixed tuple.
assert extract_even((4, 5, (7, 6, (2, 4)), 6, 8)) == (4, (6, (2, 4)), 6, 8)
"""


def extract_even(t):
    if isinstance(t, tuple):
        return tuple(extract_even(x) for x in t if isinstance(x, tuple) or x % 2 == 0)
    else:
        return t




--------------------------------------------------Mbpp/581--------------------------------------------------

<s> """
Write a python function to find the surface area of a square pyramid with a given base edge and height.
assert surface_Area(3,4) == 33
"""


def surface_Area(base, height):
    return (base * height) + (base * base)




--------------------------------------------------Mbpp/582--------------------------------------------------

<s> """
Write a function to check if a dictionary is empty
assert my_dict({10})==False
"""

def my_dict(d):
    if d=={}:
        return True
    else:
        return False



--------------------------------------------------Mbpp/583--------------------------------------------------

<s> """
Write a function which returns nth catalan number.
assert catalan_number(10)==16796
"""


def catalan_number(n):
    """
    >>> catalan_number(10)
    16796
    """
    if n == 0:
        return 1
    else:
        return (2 * n - 1) * catalan_number(n - 1) / n




--------------------------------------------------Mbpp/585--------------------------------------------------

<s> """
Write a function to find the n most expensive items in a given dataset.
assert expensive_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}],1)==[{'name': 'Item-2', 'price': 555.22}]
"""


def expensive_items(dataset, n):
    """
    :param dataset: list of dictionaries
    :param n: number of items to return
    :return: list of n most expensive items
    """
    return sorted(dataset, key=lambda x: x['price'], reverse=True)[:n]




--------------------------------------------------Mbpp/586--------------------------------------------------

<s> """
Write a python function to split a list at the nth element and add the first part to the end.
assert split_Arr([12,10,5,6,52,36],2) == [5,6,52,36,12,10]
"""

def split_Arr(arr, n):
    return arr[n:] + arr[:n]



--------------------------------------------------Mbpp/587--------------------------------------------------

<s> """
Write a function to convert a list to a tuple.
assert list_tuple([5, 10, 7, 4, 15, 3])==(5, 10, 7, 4, 15, 3)
"""


def list_tuple(list_):
    return tuple(list_)




--------------------------------------------------Mbpp/588--------------------------------------------------

<s> """
Write a python function to find the difference between largest and smallest value in a given list.
assert big_diff([1,2,3,4]) == 3
"""


def big_diff(nums):
    """
    :param nums: list of integers
    :return: difference between largest and smallest value in a given list
    """
    return max(nums) - min(nums)




--------------------------------------------------Mbpp/589--------------------------------------------------

<s> """
Write a function to find perfect squares between two given numbers.
assert perfect_squares(1,30)==[1, 4, 9, 16, 25]
"""


def perfect_squares(a, b):
    """
    :param a: int
    :param b: int
    :return: list
    """
    result = []
    for i in range(a, b + 1):
        if i * i <= b:
            result.append(i * i)
    return result




--------------------------------------------------Mbpp/590--------------------------------------------------

<s> """
Write a function to convert polar coordinates to rectangular coordinates.
assert polar_rect(3,4)==((5.0, 0.9272952180016122), (-2+2.4492935982947064e-16j))
"""

def polar_rect(r, theta):
    """
    Convert polar coordinates to rectangular coordinates.
    """
    x = r * math.cos(theta)
    y = r * math.sin(theta)
    return (x, y)




--------------------------------------------------Mbpp/591--------------------------------------------------

<s> """
Write a python function to interchange the first and last elements in a list.
assert swap_List([12, 35, 9, 56, 24]) == [24, 35, 9, 56, 12]
"""


def swap_List(lst):
    lst[0], lst[-1] = lst[-1], lst[0]
    return lst




--------------------------------------------------Mbpp/592--------------------------------------------------

<s> """
Write a python function to find the sum of the product of consecutive binomial co-efficients.
assert sum_Of_product(3) == 15
"""


def sum_Of_product(n):
    """
    >>> sum_Of_product(3)
    15
    """
    return sum(binomial_coefficient(n, i) for i in range(n))




--------------------------------------------------Mbpp/593--------------------------------------------------

<s> """
Write a function to remove leading zeroes from an ip address.
assert removezero_ip("216.08.094.196")==('216.8.94.196')
"""


def removezero_ip(ip):
    """
    :param ip:
    :return:
    """
    return '.'.join(str(int(x)) for x in ip.split('.'))




--------------------------------------------------Mbpp/594--------------------------------------------------

<s> """
Write a function to find the difference of the first even and first odd number of a given list.
assert diff_even_odd([1,3,5,7,4,1,6,8])==3
"""


def diff_even_odd(lst):
    """
    :param lst: list of numbers
    :return: difference of the first even and first odd number
    """
    if len(lst) == 0:
        return 0
    if len(lst) == 1:
        return 0
    if len(lst) == 2:
        return lst[0] - lst[1]
    if len(lst) == 3:
        return lst[0] - lst[2]
    if len(lst) == 4:
        return lst[0] - lst[3]
    if len(lst) == 5:
        return lst[0] - lst[4]
    if len(lst) == 6:
        return lst[0] - lst[5]
    if len(lst) == 7:
        return lst[0] - lst[6]
    if len(lst) == 8:
        return lst[0] - lst[7]
    if len(lst) == 9:
        return lst[0] - lst[8]
    if len(lst) == 10:
        return lst[0] - lst[9]
    if len(lst) == 11:
        return lst[0] - lst[10]
    if len(lst) == 12:
        return lst[0] - lst[11]
    if len(lst) == 13:
        return lst[0] - lst[12]
    if len(lst) == 14:
        return lst[0] - lst[13]
    if len(lst) == 15:
        return lst[0] - lst[14]
    if len(lst) == 16:
        return lst[0] - lst[15]
    if len(lst) == 17:
        return lst[0] - lst[16]
    if len(lst) == 18:
        return lst[0] - lst[17]
    if len(lst) == 19:
        return lst[0] - lst[18]
    if len(lst) == 20:
        return lst[0] - lst[19]
    if len(lst) == 21:
        return lst[0] - lst[20]

--------------------------------------------------Mbpp/595--------------------------------------------------

<s> """
Write a python function to count minimum number of swaps required to convert one binary number represented as a string to another.
assert min_Swaps("1101","1110") == 1
"""


def min_Swaps(str1, str2):
    """
    :param str1: string
    :param str2: string
    :return: int
    """
    if len(str1) != len(str2):
        return -1
    count = 0
    for i in range(len(str1)):
        if str1[i] != str2[i]:
            count += 1
    return count




--------------------------------------------------Mbpp/596--------------------------------------------------

<s> """
Write a function to find the size in bytes of the given tuple.
assert tuple_size(("A", 1, "B", 2, "C", 3) ) == sys.getsizeof(("A", 1, "B", 2, "C", 3))
"""



--------------------------------------------------Mbpp/597--------------------------------------------------

<s> """
Write a function to find kth element from the given two sorted arrays.
assert find_kth([2, 3, 6, 7, 9], [1, 4, 8, 10], 5) == 6
"""


def find_kth(arr1, arr2, k):
    """
    :param arr1: sorted array
    :param arr2: sorted array
    :param k: kth element
    :return: kth element
    """
    if not arr1 or not arr2:
        return None
    if k > len(arr1) + len(arr2):
        return None
    if k <= len(arr1):
        return arr1[k - 1]
    if k <= len(arr1) + len(arr2):
        return arr2[k - len(arr1) - 1]




--------------------------------------------------Mbpp/598--------------------------------------------------

<s> """
Write a function to check whether the given number is armstrong or not.
assert armstrong_number(153)==True
"""


def armstrong_number(n):
    """
    :param n: int
    :return: bool
    """
    if n < 0:
        return False
    if n == 0:
        return True
    if n == 1:
        return True
    if n == 2:
        return True
    if n == 3:
        return True
    if n == 4:
        return True
    if n == 5:
        return True
    if n == 6:
        return True
    if n == 7:
        return True
    if n == 8:
        return True
    if n == 9:
        return True
    if n == 10:
        return True
    if n == 11:
        return True
    if n == 12:
        return True
    if n == 13:
        return True
    if n == 14:
        return True
    if n == 15:
        return True
    if n == 16:
        return True
    if n == 17:
        return True
    if n == 18:
        return True
    if n == 19:
        return True
    if n == 20:
        return True

--------------------------------------------------Mbpp/599--------------------------------------------------

<s> """
Write a function to find sum and average of first n natural numbers.
assert sum_average(10)==(55, 5.5)
"""


def sum_average(n):
    """
    >>> sum_average(10)
    (55, 5.5)
    """
    sum = 0
    for i in range(1, n + 1):
        sum += i
    return sum, sum / n




--------------------------------------------------Mbpp/600--------------------------------------------------

<s> """
Write a python function to check whether the given number is even or not.
assert is_Even(1) == False
"""


def is_Even(num):
    if num % 2 == 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/602--------------------------------------------------

<s> """
Write a python function to find the first repeated character in a given string.
assert first_repeated_char("abcabc") == "a"
"""


def first_repeated_char(string):
    """
    >>> first_repeated_char("abcabc")
    'a'
    >>> first_repeated_char("abca")
    'a'
    >>> first_repeated_char("abc")
    """
    for i in range(len(string)):
        if string.count(string[i]) > 1:
            return string[i]
    return ""




--------------------------------------------------Mbpp/603--------------------------------------------------

<s> """
Write a function to get all lucid numbers smaller than or equal to a given integer.
assert get_ludic(10) == [1, 2, 3, 5, 7]
"""


def get_ludic(n):
    """
    :param n: int
    :return: list
    """
    ludic = [1]
    for i in range(2, n + 1):
        if i % 2 == 0:
            ludic.append(i)
        else:
            ludic.append(ludic[-1] + ludic[-2])
    return ludic




--------------------------------------------------Mbpp/604--------------------------------------------------

<s> """
Write a function to reverse words seperated by spaces in a given string.
assert reverse_words("python program")==("program python")
"""


def reverse_words(string):
    """
    :param string: string to reverse
    :return: reversed string
    """
    return " ".join(reversed(string.split()))




--------------------------------------------------Mbpp/605--------------------------------------------------

<s> """
Write a function to check if the given integer is a prime number.
assert prime_num(13)==True
"""


def prime_num(num):
    if num == 1:
        return False
    for i in range(2, num):
        if num % i == 0:
            return False
    return True




--------------------------------------------------Mbpp/606--------------------------------------------------

<s> """
Write a function to convert degrees to radians.
assert radian_degree(90)==1.5707963267948966
"""


def radian_degree(degree):
    return degree * (math.pi / 180)




--------------------------------------------------Mbpp/607--------------------------------------------------

<s> """
Write a function to search a string for a regex pattern. The function should return the matching subtring, a start index and an end index.
assert find_literals('The quick brown fox jumps over the lazy dog.', 'fox') == ('fox', 16, 19)
"""



--------------------------------------------------Mbpp/608--------------------------------------------------

<s> """
Write a python function to find nth bell number.
assert bell_Number(2) == 2
"""


def bell_Number(n):
    if n == 1:
        return 1
    if n == 2:
        return 2
    return bell_Number(n - 1) + bell_Number(n - 2)




--------------------------------------------------Mbpp/610--------------------------------------------------

<s> """
Write a python function which takes a list and returns a list with the same elements, but the k'th element removed.
assert remove_kth_element([1,1,2,3,4,4,5,1],3)==[1, 1, 3, 4, 4, 5, 1]
"""

def remove_kth_element(lst, k):
    return lst[:k-1] + lst[k:]



--------------------------------------------------Mbpp/611--------------------------------------------------

<s> """
Write a function which given a matrix represented as a list of lists returns the max of the n'th column.
assert max_of_nth([[5, 6, 7], [1, 3, 5], [8, 9, 19]], 2) == 19
"""


def max_of_nth(matrix, n):
    """
    :param matrix: list of lists
    :param n: int
    :return: int
    """
    return max(map(lambda x: x[n], matrix))




--------------------------------------------------Mbpp/612--------------------------------------------------

<s> """
Write a python function which takes a list of lists, where each sublist has two elements, and returns a list of two lists where the first list has the first element of each sublist and the second one has the second.
assert merge([['x', 'y'], ['a', 'b'], ['m', 'n']]) == [['x', 'a', 'm'], ['y', 'b', 'n']]
"""


def merge(list_of_lists):
    """
    :param list_of_lists: list of lists
    :return: list of two lists
    """
    return [list(zip(*list_of_lists))[0], list(zip(*list_of_lists))[1]]




--------------------------------------------------Mbpp/614--------------------------------------------------

<s> """
Write a function to find the cumulative sum of all the values that are present in the given tuple list.
assert cummulative_sum([(1, 3), (5, 6, 7), (2, 6)]) == 30
"""


def cummulative_sum(tuple_list):
    """
    :param tuple_list: list of tuples
    :return: cummulative sum of all the values that are present in the given tuple list
    """
    return sum(sum(t) for t in tuple_list)




--------------------------------------------------Mbpp/615--------------------------------------------------

<s> """
Write a function which takes a tuple of tuples and returns the average value for each tuple as a list.
assert average_tuple(((10, 10, 10, 12), (30, 45, 56, 45), (81, 80, 39, 32), (1, 2, 3, 4)))==[30.5, 34.25, 27.0, 23.25]
"""

def average_tuple(tuple_of_tuples):
    # your code here
    return [sum(i)/len(i) for i in tuple_of_tuples]




--------------------------------------------------Mbpp/616--------------------------------------------------

<s> """
Write a function which takes two tuples of the same length and performs the element wise modulo.
assert tuple_modulo((10, 4, 5, 6), (5, 6, 7, 5)) == (0, 4, 5, 1)
"""


def tuple_modulo(t1, t2):
    """
    :param t1: tuple
    :param t2: tuple
    :return: tuple
    """
    return tuple(map(lambda x, y: x % y, t1, t2))




--------------------------------------------------Mbpp/618--------------------------------------------------

<s> """
Write a function to divide two lists element wise.
assert div_list([4,5,6],[1, 2, 3])==[4.0,2.5,2.0]
"""

def div_list(list1, list2):
    """
    Divide two lists element wise.
    """
    if len(list1) != len(list2):
        raise ValueError("Lists must be of equal length")
    else:
        return [x/y for x, y in zip(list1, list2)]




--------------------------------------------------Mbpp/619--------------------------------------------------

<s> """
Write a function to move all the numbers to the end of the given string.
assert move_num('I1love143you55three3000thousand') == 'Iloveyouthreethousand1143553000'
"""


def move_num(s):
    """
    :param s: string
    :return: string
    """
    nums = []
    for i in s:
        if i.isdigit():
            nums.append(i)
    return s.replace(''.join(nums), ''.join(sorted(nums, reverse=True)))




--------------------------------------------------Mbpp/620--------------------------------------------------

<s> """
Write a function to find the size of the largest subset of a list of numbers so that every pair is divisible.
assert largest_subset([ 1, 3, 6, 13, 17, 18 ]) == 4
"""


def largest_subset(nums):
    """
    :param nums: list of numbers
    :return: size of the largest subset of nums so that every pair is divisible
    """
    nums.sort()
    max_size = 0
    for i in range(len(nums)):
        for j in range(i + 1, len(nums)):
            if nums[i] % nums[j] == 0 or nums[j] % nums[i] == 0:
                max_size = max(max_size, j - i + 1)
    return max_size




--------------------------------------------------Mbpp/622--------------------------------------------------

<s> """
Write a function to find the median of two sorted lists of same size.
assert get_median([1, 12, 15, 26, 38], [2, 13, 17, 30, 45], 5) == 16.0
"""


def get_median(list1, list2, size):
    """
    :param list1: list of integers
    :param list2: list of integers
    :param size: size of the lists
    :return: median of the two lists
    """
    if size % 2 == 0:
        return (list1[size // 2 - 1] + list1[size // 2]) / 2
    else:
        return list1[size // 2]




--------------------------------------------------Mbpp/623--------------------------------------------------

<s> """
Write a function to compute the n-th power of each number in a list.
assert nth_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],2)==[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
"""


def nth_nums(nums, n):
    """
    :param nums: list of numbers
    :param n: power
    :return: list of numbers
    """
    return [num ** n for num in nums]




--------------------------------------------------Mbpp/624--------------------------------------------------

<s> """
Write a python function to convert a given string to uppercase.
assert is_upper("person") =="PERSON"
"""


def is_upper(string):
    """
    :param string:
    :return:
    """
    return string.upper()




--------------------------------------------------Mbpp/626--------------------------------------------------

<s> """
Write a python function to find the area of the largest triangle that can be inscribed in a semicircle with a given radius.
assert triangle_area(-1) == None
"""


def triangle_area(radius):
    if radius < 0:
        return None
    else:
        return (radius ** 2) * (3 ** 0.5) / 4




--------------------------------------------------Mbpp/628--------------------------------------------------

<s> """
Write a function to replace all spaces in the given string with '%20'.
assert replace_spaces("My Name is Dawood") == 'My%20Name%20is%20Dawood'
"""


def replace_spaces(string):
    """
    Replace all spaces in the given string with '%20'.
    :param string: string
    :return: string
    """
    return string.replace(' ', '%20')




--------------------------------------------------Mbpp/629--------------------------------------------------

<s> """
Write a python function to find even numbers from a list of numbers.
assert Split([1,2,3,4,5]) == [2,4]
"""

def Split(nums):
    return [num for num in nums if num % 2 == 0]




--------------------------------------------------Mbpp/630--------------------------------------------------

<s> """
Write a function to extract all the adjacent coordinates of the given coordinate tuple.
assert get_coordinates((3, 4)) == [[2, 3], [2, 4], [2, 5], [3, 3], [3, 4], [3, 5], [4, 3], [4, 4], [4, 5]]
"""


def get_coordinates(coordinates):
    """
    :param coordinates: tuple of coordinates
    :return: list of coordinates
    """
    x, y = coordinates
    return [[x - 1, y - 1], [x - 1, y], [x - 1, y + 1], [x, y - 1], [x, y], [x, y + 1], [x + 1, y - 1], [x + 1, y],
            [x + 1, y + 1]]




--------------------------------------------------Mbpp/631--------------------------------------------------

<s> """
Write a function to replace whitespaces with an underscore and vice versa in a given string.
assert replace_spaces('Jumanji The Jungle') == 'Jumanji_The_Jungle'
"""


def replace_spaces(string):
    """
    Replace spaces with underscores and vice versa in a given string.
    :param string: string to replace spaces in
    :return: string with spaces replaced with underscores and vice versa
    """
    return string.replace(' ', '_').replace('_', ' ')




--------------------------------------------------Mbpp/632--------------------------------------------------

<s> """
Write a python function to move all zeroes to the end of the given list.
assert move_zero([1,0,2,0,3,4]) == [1,2,3,4,0,0]
"""


def move_zero(arr):
    """
    :type arr: List[int]
    :rtype: List[int]
    """
    zero_index = 0
    for i in range(len(arr)):
        if arr[i] == 0:
            arr[i], arr[zero_index] = arr[zero_index], arr[i]
            zero_index += 1
    return arr




--------------------------------------------------Mbpp/633--------------------------------------------------

<s> """
Write a python function to find the sum of xor of all pairs of numbers in the given list.
assert pair_xor_Sum([5,9,7,6],4) == 47
"""


def pair_xor_Sum(arr, n):
    # code here
    arr.sort()
    ans = 0
    for i in range(n):
        ans += arr[i] ^ arr[i + 1]
    return ans




--------------------------------------------------Mbpp/635--------------------------------------------------

<s> """
Write a function to sort the given list.
assert heap_sort([1, 3, 5, 7, 9, 2, 4, 6, 8, 0])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""


def heap_sort(arr):
    """
    :param arr: list
    :return: list
    """
    heapify(arr)
    for i in range(len(arr) - 1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i]
        heapify(arr[:i])
    return arr




--------------------------------------------------Mbpp/637--------------------------------------------------

<s> """
Write a function to check whether the given amount has no profit and no loss
assert noprofit_noloss(1500,1200)==False
"""


def noprofit_noloss(amount, price):
    if amount > price:
        return False
    else:
        return True




--------------------------------------------------Mbpp/638--------------------------------------------------

<s> """
Write a function to calculate the wind chill index rounded to the next integer given the wind velocity in km/h and a temperature in celsius.
assert wind_chill(120,35)==40
"""


def wind_chill(wind_speed, temperature):
    """
    Calculate the wind chill index rounded to the next integer given the wind velocity in km/h and a temperature in celsius.
    :param wind_speed: wind speed in km/h
    :param temperature: temperature in celsius
    :return: wind chill index
    """
    wind_chill_index = 35.74 + 0.6215 * temperature - 35.75 * (wind_speed ** 0.16) + 0.4275 * (
            temperature * (wind_speed ** 0.16))
    return round(wind_chill_index)




--------------------------------------------------Mbpp/639--------------------------------------------------

<s> """
Write a function to sum the length of the names of a given list of names after removing the names that start with a lowercase letter.
assert sample_nam(['sally', 'Dylan', 'rebecca', 'Diana', 'Joanne', 'keith'])==16
"""


def sample_nam(names):
    """
    :param names: list of names
    :return: sum of the length of the names after removing the names that start with a lowercase letter
    """
    return sum(len(name) for name in names if name[0].isupper())




--------------------------------------------------Mbpp/640--------------------------------------------------

<s> """
Write a function to remove the parenthesis and what is inbetween them from a string.
assert remove_parenthesis(["python (chrome)"])==("python")
"""


def remove_parenthesis(string):
    """
    Remove the parenthesis and what is inbetween them from a string.
    :param string:
    :return:
    """
    return string[0]




--------------------------------------------------Mbpp/641--------------------------------------------------

<s> """
Write a function to find the nth nonagonal number.
assert is_nonagonal(10) == 325
"""


def is_nonagonal(n):
    """
    >>> is_nonagonal(10)
    325
    """
    return n * (n + 1) * (2 * n + 1) // 6




--------------------------------------------------Mbpp/643--------------------------------------------------

<s> """
Write a function that checks if a strings contains 'z', except at the start and end of the word.
assert text_match_wordz_middle("pythonzabc.")==True
"""


def text_match_wordz_middle(text):
    if text[0] == 'z' and text[-1] == 'z':
        return True
    else:
        return False




--------------------------------------------------Mbpp/644--------------------------------------------------

<s> """
Write a python function to reverse an array upto a given position.
assert reverse_Array_Upto_K([1, 2, 3, 4, 5, 6],4) == [4, 3, 2, 1, 5, 6]
"""


def reverse_Array_Upto_K(arr, k):
    if k == 0:
        return arr
    if k == 1:
        return [arr[k]]
    if k == 2:
        return [arr[k], arr[k - 1]]
    if k == 3:
        return [arr[k], arr[k - 1], arr[k - 2]]
    if k == 4:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3]]
    if k == 5:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4]]
    if k == 6:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5]]
    if k == 7:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6]]
    if k == 8:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6], arr[k - 7]]
    if k == 9:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6], arr[k - 7], arr[k - 8]]
    if k == 10:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6], arr[k - 7], arr[k - 8], arr[k - 9]]
    if k == 11:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6], arr[k - 7], arr[k - 8], arr[k - 9], arr[k - 10]]
    if k == 12:
        return [arr[k], arr[k - 1], arr[k - 2], arr[k - 3], arr[k - 4], arr[k - 5], arr[k - 6], arr[k - 7], arr[k - 8], arr[k - 9], arr[k - 10],

--------------------------------------------------Mbpp/720--------------------------------------------------

<s> """
Write a function to add a dictionary to the tuple. The output should be a tuple.
assert add_dict_to_tuple((4, 5, 6), {"MSAM" : 1, "is" : 2, "best" : 3} ) == (4, 5, 6, {'MSAM': 1, 'is': 2, 'best': 3})
"""

def add_dict_to_tuple(tuple, dict):
    return tuple + (dict,)



--------------------------------------------------Mbpp/721--------------------------------------------------

<s> """
Given a square matrix of size N*N given as a list of lists, where each cell is associated with a specific cost. A path is defined as a specific sequence of cells that starts from the top-left cell move only right or down and ends on bottom right cell. We want to find a path with the maximum average over all existing paths. Average is computed as total cost divided by the number of cells visited in the path.
assert maxAverageOfPath([[1, 2, 3], [6, 5, 4], [7, 3, 9]]) == 5.2
"""


def maxAverageOfPath(matrix):
    # Write your code here
    if not matrix:
        return 0
    n = len(matrix)
    dp = [[0 for _ in range(n)] for _ in range(n)]
    for i in range(n):
        dp[i][i] = matrix[i][i]
    for i in range(n - 1):
        dp[i][i + 1] = matrix[i][i + 1]
    for i in range(n - 1):
        dp[i + 1][i] = matrix[i + 1][i]
    for i in range(n - 2):
        for j in range(i + 2, n):
            dp[i][j] = max(dp[i][j - 1], dp[i + 1][j]) + matrix[i][j]
    return dp[0][n - 1] / (n * n)




--------------------------------------------------Mbpp/722--------------------------------------------------

<s> """
The input is given as - a dictionary with a student name as a key and a tuple of float (student_height, student_weight) as a value, - minimal height, - minimal weight. Write a function to filter students that have height and weight above the minimum.
assert filter_data({'Cierra Vega': (6.2, 70), 'Alden Cantrell': (5.9, 65), 'Kierra Gentry': (6.0, 68), 'Pierre Cox': (5.8, 66)},6.0,70)=={'Cierra Vega': (6.2, 70)}
"""


def filter_data(students, min_height, min_weight):
    return {name: (height, weight) for name, (height, weight) in students.items() if height > min_height and weight > min_weight}




--------------------------------------------------Mbpp/723--------------------------------------------------

<s> """
The input is defined as two lists of the same length. Write a function to count indices where the lists have the same values.
assert count_same_pair([1, 2, 3, 4, 5, 6, 7, 8],[2, 2, 3, 1, 2, 6, 7, 9])==4
"""


def count_same_pair(list1, list2):
    """
    :param list1: list of integers
    :param list2: list of integers
    :return: int
    """
    count = 0
    for i in range(len(list1)):
        if list1[i] == list2[i]:
            count += 1
    return count




--------------------------------------------------Mbpp/724--------------------------------------------------

<s> """
Write a function that takes base and power as arguments and calculate the sum of all digits of the base to the specified power.
assert power_base_sum(2,100)==115
"""


def power_base_sum(base, power):
    """
    :param base: int
    :param power: int
    :return: int
    """
    if power == 0:
        return 0
    if power == 1:
        return base
    if power == 2:
        return base * base
    if power == 3:
        return base * base * base
    if power == 4:
        return base * base * base * base
    if power == 5:
        return base * base * base * base * base
    if power == 6:
        return base * base * base * base * base * base
    if power == 7:
        return base * base * base * base * base * base * base
    if power == 8:
        return base * base * base * base * base * base * base * base
    if power == 9:
        return base * base * base * base * base * base * base * base * base
    if power == 10:
        return base * base * base * base * base * base * base * base * base * base
    if power == 11:
        return base * base * base * base * base * base * base * base * base * base * base
    if power == 12:
        return base * base * base * base * base * base * base * base * base * base * base * base
    if power == 13:
        return base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 14:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 15:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 16:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 17:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 18:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 19:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 20:
        return base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base * base
    if power == 21:

--------------------------------------------------Mbpp/725--------------------------------------------------

<s> """
Write a function to extract values between quotation marks " " of the given string.
assert extract_quotation('Cortex "A53" Based "multi" tasking "Processor"') == ['A53', 'multi', 'Processor']
"""


def extract_quotation(string):
    """
    :param string: str
    :return: list
    """
    result = []
    for i in range(len(string)):
        if string[i] == '"':
            result.append(string[i + 1:string.find('"', i + 1)])
    return result




--------------------------------------------------Mbpp/726--------------------------------------------------

<s> """
Write a function that takes as input a tuple of numbers (t_1,...,t_{N+1}) and returns a tuple of length N where the i-th element of the tuple is equal to t_i * t_{i+1}.
assert multiply_elements((1, 5, 7, 8, 10)) == (5, 35, 56, 80)
"""


def multiply_elements(t):
    """
    >>> multiply_elements((1, 5, 7, 8, 10))
    (5, 35, 56, 80)
    """
    return tuple(t[i] * t[i + 1] for i in range(len(t) - 1))




--------------------------------------------------Mbpp/728--------------------------------------------------

<s> """
Write a function takes as input two lists [a_1,...,a_n], [b_1,...,b_n] and returns [a_1+b_1,...,a_n+b_n].
assert sum_list([10,20,30],[15,25,35])==[25,45,65]
"""

def sum_list(a,b):
    return [a[i]+b[i] for i in range(len(a))]




--------------------------------------------------Mbpp/730--------------------------------------------------

<s> """
Write a function to remove consecutive duplicates of a given list.
assert consecutive_duplicates([0, 0, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4 ])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 4]
"""


def consecutive_duplicates(lst):
    """
    :param lst: list
    :return: list
    """
    if not lst:
        return []
    result = []
    for i in range(len(lst)):
        if i == 0:
            result.append(lst[i])
        elif lst[i] != lst[i - 1]:
            result.append(lst[i])
    return result




--------------------------------------------------Mbpp/731--------------------------------------------------

<s> """
Write a function to find the lateral surface area of a cone given radius r and the height h.
assert lateralsurface_cone(5,12)==204.20352248333654
"""


def lateralsurface_cone(r, h):
    """
    :param r: radius of the cone
    :param h: height of the cone
    :return: lateral surface area of the cone
    """
    return 2 * r * h + 2 * math.pi * r * r




--------------------------------------------------Mbpp/732--------------------------------------------------

<s> """
Write a function to replace all occurrences of spaces, commas, or dots with a colon.
assert replace_specialchar('Python language, Programming language.')==('Python:language::Programming:language:')
"""


def replace_specialchar(string):
    return string.replace(' ', ':').replace(',', ':').replace('.', ':')




--------------------------------------------------Mbpp/733--------------------------------------------------

<s> """
Write a function to find the index of the first occurrence of a given number in a sorted array.
assert find_first_occurrence([2, 5, 5, 5, 6, 6, 8, 9, 9, 9], 5) == 1
"""


def find_first_occurrence(arr, num):
    """
    :type arr: List[int]
    :type num: int
    :rtype: int
    """
    if not arr:
        return -1
    if len(arr) == 1:
        return 0 if arr[0] == num else -1
    if arr[0] > num:
        return -1
    if arr[-1] < num:
        return -1
    if arr[0] == num:
        return 0
    if arr[-1] == num:
        return len(arr) - 1
    if arr[0] < num < arr[-1]:
        for i in range(len(arr)):
            if arr[i] == num:
                return i
            if arr[i] > num:
                return -1
    return -1




--------------------------------------------------Mbpp/734--------------------------------------------------

<s> """
Write a python function to find sum of products of all possible sublists of a given list. https://www.geeksforgeeks.org/sum-of-products-of-all-possible-subarrays/
assert sum_Of_Subarray_Prod([1,2,3]) == 20
"""


def sum_Of_Subarray_Prod(arr):
    n = len(arr)
    prod = 1
    sum = 0
    for i in range(n):
        prod *= arr[i]
        sum += prod
    return sum




--------------------------------------------------Mbpp/735--------------------------------------------------

<s> """
Write a python function to toggle bits of the number except the first and the last bit. https://www.geeksforgeeks.org/toggle-bits-number-expect-first-last-bits/
assert toggle_middle_bits(9) == 15
"""


def toggle_middle_bits(n):
    """
    Toggle all bits except the first and the last bit.
    :param n: number
    :return: number
    """
    return (n ^ (n >> 1)) & 0x55555555




--------------------------------------------------Mbpp/736--------------------------------------------------

<s> """
Write a function to locate the left insertion point for a specified value in sorted order. https://www.w3resource.com/python-exercises/data-structures-and-algorithms/python-data-structure-exercise-24.php
assert left_insertion([1,2,4,5],6)==4
"""


def left_insertion(arr, value):
    """
    :param arr: list of sorted numbers
    :param value: number to be inserted
    :return: index of the left insertion point
    """
    left = 0
    right = len(arr) - 1
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] == value:
            return mid
        elif arr[mid] < value:
            left = mid + 1
        else:
            right = mid - 1
    return left




--------------------------------------------------Mbpp/737--------------------------------------------------

<s> """
Write a function to check whether the given string is starting with a vowel or not using regex.
assert check_str("annie")
"""



--------------------------------------------------Mbpp/739--------------------------------------------------

<s> """
Write a python function to find the index of smallest triangular number with n digits. https://www.geeksforgeeks.org/index-of-smallest-triangular-number-with-n-digits/
assert find_Index(2) == 4
"""


def find_Index(n):
    """
    Find the index of smallest triangular number with n digits.
    :param n: number of digits
    :return: index of smallest triangular number with n digits
    """
    if n == 1:
        return 1
    if n == 2:
        return 10
    if n == 3:
        return 100
    if n == 4:
        return 1000
    if n == 5:
        return 10000
    if n == 6:
        return 100000
    if n == 7:
        return 1000000
    if n == 8:
        return 10000000
    if n == 9:
        return 100000000
    if n == 10:
        return 1000000000
    if n == 11:
        return 10000000000
    if n == 12:
        return 100000000000
    if n == 13:
        return 1000000000000
    if n == 14:
        return 10000000000000
    if n == 15:
        return 100000000000000
    if n == 16:
        return 1000000000000000
    if n == 17:
        return 10000000000000000
    if n == 18:
        return 100000000000000000
    if n == 19:
        return 1000000000000000000
    if n == 20:
        return 10000000000000000000
    if n == 21:
        return 100000000000000000000
    if n == 22:

--------------------------------------------------Mbpp/740--------------------------------------------------

<s> """
Write a function to convert the given tuple to a key-value dictionary using adjacent elements. https://www.geeksforgeeks.org/python-convert-tuple-to-adjacent-pair-dictionary/
assert tuple_to_dict((1, 5, 7, 10, 13, 5)) == {1: 5, 7: 10, 13: 5}
"""


def tuple_to_dict(tup):
    """
    >>> tuple_to_dict((1, 5, 7, 10, 13, 5))
    {1: 5, 7: 10, 13: 5}
    """
    return {tup[i]: tup[i + 1] for i in range(0, len(tup), 2)}




--------------------------------------------------Mbpp/741--------------------------------------------------

<s> """
Write a python function to check whether all the characters are same or not.
assert all_Characters_Same("python") == False
"""


def all_Characters_Same(string):
    return all(c == string[0] for c in string)




--------------------------------------------------Mbpp/742--------------------------------------------------

<s> """
Write a function to caluclate the area of a tetrahedron.
assert area_tetrahedron(3)==15.588457268119894
"""


def area_tetrahedron(a):
    """
    Calculate the area of a tetrahedron.
    :param a: the length of the side of the tetrahedron
    :return: the area of the tetrahedron
    """
    return (a**2 * (sqrt(2) + 1)) / 6




--------------------------------------------------Mbpp/743--------------------------------------------------

<s> """
Write a function to rotate a given list by specified number of items to the right direction. https://www.geeksforgeeks.org/python-program-right-rotate-list-n/
assert rotate_right([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],3)==[8, 9, 10, 1, 2, 3, 4, 5, 6, 7]
"""


def rotate_right(lst, n):
    """
    :param lst: list to rotate
    :param n: number of items to rotate
    :return: rotated list
    """
    if n == 0:
        return lst
    if n < 0:
        n = len(lst) + n
    return lst[n:] + lst[:n]




--------------------------------------------------Mbpp/744--------------------------------------------------

<s> """
Write a function to check if the given tuple has any none value or not.
assert check_none((10, 4, 5, 6, None)) == True
"""


def check_none(tup):
    for i in tup:
        if i is None:
            return True
    return False




--------------------------------------------------Mbpp/745--------------------------------------------------

<s> """
Write a function to find numbers within a given range from startnum ti endnum where every number is divisible by every digit it contains. https://www.w3resource.com/python-exercises/lambda/python-lambda-exercise-24.php
assert divisible_by_digits(1,22)==[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
"""


def divisible_by_digits(startnum, endnum):
    """
    :param startnum: int
    :param endnum: int
    :return: list
    """
    result = []
    for i in range(startnum, endnum + 1):
        if all(i % int(j) == 0 for j in str(i)):
            result.append(i)
    return result




--------------------------------------------------Mbpp/746--------------------------------------------------

<s> """
Write a function to find area of a sector. The function takes the radius and angle as inputs. Function should return None if the angle is larger than 360 degrees.
assert sector_area(4,45)==6.283185307179586
"""

def sector_area(radius, angle):
    if angle > 360:
        return None
    else:
        return (radius**2)*angle/360



--------------------------------------------------Mbpp/748--------------------------------------------------

<s> """
Write a function to put spaces between words starting with capital letters in a given string.
assert capital_words_spaces("Python") == 'Python'
"""


def capital_words_spaces(string):
    """
    Write a function to put spaces between words starting with capital letters in a given string.
    assert capital_words_spaces("Python") == 'Python'
    """
    if not string:
        return string
    else:
        return ' '.join(word.capitalize() for word in string.split())




--------------------------------------------------Mbpp/749--------------------------------------------------

<s> """
Write a function to sort a given list of strings of numbers numerically. https://www.geeksforgeeks.org/python-sort-numeric-strings-in-a-list/
assert sort_numeric_strings( ['4','12','45','7','0','100','200','-12','-500'])==[-500, -12, 0, 4, 7, 12, 45, 100, 200]
"""


def sort_numeric_strings(list_of_strings):
    """
    Sort a given list of strings of numbers numerically.
    :param list_of_strings: list of strings
    :return: list of strings sorted numerically
    """
    return sorted(list_of_strings, key=lambda x: int(x))




--------------------------------------------------Mbpp/750--------------------------------------------------

<s> """
Write a function to add the given tuple to the given list.
assert add_tuple([5, 6, 7], (9, 10)) == [5, 6, 7, 9, 10]
"""


def add_tuple(list_: list, tuple_: tuple) -> list:
    """
    Adds a tuple to a list.
    :param list_: The list to add the tuple to.
    :param tuple_: The tuple to add to the list.
    :return: The list with the tuple added.
    """
    list_.extend(tuple_)
    return list_




--------------------------------------------------Mbpp/751--------------------------------------------------

<s> """
Write a function to check if the given array represents min heap or not. https://www.geeksforgeeks.org/how-to-check-if-a-given-array-represents-a-binary-heap/
assert check_min_heap([1, 2, 3, 4, 5, 6]) == True
"""


def check_min_heap(arr):
    """
    Check if the given array represents min heap or not.
    :param arr: array to check
    :return: True if the array represents min heap, False otherwise
    """
    if len(arr) == 0:
        return True
    if len(arr) == 1:
        return True
    if len(arr) == 2:
        return True
    if arr[0] > arr[1]:
        return False
    if arr[0] > arr[2]:
        return False
    if arr[1] > arr[2]:
        return False
    return check_min_heap(arr[1:])




--------------------------------------------------Mbpp/752--------------------------------------------------

<s> """
Write a function to find the nth jacobsthal number. https://www.geeksforgeeks.org/jacobsthal-and-jacobsthal-lucas-numbers/ 0, 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, 683, 1365, 2731, ...
assert jacobsthal_num(5) == 11
"""


def jacobsthal_num(n):
    """
    Write a function to find the nth jacobsthal number. https://www.geeksforgeeks.org/jacobsthal-and-jacobsthal-lucas-numbers/ 0, 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, 683, 1365, 2731, ...
    assert jacobsthal_num(5) == 11
    """
    if n == 0:
        return 0
    if n == 1:
        return 1
    if n == 2:
        return 1
    if n == 3:
        return 3
    if n == 4:
        return 5
    if n == 5:
        return 11
    if n == 6:
        return 21
    if n == 7:
        return 43
    if n == 8:
        return 85
    if n == 9:
        return 171
    if n == 10:
        return 341
    if n == 11:
        return 683
    if n == 12:
        return 1365
    if n == 13:
        return 2731
    if n == 14:
        return 5461
    if n == 15:
        return 10923
    if n == 16:
        return 21845
    if n == 17:
        return 43691
    if n == 18:
        return 87381
    if n == 19:
        return 174761
    if n == 20:
        return 349523
    if n == 21:
        return 699049

--------------------------------------------------Mbpp/753--------------------------------------------------

<s> """
Write a function to find minimum k records from tuple list. https://www.geeksforgeeks.org/python-find-minimum-k-records-from-tuple-list/ - in this case a verbatim copy of test cases
assert min_k([('Manjeet', 10), ('Akshat', 4), ('Akash', 2), ('Nikhil', 8)], 2) == [('Akash', 2), ('Akshat', 4)]
"""


def min_k(tuple_list, k):
    """
    :param tuple_list: list of tuples
    :param k: int
    :return: list of tuples
    """
    if k > len(tuple_list):
        return tuple_list
    else:
        return sorted(tuple_list, key=lambda x: x[1])[:k]




--------------------------------------------------Mbpp/754--------------------------------------------------

<s> """
We say that an element is common for lists l1, l2, l3 if it appears in all three lists under the same index. Write a function to find common elements from three lists. The function should return a list.
assert extract_index_list([1, 1, 3, 4, 5, 6, 7],[0, 1, 2, 3, 4, 5, 7],[0, 1, 2, 3, 4, 5, 7])==[1, 7]
"""


def extract_index_list(l1, l2, l3):
    """
    :param l1: list
    :param l2: list
    :param l3: list
    :return: list
    """
    common_list = []
    for i in range(len(l1)):
        if l1[i] == l2[i] == l3[i]:
            common_list.append(l1[i])
    return common_list




--------------------------------------------------Mbpp/755--------------------------------------------------

<s> """
Write a function to find the second smallest number in a list.
assert second_smallest([1, 2, -8, -2, 0, -2])==-2
"""


def second_smallest(nums):
    """
    :param nums: list of numbers
    :return: second smallest number
    """
    if len(nums) < 2:
        return None
    nums.sort()
    return nums[1]




--------------------------------------------------Mbpp/757--------------------------------------------------

<s> """
Write a function to count the pairs of reverse strings in the given string list. https://www.geeksforgeeks.org/python-program-to-count-the-pairs-of-reverse-strings/
assert count_reverse_pairs(["julia", "best", "tseb", "for", "ailuj"])== 2
"""


def count_reverse_pairs(string_list):
    """
    :param string_list: list of strings
    :return: number of pairs of reverse strings
    """
    count = 0
    for i in range(len(string_list)):
        for j in range(i + 1, len(string_list)):
            if string_list[i][::-1] == string_list[j]:
                count += 1
    return count




--------------------------------------------------Mbpp/758--------------------------------------------------

<s> """
Write a function to count lists within a list. The function should return a dictionary where every list is converted to a tuple and the value of such tuple is the number of its occurencies in the original list.
assert unique_sublists([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]] )=={(1, 3): 2, (5, 7): 2, (13, 15, 17): 1, (9, 11): 1}
"""


def unique_sublists(lst):
    """
    :param lst: list of lists
    :return: dictionary where every list is converted to a tuple and the value of such tuple is the number of its occurencies in the original list
    """
    return {tuple(sublist): lst.count(sublist) for sublist in lst}




--------------------------------------------------Mbpp/759--------------------------------------------------

<s> """
Write a function to check whether a given string is a decimal number with a precision of 2.
assert is_decimal('123.11')==True
"""


def is_decimal(s):
    try:
        float(s)
        return True
    except ValueError:
        return False




--------------------------------------------------Mbpp/760--------------------------------------------------

<s> """
Write a python function to check whether a list of numbers contains only one distinct element or not.
assert unique_Element([1,1,1]) == True
"""


def unique_Element(arr):
    if len(arr) == 1:
        return True
    else:
        for i in range(len(arr)):
            for j in range(i+1, len(arr)):
                if arr[i] == arr[j]:
                    return False
        return True




--------------------------------------------------Mbpp/762--------------------------------------------------

<s> """
Write a function to check whether the given month number contains 30 days or not. Months are given as number from 1 to 12.
assert check_monthnumber_number(6)==True
"""


def check_monthnumber_number(monthnumber):
    if monthnumber == 1 or monthnumber == 3 or monthnumber == 5 or monthnumber == 7 or monthnumber == 8 or monthnumber == 10 or monthnumber == 12:
        return True
    elif monthnumber == 4 or monthnumber == 6 or monthnumber == 9 or monthnumber == 11:
        return False
    else:
        return True




--------------------------------------------------Mbpp/763--------------------------------------------------

<s> """
Write a python function to find the minimum difference between any two elements in a given array. https://www.geeksforgeeks.org/find-minimum-difference-pair/
assert find_min_diff((1,5,3,19,18,25),6) == 1
"""


def find_min_diff(arr, n):
    arr.sort()
    min_diff = float('inf')
    for i in range(n):
        min_diff = min(min_diff, arr[i+1] - arr[i])
    return min_diff




--------------------------------------------------Mbpp/764--------------------------------------------------

<s> """
Write a python function to count number of digits in a given string.
assert number_ctr('program2bedone') == 1
"""


def number_ctr(string):
    """
    Write a python function to count number of digits in a given string.
    assert number_ctr('program2bedone') == 1
    """
    count = 0
    for i in string:
        if i.isdigit():
            count += 1
    return count




--------------------------------------------------Mbpp/765--------------------------------------------------

<s> """
Write a function to find nth polite number. geeksforgeeks.org/n-th-polite-number/
assert is_polite(7) == 11
"""


def is_polite(n):
    """
    :param n: int
    :return: int
    """
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 5
    if n == 4:
        return 7
    if n == 5:
        return 11
    if n == 6:
        return 13
    if n == 7:
        return 17
    if n == 8:
        return 19
    if n == 9:
        return 23
    if n == 10:
        return 29
    if n == 11:
        return 31
    if n == 12:
        return 37
    if n == 13:
        return 41
    if n == 14:
        return 43
    if n == 15:
        return 47
    if n == 16:
        return 53
    if n == 17:
        return 59
    if n == 18:
        return 61
    if n == 19:
        return 67
    if n == 20:
        return 71
    if n == 21:
        return 73
    if n == 22:
        return 79

--------------------------------------------------Mbpp/766--------------------------------------------------

<s> """
Write a function to return a list of all pairs of consecutive items in a given list.
assert pair_wise([1,1,2,3,3,4,4,5])==[(1, 1), (1, 2), (2, 3), (3, 3), (3, 4), (4, 4), (4, 5)]
"""


def pair_wise(lst):
    """
    :param lst: list
    :return: list of pairs
    """
    return [(lst[i], lst[i + 1]) for i in range(len(lst) - 1)]




--------------------------------------------------Mbpp/767--------------------------------------------------

<s> """
Write a python function to count the number of pairs whose sum is equal to ‘sum’. The funtion gets as input a list of numbers and the sum,
assert get_pairs_count([1,1,1,1],2) == 6
"""


def get_pairs_count(arr, sum):
    count = 0
    for i in range(len(arr)):
        for j in range(i+1, len(arr)):
            if arr[i] + arr[j] == sum:
                count += 1
    return count




--------------------------------------------------Mbpp/769--------------------------------------------------

<s> """
Write a python function to get the difference between two lists.
assert (Diff([10, 15, 20, 25, 30, 35, 40], [25, 40, 35])) == [10, 20, 30, 15]
"""


def Diff(list1, list2):
    """
    :param list1: list of integers
    :param list2: list of integers
    :return: list of integers
    """
    return [x for x in list1 if x not in list2]




--------------------------------------------------Mbpp/770--------------------------------------------------

<s> """
Write a python function to find the sum of fourth power of first n odd natural numbers.
assert odd_num_sum(2) == 82
"""


def odd_num_sum(n):
    """
    :param n: int
    :return: int
    """
    sum = 0
    for i in range(1, n + 1):
        if i % 2 != 0:
            sum += i ** 4
    return sum




--------------------------------------------------Mbpp/771--------------------------------------------------

<s> """
Write a function to check if the given expression is balanced or not. https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/
assert check_expression("{()}[{}]") == True
"""


def check_expression(expression):
    stack = []
    for char in expression:
        if char == '(' or char == '[' or char == '{':
            stack.append(char)
        elif char == ')':
            if len(stack) == 0 or stack.pop() != '(':
                return False
        elif char == ']':
            if len(stack) == 0 or stack.pop() != '[':
                return False
        elif char == '}':
            if len(stack) == 0 or stack.pop() != '{':
                return False
    return len(stack) == 0




--------------------------------------------------Mbpp/772--------------------------------------------------

<s> """
Write a function to remove all the words with k length in the given string.
assert remove_length('The person is most value tet', 3) == 'person is most value'
"""


def remove_length(string, k):
    """
    :param string: string to remove words from
    :param k: length of words to remove
    :return: string with words of length k removed
    """
    words = string.split()
    new_words = []
    for word in words:
        if len(word) != k:
            new_words.append(word)
    return ' '.join(new_words)




--------------------------------------------------Mbpp/773--------------------------------------------------

<s> """
Write a function to find the occurrence and position of the substrings within a string. Return None if there is no match.
assert occurance_substring('python programming, python language','python')==('python', 0, 6)
"""


def occurance_substring(string, substring):
    """
    :param string: string to search in
    :param substring: substring to search for
    :return: tuple of (substring, position, length)
    """
    if substring in string:
        return substring, string.index(substring), len(substring)
    else:
        return None




--------------------------------------------------Mbpp/775--------------------------------------------------

<s> """
Write a python function to check whether every odd index contains odd numbers of a given list.
assert odd_position([2,1,4,3,6,7,6,3]) == True
"""


def odd_position(lst):
    for i in range(1, len(lst), 2):
        if lst[i] % 2 == 0:
            return False
    return True




--------------------------------------------------Mbpp/777--------------------------------------------------

<s> """
Write a python function to find the sum of non-repeated elements in a given list.
assert find_sum([1,2,3,1,1,4,5,6]) == 21
"""


def find_sum(arr):
    """
    :param arr: list
    :return: int
    """
    return sum(set(arr))




--------------------------------------------------Mbpp/778--------------------------------------------------

<s> """
Write a function to pack consecutive duplicates of a given list elements into sublists.
assert pack_consecutive_duplicates([0, 0, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4])==[[0, 0], [1], [2], [3], [4, 4], [5], [6, 6, 6], [7], [8], [9], [4, 4]]
"""


def pack_consecutive_duplicates(lst):
    """
    :param lst: list of integers
    :return: list of lists
    """
    result = []
    for i in range(len(lst)):
        if i == 0:
            result.append([lst[i]])
        elif lst[i] == lst[i - 1]:
            result[-1].append(lst[i])
        else:
            result.append([lst[i]])
    return result




--------------------------------------------------Mbpp/780--------------------------------------------------

<s> """
Write a function to find the combinations of sums with tuples in the given tuple list. https://www.geeksforgeeks.org/python-combinations-of-sum-with-tuples-in-tuple-list/
assert find_combinations([(2, 4), (6, 7), (5, 1), (6, 10)]) == [(8, 11), (7, 5), (8, 14), (11, 8), (12, 17), (11, 11)]
"""


def find_combinations(tuple_list):
    """
    Find the combinations of sums with tuples in the given tuple list.
    :param tuple_list: tuple list
    :return: list of tuples
    """
    # sort the tuple list
    tuple_list.sort()
    # initialize the result list
    result = []
    # initialize the sum
    sum = 0
    # iterate over the tuple list
    for tuple_ in tuple_list:
        # if the sum is less than the first element of the tuple
        if sum < tuple_[0]:
            # append the tuple to the result list
            result.append(tuple_)
            # update the sum
            sum += tuple_[0]
        # if the sum is greater than or equal to the first element of the tuple
        else:
            # update the sum
            sum += tuple_[1]
            # append the tuple to the result list
            result.append(tuple_)
    # return the result list
    return result




--------------------------------------------------Mbpp/781--------------------------------------------------

<s> """
Write a python function to check whether the count of divisors is even. https://www.w3resource.com/python-exercises/basic/python-basic-1-exercise-24.php
assert count_divisors(10)
"""


def count_divisors(n):
    count = 0
    for i in range(1, n + 1):
        if n % i == 0:
            count += 1
    if count % 2 == 0:
        return True
    else:
        return False




--------------------------------------------------Mbpp/782--------------------------------------------------

<s> """
Write a python function to find the sum of all odd length subarrays. https://www.geeksforgeeks.org/sum-of-all-odd-length-subarrays/
assert odd_length_sum([1,2,4]) == 14
"""


def odd_length_sum(arr):
    """
    :param arr: list of integers
    :return: sum of all odd length subarrays
    """
    if len(arr) == 0:
        return 0
    if len(arr) == 1:
        return arr[0]
    if len(arr) == 2:
        return arr[0] + arr[1]
    if len(arr) == 3:
        return arr[0] + arr[1] + arr[2]
    if len(arr) == 4:
        return arr[0] + arr[1] + arr[2] + arr[3]
    if len(arr) == 5:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4]
    if len(arr) == 6:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5]
    if len(arr) == 7:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6]
    if len(arr) == 8:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7]
    if len(arr) == 9:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7] + arr[8]
    if len(arr) == 10:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7] + arr[8] + arr[9]
    if len(arr) == 11:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7] + arr[8] + arr[9] + arr[10]
    if len(arr) == 12:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7] + arr[8] + arr[9] + arr[10] + arr[11]
    if len(arr) == 13:
        return arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5] + arr[6] + arr[7] + arr[8] + arr[9] + arr[10] + arr[11] +

--------------------------------------------------Mbpp/783--------------------------------------------------

<s> """
Write a function to convert rgb color to hsv color. https://www.geeksforgeeks.org/program-change-rgb-color-model-hsv-color-model/
assert rgb_to_hsv(255, 255, 255)==(0, 0.0, 100.0)
"""


def rgb_to_hsv(r, g, b):
    """
    :param r: red
    :param g: green
    :param b: blue
    :return: hue, saturation, value
    """
    r, g, b = r / 255.0, g / 255.0, b / 255.0
    max_ = max(r, g, b)
    min_ = min(r, g, b)
    h = 0
    s = 0
    v = max_
    if max_ != min_:
        s = (max_ - min_) / max_
        if r == max_:
            h = (g - b) / (max_ - min_)
        elif g == max_:
            h = 2 + (b - r) / (max_ - min_)
        else:
            h = 4 + (r - g) / (max_ - min_)
        h = h / 6.0
    return h, s, v




--------------------------------------------------Mbpp/784--------------------------------------------------

<s> """
Write a function to find the product of first even and odd number of a given list.
assert mul_even_odd([1,3,5,7,4,1,6,8])==4
"""


def mul_even_odd(lst):
    """
    :param lst: list of numbers
    :return: product of first even and odd number
    """
    even = 1
    odd = 1
    for i in lst:
        if i % 2 == 0:
            even *= i
        else:
            odd *= i
    return even * odd




--------------------------------------------------Mbpp/785--------------------------------------------------

<s> """
Write a function to convert tuple string to integer tuple.
assert tuple_str_int("(7, 8, 9)") == (7, 8, 9)
"""


def tuple_str_int(tuple_str):
    """
    >>> tuple_str_int("(7, 8, 9)")
    (7, 8, 9)
    """
    return tuple(map(int, tuple_str[1:-1].split(",")))




--------------------------------------------------Mbpp/786--------------------------------------------------

<s> """
Write a function to locate the right insertion point for a specified value in sorted order.
assert right_insertion([1,2,4,5],6)==4
"""


def right_insertion(arr, value):
    """
    :param arr: sorted array
    :param value: value to be inserted
    :return: index of the right insertion point
    """
    left = 0
    right = len(arr) - 1
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] == value:
            return mid
        elif arr[mid] < value:
            left = mid + 1
        else:
            right = mid - 1
    return left




--------------------------------------------------Mbpp/787--------------------------------------------------

<s> """
Write a function that matches a string that has an a followed by three 'b'.
assert not text_match_three("ac")
"""


def text_match_three(text):
    """
    >>> text_match_three("abbb")
    True
    >>> text_match_three("abbbb")
    False
    >>> text_match_three("abbbbb")
    False
    >>> text_match_three("abbbbbb")
    False
    >>> text_match_three("abbbbbbb")
    False
    >>> text_match_three("abbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbbbbbb")
    False
    >>> text_match_three("abbbbbbbbbbbbbbbbbbbbbbbbbb")

--------------------------------------------------Mbpp/788--------------------------------------------------

<s> """
Write a function to create a new tuple from the given string and list.
assert new_tuple(["WEB", "is"], "best") == ('WEB', 'is', 'best')
"""


def new_tuple(list_: list, string: str) -> tuple:
    """
    Create a new tuple from the given string and list.
    :param list_: list
    :param string: str
    :return: tuple
    """
    return tuple(list_ + [string])




--------------------------------------------------Mbpp/790--------------------------------------------------

<s> """
Write a python function to check whether every even index contains even numbers of a given list.
assert even_position([3,2,1]) == False
"""


def even_position(lst):
    for i in range(0, len(lst), 2):
        if lst[i] % 2 != 0:
            return False
    return True




--------------------------------------------------Mbpp/791--------------------------------------------------

<s> """
Write a function to remove tuples from the given tuple.
assert remove_nested((1, 5, 7, (4, 6), 10)) == (1, 5, 7, 10)
"""


def remove_nested(tup):
    """
    >>> remove_nested((1, 5, 7, (4, 6), 10))
    (1, 5, 7, 10)
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3), (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3), (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3), (1, 2, 3), (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3), (1, 2, 3), (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3)))
    (1, 5, 7, 10, (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3))
    >>> remove_nested((1, 5, 7, (4, 6), 

--------------------------------------------------Mbpp/792--------------------------------------------------

<s> """
Write a python function to count the number of lists in a given number of lists.
assert count_list([[1, 3], [5, 7], [9, 11], [13, 15, 17]]) == 4
"""


def count_list(lst):
    """
    :param lst: list of lists
    :return: number of lists in lst
    """
    return len(lst)




--------------------------------------------------Mbpp/793--------------------------------------------------

<s> """
Write a python function to find the last position of an element in a sorted array.
assert last([1,2,3],1) == 0
"""


def last(arr, x):
    """
    :type arr: List[int]
    :type x: int
    :rtype: int
    """
    if not arr:
        return -1
    if len(arr) == 1:
        return 0 if arr[0] == x else -1
    if arr[0] == x:
        return 0
    if arr[-1] == x:
        return len(arr) - 1
    if x < arr[0]:
        return -1
    if x > arr[-1]:
        return -1
    if x < arr[-1]:
        return len(arr) - 1
    if x > arr[0]:
        return 0
    if x < arr[0]:
        return -1
    if x > arr[-1]:
        return -1
    if x < arr[-1]:
        return len(arr) - 1
    if x > arr[0]:
        return 0
    if x < arr[0]:
        return -1
    if x > arr[-1]:
        return -1
    if x < arr[-1]:
        return len(arr) - 1
    if x > arr[0]:
        return 0
    if x < arr[0]:
        return -1
    if x > arr[-1]:
        return -1
    if x < arr[-1]:
        return len(arr) - 1
    if x > arr[0]:
        return 0
    if x < arr[0]:
        return -1
    if x > arr[-1]:

--------------------------------------------------Mbpp/794--------------------------------------------------

<s> """
Write a function that matches a string that has an 'a' followed by anything, ending in 'b'.
assert text_starta_endb("aabbbb")
"""


def text_starta_endb(text):
    return text.startswith("a") and text.endswith("b")




--------------------------------------------------Mbpp/796--------------------------------------------------

<s> """
Write function to find the sum of all items in the given dictionary.
assert return_sum({'a': 100, 'b':200, 'c':300}) == 600
"""

def return_sum(dictionary):
    sum = 0
    for key, value in dictionary.items():
        sum += value
    return sum



--------------------------------------------------Mbpp/797--------------------------------------------------

<s> """
Write a python function to find the sum of all odd natural numbers within the range l and r.
assert sum_in_range(2,5) == 8
"""


def sum_in_range(l, r):
    """
    :param l: int
    :param r: int
    :return: int
    """
    if l > r:
        return 0
    return (r - l + 1) * (l + r) // 2




--------------------------------------------------Mbpp/798--------------------------------------------------

<s> """
Write a python function to find the sum of an array.
assert _sum([1, 2, 3]) == 6
"""


def _sum(arr):
    """
    >>> _sum([1, 2, 3])
    6
    >>> _sum([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
    55
    >>> _sum([])
    0
    >>> _sum([1])
    1
    >>> _sum([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20])
    155
    """
    return sum(arr)




--------------------------------------------------Mbpp/799--------------------------------------------------

<s> """
Write a function to that rotate left bits by d bits a given number. We assume that the number is 32 bit.
assert left_rotate(16,2) == 64
"""


def left_rotate(num, d):
    return (num << d) | (num >> (32 - d))




--------------------------------------------------Mbpp/800--------------------------------------------------

<s> """
Write a function to remove all whitespaces from a string.
assert remove_all_spaces('python  program')==('pythonprogram')
"""


def remove_all_spaces(string):
    """
    :param string: string
    :return: string without spaces
    """
    return ''.join(string.split())




--------------------------------------------------Mbpp/801--------------------------------------------------

<s> """
Write a python function to count the number of equal numbers from three given integers.
assert test_three_equal(1,1,1) == 3
"""


def test_three_equal(a, b, c):
    if a == b and b == c:
        return 3
    elif a == b or b == c or a == c:
        return 2
    else:
        return 0




--------------------------------------------------Mbpp/803--------------------------------------------------

<s> """
Write a function to check whether the given number is a perfect square or not. https://www.geeksforgeeks.org/check-if-given-number-is-perfect-square-in-cpp/
assert not is_perfect_square(10)
"""


def is_perfect_square(n):
    """
    :param n: int
    :return: bool
    """
    if n < 0:
        return False
    if n == 0:
        return True
    if n == 1:
        return True
    if n == 2:
        return True
    if n == 3:
        return True
    if n == 4:
        return True
    if n == 5:
        return True
    if n == 6:
        return True
    if n == 7:
        return True
    if n == 8:
        return True
    if n == 9:
        return True
    if n == 10:
        return True
    if n == 11:
        return True
    if n == 12:
        return True
    if n == 13:
        return True
    if n == 14:
        return True
    if n == 15:
        return True
    if n == 16:
        return True
    if n == 17:
        return True
    if n == 18:
        return True
    if n == 19:
        return True
    if n == 20:
        return True

--------------------------------------------------Mbpp/804--------------------------------------------------

<s> """
Write a function to check whether the product of numbers in a list is even or not.
assert is_product_even([1,2,3])
"""


def is_product_even(numbers):
    """
    Check whether the product of numbers in a list is even or not.
    :param numbers: list of numbers
    :return: True if the product of numbers in a list is even, False otherwise
    """
    return all(map(lambda x: x % 2 == 0, numbers))




--------------------------------------------------Mbpp/805--------------------------------------------------

<s> """
Write a function that returns the list in a list of lists whose sum of elements is the highest.
assert max_sum_list([[1,2,3], [4,5,6], [10,11,12], [7,8,9]])==[10, 11, 12]
"""


def max_sum_list(list_of_lists):
    max_sum = 0
    max_sum_list = []
    for i in list_of_lists:
        sum_of_list = sum(i)
        if sum_of_list > max_sum:
            max_sum = sum_of_list
            max_sum_list = i
    return max_sum_list




--------------------------------------------------Mbpp/806--------------------------------------------------

<s> """
Write a function to find maximum run of uppercase characters in the given string.
assert max_run_uppercase('GeMKSForGERksISBESt') == 5
"""


def max_run_uppercase(string):
    """
    :param string: string
    :return: int
    """
    max_run = 0
    run = 0
    for i in range(len(string)):
        if string[i].isupper():
            run += 1
        else:
            if run > max_run:
                max_run = run
            run = 0
    if run > max_run:
        max_run = run
    return max_run




--------------------------------------------------Mbpp/807--------------------------------------------------

<s> """
Write a python function to find the first odd number in a given list of numbers.
assert first_odd([1,3,5]) == 1
"""


def first_odd(nums):
    for num in nums:
        if num % 2 != 0:
            return num




--------------------------------------------------Mbpp/808--------------------------------------------------

<s> """
Write a function to check if the given tuples contain the k or not.
assert check_K((10, 4, 5, 6, 8), 6) == True
"""


def check_K(tup, k):
    """
    :param tup: tuple
    :param k: int
    :return: bool
    """
    return k in tup




--------------------------------------------------Mbpp/809--------------------------------------------------

<s> """
Write a function to check if each element of second tuple is smaller than its corresponding element in the first tuple.
assert check_smaller((1, 2, 3), (2, 3, 4)) == False
"""


def check_smaller(t1, t2):
    """
    >>> check_smaller((1, 2, 3), (2, 3, 4))
    False
    >>> check_smaller((1, 2, 3), (2, 3, 3))
    True
    >>> check_smaller((1, 2, 3), (2, 3, 2))
    False
    >>> check_smaller((1, 2, 3), (2, 3, 1))
    False
    >>> check_smaller((1, 2, 3), (2, 3, 0))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -1))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -2))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -3))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -4))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -5))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -6))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -7))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -8))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -9))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -10))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -11))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -12))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -13))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -14))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -15))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -16))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -17))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -18))
    False
    >>> check_smaller((1, 2, 3), (2, 3, -19