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)

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)
                # print('@@this is the line to split##')
                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)

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)
            # print('@@this is the line to split##')
        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

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

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
        # print('@@this is the line to split##')
        if balance < 0:
            return True

    return False


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)

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)
    # print('@@this is the line to split##')
    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]:

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]

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]:
        # print('@@this is the line to split##')
        result.append(n)
        result.append(delimeter)

    result.append(numbers[-1])

    return result


Prompt:
from typing import List

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

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

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
                # print('@@this is the line to split##')
                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

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)

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

    # print('@@this is the line to split##')
    for n in numbers:
        sum_value += n
        prod_value *= n
    return sum_value, prod_value


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

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]

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
            # print('@@this is the line to split##')
        else:
            running_max = max(running_max, n)

        result.append(running_max)

    return result


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

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

	beginning_of_suffix = 0

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'

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
    # print('@@this is the line to split##')

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

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


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'

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

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

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'
            # print('@@this is the line to split##')
        else:
            return '1'

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


Prompt:
from typing import List, Optional

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

	>>> longest(['a', 'b', 'c'])
	'a'
	>>> longest(['a', 'bb', 'ccc'])
	'ccc'
	"""
	if not strings:
		return None

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'

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

    # print('@@this is the line to split##')
    maxlen = max(len(x) for x in strings)
    for s in strings:
        if len(s) == maxlen:
            return s


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:

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

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:
        # print('@@this is the line to split##')
        a, b = b, a % b
    return a


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

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

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

    # print('@@this is the line to split##')
    for i in range(len(string)):
        result.append(string[:i+1])
    return result


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}

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]

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}
    # print('@@this is the line to split##')
    return [note_map[x] for x in music_string.split(' ') if x]


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

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

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):
        # print('@@this is the line to split##')
        if string[i:i+len(substring)] == substring:
            times += 1

    return times


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,

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'

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,
        # print('@@this is the line to split##')
        '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]))


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)

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)
                    # print('@@this is the line to split##')
                    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)

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)
    # print('@@this is the line to split##')
    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

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)):
        # print('@@this is the line to split##')
        if n % i == 0:
            return i


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)

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]

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)
            # print('@@this is the line to split##')
            n //= i
        else:
            i += 1

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


Prompt:
from typing import List

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

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]

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
    # print('@@this is the line to split##')
    c = collections.Counter(numbers)
    return [n for n in numbers if c[n] <= 1]


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

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):
        # print('@@this is the line to split##')
        if n % k == 0:
            return False
    return True


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:

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

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:
        # print('@@this is the line to split##')
        center = (begin + end) / 2.0
        if poly(xs, center) * poly(xs, begin) > 0:
            begin = center
        else:
            end = center
    return begin


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

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)
    # print('@@this is the line to split##')
    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

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:
        # print('@@this is the line to split##')
        if e > m:
            m = e
    return m


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

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

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)
            # print('@@this is the line to split##')
    s = ''.join(list(map(str, ns)))
    ans = 0
    for c in s:
        ans += (c == '7')
    return ans


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

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 = []
    # print('@@this is the line to split##')
    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

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

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
                # print('@@this is the line to split##')
        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]


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

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

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)):
                # print('@@this is the line to split##')
                if l[i] + l[j] + l[k] == 0:
                    return True
    return 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)):

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

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)):
            # print('@@this is the line to split##')
            if l1 + l[j] == 0:
                return True
    return 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:

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)

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:
        # print('@@this is the line to split##')
        ret = str(x % base) + ret
        x //= base
    return ret


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]

METADATA = {}

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

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]

    # print('@@this is the line to split##')
    for _ in range(4, n + 1):
        results.append(results[-1] + results[-2] + results[-3] + results[-4])
        results.pop(0)

    return results[-1]


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:

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

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:
        # print('@@this is the line to split##')
        return l[len(l) // 2]
    else:
        return (l[len(l) // 2 - 1] + l[len(l) // 2]) / 2.0


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

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]:
            # print('@@this is the line to split##')
            return False
    return True


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

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):
        # print('@@this is the line to split##')
        ret = (2 * ret) % p
    return ret


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)

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:
            # print('@@this is the line to split##')
            return False
    return True


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

METADATA = {}

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

def fib(n: int):
    """Return n-th Fibonacci number.
    >>> fib(10)
    55
    >>> fib(1)
    1
    >>> fib(8)
    21
    """
    if n == 0:
        return 0
        # print('@@this is the line to split##')
    if n == 1:
        return 1
    return fib(n - 1) + fib(n - 2)


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

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

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
            # print('@@this is the line to split##')
        else:
            depth -= 1
        if depth < 0:
            return False
    return depth == 0


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

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

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):
        # print('@@this is the line to split##')
        return True
    return False


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:

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:
            # print('@@this is the line to split##')
            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

METADATA = {}

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

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
                # print('@@this is the line to split##')
        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


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

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

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
            # print('@@this is the line to split##')
        else:
            depth -= 1
        if depth < 0:
            return False
    return depth == 0


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:

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

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:
        # print('@@this is the line to split##')
        return 0
    if n == 2:
        return 1
    return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3)


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)

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

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)
    # print('@@this is the line to split##')
    if s[-1] == 'y' or s[-1] == 'Y':
        n_vowels += 1
    return n_vowels


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

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

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):
        # print('@@this is the line to split##')
        return s[::-1]
    else:
        return s[len(s) - shift:] + s[:len(s) - shift]


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

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"

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
    # print('@@this is the line to split##')
    return sum(ord(char) if char.isupper() else 0 for char in s)


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

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

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(' '):
        # print('@@this is the line to split##')
        if i.isdigit():
            lis.append(int(i))
    return n - sum(lis)


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

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"

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))
    # print('@@this is the line to split##')
    if(evens == []): return []
    return [min(evens), arr.index(min(evens))]


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

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
    # print('@@this is the line to split##')
    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))

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))
        # print('@@this is the line to split##')
        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

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

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
    # print('@@this is the line to split##')
    area = (s * (s - a) * (s - b) * (s - c)) ** 0.5
    area = round(area, 2)
    return area


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:

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

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:
        # print('@@this is the line to split##')
        if q[i] != q[j]:
            return False
        i+=1
        j-=1
    return 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):

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

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):
        # print('@@this is the line to split##')
        if arr[i] != arr[len(arr) - i - 1]:
            ans += 1
    return ans


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:

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'], []) == []

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:
        # print('@@this is the line to split##')
        l2 += len(st)

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


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

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

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):
        # print('@@this is the line to split##')
        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


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

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

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
    # print('@@this is the line to split##')
    while (power < x):
        power = power * n
    return (power == x)


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)

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

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)
    # print('@@this is the line to split##')
    return int(round(a ** (1. / 3))) ** 3 == a


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

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

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)):
        # print('@@this is the line to split##')
        if num[i] in primes:
            total += 1
    return total


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

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"

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):
      # print('@@this is the line to split##')

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


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:

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

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:
            # print('@@this is the line to split##')
            letter_grade.append("B-")
        elif gpa > 2.0:
            letter_grade.append("C+")
        elif gpa > 1.7:
            letter_grade.append("C")
        elif gpa > 1.3:
            letter_grade.append("C-")
        elif gpa > 1.0:
            letter_grade.append("D+")
        elif gpa > 0.7:
            letter_grade.append("D")
        elif gpa > 0.0:
            letter_grade.append("D-")
        else:
            letter_grade.append("E")
    return letter_grade


Prompt:
def prime_length(string):
	"""Write a function that takes a string and returns True if the string
	length is a prime number or False otherwise
	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

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

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
        # print('@@this is the line to split##')
    for i in range(2, l):
        if l % i == 0:
            return False
    return True


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.
	"""
	if n == 1: return 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!)"

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.
    """
    if n == 1: return 1
    # print('@@this is the line to split##')
    return 18 * (10 ** (n - 2))


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"