Prompt:
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.
    """

    ind=-1
    i=1
    while i<len(arr):
      if arr[i]<arr[i-1]:
        ind=i
      i+=1
    return ind

def check(candidate):
    assert candidate([1,2,4,3,5])==3,"Test 0"
    assert candidate([1,2,4,5])==-1,"Test 1"
    assert candidate([1,4,2,5,6,7,8,9,10])==2,"Test 2"
    assert candidate([4,8,5,7,3])==4,"Test 3"
    assert candidate([])==-1,"Test 4"


Prompt:
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.
    '''

    smallest = list(filter(lambda x: x < 0, lst))
    largest = list(filter(lambda x: x > 0, lst))
    return (max(smallest) if smallest else None, min(largest) if largest else None)


Prompt:
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 ,
    """

    temp_a, temp_b = a, b
    if isinstance(temp_a, str): temp_a = temp_a.replace(',','.')
    if isinstance(temp_b, str): temp_b = temp_b.replace(',','.')
    if float(temp_a) == float(temp_b): return None
    return a if float(temp_a) > float(temp_b) else b

def check(candidate):
    assert candidate(1, 2) == 2,"Test 0"
    assert candidate(1, 2.5) == 2.5,"Test 1"
    assert candidate(2, 3) == 3,"Test 2"
    assert candidate(5, 6) == 6,"Test 3"
    assert candidate(1,"Test 4"
    assert candidate("5,1","Test 5"
    assert candidate("1","Test 6"
    assert candidate("1", 1) == None,"Test 7"
    assert True,"Test 8"


Prompt:
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
    """

def check(candidate):
    assert candidate(4) == False,"Test 0"
    assert candidate(6) == False,"Test 1"
    assert candidate(8) == True,"Test 2"
    assert candidate(10) == True,"Test 3"
    assert candidate(11) == False,"Test 4"
    assert candidate(12) == True,"Test 5"
    assert candidate(13) == False,"Test 6"
    assert candidate(16) == True,"Test 7"


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

    The function will receive an integer as input and should return the special
    factorial of this integer.
    """

    fact_i = 1
    special_fact = 1
    for i in range(1, n+1):
        fact_i *= i
        special_fact *= fact_i
    return special_fact

def check(candidate):
    assert candidate(4) == 288, "Test 4"
    assert candidate(5) == 34560, "Test 5"
    assert candidate(7) == 125411328000, "Test 7"
    assert candidate(1) == 1, "Test 1"


Prompt:
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 -
    """

    new_text = ""
    i = 0
    start, end = 0, 0
    while i < len(text):
        if text[i] == " ":
            end += 1
        else:
            if end - start > 2:
                new_text += "-"+text[i]
            elif end - start > 0:
                new_text += "_"*(end - start)+text[i]
            else:
                new_text += text[i]
            start, end = i+1, i+1
        i+=1
    if end - start > 2:
        new_text += "-"
    elif end - start > 0:
        new_text += "_"
    return new_text

def check(candidate):
    assert candidate("Example") == "Example","Test 0"
    assert candidate("Mudasir Hanif ") == "Mudasir_Hanif_","Test 1"
    assert candidate("Yellow Yellow  Dirty  Fellow") == "Yellow_Yellow__Dirty__Fellow","Test 2"
    assert candidate("Exa   mple") == "Exa-mple","Test 3"
    assert candidate("   Exa 1 2 2 mple") == "-Exa_1_2_2_mple","Test 4"


Prompt:
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']
    """

    suf = ['txt', 'exe', 'dll']
    lst = file_name.split(sep='.')
    if len(lst) != 2:
        return 'No'
    if not lst[1] in suf:
        return 'No'
    if len(lst[0]) == 0:
        return 'No'
    if not lst[0][0].isalpha():
        return 'No'
    t = len([x for x in lst[0] if x.isdigit()])
    if t > 3:
        return 'No'
    return 'Yes'

def check(candidate):
    assert candidate("example.txt") == 'Yes',"Test 0"
    assert candidate("1example.dll") == 'No',"Test 1"
    assert candidate('s1sdf3.asd') == 'No',"Test 2"
    assert candidate('K.dll') == 'Yes',"Test 3"
    assert candidate('MY16FILE3.exe') == 'Yes',"Test 4"
    assert candidate('His12FILE94.exe') == 'No',"Test 5"
    assert candidate('_Y.txt') == 'No',"Test 6"
    assert candidate('?aREYA.exe') == 'No',"Test 7"
    assert candidate('/this_is_valid.dll') == 'No',"Test 8"
    assert candidate('this_is_valid.wow') == 'No',"Test 9"
    assert candidate('this_is_valid.txt') == 'Yes',"Test 10"
    assert candidate('this_is_valid.txtexe') == 'No',"Test 11"
    assert candidate('#this2_i4s_5valid.ten') == 'No',"Test 12"
    assert candidate('@this1_is6_valid.exe') == 'No',"Test 13"
    assert candidate('this_is_12valid.6exe4.txt') == 'No',"Test 14"
    assert candidate('all.exe.txt') == 'No',"Test 15"
    assert candidate('I563_No.exe') == 'Yes',"Test 16"
    assert candidate('Is3youfault.txt') == 'Yes',"Test 17"
    assert candidate('no_one#knows.dll') == 'Yes',"Test 18"
    assert candidate('1I563_Yes3.exe') == 'No',"Test 19"
    assert candidate('I563_Yes3.txtt') == 'No',"Test 20"
    assert candidate('final..txt') == 'No',"Test 21"
    assert candidate('final132') == 'No',"Test 22"
    assert candidate('_f4indsartal132.') == 'No',"Test 23"
    assert candidate('.txt') == 'No',"Test 24"
    assert candidate('s.') == 'No',"Test 25"


Prompt:
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.
    """

    result =[]
    for i in range(len(lst)):
        if i %3 == 0:
            result.append(lst[i]**2)
        elif i % 4 == 0 and i%3 != 0:
            result.append(lst[i]**3)
        else:
            result.append(lst[i])
    return sum(result)


Prompt:
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.

    Constraints:
        * 1 <= len(sentence) <= 100
        * sentence contains only letters
    """

    new_lst = []
    for word in sentence.split():
        flg = 0
        if len(word) == 1:
            flg = 1
        for i in range(2, len(word)):
            if len(word)%i == 0:
                flg = 1
        if flg == 0 or len(word) == 2:
            new_lst.append(word)
    return " ".join(new_lst)

def check(candidate):
    assert candidate("This is a test") == "is","Test 0"
    assert candidate("lets go for swimming") == "go for","Test 1"
    assert candidate("there is no place available here") == "there is no place","Test 2"
    assert candidate("Hi I am Hussein") == "Hi am Hussein","Test 3"
    assert candidate("go for it") == "go for it","Test 4"
    assert candidate("here") == "","Test 5"
    assert candidate("here is") == "is","Test 6"


Prompt:
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.
    """

    a, b = x.split("/")
    c, d = n.split("/")
    numerator = int(a) * int(c)
    denom = int(b) * int(d)
    if (numerator/denom == int(numerator/denom)):
        return True
    return False

def check(candidate):
    assert candidate("1/5","Test 0"
    assert candidate("1/6","Test 1"
    assert candidate("5/1","Test 2"
    assert candidate("7/10","Test 3"
    assert candidate("2/10","Test 4"
    assert candidate("7/2","Test 5"
    assert candidate("11/6","Test 6"
    assert candidate("2/3","Test 7"
    assert candidate("5/2","Test 8"
    assert candidate("2/4","Test 9"
    assert candidate("2/4","Test 10"
    assert candidate("1/5","Test 11"
    assert candidate("1/5","Test 12"


Prompt:
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.
    """

    def digits_sum(n):
        neg = 1
        if n < 0: n, neg = -1 * n, -1
        n = [int(i) for i in str(n)]
        n[0] = n[0] * neg
        return sum(n)
    return sorted(nums, key=digits_sum)


Prompt:
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).
    """

    count = 0
    for num in nums:
        if num > 10:
            odd_digits = (1, 3, 5, 7, 9)
            number_as_string = str(num)
            if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:
                count += 1

    return count


Prompt:
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.
    """

    A = [i*i - i + 1 for i in range(1,n+1)]
    ans = []
    for i in range(n):
        for j in range(i+1,n):
            for k in range(j+1,n):
                if (A[i]+A[j]+A[k])%3 == 0:
                    ans += [(A[i],A[j],A[k])]
    return len(ans)

def check(candidate):
    assert candidate(5) == 1,"Test 0"
    assert candidate(6) == 4,"Test 1"
    assert candidate(10) == 36,"Test 2"
    assert candidate(100) == 53361,"Test 3"


Prompt:
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.
    '''

    planet_names = ("Mercury", "Venus", "Earth", "Mars", "Jupiter", "Saturn", "Uranus", "Neptune")
    if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:
        return ()
    planet1_index = planet_names.index(planet1)
    planet2_index = planet_names.index(planet2)
    if planet1_index < planet2_index:
        return (planet_names[planet1_index + 1: planet2_index])
    else:
        return (planet_names[planet2_index + 1 : planet1_index])

def check(candidate):
    assert candidate("Jupiter","Test 0"
    assert candidate("Earth","Test 1"
    assert candidate("Mercury","Test 2"
    assert candidate("Neptune","Test 3"
    assert candidate("Earth","Test 4"
    assert candidate("Mars","Test 5"
    assert candidate("Jupiter","Test 6"


Prompt:
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.
    """

    lst.sort()
    new_lst = []
    for i in lst:
        if len(i)%2 == 0:
            new_lst.append(i)
    return sorted(new_lst, key=len)

def check(candidate):
    assert candidate(["aa","Test 0"
    assert candidate(["school","Test 1"
    assert candidate(["d","Test 2"
    assert candidate(["d","Test 3"
    assert candidate(["AI","Test 4"
    assert candidate(["a","Test 5"
    assert candidate(['aaaa', 'bbbb', 'dd', 'cc']) == ["cc","Test 6"


Prompt:
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.
    """

    if n == 1:
        return y
    for i in range(2, n):
        if n % i == 0:
            return y
            break
    else:
        return x

def check(candidate):
    assert candidate(7, 34, 12) == 34,"Test 0"
    assert candidate(15, 8, 5) == 5,"Test 1"
    assert candidate(3, 33, 5212) == 33,"Test 2"
    assert candidate(1259, 3, 52) == 3,"Test 3"
    assert candidate(7919, -1, 12) == -1,"Test 4"
    assert candidate(3609, 1245, 583) == 583,"Test 5"
    assert candidate(91, 56, 129) == 129,"Test 6"
    assert candidate(6, 34, 1234) == 1234,"Test 7"
    assert candidate(1, 2, 0) == 0,"Test 8"
    assert candidate(2, 2, 0) == 2,"Test 9"


Prompt:
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.

    If the input list is empty, return 0.
    '''

return sum([i**2 for i in lst if i > 0 and i%2!=0 and "." not in str(i)])

def check(candidate):
    assert candidate([]) == 0 ,"Test 0"
    assert candidate([5, 4]) == 25 ,"Test 1"
    assert candidate([0.1, 0.2, 0.3]) == 0 ,"Test 2"
    assert candidate([-10, -20, -30]) == 0 ,"Test 3"
    assert candidate([-1, -2, 8]) == 0,"Test 4"
    assert candidate([0.2, 3, 5]) == 34,"Test 5"
    assert candidate(lst) == odd_sum ,"Test 6"


Prompt:
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.
    """

return [abs(x-y) for x,y in zip(game,guess)]


Prompt:
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).
    """

    strong = extensions[0]
    my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])
    for s in extensions:
        val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])
        if val > my_val:
            strong = s
            my_val = val

    ans = class_name + "." + strong
    return ans

def check(candidate):
    assert candidate('Watashi', ['tEN', 'niNE', 'eIGHt8OKe']) == 'Watashi.eIGHt8OKe',"Test 0"
    assert candidate('Boku123', ['nani', 'NazeDa', 'YEs.WeCaNe', '32145tggg']) == 'Boku123.YEs.WeCaNe',"Test 1"
    assert candidate('__YESIMHERE', ['t', 'eMptY', 'nothing', 'zeR00', 'NuLl__', '123NoooneB321']) == '__YESIMHERE.NuLl__',"Test 2"
    assert candidate('K', ['Ta', 'TAR', 't234An', 'cosSo']) == 'K.TAR',"Test 3"
    assert candidate('__HAHA', ['Tab', '123', '781345', '-_-']) == '__HAHA.123',"Test 4"
    assert candidate('YameRore', ['HhAas', 'okIWILL123', 'WorkOut', 'Fails', '-_-']) == 'YameRore.okIWILL123',"Test 5"
    assert candidate('finNNalLLly', ['Die', 'NowW', 'Wow', 'WoW']) == 'finNNalLLly.WoW',"Test 6"
    assert candidate('_', ['Bb', '91245']) == '_.Bb',"Test 7"
    assert candidate('Sp', ['671235', 'Bb']) == 'Sp.671235',"Test 8"


Prompt:
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
    """

    l = len(b)
    pat = b + b
    for i in range(len(a) - l + 1):
        for j in range(l + 1):
            if a[i:i+l] == pat[j:j+l]:
                return True
    return False

def check(candidate):
    #assert True,"Test 0"
    #assert True,"Test 1"
    assert  candidate("xyzw","Test 2"
    assert  candidate("xyzw","xyw") == False ,"Test 3"
    assert  candidate("yello","Test 4"
    assert  candidate("yello","ell") == True ,"Test 5"
    assert  candidate("whattup","Test 6"
    assert  candidate("whattup","ptut") == False ,"Test 7"
    assert  candidate("efef","Test 8"
    assert  candidate("efef","fee") == True ,"Test 9"
    assert  candidate("abab","Test 10"
    assert  candidate("abab","aabb") == False ,"Test 11"
    assert  candidate("winemtt","Test 12"
    assert  candidate("winemtt","tinem") == True ,"Test 13"


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

    even_count = 0
    odd_count = 0
    for i in str(abs(num)):
        if int(i)%2==0:
            even_count +=1
        else:
            odd_count +=1
    return (even_count, odd_count)

def check(candidate):
    assert candidate(7) == (0, 1),"Test 0"
    assert candidate(-78) == (1, 1),"Test 1"
    assert candidate(3452) == (2, 2),"Test 2"
    assert candidate(346211) == (3, 3),"Test 3"
    assert candidate(-345821) == (3, 3),"Test 4"
    assert candidate(-2) == (1, 0),"Test 5"
    assert candidate(-45347) == (2, 3),"Test 6"
    assert candidate(0) == (1, 0),"Test 7"
    assert True,"Test 8"


Prompt:
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
    """

def check(candidate):
    assert candidate(19) == 'xix',"Test 0"
    assert candidate(152) == 'clii',"Test 1"
    assert candidate(251) == 'ccli',"Test 2"
    assert candidate(426) == 'cdxxvi',"Test 3"
    assert candidate(500) == 'd',"Test 4"
    assert candidate(1) == 'i',"Test 5"
    assert candidate(4) == 'iv',"Test 6"
    assert candidate(43) == 'xliii',"Test 7"
    assert candidate(90) == 'xc',"Test 8"
    assert candidate(94) == 'xciv',"Test 9"
    assert candidate(532) == 'dxxxii',"Test 10"
    assert candidate(900) == 'cm',"Test 11"
    assert candidate(994) == 'cmxciv',"Test 12"
    assert candidate(1000) == 'm',"Test 13"
    assert True,"Test 14"


Prompt:
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.
    '''

return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b

def check(candidate):
    assert candidate(3, 4, 5) == True,"Test 0"
    assert candidate(1, 2, 3) == False,"Test 1"
    assert candidate(10, 6, 8) == True,"Test 2"
    assert candidate(2, 2, 2) == False,"Test 3"
    assert candidate(7, 24, 25) == True,"Test 4"
    assert candidate(10, 5, 7) == False,"Test 5"
    assert candidate(5, 12, 13) == True,"Test 6"
    assert candidate(15, 8, 17) == True,"Test 7"
    assert candidate(48, 55, 73) == True,"Test 8"
    assert candidate(1, 1, 1) == False,"Test 9"
    assert candidate(2, 2, 10) == False,"Test 10"


Prompt:
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.
    """

return sorted(words, key = lambda x: (-len(set(x)), x))[0]

def check(candidate):
    assert (candidate(["name","Test 0"
    assert (candidate(["name","Test 1"
    assert (candidate(["aaaaaaa","Test 2"
    assert (candidate(["abc","Test 3"
    assert (candidate(["play", "this", "game", "of","Test 4"
    assert (candidate(["play","Test 5"
    assert (candidate(["we","Test 6"
    assert (candidate(["we","Test 7"
    assert (candidate(["this","Test 8"
    assert (candidate(["b"]) == "b"), 't9',"Test 9"
    assert (candidate(["play","Test 10"


Prompt:
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.

    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(need <= remaining):
        return [ number + need , remaining-need ]
    else:
        return [ number + remaining , 0]

def check(candidate):
    assert True,"Test 0"
    assert candidate(5, 6, 10) == [11, 4],"Test 1"
    assert candidate(4, 8, 9) == [12, 1],"Test 2"
    assert candidate(1, 10, 10) == [11, 0],"Test 3"
    assert candidate(2, 11, 5) == [7, 0],"Test 4"
    assert True,"Test 5"
    assert candidate(4, 5, 7) == [9, 2],"Test 6"
    assert candidate(4, 5, 1) == [5, 0],"Test 7"


Prompt:
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 ( ** )

    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.

    """

    expression = str(operand[0])
    for oprt, oprn in zip(operator, operand[1:]):
        expression+= oprt + str(oprn)
    return eval(expression)


Prompt:
def solve_2(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.
    """

    flg = 0
    idx = 0
    new_str = list(s)
    for i in s:
        if i.isalpha():
            new_str[idx] = i.swapcase()
            flg = 1
        idx += 1
    s = ""
    for i in new_str:
        s += i
    if flg == 0:
        return s[len(s)::-1]
    return s

def check(candidate):
    assert candidate("AsDf") == "aSdF","Test 0"
    assert candidate("1234") == "4321","Test 1"
    assert candidate("ab") == "AB","Test 2"
    assert candidate("#a@C") == "#A@c","Test 3"
    assert candidate("#AsdfW^45") == "#aSDFw^45","Test 4"
    assert candidate("#6@2") == "2@6#","Test 5"
    assert candidate("#$a^D") == "#$A^d","Test 6"
    assert candidate("#ccc") == "#CCC","Test 7"


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

    import hashlib
    return hashlib.md5(text.encode('ascii')).hexdigest() if text else None

def check(candidate):
    assert candidate('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62',"Test 0"
    assert candidate('') == None,"Test 1"
    assert candidate('A B C') == '0ef78513b0cb8cef12743f5aeb35f888',"Test 2"
    assert candidate('password') == '5f4dcc3b5aa765d61d8327deb882cf99',"Test 3"
    assert True,"Test 4"


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

    lower = max(2, min(a, b))
    upper = min(8, max(a, b))

    return [i for i in range(lower, upper+1) if i % 2 == 0]

def check(candidate):
    assert candidate(2, 10) == [2, 4, 6, 8], "Test 1"
    assert candidate(10, 2) == [2, 4, 6, 8], "Test 2"
    assert candidate(132, 2) == [2, 4, 6, 8], "Test 3"
    assert candidate(17,89) == [], "Test 4"
    assert True,"Test 4"