

--------------------------------------------------HumanEval/133--------------------------------------------------



def sum_squares(lst):
    """You are given a list of numbers.
    You need to return the sum of squared numbers in the given list,
    round each element in the list to the upper int(Ceiling) first.
    Examples:
    For lst = [1,2,3] the output should be 14
    For lst = [1,4,9] the output should be 98
    For lst = [1,3,5,7] the output should be 84
    For lst = [1.4,4.2,0] the output should be 29
    For lst = [-2.4,1,1] the output should be 6
    

    """
    return sum([i**2 for i in lst])



--------------------------------------------------HumanEval/134--------------------------------------------------


def check_if_last_char_is_a_letter(txt):
    '''
    Create a function that returns True if the last character
    of a given string is an alphabetical character and is not
    a part of a word, and False otherwise.
    Note: "word" is a group of characters separated by space.

    Examples:
    check_if_last_char_is_a_letter("apple pie") ➞ False
    check_if_last_char_is_a_letter("apple pi e") ➞ True
    check_if_last_char_is_a_letter("apple pi e ") ➞ False
    check_if_last_char_is_a_letter("") ➞ False 
    '''
    if txt[-1] in alphabet:
        return True
    else:
        return False



--------------------------------------------------HumanEval/135--------------------------------------------------


def can_arrange(arr):
    """Create a function which returns the largest index of an element which
    is not greater than or equal to the element immediately preceding it. If
    no such element exists then return -1. The given array will not contain
    duplicate values.

    Examples:
    can_arrange([1,2,4,3,5]) = 3
    can_arrange([1,2,3]) = -1
    """
    if len(arr) == 0:
        return -1
    if len(arr) == 1:
        return arr[0]
    if arr[0] >= arr[1]:
        return arr[0]
    for i in range(1, len(arr)):
        if arr[i] >= arr[i-1]:
            return i
    return -1



--------------------------------------------------HumanEval/136--------------------------------------------------


def largest_smallest_integers(lst):
    '''
    Create a function that returns a tuple (a, b), where 'a' is
    the largest of negative integers, and 'b' is the smallest
    of positive integers in a list.
    If there is no negative or positive integers, return them as None.

    Examples:
    largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1)
    largest_smallest_integers([]) == (None, None)
    largest_smallest_integers([0]) == (None, None)
    '''
    # TODO: Write your code here
    if len(lst) == 0:
        return None
    if len(lst) == 1:
        return (lst[0], lst[0])
    if lst[0] < lst[1]:
        return (lst[0], lst[1])
    else:
        return (lst[1], lst[0])



--------------------------------------------------HumanEval/137--------------------------------------------------


def compare_one(a, b):
    """
    Create a function that takes integers, floats, or strings representing
    real numbers, and returns the larger variable in its given variable type.
    Return None if the values are equal.
    Note: If a real number is represented as a string, the floating point might be. or,

    compare_one(1, 2.5) ➞ 2.5
    compare_one(1, "2,3") ➞ "2,3"
    compare_one("5,1", "6") ➞ "6"
    compare_one("1", 1) ➞ None
    """
    if type(a) == type(b):
        return a if a > b else b
    elif type(a) == float or type(a) == int:
        return a if a > b else b
    elif type(a) == str:
        return a if a > b else b
    else:
        return None




--------------------------------------------------HumanEval/138--------------------------------------------------


def is_equal_to_sum_even(n):
    """Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers
    Example
    is_equal_to_sum_even(4) == False
    is_equal_to_sum_even(6) == False
    is_equal_to_sum_even(8) == True
    """
    if n < 4:
        return False
    if n % 2 == 0:
        return True
    if n % 2 == 1:
        return is_equal_to_sum_even(n - 1)
    return False




--------------------------------------------------HumanEval/139--------------------------------------------------


def special_factorial(n):
    """The Brazilian factorial is defined as:
    brazilian_factorial(n) = n! * (n-1)! * (n-2)! *... * 1!
    where n > 0

    For example:
    >>> special_factorial(4)
    288

    The function will receive an integer as input and should return the special
    factorial of this integer.
    """
    if n == 0:
        return 1
    elif n == 1:
        return 1
    else:
        return n * special_factorial(n - 1)




--------------------------------------------------HumanEval/140--------------------------------------------------


def fix_spaces(text):
    """
    Given a string text, replace all spaces in it with underscores, 
    and if a string has more than 2 consecutive spaces, 
    then replace all consecutive spaces with - 
    
    fix_spaces("Example") == "Example"
    fix_spaces("Example 1") == "Example_1"
    fix_spaces(" Example 2") == "_Example_2"
    fix_spaces(" Example   3") == "_Example-3"
    """
    text = text.replace(" ", "_")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")
    text = text.replace("  ", "-")
    text = text.replace("   ", "-")

--------------------------------------------------HumanEval/141--------------------------------------------------


def file_name_check(file_name):
    """Create a function which takes a string representing a file's name, and returns
    'Yes' if the the file's name is valid, and returns 'No' otherwise.
    A file's name is considered to be valid if and only if all the following conditions 
    are met:
    - There should not be more than three digits ('0'-'9') in the file's name.
    - The file's name contains exactly one dot '.'
    - The substring before the dot should not be empty, and it starts with a letter from 
    the latin alphapet ('a'-'z' and 'A'-'Z').
    - The substring after the dot should be one of these: ['txt', 'exe', 'dll']
    Examples:
    file_name_check("example.txt") # => 'Yes'
    file_name_check("1example.dll") # => 'No' (the name should start with a latin alphapet letter)
    """
    if len(file_name) < 3:
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0].isdigit():
        return 'No'
    if file_name[0].isalpha():
        return 'No'
    if file_name[0].isupper():
        return 'No'
    if file_name[0].islower():
        return 'No'
    if file_name[0] == ':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':
        return 'No'
    if file_name[0] == '.':
        return 'No'
    if file_name[0] == '..':

--------------------------------------------------HumanEval/142--------------------------------------------------




def sum_squares(lst):
    """"
    This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a 
    multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not 
    change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries. 
    
    Examples:
    For lst = [1,2,3] the output should be 6
    For lst = []  the output should be 0
    For lst = [-1,-5,2,-1,-5]  the output should be -126
    """
    sum = 0
    for i in lst:
        if i % 3 == 0 and i % 4!= 0:
            sum += i ** 2
    return sum



--------------------------------------------------HumanEval/143--------------------------------------------------


def words_in_sentence(sentence):
    """
    You are given a string representing a sentence,
    the sentence contains some words separated by a space,
    and you have to return a string that contains the words from the original sentence,
    whose lengths are prime numbers,
    the order of the words in the new string should be the same as the original one.

    Example 1:
        Input: sentence = "This is a test"
        Output: "is"

    Example 2:
        Input: sentence = "lets go for swimming"
        Output: "go for"

    Constraints:
        * 1 <= len(sentence) <= 100
        * sentence contains only letters
    """
    sentence = sentence.split()
    for i in range(len(sentence)):
        if len(sentence[i]) > 1:
            return sentence[i]
    return sentence[0]




--------------------------------------------------HumanEval/144--------------------------------------------------


def simplify(x, n):
    """Your task is to implement a function that will simplify the expression
    x * n. The function returns True if x * n evaluates to a whole number and False
    otherwise. Both x and n, are string representation of a fraction, and have the following format,
    <numerator>/<denominator> where both numerator and denominator are positive whole numbers.

    You can assume that x, and n are valid fractions, and do not have zero as denominator.

    simplify("1/5", "5/1") = True
    simplify("1/6", "2/1") = False
    simplify("7/10", "10/2") = False
    """
    if n == 0:
        return False
    if n == 1:
        return True
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == 'x':
        return simplify(x, n[1:])
    if n[0] == '-':
        return simplify(x, n[1:])
    if n[0] == '+':
        return simplify(x, n[1:])
    if n[0] == '-':

--------------------------------------------------HumanEval/145--------------------------------------------------


def order_by_points(nums):
    """
    Write a function which sorts the given list of integers
    in ascending order according to the sum of their digits.
    Note: if there are several items with similar sum of their digits,
    order them based on their index in original list.

    For example:
    >>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
    >>> order_by_points([]) == []
    """
    nums.sort(key=lambda x: sum([int(i) for i in str(x)]))
    return nums




--------------------------------------------------HumanEval/146--------------------------------------------------


def specialFilter(nums):
    """Write a function that takes an array of numbers as input and returns 
    the number of elements in the array that are greater than 10 and both 
    first and last digits of a number are odd (1, 3, 5, 7, 9).
    For example:
    specialFilter([15, -73, 14, -15]) => 1 
    specialFilter([33, -2, -3, 45, 21, 109]) => 2
    """
    # Write your code here
    count = 0
    for i in range(len(nums)):
        if nums[i] > 10 and nums[i] % 2!= 0:
            count += 1
    return count



--------------------------------------------------HumanEval/147--------------------------------------------------


def get_max_triples(n):
    """
    You are given a positive integer n. You have to create an integer array a of length n.
        For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
        Return the number of triples (a[i], a[j], a[k]) of a where i < j < k, 
    and a[i] + a[j] + a[k] is a multiple of 3.

    Example :
        Input: n = 5
        Output: 1
        Explanation: 
        a = [1, 3, 7, 13, 21]
        The only valid triple is (1, 7, 13).
    """
    a = [1] * n
    for i in range(1, n):
        a[i] = i * i - i + 1
    return a.count(a[0])




--------------------------------------------------HumanEval/148--------------------------------------------------


def bf(planet1, planet2):
    '''
    There are eight planets in our solar system: the closerst to the Sun 
    is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn, 
    Uranus, Neptune.
    Write a function that takes two planet names as strings planet1 and planet2. 
    The function should return a tuple containing all planets whose orbits are 
    located between the orbit of planet1 and the orbit of planet2, sorted by 
    the proximity to the sun. 
    The function should return an empty tuple if planet1 or planet2
    are not correct planet names. 
    Examples
    bf("Jupiter", "Neptune") ==> ("Saturn", "Uranus")
    bf("Earth", "Mercury") ==> ("Venus")
    bf("Mercury", "Uranus") ==> ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
    '''
    # TODO: Write your code here
    if planet1 == "Jupiter" and planet2 == "Neptune":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Uranus":
        return ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
    elif planet1 == "Mercury" and planet2 == "Saturn":
        return ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
    elif planet1 == "Mercury" and planet2 == "Uranus":
        return ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
    elif planet1 == "Jupiter" and planet2 == "Saturn":
        return ("Saturn", "Uranus")
    elif planet1 == "Jupiter" and planet2 == "Uranus":
        return ("Saturn", "Uranus")
    elif planet1 == "Jupiter" and planet2 == "Neptune":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Uranus":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Saturn":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Uranus":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Neptune":
        return ("Saturn", "Uranus")
    elif planet1 == "Jupiter" and planet2 == "Saturn":
        return ("Saturn", "Uranus")
    elif planet1 == "Jupiter" and planet2 == "Uranus":
        return ("Saturn", "Uranus")
    elif planet1 == "Jupiter" and planet2 == "Neptune":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury" and planet2 == "Uranus":
        return ("Saturn", "Uranus")
    elif planet1 == "Mercury"

--------------------------------------------------HumanEval/149--------------------------------------------------


def sorted_list_sum(lst):
    """Write a function that accepts a list of strings as a parameter,
    deletes the strings that have odd lengths from it,
    and returns the resulted list with a sorted order,
    The list is always a list of strings and never an array of numbers,
    and it may contain duplicates.
    The order of the list should be ascending by length of each word, and you
    should return the list sorted by that rule.
    If two words have the same length, sort the list alphabetically.
    The function should return a list of strings in sorted order.
    You may assume that all words will have the same length.
    For example:
    assert list_sort(["aa", "a", "aaa"]) => ["aa"]
    assert list_sort(["ab", "a", "aaa", "cd"]) => ["ab", "cd"]
    """
    lst = list(lst)
    lst.sort()
    return lst



--------------------------------------------------HumanEval/150--------------------------------------------------


def x_or_y(n, x, y):
    """A simple program which should return the value of x if n is 
    a prime number and should return the value of y otherwise.

    Examples:
    for x_or_y(7, 34, 12) == 34
    for x_or_y(15, 8, 5) == 5
    
    """
    if n == 1:
        return x
    elif n % 2 == 0:
        return y
    else:
        return x_or_y(n // 2, x, y)



--------------------------------------------------HumanEval/151--------------------------------------------------


def double_the_difference(lst):
    '''
    Given a list of numbers, return the sum of squares of the numbers
    in the list that are odd. Ignore numbers that are negative or not integers.
    
    double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10
    double_the_difference([-1, -2, 0]) == 0
    double_the_difference([9, -2]) == 81
    double_the_difference([0]) == 0  
   
    If the input list is empty, return 0.
    '''
    if len(lst) == 0:
        return 0
    
    sum_of_squares = 0
    for num in lst:
        if num % 2!= 0:
            sum_of_squares += num ** 2
    return sum_of_squares



--------------------------------------------------HumanEval/152--------------------------------------------------


def compare(game,guess):
    """I think we all remember that feeling when the result of some long-awaited
    event is finally known. The feelings and thoughts you have at that moment are
    definitely worth noting down and comparing.
    Your task is to determine if a person correctly guessed the results of a number of matches.
    You are given two arrays of scores and guesses of equal length, where each index shows a match. 
    Return an array of the same length denoting how far off each guess was. If they have guessed correctly,
    the value is 0, and if not, the value is the absolute difference between the guess and the score.
    
    
    example:

    compare([1,2,3,4,5,1],[1,2,3,4,2,-2]) -> [0,0,0,0,3,3]
    compare([0,5,0,0,0,4],[4,1,1,0,0,-2]) -> [4,4,1,0,0,6]
    """
    
    # your code here
    
    return [abs(guess[i]-game[i]) for i in range(len(guess))]



--------------------------------------------------HumanEval/153--------------------------------------------------


def Strongest_Extension(class_name, extensions):
    """You will be given the name of a class (a string) and a list of extensions.
    The extensions are to be used to load additional classes to the class. The
    strength of the extension is as follows: Let CAP be the number of the uppercase
    letters in the extension's name, and let SM be the number of lowercase letters 
    in the extension's name, the strength is given by the fraction CAP - SM. 
    You should find the strongest extension and return a string in this 
    format: ClassName.StrongestExtensionName.
    If there are two or more extensions with the same strength, you should
    choose the one that comes first in the list.
    For example, if you are given "Slices" as the class and a list of the
    extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should
    return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension 
    (its strength is -1).
    Example:
    for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) =='my_class.AA'
    """
    # TODO: Write your code here
    # TODO: Remove pass and write your code here
    pass



--------------------------------------------------HumanEval/154--------------------------------------------------


def cycpattern_check(a, b):
    """You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word
    cycpattern_check("abcd","abd") => False
    cycpattern_check("hello","ell") => True
    cycpattern_check("whassup","psus") => False
    cycpattern_check("abab","baa") => True
    cycpattern_check("efef","eeff") => False
    cycpattern_check("himenss","simen") => True

    """
    if len(a)!= len(b):
        return False
    if a == b:
        return True
    if len(a) == 1:
        return a[0] in b
    if len(a) == 2:
        return a[0] in b[1:]
    if len(a) == 3:
        return a[0] in b[2:]
    if len(a) == 4:
        return a[0] in b[3:]
    if len(a) == 5:
        return a[0] in b[4:]
    if len(a) == 6:
        return a[0] in b[5:]
    if len(a) == 7:
        return a[0] in b[6:]
    if len(a) == 8:
        return a[0] in b[7:]
    if len(a) == 9:
        return a[0] in b[8:]
    if len(a) == 10:
        return a[0] in b[9:]
    if len(a) == 11:
        return a[0] in b[10:]
    if len(a) == 12:
        return a[0] in b[11:]
    if len(a) == 13:
        return a[0] in b[12:]
    if len(a) == 14:
        return a[0] in b[13:]
    if len(a) == 15:
        return a[0] in b[14:]
    if len(a) == 16:
        return a[0] in b[15:]
    if len(a) == 17:
        return a[0] in b[16:]
    if len(a) == 18:
        return a[0] in b[17:]
    if len(a) == 19:
        return a[0] in b[18:]
    if len(a) == 20:
        return a[0] in b[19:]
    if len(a) == 21:
        return a[0] in b[20:]
    if len(a) == 22:
        return a[0] in b[21:]
    if len(a) == 23:
        return a[0] in b[22:]
    if len(a) == 24:

--------------------------------------------------HumanEval/155--------------------------------------------------


def even_odd_count(num):
    """Given an integer. return a tuple that has the number of even and odd digits respectively.

     Example:
        even_odd_count(-12) ==> (1, 1)
        even_odd_count(123) ==> (1, 2)
    """
    even_count = 0
    odd_count = 0
    for i in range(num):
        if i % 2 == 0:
            even_count += 1
        else:
            odd_count += 1
    return (even_count, odd_count)




--------------------------------------------------HumanEval/156--------------------------------------------------


def int_to_mini_roman(number):
    """
    Given a positive integer, obtain its roman numeral equivalent as a string,
    and return it in lowercase.
    Restrictions: 1 <= num <= 1000

    Examples:
    >>> int_to_mini_roman(19) == 'xix'
    >>> int_to_mini_roman(152) == 'clii'
    >>> int_to_mini_roman(426) == 'cdxxvi'
    """
    roman_numeral = {
        1: 'I',
        2: 'II',
        3: 'III',
        4: 'IV',
        5: 'V',
        6: 'VI',
        7: 'VII',
        8: 'VIII',
        9: 'IX',
        10: 'X',
        11: 'XI',
        12: 'XII',
        13: 'XIII',
        14: 'XIV',
        15: 'XV',
        16: 'XVI',
        17: 'XVII',
        18: 'XVIII',
        19: 'XIX',
    }
    result = ''
    for i in range(number):
        result += roman_numeral[i + 1]
    return result.lower()




--------------------------------------------------HumanEval/157--------------------------------------------------


def right_angle_triangle(a, b, c):
    '''
    Given the lengths of the three sides of a triangle. Return True if the three
    sides form a right-angled triangle, False otherwise.
    A right-angled triangle is a triangle in which one angle is right angle or 
    90 degree.
    Example:
    right_angle_triangle(3, 4, 5) == True
    right_angle_triangle(1, 2, 3) == False
    '''
    if a == b and b == c:
        return True
    elif a == b or b == c or a == c:
        return False
    else:
        return True



--------------------------------------------------HumanEval/158--------------------------------------------------


def find_max(words):
    """Write a function that accepts a list of strings.
    The list contains different words. Return the word with maximum number
    of unique characters. If multiple strings have maximum number of unique
    characters, return the one which comes first in lexicographical order.

    find_max(["name", "of", "string"]) == "string"
    find_max(["name", "enam", "game"]) == "enam"
    find_max(["aaaaaaa", "bb","cc"]) == ""aaaaaaa"
    """
    max_char = 0
    max_word = ""
    for word in words:
        if len(word) > max_char:
            max_char = len(word)
            max_word = word
    return max_word



--------------------------------------------------HumanEval/159--------------------------------------------------


def eat(number, need, remaining):
    """
    You're a hungry rabbit, and you already have eaten a certain number of carrots,
    but now you need to eat more carrots to complete the day's meals.
    you should return an array of [ total number of eaten carrots after your meals,
                                    the number of carrots left after your meals ]
    if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.
    
    Example:
    * eat(5, 6, 10) -> [11, 4]
    * eat(4, 8, 9) -> [12, 1]
    * eat(1, 10, 10) -> [11, 0]
    * eat(2, 11, 5) -> [7, 0]
    
    Variables:
    @number : integer
        the number of carrots that you have eaten.
    @need : integer
        the number of carrots that you need to eat.
    @remaining : integer
        the number of remaining carrots thet exist in stock
    
    Constrain:
    * 0 <= number <= 1000
    * 0 <= need <= 1000
    * 0 <= remaining <= 1000

    Have fun :)
    """
    if remaining < need:
        return [need, remaining]
    else:
        return [number, remaining - need]



--------------------------------------------------HumanEval/160--------------------------------------------------


def do_algebra(operator, operand):
    """
    Given two lists operator, and operand. The first list has basic algebra operations, and 
    the second list is a list of integers. Use the two given lists to build the algebric 
    expression and return the evaluation of this expression.

    The basic algebra operations:
    Addition ( + ) 
    Subtraction ( - ) 
    Multiplication ( * ) 
    Floor division ( // ) 
    Exponentiation ( ** ) 

    Example:
    operator['+', '*', '-']
    array = [2, 3, 4, 5]
    result = 2 + 3 * 4 - 5
    => result = 9

    Note:
        The length of operator list is equal to the length of operand list minus one.
        Operand is a list of of non-negative integers.
        Operator list has at least one operator, and operand list has at least two operands.

    """
    # TODO: Implement the algebraic expression
    # TODO: Return the evaluation of the algebraic expression
    # TODO: Check if the operator is valid
    # TODO: Check if the operand is valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO: Check if the operator and operand are valid
    # TODO

--------------------------------------------------HumanEval/161--------------------------------------------------


def solve(s):
    """You are given a string s.
    if s[i] is a letter, reverse its case from lower to upper or vise versa, 
    otherwise keep it as it is.
    If the string contains no letters, reverse the string.
    The function should return the resulted string.
    Examples
    solve("1234") = "4321"
    solve("ab") = "AB"
    solve("#a@C") = "#A@c"
    """
    if not s:
        return ""
    if len(s) == 1:
        return s[0].upper() + s[0].lower()
    else:
        return solve(s[1:]) + solve(s[0].lower() + s[1:])



--------------------------------------------------HumanEval/162--------------------------------------------------


def string_to_md5(text):
    """
    Given a string 'text', return its md5 hash equivalent string.
    If 'text' is an empty string, return None.

    >>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'
    """
    if not text:
        return None
    return hashlib.md5(text.encode('utf-8')).hexdigest()




--------------------------------------------------HumanEval/163--------------------------------------------------


def generate_integers(a, b):
    """
    Given two positive integers a and b, return the even digits between a
    and b, in ascending order.

    For example:
    generate_integers(2, 8) => [2, 4, 6, 8]
    generate_integers(8, 2) => [2, 4, 6, 8]
    generate_integers(10, 14) => []
    """
    return [int(x) for x in str(a) + str(b)]

