Prompt:
from typing import List

def has_close_elements(numbers: List[float], threshold: float) -> bool:
    """ Check if in given list of numbers, are any two numbers closer to each other than
    given threshold. """

    for idx, elem in enumerate(numbers):
        for idx2, elem2 in enumerate(numbers):
            if idx != idx2:
                distance = abs(elem - elem2)
                if distance < threshold:
                    return True

    return False


Prompt:
from typing import List

def separate_paren_groups(paren_string: str) -> List[str]:
    """ Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
    separate those group into separate strings and return the list of those.
    Separate groups are balanced (each open brace is properly closed) and not nested within each other
    Ignore any spaces in the input string. """

    result = []
    current_string = []
    current_depth = 0

    for c in paren_string:
        if c == '(':
            current_depth += 1
            current_string.append(c)
        elif c == ')':
            current_depth -= 1
            current_string.append(c)

            if current_depth == 0:
                result.append(''.join(current_string))
                current_string.clear()

    return result


Prompt:
def truncate_number(number: float) -> float:
    """ Given a positive floating point number, it can be decomposed into
    and integer part (largest integer smaller than given number) and decimals
    (leftover part always smaller than 1).

    Return the decimal part of the number. """

def check(candidate):
    assert candidate(3.5) == 0.5,"Test 0"
    assert abs(candidate(1.33) - 0.33) < 1e-6,"Test 1"
    assert abs(candidate(123.456) - 0.456) < 1e-6,"Test 2"


Prompt:
from typing import List

def below_zero(operations: List[int]) -> bool:
    """ You're given a list of deposit and withdrawal operations on a bank account that starts with
    zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
    at that point function should return True. Otherwise it should return False. """

    balance = 0

    for op in operations:
        balance += op
        if balance < 0:
            return True

    return False

def check(candidate):
    assert candidate([]) == False,"Test 0"
    assert candidate([1, 2, -3, 1, 2, -3]) == False,"Test 1"
    assert candidate([1, 2, -4, 5, 6]) == True,"Test 2"
    assert candidate([1, -1, 2, -2, 5, -5, 4, -4]) == False,"Test 3"
    assert candidate([1, -1, 2, -2, 5, -5, 4, -5]) == True,"Test 4"
    assert candidate([1, -2, 2, -2, 5, -5, 4, -4]) == True,"Test 5"


Prompt:
from typing import List

def mean_absolute_deviation(numbers: List[float]) -> float:
    """ For a given list of input numbers, calculate Mean Absolute Deviation
    around the mean of this dataset.
    Mean Absolute Deviation is the average absolute difference between each
    element and a centerpoint (mean in this case):
    MAD = average | x - x_mean | """

    mean = sum(numbers) / len(numbers)
    return sum(abs(x - mean) for x in numbers) / len(numbers)


Prompt:
from typing import List

def intersperse(numbers: List[int], delimeter: int) -> List[int]:
    """ Insert a number 'delimeter' between every two consecutive elements of input list `numbers' """

    if not numbers:
        return []

    result = []

    for n in numbers[:-1]:
        result.append(n)
        result.append(delimeter)

    result.append(numbers[-1])

    return result


Prompt:
from typing import List

def parse_nested_parens(paren_string: str) -> List[int]:
    """ Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
    For each of the group, output the deepest level of nesting of parentheses.
    E.g. (()()) has maximum two levels of nesting while ((())) has three. """

    def parse_paren_group(s):
        depth = 0
        max_depth = 0
        for c in s:
            if c == '(':
                depth += 1
                max_depth = max(depth, max_depth)
            else:
                depth -= 1

        return max_depth

    return [parse_paren_group(x) for x in paren_string.split(' ') if x]


Prompt:
from typing import List

def filter_by_substring(strings: List[str], substring: str) -> List[str]:
    """ Filter an input list of strings only for ones that contain given substring """

return [x for x in strings if substring in x]

def check(candidate):
    assert candidate([], 'john') == [],"Test 0"
    assert candidate(['xxx', 'asd', 'xxy', 'john doe', 'xxxAAA', 'xxx'], 'xxx') == ['xxx', 'xxxAAA', 'xxx'],"Test 1"
    assert candidate(['xxx', 'asd', 'aaaxxy', 'john doe', 'xxxAAA', 'xxx'], 'xx') == ['xxx', 'aaaxxy', 'xxxAAA', 'xxx'],"Test 2"
    assert candidate(['grunt', 'trumpet', 'prune', 'gruesome'], 'run') == ['grunt', 'prune'],"Test 3"


Prompt:
from typing import List, Tuple

def sum_product(numbers: List[int]) -> Tuple[int, int]:
    """ For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.
    Empty sum should be equal to 0 and empty product should be equal to 1. """

    sum_value = 0
    prod_value = 1

    for n in numbers:
        sum_value += n
        prod_value *= n
    return sum_value, prod_value

def check(candidate):
    assert candidate([]) == (0, 1),"Test 0"
    assert candidate([1, 1, 1]) == (3, 1),"Test 1"
    assert candidate([100, 0]) == (100, 0),"Test 2"
    assert candidate([3, 5, 7]) == (3 + 5 + 7, 3 * 5 * 7),"Test 3"
    assert candidate([10]) == (10, 10),"Test 4"


Prompt:
from typing import List, Tuple

def rolling_max(numbers: List[int]) -> List[int]:
    """ From a given list of integers, generate a list of rolling maximum element found until given moment
    in the sequence. """

    running_max = None
    result = []

    for n in numbers:
        if running_max is None:
            running_max = n
        else:
            running_max = max(running_max, n)

        result.append(running_max)

    return result


Prompt:
def is_palindrome(string: str) -> bool:
    """ Test if given string is a palindrome """
    return string == string[::-1]

def make_palindrome(string: str) -> str:
    """ Find the shortest palindrome that begins with a supplied string.
    Algorithm idea is simple:
    - Find the longest postfix of supplied string that is a palindrome.
    - Append to the end of the string reverse of a string prefix that comes before the palindromic suffix. """

    if not string:
        return ''

    beginning_of_suffix = 0

    while not is_palindrome(string[beginning_of_suffix:]):
        beginning_of_suffix += 1

    return string + string[:beginning_of_suffix][::-1]

def check(candidate):
    assert candidate('') == '',"Test 0"
    assert candidate('x') == 'x',"Test 1"
    assert candidate('xyz') == 'xyzyx',"Test 2"
    assert candidate('xyx') == 'xyx',"Test 3"
    assert candidate('jerry') == 'jerryrrej',"Test 4"


Prompt:
from typing import List

def string_xor(a: str, b: str) -> str:
    """ Input are two strings a and b consisting only of 1s and 0s.
    Perform binary XOR on these inputs and return result also as a string. """

    def xor(i, j):
        if i == j:
            return '0'
        else:
            return '1'

    return ''.join(xor(x, y) for x, y in zip(a, b))


Prompt:
from typing import List, Optional

def longest(strings: List[str]) -> Optional[str]:
    """ Out of list of strings, return the longest one. Return the first one in case of multiple
    strings of the same length. Return None in case the input list is empty. """

    if not strings:
        return None

    maxlen = max(len(x) for x in strings)
    for s in strings:
        if len(s) == maxlen:
            return s

def check(candidate):
    assert candidate([]) == None,"Test 0"
    assert candidate(['x', 'y', 'z']) == 'x',"Test 1"
    assert candidate(['x', 'yyy', 'zzzz', 'www', 'kkkk', 'abc']) == 'zzzz',"Test 2"


Prompt:
def greatest_common_divisor(a: int, b: int) -> int:
    """ Return a greatest common divisor of two integers a and b """

    while b:
        a, b = b, a % b
    return a

def check(candidate):
    assert candidate(3, 7) == 1,"Test 0"
    assert candidate(10, 15) == 5,"Test 1"
    assert candidate(49, 14) == 7,"Test 2"
    assert candidate(144, 60) == 12,"Test 3"


Prompt:
from typing import List

def all_prefixes(string: str) -> List[str]:
    """ Return list of all prefixes from shortest to longest of the input string """

    result = []

    for i in range(len(string)):
        result.append(string[:i+1])
    return result

def check(candidate):
    assert candidate('') == [],"Test 0"
    assert candidate('asdfgh') == ['a', 'as', 'asd', 'asdf', 'asdfg', 'asdfgh'],"Test 1"
    assert candidate('WWW') == ['W', 'WW', 'WWW'],"Test 2"


Prompt:
def string_sequence(n: int) -> str:
    """ Return a string containing space-delimited numbers starting from 0 upto n inclusive. """

return ' '.join([str(x) for x in range(n + 1)])

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


Prompt:
def count_distinct_characters(string: str) -> int:
    """ Given a string, find out how many distinct characters (regardless of case) does it consist of """

def check(candidate):
    assert candidate('') == 0,"Test 0"
    assert candidate('abcde') == 5,"Test 1"
    assert candidate('abcde' + 'cade' + 'CADE') == 5,"Test 2"
    assert candidate('aaaaAAAAaaaa') == 1,"Test 3"
    assert candidate('Jerry jERRY JeRRRY') == 5,"Test 4"


Prompt:
from typing import List

def parse_music(music_string: str) -> List[int]:
    """ Input to this function is a string representing musical notes in a special ASCII format.
    Your task is to parse this string and return list of integers corresponding to how many beats does each
    not last.

    Here is a legend:
    'o' - whole note, lasts four beats
    'o|' - half note, lasts two beats
    '.|' - quater note, lasts one beat """

    note_map = {'o': 4, 'o|': 2, '.|': 1}
    return [note_map[x] for x in music_string.split(' ') if x]


Prompt:
def how_many_times(string: str, substring: str) -> int:
    """ Find how many times a given substring can be found in the original string. Count overlaping cases. """

    times = 0

    for i in range(len(string) - len(substring) + 1):
        if string[i:i+len(substring)] == substring:
            times += 1

    return times

def check(candidate):
    assert candidate('', 'x') == 0,"Test 0"
    assert candidate('xyxyxyx', 'x') == 4,"Test 1"
    assert candidate('cacacacac', 'cac') == 4,"Test 2"
    assert candidate('john doe', 'john') == 1,"Test 3"


Prompt:
from typing import List

def sort_numbers(numbers: str) -> str:
    """ Input is a space-delimited string of numberals from 'zero' to 'nine'.
    Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
    Return the string with numbers sorted from smallest to largest """

    value_map = {
        'zero': 0,
        'one': 1,
        'two': 2,
        'three': 3,
        'four': 4,
        'five': 5,
        'six': 6,
        'seven': 7,
        'eight': 8,
        'nine': 9
    }
    return ' '.join(sorted([x for x in numbers.split(' ') if x], key=lambda x: value_map[x]))

def check(candidate):
    assert candidate('') == '',"Test 0"
    assert candidate('three') == 'three',"Test 1"
    assert candidate('three five nine') == 'three five nine',"Test 2"
    assert candidate('five zero four seven nine eight') == 'zero four five seven eight nine',"Test 3"
    assert candidate('six five four three two one zero') == 'zero one two three four five six',"Test 4"


Prompt:
from typing import List, Tuple

def find_closest_elements(numbers: List[float]) -> Tuple[float, float]:
    """ From a supplied list of numbers (of length at least two) select and return two that are the closest to each
    other and return them in order (smaller number, larger number). """

    closest_pair = None
    distance = None

    for idx, elem in enumerate(numbers):
        for idx2, elem2 in enumerate(numbers):
            if idx != idx2:
                if distance is None:
                    distance = abs(elem - elem2)
                    closest_pair = tuple(sorted([elem, elem2]))
                else:
                    new_distance = abs(elem - elem2)
                    if new_distance < distance:
                        distance = new_distance
                        closest_pair = tuple(sorted([elem, elem2]))

    return closest_pair


Prompt:
from typing import List

def rescale_to_unit(numbers: List[float]) -> List[float]:
    """ Given list of numbers (of at least two elements), apply a linear transform to that list,
    such that the smallest number will become 0 and the largest will become 1 """

    min_number = min(numbers)
    max_number = max(numbers)
    return [(x - min_number) / (max_number - min_number) for x in numbers]


Prompt:
from typing import List, Any

def filter_integers(values: List[Any]) -> List[int]:
    """ Filter given list of any python values only for integers """

return [x for x in values if isinstance(x, int)]

def check(candidate):
    assert candidate([]) == [],"Test 0"
    assert candidate([4, {}, [], 23.2, 9, 'adasd']) == [4, 9],"Test 1"
    assert candidate([3, 'c', 3, 3, 'a', 'b']) == [3, 3, 3],"Test 2"


Prompt:
def strlen(string: str) -> int:
    """ Return length of given string """

def check(candidate):
    assert candidate('') == 0,"Test 0"
    assert candidate('x') == 1,"Test 1"
    assert candidate('asdasnakj') == 9,"Test 2"


Prompt:
def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n """

    for i in reversed(range(n)):
        if n % i == 0:
            return i

def check(candidate):
    assert candidate(3) == 1,"Test 0"
    assert candidate(7) == 1,"Test 1"
    assert candidate(10) == 5,"Test 2"
    assert candidate(100) == 50,"Test 3"
    assert candidate(49) == 7,"Test 4"


Prompt:
from typing import List

def factorize(n: int) -> List[int]:
    """ Return list of prime factors of given integer in the order from smallest to largest.
    Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.
    Input number should be equal to the product of all factors """

    import math
    fact = []
    i = 2
    while i <= int(math.sqrt(n) + 1):
        if n % i == 0:
            fact.append(i)
            n //= i
        else:
            i += 1

    if n > 1:
        fact.append(n)
    return fact


Prompt:
from typing import List

def remove_duplicates(numbers: List[int]) -> List[int]:
    """ From a list of integers, remove all elements that occur more than once.
    Keep order of elements left the same as in the input. """

    import collections
    c = collections.Counter(numbers)
    return [n for n in numbers if c[n] <= 1]

def check(candidate):
    assert candidate([]) == [],"Test 0"
    assert candidate([1, 2, 3, 4]) == [1, 2, 3, 4],"Test 1"
    assert candidate([1, 2, 3, 2, 4, 3, 5]) == [1, 4, 5],"Test 2"


Prompt:
def flip_case(string: str) -> str:
    """ For a given string, flip lowercase characters to uppercase and uppercase to lowercase. """

def check(candidate):
    assert candidate('') == '',"Test 0"
    assert candidate('Hello!') == 'hELLO!',"Test 1"
    assert candidate('These violent delights have violent ends') == 'tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS',"Test 2"


Prompt:
from typing import List

def concatenate(strings: List[str]) -> str:
    """ Concatenate list of strings into a single string """

def check(candidate):
    assert candidate([]) == '',"Test 0"
    assert candidate(['x', 'y', 'z']) == 'xyz',"Test 1"
    assert candidate(['x', 'y', 'z', 'w', 'k']) == 'xyzwk',"Test 2"


Prompt:
from typing import List

def filter_by_prefix(strings: List[str], prefix: str) -> List[str]:
    """ Filter an input list of strings only for ones that start with a given prefix. """

return [x for x in strings if x.startswith(prefix)]

def check(candidate):
    assert candidate([], 'john') == [],"Test 0"
    assert candidate(['xxx', 'asd', 'xxy', 'john doe', 'xxxAAA', 'xxx'], 'xxx') == ['xxx', 'xxxAAA', 'xxx'],"Test 1"


Prompt:
def get_positive(l: list):
    """Return only positive numbers in the list. """


Prompt:
def is_prime(n):
    """Return true if a given number is prime, and false otherwise. """

    if n < 2:
        return False
    for k in range(2, n - 1):
        if n % k == 0:
            return False
    return True

def check(candidate):
    assert candidate(6) == False,"Test 0"
    assert candidate(101) == True,"Test 1"
    assert candidate(11) == True,"Test 2"
    assert candidate(13441) == True,"Test 3"
    assert candidate(61) == True,"Test 4"
    assert candidate(4) == False,"Test 5"
    assert candidate(1) == False,"Test 6"
    assert candidate(5) == True,"Test 7"
    assert candidate(11) == True,"Test 8"
    assert candidate(17) == True,"Test 9"
    assert candidate(5 * 17) == False,"Test 10"
    assert candidate(11 * 7) == False,"Test 11"
    assert candidate(13441 * 19) == False,"Test 12"


Prompt:
import math

def poly(xs: list, x: float):
    """
    Evaluates polynomial with coefficients xs at point x.
    return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n
    """
    return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])

def find_zero(xs: list):
    """ xs are coefficients of a polynomial.
    find_zero find x such that poly(x) = 0.
    find_zero returns only only zero point, even if there are many.
    Moreover, find_zero only takes list xs having even number of coefficients
    and largest non zero coefficient as it guarantees
    a solution. """

    begin, end = -1., 1.
    while poly(xs, begin) * poly(xs, end) > 0:
        begin *= 2.0
        end *= 2.0
    while end - begin > 1e-10:
        center = (begin + end) / 2.0
        if poly(xs, center) * poly(xs, begin) > 0:
            begin = center
        else:
            end = center
    return begin

def check(candidate):
        assert math.fabs(poly(coeffs, solution)) < 1e-4,"Test 0"


Prompt:
def sort_third(l: list):
    """This function takes a list l and returns a list l' such that
    l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
    to the values of the corresponding indicies of l, but sorted. """

    l = list(l)
    l[::3] = sorted(l[::3])
    return l


Prompt:
def unique(l: list):
    """Return sorted unique elements in a list. """


Prompt:
def max_element(l: list):
    """Return maximum element in the list. """

    m = l[0]
    for e in l:
        if e > m:
            m = e
    return m


Prompt:
def fizz_buzz(n: int):
    """Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13. """

    ns = []
    for i in range(n):
        if i % 11 == 0 or i % 13 == 0:
            ns.append(i)
    s = ''.join(list(map(str, ns)))
    ans = 0
    for c in s:
        ans += (c == '7')
    return ans

def check(candidate):
    assert candidate(50) == 0,"Test 0"
    assert candidate(78) == 2,"Test 1"
    assert candidate(79) == 3,"Test 2"
    assert candidate(100) == 3,"Test 3"
    assert candidate(200) == 6,"Test 4"
    assert candidate(4000) == 192,"Test 5"
    assert candidate(10000) == 639,"Test 6"
    assert candidate(100000) == 8026,"Test 7"


Prompt:
def sort_even(l: list):
    """This function takes a list l and returns a list l' such that
    l' is identical to l in the odd indicies, while its values at the even indicies are equal
    to the values of the even indicies of l, but sorted. """

    evens = l[::2]
    odds = l[1::2]
    evens.sort()
    ans = []
    for e, o in zip(evens, odds):
        ans.extend([e, o])
    if len(evens) > len(odds):
        ans.append(evens[-1])
    return ans


Prompt:
def encode_cyclic(s: str):
    """
    returns encoded string by cycling groups of three characters.
    """
    # split string to groups. Each of length 3.
    groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]
    # cycle elements in each group. Unless group has fewer elements than 3.
    groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]
    return "".join(groups)

def decode_cyclic(s: str):
    """
    takes as input string encoded with encode_cyclic function. Returns decoded string.
    """

def check(candidate):
        assert candidate(encoded_str) == str,"Test 0"


Prompt:
def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime. """

    import math

    def is_prime(p):
        if p < 2:
            return False
        for k in range(2, min(int(math.sqrt(p)) + 1, p - 1)):
            if p % k == 0:
                return False
        return True
    f = [0, 1]
    while True:
        f.append(f[-1] + f[-2])
        if is_prime(f[-1]):
            n -= 1
        if n == 0:
            return f[-1]

def check(candidate):
    assert candidate(1) == 2,"Test 0"
    assert candidate(2) == 3,"Test 1"
    assert candidate(3) == 5,"Test 2"
    assert candidate(4) == 13,"Test 3"
    assert candidate(5) == 89,"Test 4"
    assert candidate(6) == 233,"Test 5"
    assert candidate(7) == 1597,"Test 6"
    assert candidate(8) == 28657,"Test 7"
    assert candidate(9) == 514229,"Test 8"
    assert candidate(10) == 433494437,"Test 9"


Prompt:
def triples_sum_to_zero(l: list):
    """
    triples_sum_to_zero takes a list of integers as an input.
    it returns True if there are three distinct elements in the list that
    sum to zero, and False otherwise. """

    for i in range(len(l)):
        for j in range(i + 1, len(l)):
            for k in range(j + 1, len(l)):
                if l[i] + l[j] + l[k] == 0:
                    return True
    return False

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


Prompt:
def car_race_collision(n: int):
    """
    Imagine a road that's a perfectly straight infinitely long line.
    n cars are driving left to right;  simultaneously, a different set of n cars
    are driving right to left.   The two sets of cars start out being very far from
    each other.  All cars move in the same speed.  Two cars are said to collide
    when a car that's moving left to right hits a car that's moving right to left.
    However, the cars are infinitely sturdy and strong; as a result, they continue moving
    in their trajectory as if they did not collide.

    This function outputs the number of such collisions.
    """

def check(candidate):
    assert candidate(2) == 4,"Test 0"
    assert candidate(3) == 9,"Test 1"
    assert candidate(4) == 16,"Test 2"
    assert candidate(8) == 64,"Test 3"
    assert candidate(10) == 100,"Test 4"


Prompt:
def incr_list(l: list):
    """Return list with elements incremented by 1. """


Prompt:
def pairs_sum_to_zero(l):
    """
    pairs_sum_to_zero takes a list of integers as an input.
    it returns True if there are two distinct elements in the list that
    sum to zero, and False otherwise. """

    for i, l1 in enumerate(l):
        for j in range(i + 1, len(l)):
            if l1 + l[j] == 0:
                return True
    return False

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


Prompt:
def change_base(x: int, base: int):
    """Change numerical base of input number x to base.
    return string representation after the conversion.
    base numbers are less than 10. """

    ret = ""
    while x > 0:
        ret = str(x % base) + ret
        x //= base
    return ret

def check(candidate):
    assert candidate(8, 3) == "22","Test 0"
    assert candidate(9, 3) == "100","Test 1"
    assert candidate(234, 2) == "11101010","Test 2"
    assert candidate(16, 2) == "10000","Test 3"
    assert candidate(8, 2) == "1000","Test 4"
    assert candidate(7, 2) == "111","Test 5"


Prompt:
def triangle_area(a, h):
    """Given length of a side and high return area for a triangle. """

def check(candidate):
    assert candidate(5, 3) == 7.5,"Test 0"
    assert candidate(2, 2) == 2.0,"Test 1"
    assert candidate(10, 8) == 40.0,"Test 2"


Prompt:
def fib4(n: int):
    """The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
    fib4(0) -> 0
    fib4(1) -> 0
    fib4(2) -> 2
    fib4(3) -> 0
    fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
    Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion. """

    results = [0, 0, 2, 0]
    if n < 4:
        return results[n]

    for _ in range(4, n + 1):
        results.append(results[-1] + results[-2] + results[-3] + results[-4])
        results.pop(0)

    return results[-1]

def check(candidate):
    assert candidate(5) == 4,"Test 0"
    assert candidate(8) == 28,"Test 1"
    assert candidate(10) == 104,"Test 2"
    assert candidate(12) == 386,"Test 3"


Prompt:
def median(l: list):
    """Return median of elements in the list l. """

    l = sorted(l)
    if len(l) % 2 == 1:
        return l[len(l) // 2]
    else:
        return (l[len(l) // 2 - 1] + l[len(l) // 2]) / 2.0

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


Prompt:
def is_palindrome(text: str):
    """
    Checks if given string is a palindrome """

    for i in range(len(text)):
        if text[i] != text[len(text) - 1 - i]:
            return False
    return True

def check(candidate):
    assert candidate('') == True,"Test 0"
    assert candidate('aba') == True,"Test 1"
    assert candidate('aaaaa') == True,"Test 2"
    assert candidate('zbcd') == False,"Test 3"
    assert candidate('xywyx') == True,"Test 4"
    assert candidate('xywyz') == False,"Test 5"
    assert candidate('xywzx') == False,"Test 6"


Prompt:
def modp(n: int, p: int):
    """Return 2^n modulo p (be aware of numerics). """

    ret = 1
    for i in range(n):
        ret = (2 * ret) % p
    return ret

def check(candidate):
    assert candidate(3, 5) == 3,"Test 0"
    assert candidate(1101, 101) == 2,"Test 1"
    assert candidate(0, 101) == 1,"Test 2"
    assert candidate(3, 11) == 8,"Test 3"
    assert candidate(100, 101) == 1,"Test 4"
    assert candidate(30, 5) == 4,"Test 5"
    assert candidate(31, 5) == 3,"Test 6"


Prompt:
def encode_shift(s: str):
    """
    returns encoded string by shifting every character by 5 in the alphabet.
    """
    return "".join([chr(((ord(ch) + 5 - ord("a")) % 26) + ord("a")) for ch in s])

def decode_shift(s: str):
    """
    takes as input string encoded with encode_shift function. Returns decoded string.
    """

return "".join([chr(((ord(ch) - 5 - ord("a")) % 26) + ord("a")) for ch in s])

def check(candidate):
        assert candidate(copy.deepcopy(encoded_str)) == str,"Test 0"


Prompt:
def remove_vowels(text):
    """
    remove_vowels is a function that takes string and returns string without vowels. """

return "".join([s for s in text if s.lower() not in ["a", "e", "i", "o", "u"]])

def check(candidate):
    assert candidate('') == '',"Test 0"
    assert candidate("abcdef\nghijklm") == 'bcdf\nghjklm',"Test 1"
    assert candidate('fedcba') == 'fdcb',"Test 2"
    assert candidate('eeeee') == '',"Test 3"
    assert candidate('acBAA') == 'cB',"Test 4"
    assert candidate('EcBOO') == 'cB',"Test 5"
    assert candidate('ybcd') == 'ybcd',"Test 6"


Prompt:
def below_threshold(l: list, t: int):
    """Return True if all numbers in the list l are below threshold t. """

    for e in l:
        if e >= t:
            return False
    return True

def check(candidate):
    assert candidate([1, 2, 4, 10], 100),"Test 0"
    assert not candidate([1, 20, 4, 10], 5),"Test 1"
    assert candidate([1, 20, 4, 10], 21),"Test 2"
    assert candidate([1, 20, 4, 10], 22),"Test 3"
    assert candidate([1, 8, 4, 10], 11),"Test 4"
    assert not candidate([1, 8, 4, 10], 10),"Test 5"


Prompt:
def add(x: int, y: int):
    """Add two numbers x and y. """

def check(candidate):
    assert candidate(0, 1) == 1,"Test 0"
    assert candidate(1, 0) == 1,"Test 1"
    assert candidate(2, 3) == 5,"Test 2"
    assert candidate(5, 7) == 12,"Test 3"
    assert candidate(7, 5) == 12,"Test 4"


Prompt:
def same_chars(s0: str, s1: str):
    """
    Check if two words have the same characters. """

def check(candidate):
    assert candidate('eabcdzzzz', 'dddzzzzzzzddeddabc') == True,"Test 0"
    assert candidate('abcd', 'dddddddabc') == True,"Test 1"
    assert candidate('dddddddabc', 'abcd') == True,"Test 2"
    assert candidate('eabcd', 'dddddddabc') == False,"Test 3"
    assert candidate('abcd', 'dddddddabcf') == False,"Test 4"
    assert candidate('eabcdzzzz', 'dddzzzzzzzddddabc') == False,"Test 5"
    assert candidate('aabb', 'aaccc') == False,"Test 6"


Prompt:
def fib(n: int):
    """Return n-th Fibonacci number. """

    if n == 0:
        return 0
    if n == 1:
        return 1
    return fib(n - 1) + fib(n - 2)

def check(candidate):
    assert candidate(10) == 55,"Test 0"
    assert candidate(1) == 1,"Test 1"
    assert candidate(8) == 21,"Test 2"
    assert candidate(11) == 89,"Test 3"
    assert candidate(12) == 144,"Test 4"


Prompt:
def correct_bracketing(brackets: str):
    """ brackets is a string of "<" and ">".
    return True if every opening bracket has a corresponding closing bracket. """

    depth = 0
    for b in brackets:
        if b == "<":
            depth += 1
        else:
            depth -= 1
        if depth < 0:
            return False
    return depth == 0

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


Prompt:
def monotonic(l: list):
    """Return True is list elements are monotonically increasing or decreasing. """

    if l == sorted(l) or l == sorted(l, reverse=True):
        return True
    return False

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


Prompt:
def common(l1: list, l2: list):
    """Return sorted unique common elements for two lists. """

    ret = set()
    for e1 in l1:
        for e2 in l2:
            if e1 == e2:
                ret.add(e1)
    return sorted(list(ret))


Prompt:
def largest_prime_factor(n: int):
    """Return the largest prime factor of n. Assume n > 1 and is not a prime. """

    def is_prime(k):
        if k < 2:
            return False
        for i in range(2, k - 1):
            if k % i == 0:
                return False
        return True
    largest = 1
    for j in range(2, n + 1):
        if n % j == 0 and is_prime(j):
            largest = max(largest, j)
    return largest

def check(candidate):
    assert candidate(15) == 5,"Test 0"
    assert candidate(27) == 3,"Test 1"
    assert candidate(63) == 7,"Test 2"
    assert candidate(330) == 11,"Test 3"
    assert candidate(13195) == 29,"Test 4"


Prompt:
def sum_to_n(n: int):
    """sum_to_n is a function that sums numbers from 1 to n. """

def check(candidate):
    assert candidate(1) == 1,"Test 0"
    assert candidate(6) == 21,"Test 1"
    assert candidate(11) == 66,"Test 2"
    assert candidate(30) == 465,"Test 3"
    assert candidate(100) == 5050,"Test 4"


Prompt:
def correct_bracketing(brackets: str):
    """ brackets is a string of "(" and ")".
    return True if every opening bracket has a corresponding closing bracket. """

    depth = 0
    for b in brackets:
        if b == "(":
            depth += 1
        else:
            depth -= 1
        if depth < 0:
            return False
    return depth == 0

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


Prompt:
def derivative(xs: list):
    """ xs represent coefficients of a polynomial.
    xs[0] + xs[1] * x + xs[2] * x^2 + ....
     Return derivative of this polynomial in the same form. """

return [(i * x) for i, x in enumerate(xs)][1:]


Prompt:
def fibfib(n: int):
    """The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
    fibfib(0) == 0
    fibfib(1) == 0
    fibfib(2) == 1
    fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
    Please write a function to efficiently compute the n-th element of the fibfib number sequence. """

    if n == 0:
        return 0
    if n == 1:
        return 0
    if n == 2:
        return 1
    return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3)

def check(candidate):
    assert candidate(2) == 1,"Test 0"
    assert candidate(1) == 0,"Test 1"
    assert candidate(5) == 4,"Test 2"
    assert candidate(8) == 24,"Test 3"
    assert candidate(10) == 81,"Test 4"
    assert candidate(12) == 274,"Test 5"
    assert candidate(14) == 927,"Test 6"


Prompt:
FIX = """
Add more test cases.
"""

def vowels_count(s):
    """Write a function vowels_count which takes a string representing
    a word as input and returns the number of vowels in the string.
    Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
    vowel, but only when it is at the end of the given word. """

    vowels = "aeiouAEIOU"
    n_vowels = sum(c in vowels for c in s)
    if s[-1] == 'y' or s[-1] == 'Y':
        n_vowels += 1
    return n_vowels

def check(candidate):
    assert candidate("abcde") == 2, "Test 1"
    assert candidate("Alone") == 3, "Test 2"
    assert candidate("key") == 2, "Test 3"
    assert candidate("bye") == 1, "Test 4"
    assert candidate("keY") == 2, "Test 5"
    assert candidate("bYe") == 1, "Test 6"
    assert candidate("ACEDY") == 3, "Test 7"
    assert True,"Test 7"


Prompt:
def circular_shift(x, shift):
    """Circular shift the digits of the integer x, shift the digits right by shift
    and return the result as a string.
    If shift > number of digits, return digits reversed. """

    s = str(x)
    if shift > len(s):
        return s[::-1]
    else:
        return s[len(s) - shift:] + s[:len(s) - shift]

def check(candidate):
    assert candidate(100, 2) == "001","Test 0"
    assert candidate(12, 2) == "12","Test 1"
    assert candidate(97, 8) == "79","Test 2"
    assert candidate(12, 1) == "21","Test 3"
    assert candidate(11, 101) == "11","Test 4"


Prompt:
def digitSum(s):
    """Task
    Write a function that takes a string as input and returns the sum of the upper characters only'
    ASCII codes. """

    if s == "": return 0
    return sum(ord(char) if char.isupper() else 0 for char in s)

def check(candidate):
    assert True,"Test 0"
    assert candidate("") == 0,"Test 1"
    assert candidate("abAB") == 131,"Test 2"
    assert candidate("abcCd") == 67,"Test 3"
    assert candidate("helloE") == 69,"Test 4"
    assert candidate("woArBld") == 131,"Test 5"
    assert candidate("aAaaaXa") == 153,"Test 6"
    assert True,"Test 7"
    assert candidate(" How are yOu?") == 151,"Test 8"
    assert candidate("You arE Very Smart") == 327,"Test 9"


Prompt:
def fruit_distribution(s,n):
    """
    In this task, you will be given a string that represents a number of apples and oranges
    that are distributed in a basket of fruit this basket contains
    apples, oranges, and mango fruits. Given the string that represents the total number of
    the oranges and apples and an integer that represent the total number of the fruits
    in the basket return the number of the mango fruits in the basket.
    for examble:
    fruit_distribution("5 apples and 6 oranges", 19) ->19 - 5 - 6 = 8
    fruit_distribution("0 apples and 1 oranges",3) -> 3 - 0 - 1 = 2
    fruit_distribution("2 apples and 3 oranges", 100) -> 100 - 2 - 3 = 95
    fruit_distribution("100 apples and 1 oranges",120) -> 120 - 100 - 1 = 19
    """

    lis = list()
    for i in s.split(' '):
        if i.isdigit():
            lis.append(int(i))
    return n - sum(lis)

def check(candidate):
    assert candidate("5 apples and 6 oranges",19) == 8,"Test 0"
    assert candidate("5 apples and 6 oranges",21) == 10,"Test 1"
    assert candidate("0 apples and 1 oranges",3) == 2,"Test 2"
    assert candidate("1 apples and 0 oranges",3) == 2,"Test 3"
    assert candidate("2 apples and 3 oranges",100) == 95,"Test 4"
    assert candidate("2 apples and 3 oranges",5) == 0,"Test 5"
    assert candidate("1 apples and 100 oranges",120) == 19,"Test 6"


Prompt:
def pluck(arr):
    """
    "Given an array representing a branch of a tree that has non-negative integer nodes
    your task is to pluck one of the nodes and return it.
    The plucked node should be the node with the smallest even value.
    If multiple nodes with the same smallest even value are found return the node that has smallest index.

    The plucked node should be returned in a list, [ smalest_value, its index ],
    If there are no even values or the given array is empty, return []. """

    if(len(arr) == 0): return []
    evens = list(filter(lambda x: x%2 == 0, arr))
    if(evens == []): return []
    return [min(evens), arr.index(min(evens))]

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


Prompt:
def search(lst):
    '''
    You are given a non-empty list of positive integers. Return the greatest integer that is greater than
    zero, and has a frequency greater than or equal to the value of the integer itself.
    The frequency of an integer is the number of times it appears in the list.
    If no such a value exist, return -1. """

    frq = [0] * (max(lst) + 1)
    for i in lst:
        frq[i] += 1;

    ans = -1
    for i in range(1, len(frq)):
        if frq[i] >= i:
            ans = i

    return ans


Prompt:
def strange_sort_list(lst):
    '''
    Given list of integers, return list in strange order.
    Strange sorting, is when you start with the minimum value,
    then maximum of the remaining integers, then minimum and so on. """

    res, switch = [], True
    while lst:
        res.append(min(lst) if switch else max(lst))
        lst.remove(res[-1])
        switch = not switch
    return res


Prompt:
def triangle_area(a, b, c):
    '''
    Given the lengths of the three sides of a triangle. Return the area of
    the triangle rounded to 2 decimal points if the three sides form a valid triangle.
    Otherwise return -1
    Three sides make a valid triangle when the sum of any two sides is greater
    than the third side. """

    if a + b <= c or a + c <= b or b + c <= a:
        return -1
    s = (a + b + c)/2
    area = (s * (s - a) * (s - b) * (s - c)) ** 0.5
    area = round(area, 2)
    return area

def check(candidate):
    assert candidate(3, 4, 5) == 6.00,"Test 0"
    assert candidate(1, 2, 10) == -1,"Test 1"
    assert candidate(4, 8, 5) == 8.18,"Test 2"
    assert candidate(2, 2, 2) == 1.73,"Test 3"
    assert candidate(1, 2, 3) == -1,"Test 4"
    assert candidate(10, 5, 7) == 16.25,"Test 5"
    assert candidate(2, 6, 3) == -1,"Test 6"
    assert candidate(1, 1, 1) == 0.43,"Test 7"
    assert candidate(2, 2, 10) == -1,"Test 8"


Prompt:
def will_it_fly(q,w):
    '''
    Write a function that returns True if the object q will fly, and False otherwise. The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w. """

    if sum(q) > w:
        return False

    i, j = 0, len(q)-1
    while i<j:
        if q[i] != q[j]:
            return False
        i+=1
        j-=1
    return True

def check(candidate):
    assert candidate([3, 2, 3], 9) is True,"Test 0"
    assert candidate([1, 2], 5) is False,"Test 1"
    assert candidate([3], 5) is True,"Test 2"
    assert candidate([3, 2, 3], 1) is False,"Test 3"
    assert candidate([1, 2, 3], 6) is False,"Test 4"
    assert candidate([5], 5) is True,"Test 5"


Prompt:
def smallest_change(arr):
    """
    Given an array arr of integers, find the minimum number of elements that
    need to be changed to make the array palindromic. A palindromic array is an array that
    is read the same backwards and forwards. In one change, you can change one element to any other element. """

    ans = 0
    for i in range(len(arr) // 2):
        if arr[i] != arr[len(arr) - i - 1]:
            ans += 1
    return ans

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


Prompt:
def total_match(lst1, lst2):
    '''
    Write a function that accepts two lists of strings and returns the list that has
    total number of chars in the all strings of the list less than the other list.

    if the two lists have the same number of chars, return the first list. """

    l1 = 0
    for st in lst1:
        l1 += len(st)

    l2 = 0
    for st in lst2:
        l2 += len(st)

    if l1 <= l2:
        return lst1
    else:
        return lst2

def check(candidate):
    assert True,"Test 0"
    assert candidate([], []) == [],"Test 1"
    assert candidate(['hi', 'admin'], ['hi', 'hi']) == ['hi', 'hi'],"Test 2"
    assert candidate(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) == ['hi', 'admin'],"Test 3"
    assert candidate(['4'], ['1', '2', '3', '4', '5']) == ['4'],"Test 4"
    assert candidate(['hi', 'admin'], ['hI', 'Hi']) == ['hI', 'Hi'],"Test 5"
    assert candidate(['hi', 'admin'], ['hI', 'hi', 'hi']) == ['hI', 'hi', 'hi'],"Test 6"
    assert candidate(['hi', 'admin'], ['hI', 'hi', 'hii']) == ['hi', 'admin'],"Test 7"
    assert True,"Test 8"
    assert candidate([], ['this']) == [],"Test 9"
    assert candidate(['this'], []) == [],"Test 10"


Prompt:
def is_multiply_prime(a):
    """Write a function that returns true if the given number is the multiplication of 3 prime numbers
    and false otherwise.
    Knowing that (a) is less then 100. """

    def is_prime(n):
        for j in range(2,n):
            if n%j == 0:
                return False
        return True

    for i in range(2,101):
        if not is_prime(i): continue
        for j in range(2,101):
            if not is_prime(j): continue
            for k in range(2,101):
                if not is_prime(k): continue
                if i*j*k == a: return True
    return False

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


Prompt:
def is_simple_power(x, n):
    """Your task is to write a function that returns true if a number x is a simple
    power of n and false in other cases.
    x is a simple power of n if n**int=x. """

    if (n == 1):
        return (x == 1)
    power = 1
    while (power < x):
        power = power * n
    return (power == x)

def check(candidate):
    assert candidate(16, 2)== True,"Test 0"
    assert candidate(143214, 16)== False,"Test 1"
    assert candidate(4, 2)==True,"Test 2"
    assert candidate(9, 3)==True,"Test 3"
    assert candidate(16, 4)==True,"Test 4"
    assert candidate(24, 2)==False,"Test 5"
    assert candidate(128, 4)==False,"Test 6"
    assert candidate(12, 6)==False,"Test 7"
    assert candidate(1, 1)==True,"Test 8"
    assert candidate(1, 12)==True,"Test 9"


Prompt:
def iscube(a):
    '''
    Write a function that takes an integer a and returns True
    if this ingeger is a cube of some integer number.
    Note: you may assume the input is always valid. """

    a = abs(a)
    return int(round(a ** (1. / 3))) ** 3 == a

def check(candidate):
    assert candidate(1) == True,"Test 0"
    assert candidate(2) == False,"Test 1"
    assert candidate(-1) == True,"Test 2"
    assert candidate(64) == True,"Test 3"
    assert candidate(180) == False,"Test 4"
    assert candidate(1000) == True,"Test 5"
    assert candidate(0) == True,"Test 6"
    assert candidate(1729) == False,"Test 7"


Prompt:
def hex_key(num):
    """You have been tasked to write a function that receives
    a hexadecimal number as a string and counts the number of hexadecimal
    digits that are primes (prime number, or a prime, is a natural number
    greater than 1 that is not a product of two smaller natural numbers).
    Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.
    Prime numbers are 2, 3, 5, 7, 11, 13, 17,...
    So you have to determine a number of the following digits: 2, 3, 5, 7,
    B (=decimal 11), D (=decimal 13).
    Note: you may assume the input is always correct or empty string,
    and symbols A,B,C,D,E,F are always uppercase. """

    primes = ('2', '3', '5', '7', 'B', 'D')
    total = 0
    for i in range(0, len(num)):
        if num[i] in primes:
            total += 1
    return total

def check(candidate):
    assert candidate("AB") == 1,"Test 0"
    assert candidate("1077E") == 2,"Test 1"
    assert candidate("ABED1A33") == 4,"Test 2"
    assert candidate("2020") == 2,"Test 3"
    assert candidate("123456789ABCDEF0") == 6,"Test 4"
    assert candidate("112233445566778899AABBCCDDEEFF00") == 12,"Test 5"
    assert candidate([]) == 0,"Test 6"


Prompt:
def decimal_to_binary(decimal):
    """You will be given a number in decimal form and your task is to convert it to
    binary format. The function should return a string, with each character representing a binary
    number. Each character in the string will be '0' or '1'.

    There will be an extra couple of characters 'db' at the beginning and at the end of the string.
    The extra characters are there to help with the format. """

def check(candidate):
    assert candidate(0) == "db0db","Test 0"
    assert candidate(32) == "db100000db","Test 1"
    assert candidate(103) == "db1100111db","Test 2"
    assert candidate(15) == "db1111db","Test 3"
    assert True,"Test 4"


Prompt:
def is_happy(s):
    """You are given a string s.
    Your task is to check if the string is happy or not.
    A string is happy if its length is at least 3 and every 3 consecutive letters are distinct. """

    if len(s) < 3:
      return False

    for i in range(len(s) - 2):

      if s[i] == s[i+1] or s[i+1] == s[i+2] or s[i] == s[i+2]:
        return False
    return True

def check(candidate):
    assert candidate("a") == False ,"Test 0"
    assert candidate("aa") == False ,"Test 1"
    assert candidate("abcd") == True ,"Test 2"
    assert candidate("aabb") == False ,"Test 3"
    assert candidate("adb") == True ,"Test 4"
    assert candidate("xyy") == False ,"Test 5"
    assert candidate("iopaxpoi") == True ,"Test 6"
    assert candidate("iopaxioi") == False ,"Test 7"


Prompt:
def numerical_letter_grade(grades):
    """It is the last week of the semester and the teacher has to give the grades
    to students. The teacher has been making her own algorithm for grading.
    The only problem is, she has lost the code she used for grading.
    She has given you a list of GPAs for some students and you have to write
    a function that can output a list of letter grades using the following table:
             GPA       |    Letter grade
              4.0                A+
            > 3.7                A
            > 3.3                A-
            > 3.0                B+
            > 2.7                B
            > 2.3                B-
            > 2.0                C+
            > 1.7                C
            > 1.3                C-
            > 1.0                D+
            > 0.7                D
            > 0.0                D-
              0.0                E. """

    letter_grade = []
    for gpa in grades:
        if gpa == 4.0:
            letter_grade.append("A+")
        elif gpa > 3.7:
            letter_grade.append("A")
        elif gpa > 3.3:
            letter_grade.append("A-")
        elif gpa > 3.0:
            letter_grade.append("B+")
        elif gpa > 2.7:
            letter_grade.append("B")
        elif gpa > 2.3:
            letter_grade.append("B-")
        elif gpa > 2.0:
            letter_grade.append("C+")
        elif gpa > 1.7:
            letter_grade.append("C")
        elif gpa > 1.3:
            letter_grade.append("C-")
        elif gpa > 1.0:
            letter_grade.append("D+")
        elif gpa > 0.7:
            letter_grade.append("D")
        elif gpa > 0.0:
            letter_grade.append("D-")
        else:
            letter_grade.append("E")
    return letter_grade


Prompt:
def prime_length(string):
    """Write a function that takes a string and returns True if the string
    length is a prime number or False otherwise. """

    l = len(string)
    if l == 0 or l == 1:
        return False
    for i in range(2, l):
        if l % i == 0:
            return False
    return True

def check(candidate):
    assert candidate('Hello') == True,"Test 0"
    assert candidate('abcdcba') == True,"Test 1"
    assert candidate('kittens') == True,"Test 2"
    assert candidate('orange') == False,"Test 3"
    assert candidate('wow') == True,"Test 4"
    assert candidate('world') == True,"Test 5"
    assert candidate('MadaM') == True,"Test 6"
    assert candidate('Wow') == True,"Test 7"
    assert candidate('') == False,"Test 8"
    assert candidate('HI') == True,"Test 9"
    assert candidate('go') == True,"Test 10"
    assert candidate('gogo') == False,"Test 11"
    assert candidate('aaaaaaaaaaaaaaa') == False,"Test 12"
    assert candidate('Madam') == True,"Test 13"
    assert candidate('M') == False,"Test 14"
    assert candidate('0') == False,"Test 15"


Prompt:
def starts_one_ends(n):
    """
    Given a positive integer n, return the count of the numbers of n-digit
    positive integers that start or end with 1.
    """

def check(candidate):
    assert True,"Test 0"
    assert candidate(1) == 1,"Test 1"
    assert candidate(2) == 18,"Test 2"
    assert candidate(3) == 180,"Test 3"
    assert candidate(4) == 1800,"Test 4"
    assert candidate(5) == 18000,"Test 5"
    assert True,"Test 6"


Prompt:
def solve(N):
    """Given a positive integer N, return the total sum of its digits in binary. """

return bin(sum(int(i) for i in str(N)))[2:]

def check(candidate):
    assert True,"Test 0"
    assert candidate(1000) == "1","Test 1"
    assert candidate(150) == "110","Test 2"
    assert candidate(147) == "1100","Test 3"
    assert True,"Test 4"
    assert candidate(333) == "1001","Test 5"
    assert candidate(963) == "10010","Test 6"


Prompt:
def add(lst):
    """Given a non-empty list of integers lst. add the even elements that are at odd indices. """

return sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0])

def check(candidate):
    assert candidate([4, 88]) == 88,"Test 0"
    assert candidate([4, 5, 6, 7, 2, 122]) == 122,"Test 1"
    assert candidate([4, 0, 6, 7]) == 0,"Test 2"
    assert candidate([4, 4, 6, 8]) == 12,"Test 3"


Prompt:
def anti_shuffle(s):
    """
    Write a function that takes a string and returns an ordered version of it.
    Ordered version of string, is a string where all words (separated by space)
    are replaced by a new word where all the characters arranged in
    ascending order based on ascii value.
    Note: You should keep the order of words and blank spaces in the sentence. """

return ' '.join([''.join(sorted(list(i))) for i in s.split(' ')])

def check(candidate):
    assert candidate('Hi') == 'Hi',"Test 0"
    assert candidate('hello') == 'ehllo',"Test 1"
    assert candidate('number') == 'bemnru',"Test 2"
    assert candidate('abcd') == 'abcd',"Test 3"
    assert candidate('Hello World!!!') == 'Hello !!!Wdlor',"Test 4"
    assert candidate('') == '',"Test 5"
    assert candidate('Hi. My name is Mister Robot. How are you?') == '.Hi My aemn is Meirst .Rboot How aer ?ouy',"Test 6"
    assert True,"Test 7"


Prompt:
def get_row(lst, x):
    """
    You are given a 2 dimensional data, as a nested lists,
    which is similar to matrix, however, unlike matrices,
    each row may contain a different number of columns.
    Given lst, and integer x, find integers x in the list,
    and return list of tuples, [(x1, y1), (x2, y2) ...] such that
    each tuple is a coordinate - (row, columns), starting with 0.
    Sort coordinates initially by rows in ascending order.
    Also, sort coordinates of the row by columns in descending order. """

    coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]
    return sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])


Prompt:
def sort_array(array):
    """
    Given an array of non-negative integers, return a copy of the given array after sorting,
    you will sort the given array in ascending order if the sum( first index value, last index value) is odd,
    or sort it in descending order if the sum( first index value, last index value) is even.

    Note:
    * don't change the given array. """

return [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0)


Prompt:
def encrypt(s):
    """Create a function encrypt that takes a string as an argument and
    returns a string encrypted with the alphabet being rotated.
    The alphabet should be rotated in a manner such that the letters
    shift down by two multiplied to two places. """

    d = 'abcdefghijklmnopqrstuvwxyz'
    out = ''
    for c in s:
        if c in d:
            out += d[(d.index(c)+2*2) % 26]
        else:
            out += c
    return out

def check(candidate):
    assert candidate('hi') == 'lm',"Test 0"
    assert candidate('asdfghjkl') == 'ewhjklnop',"Test 1"
    assert candidate('gf') == 'kj',"Test 2"
    assert candidate('et') == 'ix',"Test 3"
    assert candidate('faewfawefaewg')=='jeiajeaijeiak',"Test 4"
    assert candidate('hellomyfriend')=='lippsqcjvmirh',"Test 5"
    assert candidate('dxzdlmnilfuhmilufhlihufnmlimnufhlimnufhfucufh')=='hbdhpqrmpjylqmpyjlpmlyjrqpmqryjlpmqryjljygyjl',"Test 6"
    assert candidate('a')=='e',"Test 7"


Prompt:
def next_smallest(lst):
    """
    You are given a list of integers.
    Write a function next_smallest() that returns the 2nd smallest element of the list.
    Return None if there is no such element.

    next_smallest([1, 2, 3, 4, 5]) == 2
    next_smallest([5, 1, 4, 3, 2]) == 2
    next_smallest([]) == None
    next_smallest([1, 1]) == None
    """

    lst = sorted(set(lst))
    return None if len(lst) < 2 else lst[1]

def check(candidate):
    assert candidate([1, 2, 3, 4, 5]) == 2,"Test 0"
    assert candidate([5, 1, 4, 3, 2]) == 2,"Test 1"
    assert candidate([]) == None,"Test 2"
    assert candidate([1, 1]) == None,"Test 3"
    assert candidate([1,1,1,1,0]) == 1,"Test 4"
    assert candidate([1, 0**0]) == None,"Test 5"
    assert candidate([-35, 34, 12, -45]) == -35,"Test 6"
    assert True,"Test 7"


Prompt:
def is_bored(S):
    """
    You'll be given a string of words, and your task is to count the number
    of boredoms. A boredom is a sentence that starts with the word "I".
    Sentences are delimited by '.', '?' or '!'. """

    import re
    sentences = re.split(r'[.?!]\s*', S)
    return sum(sentence[0:2] == 'I ' for sentence in sentences)

def check(candidate):
    assert candidate("Hello world") == 0, "Test 1"
    assert candidate("Is the sky blue?") == 0, "Test 2"
    assert candidate("I love It !") == 1, "Test 3"
    assert candidate("bIt") == 0, "Test 4"
    assert candidate("I feel good today. I will be productive. will kill It") == 2, "Test 5"
    assert candidate("You and I are going for a walk") == 0, "Test 6"
    assert True,"Test 6"


Prompt:
def any_int(x, y, z):
    '''
    Create a function that takes 3 numbers.
    Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
    Returns false in any other cases. """

    if isinstance(x,int) and isinstance(y,int) and isinstance(z,int):
        if (x+y==z) or (x+z==y) or (y+z==x):
            return True
        return False
    return False

def check(candidate):
    assert candidate(2, 3, 1)==True,"Test 0"
    assert candidate(2.5, 2, 3)==False,"Test 1"
    assert candidate(1.5, 5, 3.5)==False,"Test 2"
    assert candidate(2, 6, 2)==False,"Test 3"
    assert candidate(4, 2, 2)==True,"Test 4"
    assert candidate(2.2, 2.2, 2.2)==False,"Test 5"
    assert candidate(-4, 6, 2)==True,"Test 6"
    assert candidate(2,1,1)==True,"Test 7"
    assert candidate(3,4,7)==True,"Test 8"
    assert candidate(3.0,4,7)==False,"Test 9"


Prompt:
def encode(message):
    """
    Write a function that takes a message, and encodes in such a
    way that it swaps case of all letters, replaces all vowels in
    the message with the letter that appears 2 places ahead of that
    vowel in the english alphabet.
    Assume only letters. """

    vowels = "aeiouAEIOU"
    vowels_replace = dict([(i, chr(ord(i) + 2)) for i in vowels])
    message = message.swapcase()
    return ''.join([vowels_replace[i] if i in vowels else i for i in message])

def check(candidate):
    assert candidate('TEST') == 'tgst',"Test 0"
    assert candidate('Mudasir') == 'mWDCSKR',"Test 1"
    assert candidate('YES') == 'ygs',"Test 2"
    assert candidate('This is a message') == 'tHKS KS C MGSSCGG',"Test 3"
    assert candidate("I DoNt KnOw WhAt tO WrItE") == 'k dQnT kNqW wHcT Tq wRkTg',"Test 4"


Prompt:
def skjkasdkd(lst):
    """You are given a list of integers.
    You need to find the largest prime value and return the sum of its digits. """

    def isPrime(n):
        for i in range(2,int(n**0.5)+1):
            if n%i==0:
                return False

        return True
    maxx = 0
    i = 0
    while i < len(lst):
        if(lst[i] > maxx and isPrime(lst[i])):
            maxx = lst[i]
        i+=1
    result = sum(int(digit) for digit in str(maxx))
    return result


Prompt:
def check_dict_case(dict):
    """
    Given a dictionary, return True if all keys are strings in lower
    case or all keys are strings in upper case, else return False.
    The function should return False is the given dictionary is empty. """

    if len(dict.keys()) == 0:
        return False
    else:
        state = "start"
        for key in dict.keys():

            if isinstance(key, str) == False:
                state = "mixed"
                break
            if state == "start":
                if key.isupper():
                    state = "upper"
                elif key.islower():
                    state = "lower"
                else:
                    break
            elif (state == "upper" and not key.isupper()) or (state == "lower" and not key.islower()):
                    state = "mixed"
                    break
            else:
                break
        return state == "upper" or state == "lower"

def check(candidate):
    assert candidate({"p":"pineapple","Test 0"
    assert candidate({"p":"pineapple","Test 1"
    assert candidate({"p":"pineapple", 5:"banana","Test 2"
    assert candidate({"Name":"John","Test 3"
    assert candidate({"STATE":"NC","Test 4"
    assert candidate({"fruit":"Orange","Test 5"
    assert candidate({}) == False,"Test 6"


Prompt:
def count_up_to(n):
    """Implement a function that takes an non-negative integer and returns an array of the first n
    integers that are prime numbers and less than n. """

    primes = []
    for i in range(2, n):
        is_prime = True
        for j in range(2, i):
            if i % j == 0:
                is_prime = False
                break
        if is_prime:
            primes.append(i)
    return primes


Prompt:
def multiply(a, b):
    """Complete the function that takes two integers and returns
    the product of their unit digits.
    Assume the input is always valid. """

def check(candidate):
    assert candidate(148, 412) == 16,"Test 0"
    assert candidate(19, 28) == 72,"Test 1"
    assert candidate(2020, 1851) == 0,"Test 2"
    assert candidate(14,-15) == 20,"Test 3"
    assert candidate(76, 67) == 42,"Test 4"
    assert candidate(17, 27) == 49,"Test 5"
    assert candidate(0, 1) == 0,"Test 6"
    assert candidate(0, 0) == 0,"Test 7"


Prompt:
def count_upper(s):
    """
    Given a string s, count the number of uppercase vowels in even indices. """

    count = 0
    for i in range(0,len(s),2):
        if s[i] in "AEIOU":
            count += 1
    return count

def check(candidate):
    assert candidate('aBCdEf')  == 1,"Test 0"
    assert candidate('abcdefg') == 0,"Test 1"
    assert candidate('dBBE') == 0,"Test 2"
    assert candidate('B')  == 0,"Test 3"
    assert candidate('U')  == 1,"Test 4"
    assert candidate('') == 0,"Test 5"
    assert candidate('EEEE') == 2,"Test 6"
    assert True,"Test 7"


Prompt:
def closest_integer(value):
    '''
    Create a function that takes a value (string) representing a number
    and returns the closest integer to it. If the number is equidistant
    from two integers, round it away from zero. """

    from math import floor, ceil

    if value.count('.') == 1:
        # remove trailing zeros
        while (value[-1] == '0'):
            value = value[:-1]

    num = float(value)
    if value[-2:] == '.5':
        if num > 0:
            res = ceil(num)
        else:
            res = floor(num)
    elif len(value) > 0:
        res = int(round(num))
    else:
        res = 0

    return res

def check(candidate):
    assert candidate("10") == 10, "Test 1"
    assert candidate("14.5") == 15, "Test 2"
    assert candidate("-15.5") == -16, "Test 3"
    assert candidate("15.3") == 15, "Test 3"
    assert candidate("0") == 0, "Test 0"


Prompt:
def make_a_pile(n):
    """
    Given a positive integer n, you have to make a pile of n levels of stones.
    The first level has n stones.
    The number of stones in the next level is:
        - the next odd number if n is odd.
        - the next even number if n is even.
    Return the number of stones in each level in a list, where element at index
    i represents the number of stones in the level (i+1). """

def check(candidate):
    assert candidate(3) == [3, 5, 7], "Test 3"
    assert candidate(4) == [4,6,8,10], "Test 4"
    assert candidate(5) == [5, 7, 9, 11, 13],"Test 2"
    assert candidate(6) == [6, 8, 10, 12, 14, 16],"Test 3"
    assert candidate(8) == [8, 10, 12, 14, 16, 18, 20, 22],"Test 4"
    assert True,"Test 5"


Prompt:
def words_string(s):
    """
    You will be given a string of words separated by commas or spaces. Your task is
    to split the string into words and return an array of the words. """

    if not s:
        return []

    s_list = []

    for letter in s:
        if letter == ',':
            s_list.append(' ')
        else:
            s_list.append(letter)

    s_list = "".join(s_list)
    return s_list.split()

def check(candidate):
    assert candidate("Hi, my name is John") == ["Hi", "my", "name", "is", "John"], "Test 0"
    assert candidate("One, two, three, four, five, six") == ["One", "two", "three", "four", "five", "six"], "Test 1"
    assert candidate("Hi, my name") == ["Hi", "my", "name"], "Test 2"
    assert candidate("One,, two, three, four, five, six,") == ["One", "two", "three", "four", "five", "six"], "Test 3"
    assert candidate("") == [], "Test 4"
    assert candidate("ahmed     , gamal") == ["ahmed", "gamal"], "Test 5"


Prompt:
def choose_num(x, y):
    """This function takes two positive numbers x and y and returns the
    biggest even integer number that is in the range [x, y] inclusive. If
    there's no such number, then the function should return -1. """

    if x > y:
        return -1
    if y % 2 == 0:
        return y
    if x == y:
        return -1
    return y - 1

def check(candidate):
    assert candidate(12, 15) == 14,"Test 0"
    assert candidate(13, 12) == -1,"Test 1"
    assert candidate(33, 12354) == 12354,"Test 2"
    assert candidate(5234, 5233) == -1,"Test 3"
    assert candidate(6, 29) == 28,"Test 4"
    assert candidate(27, 10) == -1,"Test 5"
    assert candidate(7, 7) == -1,"Test 6"
    assert candidate(546, 546) == 546,"Test 7"


Prompt:
def rounded_avg(n, m):
    """You are given two positive integers n and m, and your task is to compute the
    average of the integers from n through m (including n and m).
    Round the answer to the nearest integer and convert that to binary.
    If n is greater than m, return -1. """

    if m < n:
        return -1
    summation = 0
    for i in range(n, m+1):
        summation += i
    return bin(round(summation/(m - n + 1)))


Prompt:
def unique_digits(x):
    """Given a list of positive integers x. return a sorted list of all
    elements that hasn't any even digit.

    Note: Returned list should be sorted in increasing order. """

    odd_digit_elements = []
    for i in x:
        if all (int(c) % 2 == 1 for c in str(i)):
            odd_digit_elements.append(i)
    return sorted(odd_digit_elements)


Prompt:
def by_length(arr):
    """
    Given an array of integers, sort the integers that are between 1 and 9 inclusive,
    reverse the resulting array, and then replace each digit by its corresponding name from
    "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine". """

    dic = {
        1: "One",
        2: "Two",
        3: "Three",
        4: "Four",
        5: "Five",
        6: "Six",
        7: "Seven",
        8: "Eight",
        9: "Nine",
    }
    sorted_arr = sorted(arr, reverse=True)
    new_arr = []
    for var in sorted_arr:
        try:
            new_arr.append(dic[var])
        except:
            pass
    return new_arr

def check(candidate):
    assert candidate([2, 1, 1, 4, 5, 8, 2, 3]) == ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"], "Test 0"
    assert candidate([]) == [], "Test 1"
    assert candidate([1, -1 , 55]) == ['One'], "Test 2"
    assert candidate([1, -1, 3, 2]) == ["Three", "Two", "One"], "Test 3"
    assert candidate([9, 4, 8]) == ["Nine", "Eight", "Four"], "Test 4"


Prompt:
def f(n):
    """ Implement the function f that takes n as a parameter,
    and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even
    or the sum of numbers from 1 to i otherwise.
    i starts from 1.
    the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i). """

    ret = []
    for i in range(1,n+1):
        if i%2 == 0:
            x = 1
            for j in range(1,i+1): x *= j
            ret += [x]
        else:
            x = 0
            for j in range(1,i+1): x += j
            ret += [x]
    return ret

def check(candidate):
    assert candidate(5) == [1, 2, 6, 24, 15],"Test 0"
    assert candidate(7) == [1, 2, 6, 24, 15, 720, 28],"Test 1"
    assert candidate(1) == [1],"Test 2"
    assert candidate(3) == [1, 2, 6],"Test 3"


Prompt:
def even_odd_palindrome(n):
    """
    Given a positive integer n, return a tuple that has the number of even and odd
    integer palindromes that fall within the range(1, n), inclusive. """

    def is_palindrome(n):
        return str(n) == str(n)[::-1]

    even_palindrome_count = 0
    odd_palindrome_count = 0

    for i in range(1, n+1):
        if i%2 == 1 and is_palindrome(i):
                odd_palindrome_count += 1
        elif i%2 == 0 and is_palindrome(i):
            even_palindrome_count += 1
    return (even_palindrome_count, odd_palindrome_count)

def check(candidate):
    assert candidate(123) == (8, 13),"Test 0"
    assert candidate(12) == (4, 6),"Test 1"
    assert candidate(3) == (1, 2),"Test 2"
    assert candidate(63) == (6, 8),"Test 3"
    assert candidate(25) == (5, 6),"Test 4"
    assert candidate(19) == (4, 6),"Test 5"
    assert candidate(9) == (4, 5),"Test 6"
    assert candidate(1) == (0, 1),"Test 7"


Prompt:
def count_nums(arr):
    """
    Write a function count_nums which takes an array of integers and returns
    the number of elements which has a sum of digits > 0.
    If a number is negative, then its first signed digit will be negative. """

    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 len(list(filter(lambda x: x > 0, [digits_sum(i) for i in arr])))

def check(candidate):
    assert candidate([]) == 0,"Test 0"
    assert candidate([-1, -2, 0]) == 0,"Test 1"
    assert candidate([1, 1, 2, -2, 3, 4, 5]) == 6,"Test 2"
    assert candidate([1, 6, 9, -6, 0, 1, 5]) == 5,"Test 3"
    assert candidate([1, 100, 98, -7, 1, -1]) == 4,"Test 4"
    assert candidate([12, 23, 34, -45, -56, 0]) == 5,"Test 5"
    assert candidate([-0, 1**0]) == 1,"Test 6"
    assert candidate([1]) == 1,"Test 7"
    assert True,"Test 8"


Prompt:
def move_one_ball(arr):
    """We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The
    numbers in the array will be randomly ordered. Your task is to determine if
    it is possible to get an array sorted in non-decreasing order by performing
    the following operation on the given array:
        You are allowed to perform right shift operation any number of times.

    One right shift operation means shifting all elements of the array by one
    position in the right direction. The last element of the array will be moved to
    the starting position in the array i.e. 0th index.

    If it is possible to obtain the sorted array by performing the above operation
    then return True else return False.
    If the given array is empty then return True.

    Note: The given list is guaranteed to have unique elements. """

    if len(arr)==0:
      return True
    sorted_array=sorted(arr)
    my_arr=[]

    min_value=min(arr)
    min_index=arr.index(min_value)
    my_arr=arr[min_index:]+arr[0:min_index]
    for i in range(len(arr)):
      if my_arr[i]!=sorted_array[i]:
        return False
    return True

def check(candidate):
    assert candidate([3, 4, 5, 1, 2])==True,"Test 0"
    assert candidate([3, 5, 10, 1, 2])==True,"Test 1"
    assert candidate([4, 3, 1, 2])==False,"Test 2"
    assert candidate([3, 5, 4, 1, 2])==False,"Test 3"
    assert candidate([])==True,"Test 4"


Prompt:
def exchange(lst1, lst2):
    """In this problem, you will implement a function that takes two lists of numbers,
    and determines whether it is possible to perform an exchange of elements
    between them to make lst1 a list of only even numbers.
    There is no limit on the number of exchanged elements between lst1 and lst2.
    If it is possible to exchange elements between the lst1 and lst2 to make
    all the elements of lst1 to be even, return "YES".
    Otherwise, return "NO". """

    odd = 0
    even = 0
    for i in lst1:
        if i%2 == 1:
            odd += 1
    for i in lst2:
        if i%2 == 0:
            even += 1
    if even >= odd:
        return "YES"
    return "NO"


Prompt:
def histogram(test):
    """Given a string representing a space separated lowercase letters, return a dictionary
    of the letter with the most repetition and containing the corresponding count.
    If several letters have the same occurrence, return all of them. """

    dict1={}
    list1=test.split(" ")
    t=0

    for i in list1:
        if(list1.count(i)>t) and i!='':
            t=list1.count(i)
    if t>0:
        for i in list1:
            if(list1.count(i)==t):

                dict1[i]=t
    return dict1

def check(candidate):
    assert candidate('a b b a') == {'a':2,'b': 2},"Test 0"
    assert candidate('a b c a b') == {'a': 2, 'b': 2},"Test 1"
    assert candidate('a b c d g') == {'a': 1, 'b': 1, 'c': 1, 'd': 1, 'g': 1},"Test 2"
    assert candidate('r t g') == {'r': 1,'t': 1,'g': 1},"Test 3"
    assert candidate('b b b b a') == {'b': 4},"Test 4"
    assert candidate('r t g') == {'r': 1,'t': 1,'g': 1},"Test 5"
    assert candidate('') == {},"Test 6"
    assert candidate('a') == {'a': 1},"Test 7"


Prompt:
def reverse_delete(s,c):
    """Task
    We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c
    then check if the result string is palindrome.
    A string is called palindrome if it reads the same backward as forward.
    You should return a tuple containing the result string and True/False for the check. """

    s = ''.join([char for char in s if char not in c])
    return (s,s[::-1] == s)

def check(candidate):
    assert candidate("abcde","Test 0"
    assert candidate("abcdef","Test 1"
    assert candidate("abcdedcba","Test 2"
    assert candidate("dwik","Test 3"
    assert candidate("a","Test 4"
    assert candidate("abcdedcba","Test 5"
    assert candidate("abcdedcba","Test 6"
    assert candidate("vabba","Test 7"
    assert candidate("mamma","Test 8"


Prompt:
def odd_count(lst):
    """Given a list of strings, where each string consists of only digits, return a list.
    Each element i of the output should be "the number of odd elements in the
    string i of the input." where all the i's should be replaced by the number
    of odd digits in the i'th string of the input. """

    res = []
    for arr in lst:
        n = sum(int(d)%2==1 for d in arr)
        res.append("the number of odd elements " + str(n) + "n the str"+ str(n) +"ng "+ str(n) +" of the "+ str(n) +"nput.")
    return res

def check(candidate):
    assert candidate(['1234567']) == ["the number of odd elements 4n the str4ng 4 of the 4nput."], "Test 0"
    assert candidate(['3',"11111111"]) == ["the number of odd elements 1n the str1ng 1 of the 1nput.", "the number of odd elements 8n the str8ng 8 of the 8nput."], "Test 1"
    assert candidate(['271', '137', '314']) == ['the number of odd elements 2n the str2ng 2 of the 2nput.','the number of odd elements 3n the str3ng 3 of the 3nput.','the number of odd elements 2n the str2ng 2 of the 2nput.'], "Test 3"


Prompt:
def minSubArraySum(nums):
    """
    Given an array of integers nums, find the minimum sum of any non-empty sub-array
    of nums. """

    max_sum = 0
    s = 0
    for num in nums:
        s += -num
        if (s < 0):
            s = 0
        max_sum = max(s, max_sum)
    if max_sum == 0:
        max_sum = max(-i for i in nums)
    min_sum = -max_sum
    return min_sum


Prompt:
def max_fill(grid, capacity):
    import math
    """
    You are given a rectangular grid of wells. Each row represents a single well,
    and each 1 in a row represents a single unit of water.
    Each well has a corresponding bucket that can be used to extract water from it,
    and all buckets have the same capacity.
    Your task is to use the buckets to empty the wells.
    Output the number of times you need to lower the buckets. """

return sum([math.ceil(sum(arr)/capacity) for arr in grid])


Prompt:
def sort_array(arr):
    """
    In this Kata, you have to sort an array of non-negative integers according to
    number of ones in their binary representation in ascending order.
    For similar number of ones, sort based on decimal value.

    It must be implemented like this. """

return sorted(sorted(arr), key=lambda x: bin(x)[2:].count('1'))


Prompt:
def select_words(s, n):
    """Given a string s and a natural number n, you have been tasked to implement
    a function that returns a list of all words from string s that contain exactly
    n consonants, in order these words appear in the string s.
    If the string s is empty then the function should return an empty list.
    Note: you may assume the input string contains only letters and spaces. """

    result = []
    for word in s.split():
        n_consonants = 0
        for i in range(0, len(word)):
            if word[i].lower() not in ["a","e","i","o","u"]:
                n_consonants += 1
        if n_consonants == n:
            result.append(word)
    return result

def check(candidate):
    assert candidate("Mary had a little lamb", 4) == ["little"], "Test 0"
    assert candidate("Mary had a little lamb", 3) == ["Mary", "lamb"], "Test 1"
    assert candidate("simple white space", 2) == [], "Test 2"
    assert candidate("Hello world", 4) == ["world"], "Test 3"
    assert candidate("Uncle sam", 3) == ["Uncle"], "Test 4"
    assert candidate("", 4) == [], "Test 5"
    assert candidate("a b c d e f", 1) == ["b", "c", "d", "f"], "Test 6"


Prompt:
def get_closest_vowel(word):
    """You are given a word. Your task is to find the closest vowel that stands between
    two consonants from the right side of the word (case sensitive).

    Vowels in the beginning and ending doesn't count. Return empty string if you didn't
    find any vowel met the above condition.

    You may assume that the given string contains English letter only. """

    if len(word) < 3:
        return ""

    vowels = {"a", "e", "i", "o", "u", "A", "E", 'O', 'U', 'I'}
    for i in range(len(word)-2, 0, -1):
        if word[i] in vowels:
            if (word[i+1] not in vowels) and (word[i-1] not in vowels):
                return word[i]
    return ""

def check(candidate):
    assert candidate("yogurt") == "u","Test 0"
    assert candidate("full") == "u","Test 1"
    assert candidate("easy") == "","Test 2"
    assert candidate("eAsy") == "","Test 3"
    assert candidate("ali") == "","Test 4"
    assert candidate("bad") == "a","Test 5"
    assert candidate("most") == "o","Test 6"
    assert candidate("ab") == "","Test 7"
    assert candidate("ba") == "","Test 8"
    assert candidate("quick") == "","Test 9"
    assert candidate("anime") == "i","Test 10"
    assert candidate("Asia") == "","Test 11"
    assert candidate("Above") == "o","Test 12"
    assert True,"Test 13"


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    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 ,

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

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

    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"