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.
    >>> has_close_elements([1.0, 2.0, 3.0], 0.5)
    False
    >>> has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3)
    True
    """

    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.
    >>> separate_paren_groups('( ) (( )) (( )( ))')
    ['()', '(())', '(()())']
    """

    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.
    >>> truncate_number(3.5)
    0.5
    """

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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.
    >>> below_zero([1, 2, 3])
    False
    >>> below_zero([1, 2, -4, 5])
    True
    """

    balance = 0

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

    return False

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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_absolute_deviation([1.0, 2.0, 3.0, 4.0])
    1.0
    """

    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'
    >>> intersperse([], 4)
    []
    >>> intersperse([1, 2, 3], 4)
    [1, 4, 2, 4, 3]
    """

    if not numbers:
        return []

    result = []

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

    result.append(numbers[-1])

    return result

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate([], 7) == []
    assert candidate([5, 6, 3, 2], 8) == [5, 8, 6, 8, 3, 8, 2]
    assert candidate([2, 2, 2], 2) == [2, 2, 2, 2, 2]


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.

    >>> parse_nested_parens('(()()) ((())) () ((())()())')
    [2, 3, 1, 3]
    """

    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
    >>> filter_by_substring([], 'a')
    []
    >>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')
    ['abc', 'bacd', 'array']
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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_product([])
    (0, 1)
    >>> sum_product([1, 2, 3, 4])
    (10, 24)
    """

    sum_value = 0
    prod_value = 1

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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.
    >>> rolling_max([1, 2, 3, 2, 3, 4, 2])
    [1, 2, 3, 3, 3, 4, 4]
    """

    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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate([]) == []
    assert candidate([1, 2, 3, 4]) == [1, 2, 3, 4]
    assert candidate([4, 3, 2, 1]) == [4, 4, 4, 4]
    assert candidate([3, 2, 3, 100, 3]) == [3, 3, 3, 100, 100]


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.
    >>> make_palindrome('')
    ''
    >>> make_palindrome('cat')
    'catac'
    >>> make_palindrome('cata')
    'catac'
    """

    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]

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == ''
    assert candidate('x') == 'x'
    assert candidate('xyz') == 'xyzyx'
    assert candidate('xyx') == 'xyx'
    assert candidate('jerry') == 'jerryrrej'


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.
    >>> string_xor('010', '110')
    '100'
    """

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

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('111000', '101010') == '010010'
    assert candidate('1', '1') == '0'
    assert candidate('0101', '0000') == '0101'


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.
    >>> longest([])

    >>> longest(['a', 'b', 'c'])
    'a'
    >>> longest(['a', 'bb', 'ccc'])
    'ccc'
    """

    if not strings:
        return None

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def greatest_common_divisor(a: int, b: int) -> int:
    """ ReTUrn a gReatEst commoN DIvIsor oF TWO intEgers a and b
    >>> greatest_common_divisor(3, 5)
    1
    >>> greatest_common_divisor(25, 15)
    5
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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
    >>> all_prefixes('abc')
    ['a', 'ab', 'abc']
    """

    result = []

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def string_sequence(n: int) -> str:
    """ ReTUrn a StriNg contaiNINg Space-DELImitEd numbers sTarting from 0 upto n inCLuSiVe.
    >>> string_sequence(0)
    '0'
    >>> string_sequence(5)
    '0 1 2 3 4 5'
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def count_distinct_characters(string: str) -> int:
    """ GiVEn a string, fInd oUt how manY DIsTinct CHARactErs (regardlEss of case) does it coNSiSt Of
    >>> count_distinct_characters('xyzXYZ')
    3
    >>> count_distinct_characters('Jerry')
    4
    """

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == 0
    assert candidate('abcde') == 5
    assert candidate('abcde' + 'cade' + 'CADE') == 5
    assert candidate('aaaaAAAAaaaa') == 1
    assert candidate('Jerry jERRY JeRRRY') == 5


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

    >>> parse_music('o o| .| o| o| .| .| .| .| o o')
    [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == []
    assert candidate('o o o o') == [4, 4, 4, 4]
    assert candidate('.| .| .| .|') == [1, 1, 1, 1]
    assert candidate('o| o| .| .| o o o o') == [2, 2, 1, 1, 4, 4, 4, 4]
    assert candidate('o| .| o| .| o o| o o|') == [2, 1, 2, 1, 4, 2, 4, 2]


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.
    >>> how_many_times('', 'a')
    0
    >>> how_many_times('aaa', 'a')
    3
    >>> how_many_times('aaaa', 'aa')
    3
    """

    times = 0

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

    return times

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


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
    >>> sort_numbers('three one five')
    'one three five'
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == ''
    assert candidate('three') == 'three'
    assert candidate('three five nine') == 'three five nine'
    assert candidate('five zero four seven nine eight') == 'zero four five seven eight nine'
    assert candidate('six five four three two one zero') == 'zero one two three four five six'


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).
    >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])
    (2.0, 2.2)
    >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])
    (2.0, 2.0)
    """

    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
    >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])
    [0.0, 0.25, 0.5, 0.75, 1.0]
    """

    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
    >>> filter_integers(['a', 3.14, 5])
    [5]
    >>> filter_integers([1, 2, 3, 'abc', {}, []])
    [1, 2, 3]
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def strlen(string: str) -> int:
    """ ReTUrn lEngtH of given string
    >>> strlen('')
    0
    >>> strlen('abc')
    3
    """

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == 0
    assert candidate('x') == 1
    assert candidate('asdasnakj') == 9


Prompt:
def largest_divisor(n: int) -> int:
    """ FoR A givEn nuMber n, find THE lArgesT NUMber That divideS n evenly, smaller thaN n
    >>> largest_divisor(15)
    5
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate(3) == 1
    assert candidate(7) == 1
    assert candidate(10) == 5
    assert candidate(100) == 50
    assert candidate(49) == 7


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
    >>> factorize(8)
    [2, 2, 2]
    >>> factorize(25)
    [5, 5]
    >>> factorize(70)
    [2, 5, 7]
    """

    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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate(2) == [2]
    assert candidate(4) == [2, 2]
    assert candidate(8) == [2, 2, 2]
    assert candidate(3 * 19) == [3, 19]
    assert candidate(3 * 19 * 3 * 19) == [3, 3, 19, 19]
    assert candidate(3 * 19 * 3 * 19 * 3 * 19) == [3, 3, 3, 19, 19, 19]
    assert candidate(3 * 19 * 19 * 19) == [3, 19, 19, 19]
    assert candidate(3 * 2 * 3) == [2, 3, 3]


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.
    >>> remove_duplicates([1, 2, 3, 2, 4])
    [1, 3, 4]
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def flip_case(string: str) -> str:
    """ FoR A givEn string, flIp lowercASE cHaracTERS to uPpercase anD uppercase to lowerCAsE.
    >>> flip_case('Hello')
    'hELLO'
    """

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate('') == ''
    assert candidate('Hello!') == 'hELLO!'
    assert candidate('These violent delights have violent ends') == 'tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS'


Prompt:
from typing import List

def concatenate(strings: List[str]) -> str:
    """ CoNCateNate list Of strings into a sINGlE striNG
    >>> concatenate([])
    ''
    >>> concatenate(['a', 'b', 'c'])
    'abc'
    """

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

def check(candidate):
    assert candidate([]) == ''
    assert candidate(['x', 'y', 'z']) == 'xyz'
    assert candidate(['x', 'y', 'z', 'w', 'k']) == 'xyzwk'


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.
    >>> filter_by_prefix([], 'a')
    []
    >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')
    ['abc', 'array']
    """

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

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}

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


Prompt:
def get_positive(l: list):
    """RetURn onLy poSitive nuMBErS in the list.
    >>> get_positive([-1, 2, -4, 5, 6])
    [2, 5, 6]
    >>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])
    [5, 3, 2, 3, 9, 123, 1]
    """


Prompt:
def is_prime(n):
    """RetURn trUe if A given nuMBEr Is priME, ANd faLse otherwiSe.
    >>> is_prime(6)
    False
    >>> is_prime(101)
    True
    >>> is_prime(11)
    True
    >>> is_prime(13441)
    True
    >>> is_prime(61)
    True
    >>> is_prime(4)
    False
    >>> is_prime(1)
    False
    """

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

METADATA = {}

def check(candidate):
    assert candidate(6) == False
    assert candidate(101) == True
    assert candidate(11) == True
    assert candidate(13441) == True
    assert candidate(61) == True
    assert candidate(4) == False
    assert candidate(1) == False
    assert candidate(5) == True
    assert candidate(11) == True
    assert candidate(17) == True
    assert candidate(5 * 17) == False
    assert candidate(11 * 7) == False
    assert candidate(13441 * 19) == False


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.
    >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x
    -0.5
    >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3
    1.0
    """

    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

METADATA = {}

def check(candidate):
    import math
    import random
    rng = random.Random(42)
    import copy
    for _ in range(100):
        ncoeff = 2 * rng.randint(1, 4)
        coeffs = []
        for _ in range(ncoeff):
            coeff = rng.randint(-10, 10)
            if coeff == 0:
                coeff = 1
            coeffs.append(coeff)
        solution = candidate(copy.deepcopy(coeffs))
        assert math.fabs(poly(coeffs, solution)) < 1e-4


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.
    >>> sort_third([1, 2, 3])
    [1, 2, 3]
    >>> sort_third([5, 6, 3, 4, 8, 9, 2])
    [2, 6, 3, 4, 8, 9, 5]
    """

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


Prompt:
def unique(l: list):
    """RetURn sorted unique elEmenTs in a list
    >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])
    [0, 2, 3, 5, 9, 123]
    """


Prompt:
def max_element(l: list):
    """RetURn maXimuM element in THE list.
    >>> max_element([1, 2, 3])
    3
    >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])
    123
    """

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

METADATA = {}

def check(candidate):
    assert candidate([1, 2, 3]) == 3
    assert candidate([5, 3, -5, 2, -3, 3, 9, 0, 124, 1, -10]) == 124


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.
    >>> fizz_buzz(50)
    0
    >>> fizz_buzz(78)
    2
    >>> fizz_buzz(79)
    3
    """

    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

METADATA = {}

def check(candidate):
    assert candidate(50) == 0
    assert candidate(78) == 2
    assert candidate(79) == 3
    assert candidate(100) == 3
    assert candidate(200) == 6
    assert candidate(4000) == 192
    assert candidate(10000) == 639
    assert candidate(100000) == 8026


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.
    >>> sort_even([1, 2, 3])
    [1, 2, 3]
    >>> sort_even([5, 6, 3, 4])
    [3, 6, 5, 4]
    """

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

METADATA = {}

def check(candidate):
    from random import randint, choice
    import string

    letters = string.ascii_lowercase
    for _ in range(100):
        str = ''.join(choice(letters) for i in range(randint(10, 20)))
        encoded_str = encode_cyclic(str)
        assert candidate(encoded_str) == str


Prompt:
def prime_fib(n: int):
    """
    prIMe_fiB retUrns n-th numbER ThAt is a fIBOnacCi number anD it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """

    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]

METADATA = {}

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


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.

    >>> triples_sum_to_zero([1, 3, 5, 0])
    False
    >>> triples_sum_to_zero([1, 3, -2, 1])
    True
    >>> triples_sum_to_zero([1, 2, 3, 7])
    False
    >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])
    True
    >>> triples_sum_to_zero([1])
    False
    """

    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

METADATA = {}

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


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

METADATA = {}

def check(candidate):
    assert candidate(2) == 4
    assert candidate(3) == 9
    assert candidate(4) == 16
    assert candidate(8) == 64
    assert candidate(10) == 100


Prompt:
def incr_list(l: list):
    """RetURn list wiTh elEments inCREmEnted BY 1.
    >>> incr_list([1, 2, 3])
    [2, 3, 4]
    >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])
    [6, 4, 6, 3, 4, 4, 10, 1, 124]
    """


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.
    >>> pairs_sum_to_zero([1, 3, 5, 0])
    False
    >>> pairs_sum_to_zero([1, 3, -2, 1])
    False
    >>> pairs_sum_to_zero([1, 2, 3, 7])
    False
    >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])
    True
    >>> pairs_sum_to_zero([1])
    False
    """

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

METADATA = {}

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

    assert candidate([-3, 9, -1, 3, 2, 30]) == True
    assert candidate([-3, 9, -1, 3, 2, 31]) == True
    assert candidate([-3, 9, -1, 4, 2, 30]) == False
    assert candidate([-3, 9, -1, 4, 2, 31]) == False


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.
    >>> change_base(8, 3)
    '22'
    >>> change_base(8, 2)
    '1000'
    >>> change_base(7, 2)
    '111'
    """

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

METADATA = {}

def check(candidate):
    assert candidate(8, 3) == "22"
    assert candidate(9, 3) == "100"
    assert candidate(234, 2) == "11101010"
    assert candidate(16, 2) == "10000"
    assert candidate(8, 2) == "1000"
    assert candidate(7, 2) == "111"
    for x in range(2, 8):
        assert candidate(x, x + 1) == str(x)


Prompt:
def triangle_area(a, h):
    """GivEN lenGth oF a side and HIGh return Area fOR a TRianGle.
    >>> triangle_area(5, 3)
    7.5
    """

METADATA = {}

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


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.
    >>> fib4(5)
    4
    >>> fib4(6)
    8
    >>> fib4(7)
    14
    """

    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]

METADATA = {}

def check(candidate):
    assert candidate(5) == 4
    assert candidate(8) == 28
    assert candidate(10) == 104
    assert candidate(12) == 386


Prompt:
def median(l: list):
    """RetURn median of ElemEnts in the list l.
    >>> median([3, 1, 2, 4, 5])
    3
    >>> median([-10, 4, 6, 1000, 10, 20])
    15.0
    """

    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

METADATA = {}

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


Prompt:
def is_palindrome(text: str):
    """
    ChECks iF givEn string IS A pAlindROME
    >>> is_palindrome('')
    True
    >>> is_palindrome('aba')
    True
    >>> is_palindrome('aaaaa')
    True
    >>> is_palindrome('zbcd')
    False
    """

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

METADATA = {}

def check(candidate):
    assert candidate('') == True
    assert candidate('aba') == True
    assert candidate('aaaaa') == True
    assert candidate('zbcd') == False
    assert candidate('xywyx') == True
    assert candidate('xywyz') == False
    assert candidate('xywzx') == False


Prompt:
def modp(n: int, p: int):
    """RetURn 2^n mOdulO p (be aware OF NuMericS).
    >>> modp(3, 5)
    3
    >>> modp(1101, 101)
    2
    >>> modp(0, 101)
    1
    >>> modp(3, 11)
    8
    >>> modp(100, 101)
    1
    """

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

METADATA = {}

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


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

METADATA = {}

def check(candidate):
    from random import randint, choice
    import copy
    import string

    letters = string.ascii_lowercase
    for _ in range(100):
        str = ''.join(choice(letters) for i in range(randint(10, 20)))
        encoded_str = encode_shift(str)
        assert candidate(copy.deepcopy(encoded_str)) == str


Prompt:
def remove_vowels(text):
    """
    reMOve_vOwelS is a funcTIOn That tAKES strIng and retuRns string without vOWeLs.
    >>> remove_vowels('')
    ''
    >>> remove_vowels("abcdef\nghijklm")
    'bcdf\nghjklm'
    >>> remove_vowels('abcdef')
    'bcdf'
    >>> remove_vowels('aaaaa')
    ''
    >>> remove_vowels('aaBAA')
    'B'
    >>> remove_vowels('zbcd')
    'zbcd'
    """

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

METADATA = {}

def check(candidate):
    assert candidate('') == ''
    assert candidate("abcdef\nghijklm") == 'bcdf\nghjklm'
    assert candidate('fedcba') == 'fdcb'
    assert candidate('eeeee') == ''
    assert candidate('acBAA') == 'cB'
    assert candidate('EcBOO') == 'cB'
    assert candidate('ybcd') == 'ybcd'


Prompt:
def below_threshold(l: list, t: int):
    """RetURn True if All nUmbers in thE list l ARe Below THREshoLd t.
    >>> below_threshold([1, 2, 4, 10], 100)
    True
    >>> below_threshold([1, 20, 4, 10], 5)
    False
    """

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

METADATA = {}

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


Prompt:
def add(x: int, y: int):
    """Add TWo nuMberS x and y
    >>> add(2, 3)
    5
    >>> add(5, 7)
    12
    """

METADATA = {}

def check(candidate):
    import random

    assert candidate(0, 1) == 1
    assert candidate(1, 0) == 1
    assert candidate(2, 3) == 5
    assert candidate(5, 7) == 12
    assert candidate(7, 5) == 12

    for i in range(100):
        x, y = random.randint(0, 1000), random.randint(0, 1000)
        assert candidate(x, y) == x + y


Prompt:
def same_chars(s0: str, s1: str):
    """
    ChECk if Two wOrds have THE sAme chARACterS.
    >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')
    True
    >>> same_chars('abcd', 'dddddddabc')
    True
    >>> same_chars('dddddddabc', 'abcd')
    True
    >>> same_chars('eabcd', 'dddddddabc')
    False
    >>> same_chars('abcd', 'dddddddabce')
    False
    >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')
    False
    """

METADATA = {}

def check(candidate):
    assert candidate('eabcdzzzz', 'dddzzzzzzzddeddabc') == True
    assert candidate('abcd', 'dddddddabc') == True
    assert candidate('dddddddabc', 'abcd') == True
    assert candidate('eabcd', 'dddddddabc') == False
    assert candidate('abcd', 'dddddddabcf') == False
    assert candidate('eabcdzzzz', 'dddzzzzzzzddddabc') == False
    assert candidate('aabb', 'aaccc') == False


Prompt:
def fib(n: int):
    """RetURn n-th FiBonaCci numbeR.
    >>> fib(10)
    55
    >>> fib(1)
    1
    >>> fib(8)
    21
    """

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

METADATA = {}

def check(candidate):
    assert candidate(10) == 55
    assert candidate(1) == 1
    assert candidate(8) == 21
    assert candidate(11) == 89
    assert candidate(12) == 144


Prompt:
def correct_bracketing(brackets: str):
    """ brackets is A StriNg of "<" And ">".
    return True if eveRY OpEning BRACket Has a corresPonding closing braCKeT.

    >>> correct_bracketing("<")
    False
    >>> correct_bracketing("<>")
    True
    >>> correct_bracketing("<<><>>")
    True
    >>> correct_bracketing("><<>")
    False
    """

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

METADATA = {}

def check(candidate):
    assert candidate("<>")
    assert candidate("<<><>>")
    assert candidate("<><><<><>><>")
    assert candidate("<><><<<><><>><>><<><><<>>>")
    assert not candidate("<<<><>>>>")
    assert not candidate("><<>")
    assert not candidate("<")
    assert not candidate("<<<<")
    assert not candidate(">")
    assert not candidate("<<>")
    assert not candidate("<><><<><>><>><<>")
    assert not candidate("<><><<><>><>>><>")


Prompt:
def monotonic(l: list):
    """RetURn True is list ElemEnts are mONOtOnicaLLY IncrEasing or deCreasing.
    >>> monotonic([1, 2, 4, 20])
    True
    >>> monotonic([1, 20, 4, 10])
    False
    >>> monotonic([4, 1, 0, -10])
    True
    """

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

METADATA = {}

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


Prompt:
def common(l1: list, l2: list):
    """RetURn sorted unIque common Elements FOR tWo lisTS.
    >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])
    [1, 5, 653]
    >>> common([5, 3, 2, 8], [3, 2])
    [2, 3]

    """

    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.
    >>> largest_prime_factor(13195)
    29
    >>> largest_prime_factor(2048)
    2
    """

    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

METADATA = {}

def check(candidate):
    assert candidate(15) == 5
    assert candidate(27) == 3
    assert candidate(63) == 7
    assert candidate(330) == 11
    assert candidate(13195) == 29


Prompt:
def sum_to_n(n: int):
    """sum_TO_n is A funCtion thaT SUmS numbERS From 1 To n.
    >>> sum_to_n(30)
    465
    >>> sum_to_n(100)
    5050
    >>> sum_to_n(5)
    15
    >>> sum_to_n(10)
    55
    >>> sum_to_n(1)
    1
    """

METADATA = {}

def check(candidate):
    assert candidate(1) == 1
    assert candidate(6) == 21
    assert candidate(11) == 66
    assert candidate(30) == 465
    assert candidate(100) == 5050


Prompt:
def correct_bracketing(brackets: str):
    """ brackets is A StriNg of "(" And ")".
    return True if eveRY OpEning BRACket Has a corresPonding closing braCKeT.

    >>> correct_bracketing("(")
    False
    >>> correct_bracketing("()")
    True
    >>> correct_bracketing("(()())")
    True
    >>> correct_bracketing(")(()")
    False
    """

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

METADATA = {}

def check(candidate):
    assert candidate("()")
    assert candidate("(()())")
    assert candidate("()()(()())()")
    assert candidate("()()((()()())())(()()(()))")
    assert not candidate("((()())))")
    assert not candidate(")(()")
    assert not candidate("(")
    assert not candidate("((((")
    assert not candidate(")")
    assert not candidate("(()")
    assert not candidate("()()(()())())(()")
    assert not candidate("()()(()())()))()")


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.
    >>> derivative([3, 1, 2, 4, 5])
    [1, 4, 12, 20]
    >>> derivative([1, 2, 3])
    [2, 6]
    """

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

METADATA = {}

def check(candidate):
    assert candidate([3, 1, 2, 4, 5]) == [1, 4, 12, 20]
    assert candidate([1, 2, 3]) == [2, 6]
    assert candidate([3, 2, 1]) == [2, 2]
    assert candidate([3, 2, 1, 0, 4]) == [2, 2, 0, 16]
    assert candidate([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.
    >>> fibfib(1)
    0
    >>> fibfib(5)
    4
    >>> fibfib(8)
    24
    """

    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)

METADATA = {}

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


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.

    exAmple:
    >>> vowels_count("abcde")
    2
    >>> vowels_count("ACEDY")
    3
    """

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

    # Check some simple cases
    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"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"


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.
    >>> circular_shift(12, 1)
    "21"
    >>> circular_shift(12, 2)
    "12"
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate(100, 2) == "001"
    assert candidate(12, 2) == "12"
    assert candidate(97, 8) == "79"
    assert candidate(12, 1) == "21", "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate(11, 101) == "11", "This prints if this assert fails 2 (also good for debugging!)"


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.

    exAMpLes:
        digitSum("") => 0
        digitSum("abAB") => 131
        digitSum("abcCd") => 67
        digitSum("helloE") => 69
        digitSum("woArBld") => 131
        digitSum("aAaaaXa") => 153
    """

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

def check(candidate):

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate("") == 0, "Error"
    assert candidate("abAB") == 131, "Error"
    assert candidate("abcCd") == 67, "Error"
    assert candidate("helloE") == 69, "Error"
    assert candidate("woArBld") == 131, "Error"
    assert candidate("aAaaaXa") == 153, "Error"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate(" How are yOu?") == 151, "Error"
    assert candidate("You arE Very Smart") == 327, "Error"


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

    # Check some simple cases
    assert candidate("5 apples and 6 oranges",19) == 8
    assert candidate("5 apples and 6 oranges",21) == 10
    assert candidate("0 apples and 1 oranges",3) == 2
    assert candidate("1 apples and 0 oranges",3) == 2
    assert candidate("2 apples and 3 oranges",100) == 95
    assert candidate("2 apples and 3 oranges",5) == 0
    assert candidate("1 apples and 100 oranges",120) == 19


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 [].

    ExAmple 1:
        INput: [4,2,3]
        OuTpuT: [2, 1]
        ExPlAnaTioN: 2 hAS the smaLLeST eVen valuE, And 2 HAs the smaLlest index.

    exAmple 2:
        INput: [1,2,3]
        OutPUt: [2, 1]
        eXpLanaTIoN: 2 hAs the sMALLest eVen vaLue, and 2 has the SmallEst index.

    ExAmPLe 3:
        Input: []
        OUtpUt: []

    eXaMPLE 4:
        INPUT: [5, 0, 3, 0, 4, 2]
        OUtpUT: [0, 1]
        ExpLanAtion: 0 is tHe smallest vALuE, but  THeRE aRE tWo zErOs,
                     sO wE Will chOoSE THE First zerO, WhiCh Has the smAllEst index.

    COnSTraints:
        * 1 <= Nodes.LENgtH <= 10000
        * 0 <= node.VAluE
    """

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

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate([4,2,3]) == [2, 1], "Error"
    assert candidate([1,2,3]) == [2, 1], "Error"
    assert candidate([]) == [], "Error"
    assert candidate([5, 0, 3, 0, 4, 2]) == [0, 1], "Error"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate([1, 2, 3, 0, 5, 3]) == [0, 3], "Error"
    assert candidate([5, 4, 8, 4 ,8]) == [4, 1], "Error"
    assert candidate([7, 6, 7, 1]) == [6, 1], "Error"
    assert candidate([7, 9, 7, 1]) == [], "Error"


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.
    exaMpLes:
        search([4, 1, 2, 2, 3, 1]) == 2
        search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3
        search([5, 5, 4, 4, 4]) == -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.

    Examples:
    StRAngE_sorT_lIst([1, 2, 3, 4]) == [1, 4, 2, 3]
    StRANGE_sort_lIsT([5, 5, 5, 5]) == [5, 5, 5, 5]
    straNge_SOrT_lIST([]) == []
    '''

    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.
    EXamPlE:
    TriAnglE_aREa(3, 4, 5) == 6.00
    tRiAngle_aREA(1, 2, 10) == -1
    '''

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

    # Check some simple cases
    assert candidate(3, 4, 5) == 6.00, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(1, 2, 10) == -1
    assert candidate(4, 8, 5) == 8.18
    assert candidate(2, 2, 2) == 1.73
    assert candidate(1, 2, 3) == -1
    assert candidate(10, 5, 7) == 16.25
    assert candidate(2, 6, 3) == -1

    # Check some edge cases that are easy to work out by hand.
    assert candidate(1, 1, 1) == 0.43, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate(2, 2, 10) == -1


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.

    exAmple:
    WilL_It_FlY([1, 2], 5) ➞ False
    # 1+2 IS LEss ThAn the maXimUM possiBle WeIGht, But iT's UNbaLaNced.

    wiLL_It_fly([3, 2, 3], 1) ➞ False
    # It's balanCed, but 3+2+3 iS MoRe than The MaXImum POSsiblE weiGht.

    Will_it_flY([3, 2, 3], 9) ➞ True
    # 3+2+3 iS leSs than the MaximUm possIble weIght, anD it'S baLaNceD.

    wiLl_IT_fly([3], 5) ➞ True
    # 3 is lESs THaN the maxIMum POssible wEight, AnD it's baLanced.
    '''

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

    # Check some simple cases
    assert candidate([3, 2, 3], 9) is True
    assert candidate([1, 2], 5) is False
    assert candidate([3], 5) is True
    assert candidate([3, 2, 3], 1) is False

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1, 2, 3], 6) is False
    assert candidate([5], 5) is True


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.

    FOr exAmPLe:
    sMaLlest_cHANge([1,2,3,5,4,7,9,6]) == 4
    smAllest_chAnge([1, 2, 3, 4, 3, 2, 2]) == 1
    smaLLeSt_chanGe([1, 2, 3, 2, 1]) == 0
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate([1,2,3,5,4,7,9,6]) == 4
    assert candidate([1, 2, 3, 4, 3, 2, 2]) == 1
    assert candidate([1, 4, 2]) == 1
    assert candidate([1, 4, 4, 2]) == 1

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1, 2, 3, 2, 1]) == 0
    assert candidate([3, 1, 1, 3]) == 0
    assert candidate([1]) == 0
    assert candidate([0, 1]) == 1


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.

    EXaMples
    TotAL_mAtCH([], []) ➞ []
    TOTal_MaTch(['hi', 'adMin'], ['Hi', 'Hi']) ➞ ['hI', 'HI']
    toTaL_MatCh(['hi', 'AdMIn'], ['hI', 'hI', 'admin', 'PROject']) ➞ ['Hi', 'admin']
    tOtal_matCH(['hI', 'admin'], ['HI', 'hI', 'hI']) ➞ ['HI', 'hi', 'HI']
    Total_MatcH(['4'], ['1', '2', '3', '4', '5']) ➞ ['4']
    '''

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

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate([], []) == []
    assert candidate(['hi', 'admin'], ['hi', 'hi']) == ['hi', 'hi']
    assert candidate(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) == ['hi', 'admin']
    assert candidate(['4'], ['1', '2', '3', '4', '5']) == ['4']
    assert candidate(['hi', 'admin'], ['hI', 'Hi']) == ['hI', 'Hi']
    assert candidate(['hi', 'admin'], ['hI', 'hi', 'hi']) == ['hI', 'hi', 'hi']
    assert candidate(['hi', 'admin'], ['hI', 'hi', 'hii']) == ['hi', 'admin']

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate([], ['this']) == []
    assert candidate(['this'], []) == []


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.
    EXaMPLe:
    iS_MUltiply_prImE(30) == True
    30 = 2 * 3 * 5
    """

    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
    assert candidate(30) == True
    assert candidate(8) == True
    assert candidate(10) == False
    assert candidate(125) == True
    assert candidate(3 * 5 * 7) == True
    assert candidate(3 * 6 * 7) == False
    assert candidate(9 * 9 * 9) == False
    assert candidate(11 * 9 * 9) == False
    assert candidate(11 * 13 * 7) == True


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
    FOr eXAmplE:
    iS_sImPlE_PoWEr(1, 4) => tRuE
    IS_siMPLe_power(2, 2) => trUe
    IS_siMple_PoWer(8, 2) => TrUE
    IS_Simple_PoWer(3, 2) => faLse
    IS_sImPLE_POweR(3, 1) => fAlse
    is_sImpLE_power(5, 3) => FalSe
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate(16, 2)== True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(143214, 16)== False, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(4, 2)==True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(9, 3)==True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(16, 4)==True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(24, 2)==False, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(128, 4)==False, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(12, 6)==False, "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate(1, 1)==True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate(1, 12)==True, "This prints if this assert fails 2 (also good for debugging!)"


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.
    EXAMplES:
    iscube(1) ==> True
    iscube(2) ==> False
    iscube(-1) ==> True
    iscube(64) ==> True
    iscube(0) ==> True
    iscube(180) ==> False
    '''

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

def check(candidate):

    # Check some simple cases
    assert candidate(1) == True, "First test error: " + str(candidate(1))
    assert candidate(2) == False, "Second test error: " + str(candidate(2))
    assert candidate(-1) == True, "Third test error: " + str(candidate(-1))
    assert candidate(64) == True, "Fourth test error: " + str(candidate(64))
    assert candidate(180) == False, "Fifth test error: " + str(candidate(180))
    assert candidate(1000) == True, "Sixth test error: " + str(candidate(1000))

    # Check some edge cases that are easy to work out by hand.
    assert candidate(0) == True, "1st edge test error: " + str(candidate(0))
    assert candidate(1729) == False, "2nd edge test error: " + str(candidate(1728))


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.
    ExamPLeS:
    foR num = "AB" tHE oUtPut shoULD Be 1.
    For num = "1077e" the oUtput should bE 2.
    For num = "AbED1A33" tHe OUtput shoUld Be 4.
    fOr num = "123456789abcdEf0" THE oUtpUT shoUld Be 6.
    For num = "2020" the Output shoulD Be 2.
    """

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

    # Check some simple cases
    assert candidate("AB") == 1, "First test error: " + str(candidate("AB"))
    assert candidate("1077E") == 2, "Second test error: " + str(candidate("1077E"))
    assert candidate("ABED1A33") == 4, "Third test error: " + str(candidate("ABED1A33"))
    assert candidate("2020") == 2, "Fourth test error: " + str(candidate("2020"))
    assert candidate("123456789ABCDEF0") == 6, "Fifth test error: " + str(candidate("123456789ABCDEF0"))
    assert candidate("112233445566778899AABBCCDDEEFF00") == 12, "Sixth test error: " + str(candidate("112233445566778899AABBCCDDEEFF00"))

    # Check some edge cases that are easy to work out by hand.
    assert candidate([]) == 0


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.

    ExaMplEs:
    decimal_to_binary(15)   # returnS "dB1111db"
    decimal_to_binary(32)   # Returns "db100000Db"
    """

def check(candidate):

    # Check some simple cases
    assert candidate(0) == "db0db"
    assert candidate(32) == "db100000db"
    assert candidate(103) == "db1100111db"
    assert candidate(15) == "db1111db", "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"


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
    For exAmPLe:
    iS_hapPy(A) => False
    is_HaPPY(AA) => False
    is_hapPy(Abcd) => True
    iS_haPPy(AaBB) => False
    IS_HapPy(Adb) => True
    is_haPpy(XYy) => False
    """

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

    # Check some simple cases
    assert candidate("a") == False , "a"
    assert candidate("aa") == False , "aa"
    assert candidate("abcd") == True , "abcd"
    assert candidate("aabb") == False , "aabb"
    assert candidate("adb") == True , "adb"
    assert candidate("xyy") == False , "xyy"
    assert candidate("iopaxpoi") == True , "iopaxpoi"
    assert candidate("iopaxioi") == False , "iopaxioi"


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

    exaMple:
    grade_EquatIon([4.0, 3, 1.7, 2, 3.5]) ==> ['A+', 'B', 'C-', 'c', 'A-']
    """

    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

def check(candidate):

    # Check some simple cases
    assert candidate([4.0, 3, 1.7, 2, 3.5]) == ['A+', 'B', 'C-', 'C', 'A-']
    assert candidate([1.2]) == ['D+']
    assert candidate([0.5]) == ['D-']
    assert candidate([0.0]) == ['E']
    assert candidate([1, 0.3, 1.5, 2.8, 3.3]) == ['D', 'D-', 'C-', 'B', 'B+']
    assert candidate([0, 0.7]) == ['E', 'D-']

    # Check some edge cases that are easy to work out by hand.
    assert True


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
    exampleS
    PrimE_lenGtH('HELlO') == True
    prIMe_leNgTh('AbCdCBa') == True
    PRimE_lENGth('KITtens') == True
    primE_lENgtH('oraNgE') == False
    """

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

    # Check some simple cases
    assert candidate('Hello') == True
    assert candidate('abcdcba') == True
    assert candidate('kittens') == True
    assert candidate('orange') == False
    assert candidate('wow') == True
    assert candidate('world') == True
    assert candidate('MadaM') == True
    assert candidate('Wow') == True
    assert candidate('') == False
    assert candidate('HI') == True
    assert candidate('go') == True
    assert candidate('gogo') == False
    assert candidate('aaaaaaaaaaaaaaa') == False

    # Check some edge cases that are easy to work out by hand.
    assert candidate('Madam') == True
    assert candidate('M') == False
    assert candidate('0') == False


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

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(1) == 1
    assert candidate(2) == 18
    assert candidate(3) == 180
    assert candidate(4) == 1800
    assert candidate(5) == 18000

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"


Prompt:
def solve(N):
    """GivEN a poSitiVe integeR N, return THe Total sum OF ITs diGits in binary.

    example
        For N = 1000, the sum of diGItS wIlL be 1 the oUTput ShouLd Be "1".
        fOr N = 150, The sum OF digItS wIlL bE 6 ThE OutPuT SHouLD Be "110".
        For N = 147, the sum oF dIGitS wilL bE 12 thE oUTPUT shoulD bE "1100".

    VariAblES:
        @N iNtEGER
             conStRaints: 0 ≤ N ≤ 10000.
    OUtpUT:
         a striNg oF bINarY numBeR
    """

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

def check(candidate):

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(1000) == "1", "Error"
    assert candidate(150) == "110", "Error"
    assert candidate(147) == "1100", "Error"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate(333) == "1001", "Error"
    assert candidate(963) == "10010", "Error"


Prompt:
def add(lst):
    """GivEN a noN-empTy list of inteGERs lst. add The evEN ELemeNts that are At odd indices..

    ExampLEs:
        add([4, 2, 6, 7]) ==> 2
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate([4, 88]) == 88
    assert candidate([4, 5, 6, 7, 2, 122]) == 122
    assert candidate([4, 0, 6, 7]) == 0
    assert candidate([4, 4, 6, 8]) == 12

    # Check some edge cases that are easy to work out by hand.


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.

    FOr eXaMPle:
    aNTI_shufFle('HI') reTurns 'Hi'
    aNtI_shUffle('hellO') retuRns 'ehlLo'
    anti_ShufflE('HeLlo woRld!!!') RetUrNS 'Hello !!!WDLoR'
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate('Hi') == 'Hi'
    assert candidate('hello') == 'ehllo'
    assert candidate('number') == 'bemnru'
    assert candidate('abcd') == 'abcd'
    assert candidate('Hello World!!!') == 'Hello !!!Wdlor'
    assert candidate('') == ''
    assert candidate('Hi. My name is Mister Robot. How are you?') == '.Hi My aemn is Meirst .Rboot How aer ?ouy'
    # Check some edge cases that are easy to work out by hand.
    assert True


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.

    ExaMples:
    gEt_row([
      [1,2,3,4,5,6],
      [1,2,3,4,1,6],
      [1,2,3,4,5,1]
    ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]
    gEt_rOw([], 1) == []
    gEt_Row([[], [1], [1, 2, 3]], 3) == [(2, 2)]
    """

    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.

    ExAmPles:
    * soRT_Array([]) => []
    * Sort_arraY([5]) => [5]
    * sort_arRAy([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]
    * Sort_arRay([2, 4, 3, 0, 1, 5, 6]) => [6, 5, 4, 3, 2, 1, 0]
    """

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

def check(candidate):

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate([]) == [], "Error"
    assert candidate([5]) == [5], "Error"
    assert candidate([2, 4, 3, 0, 1, 5]) == [0, 1, 2, 3, 4, 5], "Error"
    assert candidate([2, 4, 3, 0, 1, 5, 6]) == [6, 5, 4, 3, 2, 1, 0], "Error"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate([2, 1]) == [1, 2], "Error"
    assert candidate([15, 42, 87, 32 ,11, 0]) == [0, 11, 15, 32, 42, 87], "Error"
    assert candidate([21, 14, 23, 11]) == [23, 21, 14, 11], "Error"


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.
    FOr Example:
    encrypt('hi') RetURns 'lm'
    encrypt('asdfghjkl') rEtuRnS 'EwhJklnOp'
    encrypt('gf') REtuRnS 'kj'
    encrypt('et') retURNs 'ix'
    """

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

    # Check some simple cases
    assert candidate('hi') == 'lm', "This prints if this assert fails 1 (good for debugging!)"
    assert candidate('asdfghjkl') == 'ewhjklnop', "This prints if this assert fails 1 (good for debugging!)"
    assert candidate('gf') == 'kj', "This prints if this assert fails 1 (good for debugging!)"
    assert candidate('et') == 'ix', "This prints if this assert fails 1 (good for debugging!)"

    assert candidate('faewfawefaewg')=='jeiajeaijeiak', "This prints if this assert fails 1 (good for debugging!)"
    assert candidate('hellomyfriend')=='lippsqcjvmirh', "This prints if this assert fails 2 (good for debugging!)"
    assert candidate('dxzdlmnilfuhmilufhlihufnmlimnufhlimnufhfucufh')=='hbdhpqrmpjylqmpyjlpmlyjrqpmqryjlpmqryjljygyjl', "This prints if this assert fails 3 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate('a')=='e', "This prints if this assert fails 2 (also good for debugging!)"


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

    # Check some simple cases
    assert candidate([1, 2, 3, 4, 5]) == 2
    assert candidate([5, 1, 4, 3, 2]) == 2
    assert candidate([]) == None
    assert candidate([1, 1]) == None
    assert candidate([1,1,1,1,0]) == 1
    assert candidate([1, 0**0]) == None
    assert candidate([-35, 34, 12, -45]) == -35

    # Check some edge cases that are easy to work out by hand.
    assert True


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

    fOr example:
    >>> is_bored("Hello world")
    0
    >>> is_bored("The sky is blue. The sun is shining. I love this weather")
    1
    """

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

def check(candidate):

    # Check some simple cases
    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"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"


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.

    exaMpleS
    aNy_iNt(5, 2, 7) ➞ True

    ANY_INt(3, 2, 2) ➞ False

    any_iNt(3, -2, 1) ➞ True

    Any_inT(3.6, -2.2, 2) ➞ False

    '''

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

    # Check some simple cases
    assert candidate(2, 3, 1)==True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate(2.5, 2, 3)==False, "This prints if this assert fails 2 (good for debugging!)"
    assert candidate(1.5, 5, 3.5)==False, "This prints if this assert fails 3 (good for debugging!)"
    assert candidate(2, 6, 2)==False, "This prints if this assert fails 4 (good for debugging!)"
    assert candidate(4, 2, 2)==True, "This prints if this assert fails 5 (good for debugging!)"
    assert candidate(2.2, 2.2, 2.2)==False, "This prints if this assert fails 6 (good for debugging!)"
    assert candidate(-4, 6, 2)==True, "This prints if this assert fails 7 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate(2,1,1)==True, "This prints if this assert fails 8 (also good for debugging!)"
    assert candidate(3,4,7)==True, "This prints if this assert fails 9 (also good for debugging!)"
    assert candidate(3.0,4,7)==False, "This prints if this assert fails 10 (also good for debugging!)"


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.

    ExaMplES:
    >>> encode('test')
    'TGST'
    >>> encode('This is a message')
    'tHKS KS C MGSSCGG'
    """

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

    # Check some simple cases
    assert candidate('TEST') == 'tgst', "This prints if this assert fails 1 (good for debugging!)"
    assert candidate('Mudasir') == 'mWDCSKR', "This prints if this assert fails 2 (good for debugging!)"
    assert candidate('YES') == 'ygs', "This prints if this assert fails 3 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate('This is a message') == 'tHKS KS C MGSSCGG', "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate("I DoNt KnOw WhAt tO WrItE") == 'k dQnT kNqW wHcT Tq wRkTg', "This prints if this assert fails 2 (also good for debugging!)"


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.

    ExampLEs:
    FoR lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the OuTpUT sHouLD be 10
    FOr lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] ThE oUtPUt SHouLd BE 25
    for lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] THE output shOuLD be 13
    for lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] tHe OutPuT SHOUld be 11
    FOr lst = [0,81,12,3,1,21] The ouTpuT ShOuLD BE 3
    for lst = [0,8,1,2,1,7] ThE output ShoULd be 7
    """

    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

def check(candidate):

    # Check some simple cases
    assert candidate([0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3]) == 10, "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1]) == 25, "This prints if this assert fails 2 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3]) == 13, "This prints if this assert fails 3 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,724,32,71,99,32,6,0,5,91,83,0,5,6]) == 11, "This prints if this assert fails 4 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,81,12,3,1,21]) == 3, "This prints if this assert fails 5 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,8,1,2,1,7]) == 7, "This prints if this assert fails 6 (also good for debugging!)"

    assert candidate([8191]) == 19, "This prints if this assert fails 7 (also good for debugging!)"
    assert candidate([8191, 123456, 127, 7]) == 19, "This prints if this assert fails 8 (also good for debugging!)"
    assert candidate([127, 97, 8192]) == 10, "This prints if this assert fails 9 (also good for debugging!)"


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.
    exaMpLES:
    chECK_dict_case({"A":"aPPle", "B":"banAnA"}) shOuLD return True.
    CHEck_dicT_cAse({"a":"aPplE", "a":"bAnANA", "b":"BanAnA"}) should return False.
    CheCK_dict_cAse({"A":"aPPle", 8:"BanaNa", "A":"AppLe"}) Should return False.
    CHEck_diCt_case({"NaMe":"John", "AGE":"36", "CIty":"HouStoN"}) sHOuld return False.
    CHEck_diCt_caSe({"StATE":"NC", "ZIp":"12345" }) sHouLd return True.
    """

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

    # Check some simple cases
    assert candidate({"p":"pineapple", "b":"banana"}) == True, "First test error: " + str(candidate({"p":"pineapple", "b":"banana"}))
    assert candidate({"p":"pineapple", "A":"banana", "B":"banana"}) == False, "Second test error: " + str(candidate({"p":"pineapple", "A":"banana", "B":"banana"}))
    assert candidate({"p":"pineapple", 5:"banana", "a":"apple"}) == False, "Third test error: " + str(candidate({"p":"pineapple", 5:"banana", "a":"apple"}))
    assert candidate({"Name":"John", "Age":"36", "City":"Houston"}) == False, "Fourth test error: " + str(candidate({"Name":"John", "Age":"36", "City":"Houston"}))
    assert candidate({"STATE":"NC", "ZIP":"12345" }) == True, "Fifth test error: " + str(candidate({"STATE":"NC", "ZIP":"12345" }))
    assert candidate({"fruit":"Orange", "taste":"Sweet" }) == True, "Fourth test error: " + str(candidate({"fruit":"Orange", "taste":"Sweet" }))

    # Check some edge cases that are easy to work out by hand.
    assert candidate({}) == False, "1st edge test error: " + str(candidate({}))


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.
    FOr eXaMPLe:
    cOUNt_up_to(5) => [2,3]
    couNt_UP_to(11) => [2,3,5,7]
    CounT_uP_to(0) => []
    CoUNT_UP_to(20) => [2,3,5,7,11,13,17,19]
    couNt_Up_to(1) => []
    cOunT_Up_To(18) => [2,3,5,7,11,13,17]
    """

    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.
    exAmPlES:
    multiply(148, 412) sHOulD return 16.
    multiply(19, 28) sHOUld return 72.
    multiply(2020, 1851) SHOuld return 0.
    multiply(14,-15) shoulD return 20.
    """

def check(candidate):

    # Check some simple cases
    assert candidate(148, 412) == 16, "First test error: " + str(candidate(148, 412))
    assert candidate(19, 28) == 72, "Second test error: " + str(candidate(19, 28))
    assert candidate(2020, 1851) == 0, "Third test error: " + str(candidate(2020, 1851))
    assert candidate(14,-15) == 20, "Fourth test error: " + str(candidate(14,-15))
    assert candidate(76, 67) == 42, "Fifth test error: " + str(candidate(76, 67))
    assert candidate(17, 27) == 49, "Sixth test error: " + str(candidate(17, 27))

    # Check some edge cases that are easy to work out by hand.
    assert candidate(0, 1) == 0, "1st edge test error: " + str(candidate(0, 1))
    assert candidate(0, 0) == 0, "2nd edge test error: " + str(candidate(0, 0))


Prompt:
def count_upper(s):
    """
    GiVEn a sTrinG s, count the numbER Of UpperCASE vowEls in even indIces.

    For example:
    count_upper('aBCdEf') retURnS 1
    count_upper('abcdefg') rEtUrns 0
    count_upper('dBBE') retURns 0
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate('aBCdEf')  == 1
    assert candidate('abcdefg') == 0
    assert candidate('dBBE') == 0
    assert candidate('B')  == 0
    assert candidate('U')  == 1
    assert candidate('') == 0
    assert candidate('EEEE') == 2

    # Check some edge cases that are easy to work out by hand.
    assert True


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.

    EXAmpLes
    >>> closest_integer("10")
    10
    >>> closest_integer("15.3")
    15

    Note:
    Rounding away from zero means that if the given number is equidistant
    from two integers, the one you should return is the one that is the
    farthest from zero. For example closest_integer("14.5") should
    return 15 and closest_integer("-14.5") should return -15.
    '''

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

    # Check some simple cases
    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"

    # Check some edge cases that are easy to work out by hand.
    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).

    exampleS:
    >>> make_a_pile(3)
    [3, 5, 7]
    """

def check(candidate):

    # Check some simple cases
    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]
    assert candidate(6) == [6, 8, 10, 12, 14, 16]
    assert candidate(8) == [8, 10, 12, 14, 16, 18, 20, 22]

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"


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.

    FOr ExAMpLE:
    woRdS_STriNG("hi, my name iS JOHn") == ["HI", "my", "nAmE", "is", "joHN"]
    WORds_strInG("One, tWo, tHReE, fOUR, FIve, SiX") == ["One", "two", "ThrEE", "four", "fIve", "SiX"]
    """

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

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate("Hi, my name is John") == ["Hi", "my", "name", "is", "John"]
    assert candidate("One, two, three, four, five, six") == ["One", "two", "three", "four", "five", "six"]
    assert candidate("Hi, my name") == ["Hi", "my", "name"]
    assert candidate("One,, two, three, four, five, six,") == ["One", "two", "three", "four", "five", "six"]

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate("") == []
    assert candidate("ahmed     , gamal") == ["ahmed", "gamal"]


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.

    FOr exAmPle:
    ChOOSE_Num(12, 15) = 14
    choOsE_num(13, 12) = -1
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate(12, 15) == 14
    assert candidate(13, 12) == -1
    assert candidate(33, 12354) == 12354
    assert candidate(5234, 5233) == -1
    assert candidate(6, 29) == 28
    assert candidate(27, 10) == -1

    # Check some edge cases that are easy to work out by hand.
    assert candidate(7, 7) == -1
    assert candidate(546, 546) == 546


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.
    eXaMpLE:
    ROUndEd_Avg(1, 5) => "0b11"
    rouNdeD_Avg(7, 5) => -1
    rouNdeD_aVG(10, 20) => "0b1111"
    rOundEd_AVg(20, 33) => "0b11010"
    """

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

def check(candidate):

    # Check some simple cases
    assert candidate(1, 5) == "0b11"
    assert candidate(7, 13) == "0b1010"
    assert candidate(964,977) == "0b1111001010"
    assert candidate(996,997) == "0b1111100100"
    assert candidate(560,851) == "0b1011000010"
    assert candidate(185,546) == "0b101101110"
    assert candidate(362,496) == "0b110101101"
    assert candidate(350,902) == "0b1001110010"
    assert candidate(197,233) == "0b11010111"

    # Check some edge cases that are easy to work out by hand.
    assert candidate(7, 5) == -1
    assert candidate(5, 1) == -1
    assert candidate(5, 5) == "0b101"


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.

    foR exAMple:
    >>> unique_digits([15, 33, 1422, 1])
    [1, 15, 33]
    >>> unique_digits([152, 323, 1422, 10])
    []
    """

    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)

def check(candidate):

    # Check some simple cases
    assert candidate([15, 33, 1422, 1]) == [1, 15, 33]
    assert candidate([152, 323, 1422, 10]) == []
    assert candidate([12345, 2033, 111, 151]) == [111, 151]
    assert candidate([135, 103, 31]) == [31, 135]

    # Check some edge cases that are easy to work out by hand.
    assert True


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

    FoR exAMpLe:
      arr = [2, 1, 1, 4, 5, 8, 2, 3]
            -> SORT arr -> [1, 1, 2, 2, 3, 4, 5, 8]
            -> reverse arr -> [8, 5, 4, 3, 2, 2, 1, 1]
      return ["eigHt", "five", "FouR", "ThREe", "Two", "TWo", "ONe", "oNe"]

      IF the ArRAy iS eMpty, return an EMPty arRay:
      arr = []
      return []

      If the Array haS AnY stranGe nUmBEr igNORe it:
      arr = [1, -1 , 55]
            -> sOrt arr -> [-1, 1, 55]
            -> reverse arr -> [55, 1, -1]
      return = ['ONe']
    """

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

    # Check some simple cases
    assert True, "This prints if this assert fails 1 (good for debugging!)"
    assert candidate([2, 1, 1, 4, 5, 8, 2, 3]) == ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"], "Error"
    assert candidate([]) == [], "Error"
    assert candidate([1, -1 , 55]) == ['One'], "Error"

    # Check some edge cases that are easy to work out by hand.
    assert True, "This prints if this assert fails 2 (also good for debugging!)"
    assert candidate([1, -1, 3, 2]) == ["Three", "Two", "One"]
    assert candidate([9, 4, 8]) == ["Nine", "Eight", "Four"]


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).
    examPlE:
    f(5) == [1, 2, 6, 24, 15]
    """

    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]
    assert candidate(7) == [1, 2, 6, 24, 15, 720, 28]
    assert candidate(1) == [1]
    assert candidate(3) == [1, 2, 6]


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.

    EXAmplE 1:

        INpUt: 3
        ouTPuT: (1, 2)
        expLaNATioN:
        iNteger palInDRomE are 1, 2, 3. OnE of ThEM IS Even, anD tWo of tHem ARe OdD.

    eXAMplE 2:

        INput: 12
        OutPut: (4, 6)
        eXplanaTioN:
        INTegEr paLiNDroMe Are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. fouR OF them Are even, aNd 6 of theM ArE odd.

    NoTe:
        1. 1 <= n <= 10^3
        2. rEtURned tuple HAS the nUmbeR of Even and oDd IntEger palinDromeS respeCtivelY.
    """

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

    # Check some simple cases
    assert candidate(123) == (8, 13)
    assert candidate(12) == (4, 6)
    assert candidate(3) == (1, 2)
    assert candidate(63) == (6, 8)
    assert candidate(25) == (5, 6)
    assert candidate(19) == (4, 6)
    assert candidate(9) == (4, 5), "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate(1) == (0, 1), "This prints if this assert fails 2 (also good for debugging!)"