Prompt:
def match_parens(lst):
    '''
    You are given a list of two strings, both strings consist of open
    parentheses '(' or close parentheses ')' only.
    Your job is to check if it is possible to concatenate the two strings in
    some order, that the resulting string will be good.
    A string S is considered to be good if and only if all parentheses in S
    are balanced. For example: the string '(())()' is good, while the string
    '())' is not.
    Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.

    Examples:
    match_parens(['()(', ')']) == 'Yes'
    match_parens([')', ')']) == 'No'
    '''

    def check(s):
        val = 0
        for i in s:
            if i == '(':
                val = val + 1
            else:
                val = val - 1
            if val < 0:
                return False
        return True if val == 0 else False

    S1 = lst[0] + lst[1]
    S2 = lst[1] + lst[0]
    return 'Yes' if check(S1) or check(S2) else 'No'


Prompt:
def maximum(arr, k):
    """
    Given an array arr of integers and a positive integer k, return a sorted list
    of length k with the maximum k numbers in arr.

    Example 1:

        Input: arr = [-3, -4, 5], k = 3
        Output: [-4, -3, 5]

    Example 2:

        Input: arr = [4, -4, 4], k = 2
        Output: [4, 4]

    Example 3:

        Input: arr = [-3, 2, 1, 2, -1, -2, 1], k = 1
        Output: [2]

    Note:
        1. The length of the array will be in the range of [1, 1000].
        2. The elements in the array will be in the range of [-1000, 1000].
        3. 0 <= k <= len(arr)
    """

    if k == 0:
        return []
    arr.sort()
    ans = arr[-k:]
    return ans


Prompt:
def solution(lst):
    """Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.

    Examples
    solution([5, 8, 7, 1]) ==> 12
    solution([3, 3, 3, 3, 3]) ==> 9
    solution([30, 13, 24, 321]) ==>0
    """

return sum([x for idx, x in enumerate(lst) if idx%2==0 and x%2==1])

def check(candidate):
    assert candidate([5, 8, 7, 1])    == 12,"Test 0"
    assert candidate([3, 3, 3, 3, 3]) == 9,"Test 1"
    assert candidate([30, 13, 24, 321]) == 0,"Test 2"
    assert candidate([5, 9]) == 5,"Test 3"
    assert candidate([2, 4, 8]) == 0,"Test 4"
    assert candidate([30, 13, 23, 32]) == 23,"Test 5"
    assert candidate([3, 13, 2, 9]) == 3,"Test 6"


Prompt:
def add_elements(arr, k):
    """
    Given a non-empty array of integers arr and an integer k, return
    the sum of the elements with at most two digits from the first k elements of arr.

    Example:

        Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4
        Output: 24 # sum of 21 + 3

    Constraints:
        1. 1 <= len(arr) <= 100
        2. 1 <= k <= len(arr)
    """

return sum(elem for elem in arr[:k] if len(str(elem)) <= 2)


Prompt:
def get_odd_collatz(n):
    """
    Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.

    The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined
    as follows: start with any positive integer n. Then each term is obtained from the
    previous term as follows: if the previous term is even, the next term is one half of
    the previous term. If the previous term is odd, the next term is 3 times the previous
    term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.

    Note:
        1. Collatz(1) is [1].
        2. returned list sorted in increasing order.

    For example:
    get_odd_collatz(5) returns [1, 5] # The collatz sequence for 5 is [5, 16, 8, 4, 2, 1], so the odd numbers are only 1, and 5.
    """

    if n%2==0:
        odd_collatz = []
    else:
        odd_collatz = [n]
    while n > 1:
        if n % 2 == 0:
            n = n/2
        else:
            n = n*3 + 1

        if n%2 == 1:
            odd_collatz.append(int(n))

    return sorted(odd_collatz)

def check(candidate):
    assert candidate(14) == [1, 5, 7, 11, 13, 17],"Test 0"
    assert candidate(5) == [1, 5],"Test 1"
    assert candidate(12) == [1, 3, 5],"Test 2"
    assert candidate(1) == [1],"Test 3"


Prompt:
def valid_date(date):
    """You have to write a function which validates a given date string and
    returns True if the date is valid otherwise False.
    The date is valid if all of the following rules are satisfied:
    1. The date string is not empty.
    2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the number of days is not less than 1 or higher than 30 days for months 4,6,9,11. And, the number of days is not less than 1 or higher than 29 for the month 2.
    3. The months should not be less than 1 or higher than 12.
    4. The date should be in the format: mm-dd-yyyy

    for example:
    valid_date('03-11-2000') => True

    valid_date('15-01-2012') => False

    valid_date('04-0-2040') => False

    valid_date('06-04-2020') => True

    valid_date('06/04/2020') => False
    """

    try:
        date = date.strip()
        month, day, year = date.split('-')
        month, day, year = int(month), int(day), int(year)
        if month < 1 or month > 12:
            return False
        if month in [1,3,5,7,8,10,12] and day < 1 or day > 31:
            return False
        if month in [4,6,9,11] and day < 1 or day > 30:
            return False
        if month == 2 and day < 1 or day > 29:
            return False
    except:
        return False

    return True

def check(candidate):
    assert candidate('03-11-2000') == True,"Test 0"
    assert candidate('15-01-2012') == False,"Test 1"
    assert candidate('04-0-2040') == False,"Test 2"
    assert candidate('06-04-2020') == True,"Test 3"
    assert candidate('01-01-2007') == True,"Test 4"
    assert candidate('03-32-2011') == False,"Test 5"
    assert candidate('') == False,"Test 6"
    assert candidate('04-31-3000') == False,"Test 7"
    assert candidate('06-06-2005') == True,"Test 8"
    assert candidate('21-31-2000') == False,"Test 9"
    assert candidate('04-12-2003') == True,"Test 10"
    assert candidate('04122003') == False,"Test 11"
    assert candidate('20030412') == False,"Test 12"
    assert candidate('2003-04') == False,"Test 13"
    assert candidate('2003-04-12') == False,"Test 14"
    assert candidate('04-2003') == False,"Test 15"


Prompt:
def split_words(txt):
    '''
    Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you
    should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the
    alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25
    Examples
    split_words("Hello world!") ➞ ["Hello", "world!"]
    split_words("Hello,world!") ➞ ["Hello", "world!"]
    split_words("abcdef") == 3
    '''

    if " " in txt:
        return txt.split()
    elif "," in txt:
        return txt.replace(',',' ').split()
    else:
        return len([i for i in txt if i.islower() and ord(i)%2 == 0])

def check(candidate):
    assert candidate("Hello world!") == ["Hello","Test 0"
    assert candidate("Hello,world!") == ["Hello","Test 1"
    assert candidate("Hello world,!") == ["Hello","Test 2"
    assert candidate("Hello,Hello,world !") == ["Hello,Hello,world","Test 3"
    assert candidate("abcdef") == 3,"Test 4"
    assert candidate("aaabb") == 2,"Test 5"
    assert candidate("aaaBb") == 1,"Test 6"
    assert candidate("") == 0,"Test 7"


Prompt:
def is_sorted(lst):
    '''
    Given a list of numbers, return whether or not they are sorted
    in ascending order. If list has more than 1 duplicate of the same
    number, return False. Assume no negative numbers and only integers.

    Examples
    is_sorted([5]) ➞ True
    is_sorted([1, 2, 3, 4, 5]) ➞ True
    is_sorted([1, 3, 2, 4, 5]) ➞ False
    is_sorted([1, 2, 3, 4, 5, 6]) ➞ True
    is_sorted([1, 2, 3, 4, 5, 6, 7]) ➞ True
    is_sorted([1, 3, 2, 4, 5, 6, 7]) ➞ False
    is_sorted([1, 2, 2, 3, 3, 4]) ➞ True
    is_sorted([1, 2, 2, 2, 3, 4]) ➞ False
    '''

    count_digit = dict([(i, 0) for i in lst])
    for i in lst:
        count_digit[i]+=1
    if any(count_digit[i] > 2 for i in lst):
        return False
    if all(lst[i-1] <= lst[i] for i in range(1, len(lst))):
        return True
    else:
        return False

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


Prompt:
def intersection(interval1, interval2):
    """You are given two intervals,
    where each interval is a pair of integers. For example, interval = (start, end) = (1, 2).
    The given intervals are closed which means that the interval (start, end)
    includes both start and end.
    For each given interval, it is assumed that its start is less or equal its end.
    Your task is to determine whether the length of intersection of these two
    intervals is a prime number.
    Example, the intersection of the intervals (1, 3), (2, 4) is (2, 3)
    which its length is 1, which not a prime number.
    If the length of the intersection is a prime number, return "YES",
    otherwise, return "NO".
    If the two intervals don't intersect, return "NO".

    [input/output] samples:
    intersection((1, 2), (2, 3)) ==> "NO"
    intersection((-1, 1), (0, 4)) ==> "NO"
    intersection((-3, -1), (-5, 5)) ==> "YES"
    """

    def is_prime(num):
        if num == 1 or num == 0:
            return False
        if num == 2:
            return True
        for i in range(2, num):
            if num%i == 0:
                return False
        return True

    l = max(interval1[0], interval2[0])
    r = min(interval1[1], interval2[1])
    length = r - l
    if length > 0 and is_prime(length):
        return "YES"
    return "NO"

def check(candidate):
    assert candidate((1, 2), (2, 3)) == "NO","Test 0"
    assert candidate((-1, 1), (0, 4)) == "NO","Test 1"
    assert candidate((-3, -1), (-5, 5)) == "YES","Test 2"
    assert candidate((-2, 2), (-4, 0)) == "YES","Test 3"
    assert candidate((-11, 2), (-1, -1)) == "NO","Test 4"
    assert candidate((1, 2), (3, 5)) == "NO","Test 5"
    assert candidate((1, 2), (1, 2)) == "NO","Test 6"
    assert candidate((-2, -2), (-3, -2)) == "NO","Test 7"


Prompt:
def prod_signs(arr):
    """
    You are given an array arr of integers and you need to return
    sum of magnitudes of integers multiplied by product of all signs
    of each number in the array, represented by 1, -1 or 0.
    Note: return None for empty arr.

    Example:
    >>> prod_signs([1, 2, 2, -4]) == -9
    >>> prod_signs([0, 1]) == 0
    >>> prod_signs([]) == None
    """

    if not arr: return None
    prod = 0 if 0 in arr else (-1) ** len(list(filter(lambda x: x < 0, arr)))
    return prod * sum([abs(i) for i in arr])

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


Prompt:
def minPath(grid, k):
    """
    Given a grid with N rows and N columns (N >= 2) and a positive integer k,
    each cell of the grid contains a value. Every integer in the range [1, N * N]
    inclusive appears exactly once on the cells of the grid.

    You have to find the minimum path of length k in the grid. You can start
    from any cell, and in each step you can move to any of the neighbor cells,
    in other words, you can go to cells which share an edge with you current
    cell.
    Please note that a path of length k means visiting exactly k cells (not
    necessarily distinct).
    You CANNOT go off the grid.
    A path A (of length k) is considered less than a path B (of length k) if
    after making the ordered lists of the values on the cells that A and B go
    through (let's call them lst_A and lst_B), lst_A is lexicographically less
    than lst_B, in other words, there exist an integer index i (1 <= i <= k)
    such that lst_A[i] < lst_B[i] and for any j (1 <= j < i) we have
    lst_A[j] = lst_B[j].
    It is guaranteed that the answer is unique.
    Return an ordered list of the values on the cells that the minimum path go through.

    Examples:

        Input: grid = [ [1,2,3], [4,5,6], [7,8,9]], k = 3
        Output: [1, 2, 1]

        Input: grid = [ [5,9,3], [4,1,6], [7,8,2]], k = 1
        Output: [1]
    """

    n = len(grid)
    val = n * n + 1
    for i in range(n):
        for j in range(n):
            if grid[i][j] == 1:
                temp = []
                if i != 0:
                    temp.append(grid[i - 1][j])

                if j != 0:
                    temp.append(grid[i][j - 1])

                if i != n - 1:
                    temp.append(grid[i + 1][j])

                if j != n - 1:
                    temp.append(grid[i][j + 1])

                val = min(temp)

    ans = []
    for i in range(k):
        if i % 2 == 0:
            ans.append(1)
        else:
            ans.append(val)
    return ans


Prompt:
def tri(n):
    """Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in
    the last couple centuries. However, what people don't know is Tribonacci sequence.
    Tribonacci sequence is defined by the recurrence:
    tri(1) = 3
    tri(n) = 1 + n / 2, if n is even.
    tri(n) =  tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.
    For example:
    tri(2) = 1 + (2 / 2) = 2
    tri(4) = 3
    tri(3) = tri(2) + tri(1) + tri(4)
           = 2 + 3 + 3 = 8
    You are given a non-negative integer number n, you have to a return a list of the
    first n + 1 numbers of the Tribonacci sequence.
    Examples:
    tri(3) = [1, 3, 2, 8]
    """

    if n == 0:
        return [1]
    my_tri = [1, 3]
    for i in range(2, n + 1):
        if i % 2 == 0:
            my_tri.append(i / 2 + 1)
        else:
            my_tri.append(my_tri[i - 1] + my_tri[i - 2] + (i + 3) / 2)
    return my_tri


Prompt:
def digits(n):
    """Given a positive integer n, return the product of the odd digits.
    Return 0 if all digits are even.
    For example:
    digits(1)  == 1
    digits(4)  == 0
    digits(235) == 15
    """

    product = 1
    odd_count = 0
    for digit in str(n):
        int_digit = int(digit)
        if int_digit%2 == 1:
            product= product*int_digit
            odd_count+=1
    if odd_count ==0:
        return 0
    else:
        return product

def check(candidate):
    assert candidate(5) == 5,"Test 0"
    assert candidate(54) == 5,"Test 1"
    assert candidate(120) ==1,"Test 2"
    assert candidate(5014) == 5,"Test 3"
    assert candidate(98765) == 315,"Test 4"
    assert candidate(5576543) == 2625,"Test 5"
    assert candidate(2468) == 0,"Test 6"


Prompt:
def is_nested(string):
    '''
    Create a function that takes a string as input which contains only square brackets.
    The function should return True if and only if there is a valid subsequence of brackets
    where at least one bracket in the subsequence is nested.

    is_nested('[[]]') ➞ True
    is_nested('[]]]]]]][[[[[]') ➞ False
    is_nested('[][]') ➞ False
    is_nested('[]') ➞ False
    is_nested('[[][]]') ➞ True
    is_nested('[[]][[') ➞ True
    '''

    opening_bracket_index = []
    closing_bracket_index = []
    for i in range(len(string)):
        if string[i] == '[':
            opening_bracket_index.append(i)
        else:
            closing_bracket_index.append(i)
    closing_bracket_index.reverse()
    cnt = 0
    i = 0
    l = len(closing_bracket_index)
    for idx in opening_bracket_index:
        if i < l and idx < closing_bracket_index[i]:
            cnt += 1
            i += 1
    return cnt >= 2

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


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

    """

    import math
    squared = 0
    for i in lst:
        squared += math.ceil(i)**2
    return squared


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

    check = txt.split(' ')[-1]
    return True if len(check) == 1 and (97 <= ord(check.lower()) <= 122) else False

def check(candidate):
    assert candidate("apple") == False,"Test 0"
    assert candidate("apple pi e") == True,"Test 1"
    assert candidate("eeeee") == False,"Test 2"
    assert candidate("A") == True,"Test 3"
    assert candidate("Pumpkin pie ") == False,"Test 4"
    assert candidate("Pumpkin pie 1") == False,"Test 5"
    assert candidate("") == False,"Test 6"
    assert candidate("eeeee e ") == False,"Test 7"
    assert candidate("apple pie") == False,"Test 8"
    assert candidate("apple pi e ") == False,"Test 9"
    assert True,"Test 10"


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.

    Examples:
    can_arrange([1,2,4,3,5]) = 3
    can_arrange([1,2,3]) = -1
    """

    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.

    Examples:
    largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1)
    largest_smallest_integers([]) == (None, None)
    largest_smallest_integers([0]) == (None, 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 ,

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

    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, "2,3") == "2,3", "Test 4"
    assert candidate("5,1", "6") == "6", "Test 5"
    assert candidate("1", "2") == "2", "Test 6"


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
    Example
    is_equal_to_sum_even(4) == False
    is_equal_to_sum_even(6) == False
    is_equal_to_sum_even(8) == True
    """

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

    For example:
    >>> special_factorial(4)
    288

    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 -

    fix_spaces("Example") == "Example"
    fix_spaces("Example 1") == "Example_1"
    fix_spaces(" Example 2") == "_Example_2"
    fix_spaces(" Example   3") == "_Example-3"
    """

    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']
    Examples:
    file_name_check("example.txt") # => 'Yes'
    file_name_check("1example.dll") # => 'No' (the name should start with a latin alphapet letter)
    """

    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.

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

    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.

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

    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.

    simplify("1/5", "5/1") = True
    simplify("1/6", "2/1") = False
    simplify("7/10", "10/2") = False
    """

    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", "5/1") == True, "Test 0"
    assert candidate("1/6", "2/1") == False, "Test 1"
    assert candidate("5/1", "3/1") == True, "Test 2"
    assert candidate("7/10", "10/2") == False, "Test 3"
    assert candidate("2/10", "50/10") == True, "Test 4"
    assert candidate("7/2", "4/2") == True, "Test 5"


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.

    For example:
    >>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
    >>> order_by_points([]) == []
    """

    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).
    For example:
    specialFilter([15, -73, 14, -15]) => 1
    specialFilter([33, -2, -3, 45, 21, 109]) => 2
    """

    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.

    Example :
        Input: n = 5
        Output: 1
        Explanation:
        a = [1, 3, 7, 13, 21]
        The only valid triple is (1, 7, 13).
    """

    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.
    Examples
    bf("Jupiter", "Neptune") ==> ("Saturn", "Uranus")
    bf("Earth", "Mercury") ==> ("Venus")
    bf("Mercury", "Uranus") ==> ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
    '''

    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.
    For example:
    assert list_sort(["aa", "a", "aaa"]) => ["aa"]
    assert list_sort(["ab", "a", "aaa", "cd"]) => ["ab", "cd"]
    """

    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.

    Examples:
    for x_or_y(7, 34, 12) == 34
    for x_or_y(15, 8, 5) == 5

    """

    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.

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

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.

    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]
    """

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).
    Example:
    for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'
    """

    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
    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

    """

    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  candidate("xyzw","xyw") == False , "Test 0"
    assert  candidate("yello","ell") == True , "Test 1"
    assert  candidate("whattup","ptut") == False , "Test 3"
    assert  candidate("efef","fee") == True , "Test 4"
    assert  candidate("abab","Test 4"
    assert  candidate("abab","aabb") == False ,"Test 5"
    assert  candidate("winemtt","tinem") == True , "Test 6"


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

    Examples:
    >>> int_to_mini_roman(19) == 'xix'
    >>> int_to_mini_roman(152) == 'clii'
    >>> int_to_mini_roman(426) == 'cdxxvi'
    """

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.
    Example:
    right_angle_triangle(3, 4, 5) == True
    right_angle_triangle(1, 2, 3) == False
    '''

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.

    find_max(["name", "of", "string"]) == "string"
    find_max(["name", "enam", "game"]) == "enam"
    find_max(["aaaaaaa", "bb" ,"cc"]) == ""aaaaaaa"
    """

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.

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

    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.

    """

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


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

    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.

    >>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'
    """

    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.

    For example:
    generate_integers(2, 8) => [2, 4, 6, 8]
    generate_integers(8, 2) => [2, 4, 6, 8]
    generate_integers(10, 14) => []
    """

    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"