def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    r = list(dict.fromkeys(r))
    return all(x > 0 for x in r)


Take a list of integers; add ten to each, then drop duplicates keeping first occurrence, then return whether all values are positive.


Take a list of integers; if empty, use a single zero, then extend to length 3 using zeros, then truncate to the last three items.


Take a list of integers; if blank use 0, then pad to 3, then show only the last three.


Take a list of integers; default to [0] when there is nothing, then extend to length 3 using zeros, then remove all but the last three.


Take a list of integers; when the list is empty, substitute a zero value, then pad to 3, then take the final 3 elements.


Take a list of integers; replace an empty list with one zero, then extend to length 3 using zeros, then drop everything except the final three.


Take a list of integers; zero it out if it's empty, then pad to 3, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = r[-3:]
    return r


Take a list of integers; if empty, use a single zero, then pad with zeros to at least three elements, then keep only the last three.


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then take abs of each.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then make them all positive.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then make every value non-negative.


def solve(xs):
    r = list(xs)
    r = r[:r.index(0)] if 0 in r else r
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = [abs(x) for x in r]
    return r


Take a list of integers; keep everything before the first zero, then take values while they are positive, then take the absolute value of each.


Take a list of integers; keep values greater than five, then default to [0] when there is nothing, then stop at the first non-positive value.


Take a list of integers; filter out values less than or equal to 5, then when the list is empty, substitute a zero value, then keep the leading run of positive numbers.


Take a list of integers; keep only numbers above 5, then replace an empty list with one zero, then take values while they are positive.


Take a list of integers; exclude values of 5 and below, then zero it out if it's empty, then take positive values then stop.


Take a list of integers; remove anything 5 or less, then use zero if the list is empty, then keep going while positive.


Take a list of integers; filter to keep only values above 5, then default to zero when empty, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = r if r else [0]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return r


Take a list of integers; keep values greater than five, then if empty, use a single zero, then take values while they are positive.


Take a list of integers; keep the odd numbers, then increase every value by 10, then drop the odd numbers.


Take a list of integers; odd numbers only, then add 10 to each item, then filter out the odd numbers.


Take a list of integers; keep the odd numbers, then shift each up by ten, then drop the odd numbers.


Take a list of integers; odd numbers only, then increase all numbers by 10, then filter out the odd numbers.


Take a list of integers; keep the odd numbers, then add 10 to everything, then drop the odd numbers.


Take a list of integers; odd numbers only, then give everything a boost of 10, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 != 0]
    r = [x + 10 for x in r]
    r = [x for x in r if x % 2 == 0]
    return r


Take a list of integers; keep the odd numbers, then add ten to each, then keep the even numbers.


Take a list of integers; keep values greater than five, then clamp each to at most ten, then truncate to three items.


Take a list of integers; filter out values less than or equal to 5, then don't let anything exceed 10, then show the first three.


Take a list of integers; keep only numbers above 5, then clamp each to at most ten, then take the first three.


Take a list of integers; exclude values of 5 and below, then don't let anything exceed 10, then keep first 3.


Take a list of integers; remove anything 5 or less, then clamp each to at most ten, then truncate to first three.


Take a list of integers; filter to keep only values above 5, then don't let anything exceed 10, then first three.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [min(x, 10) for x in r]
    r = r[:3]
    return r


Take a list of integers; keep values greater than five, then cap each value at 10, then keep only the first three.


Take a list of integers; keep the even numbers, then take the final 3 elements, then take values up to (excluding) the first zero.


Take a list of integers; keep evens, then drop everything except the final three, then keep the part before the first 0.


Take a list of integers; keep the even numbers, then give me the last three elements, then truncate at the first zero.


Take a list of integers; keep evens, then keep only the last three, then delete everything starting with the first zero.


Take a list of integers; keep the even numbers, then keep the final three items, then remove from the first zero onwards.


Take a list of integers; keep evens, then take the last three, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 0]
    r = r[-3:]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; keep the even numbers, then keep only the last three, then keep everything before the first zero.


Take a list of integers; keep values greater than five, then keep values divisible by 3, then raise each to the power of two.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then I need each number multiplied by itself.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then square all of them.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then multiply each element by itself.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then make each one squared.


Take a list of integers; filter to keep only values above 5, then multiples of three only, then square each value in the list.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [x for x in r if x % 3 == 0]
    r = [x * x for x in r]
    return r


Take a list of integers; keep values greater than five, then keep multiples of three, then square each.


Take a list of integers; negate each, then multiply each value by itself, then remove the initial run of negative numbers.


Take a list of integers; reverse the signs of everything, then square them all, then strip the front negatives.


Take a list of integers; negate each, then raise each to the power of two, then remove leading negative numbers.


Take a list of integers; reverse the signs of everything, then I need each number multiplied by itself, then drop negatives from start.


Take a list of integers; negate each, then square all of them, then strip negative values from the start.


Take a list of integers; reverse the signs of everything, then multiply each element by itself, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = [x * x for x in r]
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    return r


Take a list of integers; negate each, then square each, then drop the leading negative values.


Take a list of integers; keep values greater than five, then remove the first item, then drop the even numbers.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then strip out the evens.


Take a list of integers; keep only numbers above 5, then remove the first item, then drop the even numbers.


Take a list of integers; exclude values of 5 and below, then Remove head, then strip out the evens.


Take a list of integers; remove anything 5 or less, then remove the first item, then drop the even numbers.


Take a list of integers; filter to keep only values above 5, then Remove head, then strip out the evens.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = r[1:]
    r = [x for x in r if x % 2 != 0]
    return r


Take a list of integers; keep values greater than five, then drop the first element, then keep the odd numbers.


Take a list of integers; take values while they are positive, then remove repeated values, then truncate to the last three items.


Take a list of integers; take positive values then stop, then unique values preserving order, then show only the last three.


Take a list of integers; keep going while positive, then remove repeated values, then remove all but the last three.


Take a list of integers; stop at first non positive, then unique values preserving order, then take the final 3 elements.


Take a list of integers; take while greater than zero, then remove repeated values, then drop everything except the final three.


Take a list of integers; take values while positive, then unique values preserving order, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = list(dict.fromkeys(r))
    r = r[-3:]
    return r


Take a list of integers; take values while they are positive, then drop duplicates keeping first occurrence, then keep only the last three.


Take a list of integers; reverse the order, then remove repeated values, then make each twice as big.


Take a list of integers; reverse, then unique values preserving order, then multiply each by 2.


Take a list of integers; flip the list around, then remove repeated values, then make each twice as big.


Take a list of integers; flip the order around, then unique values preserving order, then multiply each by 2.


Take a list of integers; put the elements backwards, then remove repeated values, then make each twice as big.


Take a list of integers; reverse that for me, then unique values preserving order, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = list(dict.fromkeys(r))
    r = [x * 2 for x in r]
    return r


Take a list of integers; reverse the order, then drop duplicates keeping first occurrence, then double each.


Take a list of integers; negate each, then keep only even values, then find the max, defaulting to 0.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; negate each, then keep only even values, then What's the highest number in the list.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then Return the greatest value or default to 0.


Take a list of integers; negate each, then keep only even values, then Find the largest element, defaulting to zero.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = [x for x in r if x % 2 == 0]
    return max(r) if r else 0


Take a list of integers; negate each, then keep the even numbers, then return the maximum (0 if empty).


Take a list of integers; take values while they are positive, then cut the list at the first zero, then make each twice as big.


Take a list of integers; take positive values then stop, then cut off after the first zero appears, then multiply each by 2.


Take a list of integers; keep going while positive, then take values up to (excluding) the first zero, then make each twice as big.


Take a list of integers; stop at first non positive, then keep the part before the first 0, then multiply each by 2.


Take a list of integers; take while greater than zero, then truncate at the first zero, then make each twice as big.


Take a list of integers; take values while positive, then delete everything starting with the first zero, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r[:r.index(0)] if 0 in r else r
    r = [x * 2 for x in r]
    return r


Take a list of integers; take values while they are positive, then keep everything before the first zero, then double each.


Take a list of integers; square each, then multiply each by two, then drop non-negative values.


Take a list of integers; each value squared, then double each item in the list, then drop all positive numbers.


Take a list of integers; multiply each value by itself, then multiply each by two, then drop non-negative values.


Take a list of integers; square them all, then double each item in the list, then drop all positive numbers.


Take a list of integers; raise each to the power of two, then multiply each by two, then drop non-negative values.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then drop all positive numbers.


def solve(xs):
    r = list(xs)
    r = [x * x for x in r]
    r = [x * 2 for x in r]
    r = [x for x in r if x < 0]
    return r


Take a list of integers; square each, then double each, then keep the negative numbers.


Take a list of integers; add one to each, then remove both ends, then limit every value to 10.


Take a list of integers; make each one bigger, then trim the edges, then maximum of 10 for all.


Take a list of integers; add one to each, then trim one element off each end, then limit every value to 10.


Take a list of integers; make each one bigger, then cut off the first and last, then maximum of 10 for all.


Take a list of integers; add one to each, then remove the first and last elements, then limit every value to 10.


Take a list of integers; make each one bigger, then keep only the middle part, then maximum of 10 for all.


def solve(xs):
    r = list(xs)
    r = [x + 1 for x in r]
    r = r[1:-1]
    r = [min(x, 10) for x in r]
    return r


Take a list of integers; add one to each, then drop the first and last elements, then cap each value at 10.


Take a list of integers; keep the odd numbers, then take the final 3 elements, then give back the product of all values.


Take a list of integers; odd numbers only, then drop everything except the final three, then product of the list.


Take a list of integers; keep the odd numbers, then give me the last three elements, then what's the product.


Take a list of integers; odd numbers only, then keep only the last three, then what do they multiply to.


Take a list of integers; keep the odd numbers, then keep the final three items, then give me their product.


Take a list of integers; odd numbers only, then take the last three, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 != 0]
    r = r[-3:]
    return __import__('math').prod(r)


Take a list of integers; keep the odd numbers, then keep only the last three, then return their product.


Take a list of integers; drop the first and last elements, then cut the list at the first zero, then find the max, defaulting to 0.


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then Give me the maximum, but 0 if there are no items.


Take a list of integers; remove both ends, then take values up to (excluding) the first zero, then What's the highest number in the list.


Take a list of integers; trim the edges, then keep the part before the first 0, then Return the greatest value or default to 0.


Take a list of integers; trim one element off each end, then truncate at the first zero, then Find the largest element, defaulting to zero.


Take a list of integers; cut off the first and last, then delete everything starting with the first zero, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = r[:r.index(0)] if 0 in r else r
    return max(r) if r else 0


Take a list of integers; drop the first and last elements, then keep everything before the first zero, then return the maximum (0 if empty).


Take a list of integers; keep values greater than five, then increment each value, then take values up to (excluding) the first zero.


Take a list of integers; filter out values less than or equal to 5, then plus one for all, then keep the part before the first 0.


Take a list of integers; keep only numbers above 5, then increment each value, then truncate at the first zero.


Take a list of integers; exclude values of 5 and below, then plus one for all, then delete everything starting with the first zero.


Take a list of integers; remove anything 5 or less, then increment each value, then remove from the first zero onwards.


Take a list of integers; filter to keep only values above 5, then plus one for all, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [x + 1 for x in r]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; keep values greater than five, then add one to each, then keep everything before the first zero.


Take a list of integers; keep only the first three, then cut the list at the first zero, then limit every value to 10.


Take a list of integers; keep the first 3 items, then cut off after the first zero appears, then maximum of 10 for all.


Take a list of integers; take the first 3 elements, then take values up to (excluding) the first zero, then limit every value to 10.


Take a list of integers; remove everything after the third, then keep the part before the first 0, then maximum of 10 for all.


Take a list of integers; truncate to three items, then truncate at the first zero, then limit every value to 10.


Take a list of integers; show the first three, then delete everything starting with the first zero, then maximum of 10 for all.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = r[:r.index(0)] if 0 in r else r
    r = [min(x, 10) for x in r]
    return r


Take a list of integers; keep only the first three, then keep everything before the first zero, then cap each value at 10.


Take a list of integers; drop the first element, then sort smallest to largest, then drop the odd numbers.


Take a list of integers; Take everything except the first, then Ascending sort, then filter out the odd numbers.


Take a list of integers; drop the first element, then Sort this ascending, then drop the odd numbers.


Take a list of integers; Take everything except the first, then Sort lowest to highest, then filter out the odd numbers.


Take a list of integers; drop the first element, then Arrange from smallest to largest, then drop the odd numbers.


Take a list of integers; Take everything except the first, then sort ascending, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = sorted(r)
    r = [x for x in r if x % 2 == 0]
    return r


Take a list of integers; drop the first element, then sort ascending, then keep the even numbers.


Take a list of integers; reverse the order, then sort largest to smallest, then truncate to three items.


Take a list of integers; reverse, then sort by descending values, then show the first three.


Take a list of integers; flip the list around, then sort from highest to lowest, then take the first three.


Take a list of integers; flip the order around, then sort descending, then keep first 3.


Take a list of integers; put the elements backwards, then sort largest first, then truncate to first three.


Take a list of integers; reverse that for me, then sort in descending order, then first three.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = sorted(r, reverse=True)
    r = r[:3]
    return r


Take a list of integers; reverse the order, then sort descending, then keep only the first three.


Take a list of integers; subtract one from each, then drop anything 5 or below, then give back the total.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then sum r.


Take a list of integers; decrement each value, then filter for numbers above 5, then add them up.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then calculate the sum of all elements.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then what's the total.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then what do they add up to.


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in r]
    r = [x for x in r if x > 5]
    return sum(r)


Take a list of integers; subtract one from each, then keep values greater than five, then return their sum.


Take a list of integers; reverse the order, then default to [0] when there is nothing, then limit every value to 10.


Take a list of integers; reverse, then when the list is empty, substitute a zero value, then maximum of 10 for all.


Take a list of integers; flip the list around, then replace an empty list with one zero, then limit every value to 10.


Take a list of integers; flip the order around, then zero it out if it's empty, then maximum of 10 for all.


Take a list of integers; put the elements backwards, then use zero if the list is empty, then limit every value to 10.


Take a list of integers; reverse that for me, then default to zero when empty, then maximum of 10 for all.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = r if r else [0]
    r = [min(x, 10) for x in r]
    return r


Take a list of integers; reverse the order, then if empty, use a single zero, then cap each value at 10.


Take a list of integers; sort descending, then cut the list at the first zero, then strip the signs.


Take a list of integers; sort largest first, then cut off after the first zero appears, then take abs of each.


Take a list of integers; sort in descending order, then take values up to (excluding) the first zero, then get the absolute value of everything.


Take a list of integers; sort from greatest to least, then keep the part before the first 0, then apply absolute value to the whole list.


Take a list of integers; sort z to a, then truncate at the first zero, then make them all positive.


Take a list of integers; arrange in decreasing order, then delete everything starting with the first zero, then make every value non-negative.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = r[:r.index(0)] if 0 in r else r
    r = [abs(x) for x in r]
    return r


Take a list of integers; sort descending, then keep everything before the first zero, then take the absolute value of each.


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then truncate to three items.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then show the first three.


Take a list of integers; drop the zeros, then take positive values then stop, then take the first three.


Take a list of integers; keep only nonzero elements, then keep going while positive, then keep first 3.


Take a list of integers; drop the zeros, then stop at first non positive, then truncate to first three.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then first three.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x != 0]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r[:3]
    return r


Take a list of integers; drop the zeros, then take values while they are positive, then keep only the first three.


Take a list of integers; drop the leading negative values, then keep values below zero, then truncate to the last three items.


Take a list of integers; cut the leading negatives, then get the negative numbers, then show only the last three.


Take a list of integers; skip negatives at the start, then keep values below zero, then remove all but the last three.


Take a list of integers; remove all negatives at the front, then get the negative numbers, then take the final 3 elements.


Take a list of integers; remove the initial run of negative numbers, then keep values below zero, then drop everything except the final three.


Take a list of integers; strip the front negatives, then get the negative numbers, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    r = [x for x in r if x < 0]
    r = r[-3:]
    return r


Take a list of integers; drop the leading negative values, then keep the negative numbers, then keep only the last three.


Take a list of integers; drop the first element, then skip negatives at the start, then count the elements.


Take a list of integers; Take everything except the first, then remove all negatives at the front, then how many items remain.


Take a list of integers; drop the first element, then remove the initial run of negative numbers, then tell me the length.


Take a list of integers; Take everything except the first, then strip the front negatives, then return the length.


Take a list of integers; drop the first element, then remove leading negative numbers, then count them.


Take a list of integers; Take everything except the first, then drop negatives from start, then what's the count.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    return len(r)


Take a list of integers; drop the first element, then drop the leading negative values, then return how many remain.


Take a list of integers; add one to each, then multiply each value by itself, then skip the first one.


Take a list of integers; make each one bigger, then square them all, then Discard the first element.


Take a list of integers; add one to each, then raise each to the power of two, then skip the first one.


Take a list of integers; make each one bigger, then I need each number multiplied by itself, then Discard the first element.


Take a list of integers; add one to each, then square all of them, then skip the first one.


Take a list of integers; make each one bigger, then multiply each element by itself, then Discard the first element.


def solve(xs):
    r = list(xs)
    r = [x + 1 for x in r]
    r = [x * x for x in r]
    r = r[1:]
    return r


Take a list of integers; add one to each, then square each, then drop the first element.


Take a list of integers; add ten to each, then remove all zero values, then arrange in decreasing order.


Take a list of integers; bump everything up by 10, then exclude zeros, then arrange in descending order.


Take a list of integers; increase every value by 10, then remove all zero values, then reverse sort.


Take a list of integers; add 10 to each item, then exclude zeros, then sort largest to smallest.


Take a list of integers; shift each up by ten, then remove all zero values, then sort by descending values.


Take a list of integers; increase all numbers by 10, then exclude zeros, then sort from highest to lowest.


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    r = [x for x in r if x != 0]
    r = sorted(r, reverse=True)
    return r


Take a list of integers; add ten to each, then drop the zeros, then sort descending.


Take a list of integers; reverse the order, then make every value non-negative, then drop the odd numbers.


Take a list of integers; reverse, then absolute value for all items, then filter out the odd numbers.


Take a list of integers; flip the list around, then take absolute values, then drop the odd numbers.


Take a list of integers; flip the order around, then turn negatives into positives, then filter out the odd numbers.


Take a list of integers; put the elements backwards, then abs each element, then drop the odd numbers.


Take a list of integers; reverse that for me, then take the absolute value of each, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = [abs(x) for x in r]
    r = [x for x in r if x % 2 == 0]
    return r


Take a list of integers; reverse the order, then take the absolute value of each, then keep the even numbers.


Take a list of integers; negate each, then multiply each by two, then truncate to the last three items.


Take a list of integers; reverse the signs of everything, then double each item in the list, then show only the last three.


Take a list of integers; negate each, then multiply each by two, then remove all but the last three.


Take a list of integers; reverse the signs of everything, then double each item in the list, then take the final 3 elements.


Take a list of integers; negate each, then multiply each by two, then drop everything except the final three.


Take a list of integers; reverse the signs of everything, then double each item in the list, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = [x * 2 for x in r]
    r = r[-3:]
    return r


Take a list of integers; negate each, then double each, then keep only the last three.


Take a list of integers; keep everything before the first zero, then keep only even values, then make each twice as big.


Take a list of integers; take only what comes before the initial zero, then extract all even numbers, then multiply each by 2.


Take a list of integers; cut the list at the first zero, then keep only even values, then make each twice as big.


Take a list of integers; cut off after the first zero appears, then extract all even numbers, then multiply each by 2.


Take a list of integers; take values up to (excluding) the first zero, then keep only even values, then make each twice as big.


Take a list of integers; keep the part before the first 0, then extract all even numbers, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = r[:r.index(0)] if 0 in r else r
    r = [x for x in r if x % 2 == 0]
    r = [x * 2 for x in r]
    return r


Take a list of integers; keep everything before the first zero, then keep the even numbers, then double each.


Take a list of integers; reverse the order, then increase every value by 10, then true only if all are positive.


Take a list of integers; reverse, then add 10 to each item, then do all of these have positive values.


Take a list of integers; flip the list around, then shift each up by ten, then check if every value is positive.


Take a list of integers; flip the order around, then increase all numbers by 10, then confirm all values are positive.


Take a list of integers; put the elements backwards, then add 10 to everything, then all positive.


Take a list of integers; reverse that for me, then give everything a boost of 10, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = [x + 10 for x in r]
    return all(x > 0 for x in r)


Take a list of integers; reverse the order, then add ten to each, then return whether all values are positive.


Take a list of integers; negate each, then multiply each by two, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then double each item in the list, then strip out the evens.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = [x * 2 for x in r]
    r = [x for x in r if x % 2 != 0]
    return r


Take a list of integers; negate each, then double each, then keep the odd numbers.


Take a list of integers; keep only the first three, then remove all zero values, then find the max, defaulting to 0.


Take a list of integers; keep the first 3 items, then exclude zeros, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the first 3 elements, then remove all zero values, then What's the highest number in the list.


Take a list of integers; remove everything after the third, then exclude zeros, then Return the greatest value or default to 0.


Take a list of integers; truncate to three items, then remove all zero values, then Find the largest element, defaulting to zero.


Take a list of integers; show the first three, then exclude zeros, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = [x for x in r if x != 0]
    return max(r) if r else 0


Take a list of integers; keep only the first three, then drop the zeros, then return the maximum (0 if empty).


Take a list of people records (name, age); extract the names, then keep only strings of length 3 or more, then deduplicate the strings.


Take a list of people records (name, age); Give me the names, then get rid of short ones, then filter out duplicate strings retain first.


Take a list of people records (name, age); pluck the name field from each record, then remove strings with less than three characters, then strip duplicates preserve order.


Take a list of people records (name, age); Grab the names, then remove all strings under three characters in length, then remove repeated strings.


Take a list of people records (name, age); keep just each person's name, then filter out short strings under three chars, then keep unique strings first appearance.


Take a list of people records (name, age); List the names, then drop strings shorter than three characters, then eliminate repeated strings preserve first occurrence.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = [s for s in r if len(s) >= 3]
    r = list(dict.fromkeys(r))
    return r


Take a list of people records (name, age); extract the names, then drop strings shorter than three characters, then drop duplicate strings keeping the first.


Take a list of integers; subtract one from each, then default to [0] when there is nothing, then stop at the first non-positive value.


Take a list of integers; Decrement all items, then when the list is empty, substitute a zero value, then keep the leading run of positive numbers.


Take a list of integers; decrement each value, then replace an empty list with one zero, then take values while they are positive.


Take a list of integers; Lower each number by one, then zero it out if it's empty, then take positive values then stop.


Take a list of integers; reduce each by one, then use zero if the list is empty, then keep going while positive.


Take a list of integers; Subtract 1 from all, then default to zero when empty, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in r]
    r = r if r else [0]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return r


Take a list of integers; subtract one from each, then if empty, use a single zero, then take values while they are positive.


Take a list of integers; square each, then keep only odd values, then arrange by magnitude ignoring sign.


Take a list of integers; each value squared, then eliminate the even numbers, then put them in order by magnitude.


Take a list of integers; multiply each value by itself, then keep only odd values, then arrange in order of absolute value.


Take a list of integers; square them all, then eliminate the even numbers, then sort by distance from zero.


Take a list of integers; raise each to the power of two, then keep only odd values, then order by how far from zero.


Take a list of integers; I need each number multiplied by itself, then eliminate the even numbers, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = [x * x for x in r]
    r = [x for x in r if x % 2 != 0]
    r = sorted(r, key=abs)
    return r


Take a list of integers; square each, then keep the odd numbers, then sort by absolute value.


Take a list of integers; take the absolute value of each, then multiply each value by itself, then drop non-negative values.


Take a list of integers; convert to absolute value, then square them all, then drop all positive numbers.


Take a list of integers; strip the signs, then raise each to the power of two, then drop non-negative values.


Take a list of integers; take abs of each, then I need each number multiplied by itself, then drop all positive numbers.


Take a list of integers; get the absolute value of everything, then square all of them, then drop non-negative values.


Take a list of integers; apply absolute value to the whole list, then multiply each element by itself, then drop all positive numbers.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = [x * x for x in r]
    r = [x for x in r if x < 0]
    return r


Take a list of integers; take the absolute value of each, then square each, then keep the negative numbers.


Take a list of integers; take values while they are positive, then order by distance from zero, then make each twice as big.


Take a list of integers; take positive values then stop, then sort based on absolute value, then multiply each by 2.


Take a list of integers; keep going while positive, then organize by magnitude, then make each twice as big.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then multiply each by 2.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then make each twice as big.


Take a list of integers; take values while positive, then sort by absolute value, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = sorted(r, key=abs)
    r = [x * 2 for x in r]
    return r


Take a list of integers; take values while they are positive, then sort by absolute value, then double each.


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then drop anything not divisible by three.


Take a list of people records (name, age); show me all ages, then drop everything except the final three, then filter out everything except multiples of three.


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then keep only multiples of three.


Take a list of people records (name, age); get the age field, then keep only the last three, then multiples of three only.


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then filter for numbers divisible by three.


Take a list of people records (name, age); extract age values, then take the last three, then give me only the values divisible by three.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r[-3:]
    r = [x for x in r if x % 3 == 0]
    return r


Take a list of people records (name, age); extract the ages, then keep only the last three, then keep multiples of three.


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then multiply each by -1.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then negate.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then multiply each by -1.


Take a list of people records (name, age); get the age field, then zero it out if it's empty, then negate.


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then multiply each by -1.


Take a list of people records (name, age); extract age values, then default to zero when empty, then negate.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r if r else [0]
    r = [-x for x in r]
    return r


Take a list of people records (name, age); extract the ages, then if empty, use a single zero, then negate each.


Take a list of integers; if empty, use a single zero, then decrement each value, then strip the signs.


Take a list of integers; if blank use 0, then Lower each number by one, then take abs of each.


Take a list of integers; default to [0] when there is nothing, then reduce each by one, then get the absolute value of everything.


Take a list of integers; when the list is empty, substitute a zero value, then Subtract 1 from all, then apply absolute value to the whole list.


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then make them all positive.


Take a list of integers; zero it out if it's empty, then Drop each by one, then make every value non-negative.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    r = [x - 1 for x in r]
    r = [abs(x) for x in r]
    return r


Take a list of integers; if empty, use a single zero, then subtract one from each, then take the absolute value of each.


Take a list of integers; if empty, use a single zero, then increase every value by 10, then make each twice as big.


Take a list of integers; if blank use 0, then add 10 to each item, then multiply each by 2.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then make each twice as big.


Take a list of integers; when the list is empty, substitute a zero value, then increase all numbers by 10, then multiply each by 2.


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then make each twice as big.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    r = [x + 10 for x in r]
    r = [x * 2 for x in r]
    return r


Take a list of integers; if empty, use a single zero, then add ten to each, then double each.


Take a list of integers; reverse the order, then increase every value by 10, then find the max, defaulting to 0.


Take a list of integers; reverse, then add 10 to each item, then Give me the maximum, but 0 if there are no items.


Take a list of integers; flip the list around, then shift each up by ten, then What's the highest number in the list.


Take a list of integers; flip the order around, then increase all numbers by 10, then Return the greatest value or default to 0.


Take a list of integers; put the elements backwards, then add 10 to everything, then Find the largest element, defaulting to zero.


Take a list of integers; reverse that for me, then give everything a boost of 10, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = [x + 10 for x in r]
    return max(r) if r else 0


Take a list of integers; reverse the order, then add ten to each, then return the maximum (0 if empty).


Take a list of integers; keep multiples of three, then decrement each value, then drop the even numbers.


Take a list of integers; get rid of non-multiples of three, then Lower each number by one, then strip out the evens.


Take a list of integers; keep values divisible by 3, then reduce each by one, then drop the even numbers.


Take a list of integers; keep items where x mod 3 equals zero, then Subtract 1 from all, then strip out the evens.


Take a list of integers; drop anything not divisible by three, then Subtract one from each, then drop the even numbers.


Take a list of integers; filter out everything except multiples of three, then Drop each by one, then strip out the evens.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [x - 1 for x in r]
    r = [x for x in r if x % 2 != 0]
    return r


Take a list of integers; keep multiples of three, then subtract one from each, then keep the odd numbers.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then take values up to (excluding) the first zero.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then keep the part before the first 0.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then truncate at the first zero.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [x * 2 for x in r]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; pad with zeros to at least three elements, then double each, then keep everything before the first zero.


Take a list of integers; keep only the first three, then multiply each value by itself, then take values up to (excluding) the first zero.


Take a list of integers; keep the first 3 items, then square them all, then keep the part before the first 0.


Take a list of integers; take the first 3 elements, then raise each to the power of two, then truncate at the first zero.


Take a list of integers; remove everything after the third, then I need each number multiplied by itself, then delete everything starting with the first zero.


Take a list of integers; truncate to three items, then square all of them, then remove from the first zero onwards.


Take a list of integers; show the first three, then multiply each element by itself, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = [x * x for x in r]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; keep only the first three, then square each, then keep everything before the first zero.


Take a list of integers; add ten to each, then remove repeated values, then find the max, defaulting to 0.


Take a list of integers; bump everything up by 10, then unique values preserving order, then Give me the maximum, but 0 if there are no items.


Take a list of integers; increase every value by 10, then remove repeated values, then What's the highest number in the list.


Take a list of integers; add 10 to each item, then unique values preserving order, then Return the greatest value or default to 0.


Take a list of integers; shift each up by ten, then remove repeated values, then Find the largest element, defaulting to zero.


Take a list of integers; increase all numbers by 10, then unique values preserving order, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    r = list(dict.fromkeys(r))
    return max(r) if r else 0


Take a list of integers; add ten to each, then drop duplicates keeping first occurrence, then return the maximum (0 if empty).


Take a list of integers; take values while they are positive, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; take positive values then stop, then double each item in the list, then fetch the first even element, default to 0.


Take a list of integers; keep going while positive, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; stop at first non positive, then double each item in the list, then fetch the first even element, default to 0.


Take a list of integers; take while greater than zero, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; take values while positive, then double each item in the list, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = [x * 2 for x in r]
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; take values while they are positive, then double each, then return the first even value (0 if none).


Take a list of integers; square each, then take the final 3 elements, then true if every value is unique.


Take a list of integers; each value squared, then drop everything except the final three, then check for duplicates in the values.


Take a list of integers; multiply each value by itself, then give me the last three elements, then do all values appear only once.


Take a list of integers; square them all, then keep only the last three, then check that there are no duplicates.


Take a list of integers; raise each to the power of two, then keep the final three items, then are the values all unique.


Take a list of integers; I need each number multiplied by itself, then take the last three, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = [x * x for x in r]
    r = r[-3:]
    return len(r) == len(set(r))


Take a list of integers; square each, then keep only the last three, then return whether all values are distinct.


Take a list of integers; add ten to each, then drop anything 5 or below, then true only if all are positive.


Take a list of integers; bump everything up by 10, then keep only numbers greater than 5, then do all of these have positive values.


Take a list of integers; increase every value by 10, then filter for numbers above 5, then check if every value is positive.


Take a list of integers; add 10 to each item, then give me values where x is greater than 5, then confirm all values are positive.


Take a list of integers; shift each up by ten, then show me only the values that are bigger than five, then all positive.


Take a list of integers; increase all numbers by 10, then keep values greater than five, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    r = [x for x in r if x > 5]
    return all(x > 0 for x in r)


Take a list of integers; add ten to each, then keep values greater than five, then return whether all values are positive.


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then reduce each by one.


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then Subtract 1 from all.


Take a list of integers; drop non-positive values, then clamp each to at most ten, then Subtract one from each.


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then Drop each by one.


Take a list of integers; filter out the negative ones, then clamp each to at most ten, then Decrease all values by one.


Take a list of integers; remove all negative values, then don't let anything exceed 10, then Remove one from each value.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 0]
    r = [min(x, 10) for x in r]
    r = [x - 1 for x in r]
    return r


Take a list of integers; keep the positive numbers, then cap each value at 10, then subtract one from each.


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then drop the odd numbers.


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then filter out the odd numbers.


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then drop the odd numbers.


Take a list of integers; drop duplicates but keep the first one, then filter out everything except multiples of three, then filter out the odd numbers.


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then drop the odd numbers.


Take a list of integers; drop duplicates but keep the first one, then multiples of three only, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = [x for x in r if x % 3 == 0]
    r = [x for x in r if x % 2 == 0]
    return r


Take a list of integers; drop duplicates keeping first occurrence, then keep multiples of three, then keep the even numbers.


Take a list of integers; pad with zeros to at least three elements, then multiply each value by itself, then deduplicate the list.


Take a list of integers; add zeros until the list has at least three values, then square them all, then remove repeats.


Take a list of integers; pad with zeros to at least three elements, then raise each to the power of two, then deduplicate the list.


Take a list of integers; add zeros until the list has at least three values, then I need each number multiplied by itself, then remove repeats.


Take a list of integers; pad with zeros to at least three elements, then square all of them, then deduplicate the list.


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then remove repeats.


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [x * x for x in r]
    r = list(dict.fromkeys(r))
    return r


Take a list of integers; pad with zeros to at least three elements, then square each, then drop duplicates keeping first occurrence.


Take a list of integers; subtract one from each, then take the first 3 elements, then find the max, defaulting to 0.


Take a list of integers; Decrement all items, then remove everything after the third, then Give me the maximum, but 0 if there are no items.


Take a list of integers; decrement each value, then truncate to three items, then What's the highest number in the list.


Take a list of integers; Lower each number by one, then show the first three, then Return the greatest value or default to 0.


Take a list of integers; reduce each by one, then take the first three, then Find the largest element, defaulting to zero.


Take a list of integers; Subtract 1 from all, then keep first 3, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in r]
    r = r[:3]
    return max(r) if r else 0


Take a list of integers; subtract one from each, then keep only the first three, then return the maximum (0 if empty).


Take a list of integers; keep the even numbers, then multiply each value by itself, then true only if all are positive.


Take a list of integers; keep evens, then square them all, then do all of these have positive values.


Take a list of integers; keep the even numbers, then raise each to the power of two, then check if every value is positive.


Take a list of integers; keep evens, then I need each number multiplied by itself, then confirm all values are positive.


Take a list of integers; keep the even numbers, then square all of them, then all positive.


Take a list of integers; keep evens, then multiply each element by itself, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 0]
    r = [x * x for x in r]
    return all(x > 0 for x in r)


Take a list of integers; keep the even numbers, then square each, then return whether all values are positive.


Take a list of integers; reverse the order, then multiply each by two, then shift each up by ten.


Take a list of integers; reverse, then double each item in the list, then increase all numbers by 10.


Take a list of integers; flip the list around, then multiply each by two, then add 10 to everything.


Take a list of integers; flip the order around, then double each item in the list, then give everything a boost of 10.


Take a list of integers; put the elements backwards, then multiply each by two, then increment each by ten.


Take a list of integers; reverse that for me, then double each item in the list, then add a constant 10 to each.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = [x * 2 for x in r]
    r = [x + 10 for x in r]
    return r


Take a list of integers; reverse the order, then double each, then add ten to each.


Take a list of integers; drop the first and last elements, then flip the list around, then drop non-negative values.


Take a list of integers; take out the first and last items, then flip the order around, then drop all positive numbers.


Take a list of integers; remove both ends, then put the elements backwards, then drop non-negative values.


Take a list of integers; trim the edges, then reverse that for me, then drop all positive numbers.


Take a list of integers; trim one element off each end, then flip it backwards, then drop non-negative values.


Take a list of integers; cut off the first and last, then make it backwards, then drop all positive numbers.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = list(reversed(r))
    r = [x for x in r if x < 0]
    return r


Take a list of integers; drop the first and last elements, then reverse the order, then keep the negative numbers.


Take a list of integers; drop the first element, then take the first 3 elements, then give back the total.


Take a list of integers; Take everything except the first, then remove everything after the third, then sum r.


Take a list of integers; drop the first element, then truncate to three items, then add them up.


Take a list of integers; Take everything except the first, then show the first three, then calculate the sum of all elements.


Take a list of integers; drop the first element, then take the first three, then what's the total.


Take a list of integers; Take everything except the first, then keep first 3, then what do they add up to.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = r[:3]
    return sum(r)


Take a list of integers; drop the first element, then keep only the first three, then return their sum.


Take a list of people records (name, age); extract the ages, then sort largest to smallest, then make each twice as big.


Take a list of people records (name, age); show me all ages, then sort by descending values, then multiply each by 2.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest, then make each twice as big.


Take a list of people records (name, age); get the age field, then sort descending, then multiply each by 2.


Take a list of people records (name, age); keep just each person's age, then sort largest first, then make each twice as big.


Take a list of people records (name, age); extract age values, then sort in descending order, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = sorted(r, reverse=True)
    r = [x * 2 for x in r]
    return r


Take a list of people records (name, age); extract the ages, then sort descending, then double each.


Take a list of integers; sort by absolute value, then keep values divisible by 3, then drop the odd numbers.


Take a list of integers; rearrange by distance from zero, then keep items where x mod 3 equals zero, then filter out the odd numbers.


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then drop the odd numbers.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then filter out the odd numbers.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then drop the odd numbers.


Take a list of integers; sort by distance from zero, then multiples of three only, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = [x for x in r if x % 3 == 0]
    r = [x for x in r if x % 2 == 0]
    return r


Take a list of integers; sort by absolute value, then keep multiples of three, then keep the even numbers.


Take a list of integers; subtract one from each, then keep values divisible by 3, then trim one element off each end.


Take a list of integers; Decrement all items, then keep items where x mod 3 equals zero, then cut off the first and last.


Take a list of integers; decrement each value, then drop anything not divisible by three, then remove the first and last elements.


Take a list of integers; Lower each number by one, then filter out everything except multiples of three, then keep only the middle part.


Take a list of integers; reduce each by one, then keep only multiples of three, then drop first and last.


Take a list of integers; Subtract 1 from all, then multiples of three only, then eliminate the outermost elements.


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in r]
    r = [x for x in r if x % 3 == 0]
    r = r[1:-1]
    return r


Take a list of integers; subtract one from each, then keep multiples of three, then drop the first and last elements.


Take a list of integers; sort descending, then clamp each to at most ten, then true if every value is unique.


Take a list of integers; sort largest first, then don't let anything exceed 10, then check for duplicates in the values.


Take a list of integers; sort in descending order, then clamp each to at most ten, then do all values appear only once.


Take a list of integers; sort from greatest to least, then don't let anything exceed 10, then check that there are no duplicates.


Take a list of integers; sort z to a, then clamp each to at most ten, then are the values all unique.


Take a list of integers; arrange in decreasing order, then don't let anything exceed 10, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = [min(x, 10) for x in r]
    return len(r) == len(set(r))


Take a list of integers; sort descending, then cap each value at 10, then return whether all values are distinct.


Take a list of integers; keep only the last three, then increase every value by 10, then give back the product of all values.


Take a list of integers; keep the final three items, then add 10 to each item, then product of the list.


Take a list of integers; take the last three, then shift each up by ten, then what's the product.


Take a list of integers; trim to the last three, then increase all numbers by 10, then what do they multiply to.


Take a list of integers; last three only, then add 10 to everything, then give me their product.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    r = [x + 10 for x in r]
    return __import__('math').prod(r)


Take a list of integers; keep only the last three, then add ten to each, then return their product.


Take a list of strings; uppercase each string, then order the strings A to Z, then deduplicate the strings.


Take a list of strings; make it all caps, then make it alphabetical, then filter out duplicate strings retain first.


Take a list of strings; convert each to upper case, then order the strings A to Z, then strip duplicates preserve order.


Take a list of strings; change all strings to uppercase, then make it alphabetical, then remove repeated strings.


Take a list of strings; make every string uppercase, then order the strings A to Z, then keep unique strings first appearance.


Take a list of strings; uppercase each one, then make it alphabetical, then eliminate repeated strings preserve first occurrence.


def solve(xs):
    r = list(xs)
    r = [s.upper() for s in r]
    r = sorted(r)
    r = list(dict.fromkeys(r))
    return r


Take a list of strings; uppercase each string, then sort alphabetically, then drop duplicate strings keeping the first.


Take a list of integers; drop duplicates keeping first occurrence, then decrement each value, then truncate to three items.


Take a list of integers; drop duplicates but keep the first one, then Lower each number by one, then show the first three.


Take a list of integers; drop duplicates keeping first occurrence, then reduce each by one, then take the first three.


Take a list of integers; drop duplicates but keep the first one, then Subtract 1 from all, then keep first 3.


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each, then truncate to first three.


Take a list of integers; drop duplicates but keep the first one, then Drop each by one, then first three.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = [x - 1 for x in r]
    r = r[:3]
    return r


Take a list of integers; drop duplicates keeping first occurrence, then subtract one from each, then keep only the first three.


Take a list of integers; subtract one from each, then cut the list at the first zero, then put the elements backwards.


Take a list of integers; Decrement all items, then cut off after the first zero appears, then reverse that for me.


Take a list of integers; decrement each value, then take values up to (excluding) the first zero, then flip it backwards.


Take a list of integers; Lower each number by one, then keep the part before the first 0, then make it backwards.


Take a list of integers; reduce each by one, then truncate at the first zero, then reverse the list.


Take a list of integers; Subtract 1 from all, then delete everything starting with the first zero, then invert the sequence.


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in r]
    r = r[:r.index(0)] if 0 in r else r
    r = list(reversed(r))
    return r


Take a list of integers; subtract one from each, then keep everything before the first zero, then reverse the order.


Take a list of people records (name, age); sort records by age, youngest first, then pluck the age field from each record, then shift each up by ten.


Take a list of people records (name, age); put the youngest at the top, then get the age field, then increase all numbers by 10.


Take a list of people records (name, age); sort records by age, youngest first, then keep just each person's age, then add 10 to everything.


Take a list of people records (name, age); put the youngest at the top, then extract age values, then give everything a boost of 10.


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then increment each by ten.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then add a constant 10 to each.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=lambda d: d['age'])
    r = [d['age'] for d in r]
    r = [x + 10 for x in r]
    return r


Take a list of people records (name, age); sort records by age, youngest first, then extract the ages, then add ten to each.


Take a list of integers; keep values greater than five, then keep only odd values, then bump each up by one.


Take a list of integers; filter out values less than or equal to 5, then eliminate the even numbers, then increment each item.


Take a list of integers; keep only numbers above 5, then keep only odd values, then bump each up by one.


Take a list of integers; exclude values of 5 and below, then eliminate the even numbers, then increment each item.


Take a list of integers; remove anything 5 or less, then keep only odd values, then bump each up by one.


Take a list of integers; filter to keep only values above 5, then eliminate the even numbers, then increment each item.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [x for x in r if x % 2 != 0]
    r = [x + 1 for x in r]
    return r


Take a list of integers; keep values greater than five, then keep the odd numbers, then add one to each.


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then true only if all are positive.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then confirm all values are positive.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then all positive.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return all(x > 0 for x in r)


Take a list of integers; keep values greater than five, then take values while they are positive, then return whether all values are positive.


Take a list of integers; negate each, then remove repeated values, then true only if all are positive.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then do all of these have positive values.


Take a list of integers; negate each, then remove repeated values, then check if every value is positive.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then confirm all values are positive.


Take a list of integers; negate each, then remove repeated values, then all positive.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = list(dict.fromkeys(r))
    return all(x > 0 for x in r)


Take a list of integers; negate each, then drop duplicates keeping first occurrence, then return whether all values are positive.


Take a list of integers; keep multiples of three, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; get rid of non-multiples of three, then unique values preserving order, then fetch the first even element, default to 0.


Take a list of integers; keep values divisible by 3, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; keep items where x mod 3 equals zero, then unique values preserving order, then fetch the first even element, default to 0.


Take a list of integers; drop anything not divisible by three, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; filter out everything except multiples of three, then unique values preserving order, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = list(dict.fromkeys(r))
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; keep multiples of three, then drop duplicates keeping first occurrence, then return the first even value (0 if none).


Take a list of integers; keep the positive numbers, then keep the leading run of positive numbers, then replace an empty list with one zero.


Take a list of integers; get rid of anything that's not positive, then take values while they are positive, then zero it out if it's empty.


Take a list of integers; drop non-positive values, then take positive values then stop, then use zero if the list is empty.


Take a list of integers; drop the negative numbers, then keep going while positive, then default to zero when empty.


Take a list of integers; filter out the negative ones, then stop at first non positive, then if there's nothing, put in a zero.


Take a list of integers; remove all negative values, then take while greater than zero, then if no items, add a zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 0]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r if r else [0]
    return r


Take a list of integers; keep the positive numbers, then take values while they are positive, then if empty, use a single zero.


Take a list of integers; keep everything before the first zero, then increment each value, then truncate to three items.


Take a list of integers; take only what comes before the initial zero, then plus one for all, then show the first three.


Take a list of integers; cut the list at the first zero, then increment each value, then take the first three.


Take a list of integers; cut off after the first zero appears, then plus one for all, then keep first 3.


Take a list of integers; take values up to (excluding) the first zero, then increment each value, then truncate to first three.


Take a list of integers; keep the part before the first 0, then plus one for all, then first three.


def solve(xs):
    r = list(xs)
    r = r[:r.index(0)] if 0 in r else r
    r = [x + 1 for x in r]
    r = r[:3]
    return r


Take a list of integers; keep everything before the first zero, then add one to each, then keep only the first three.


Take a list of integers; keep multiples of three, then keep only odd values, then deduplicate the list.


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then remove repeats.


Take a list of integers; keep values divisible by 3, then keep only odd values, then deduplicate the list.


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then remove repeats.


Take a list of integers; drop anything not divisible by three, then keep only odd values, then deduplicate the list.


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then remove repeats.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [x for x in r if x % 2 != 0]
    r = list(dict.fromkeys(r))
    return r


Take a list of integers; keep multiples of three, then keep the odd numbers, then drop duplicates keeping first occurrence.


Take a list of integers; keep values greater than five, then increment each value, then deduplicate the list.


Take a list of integers; filter out values less than or equal to 5, then plus one for all, then remove repeats.


Take a list of integers; keep only numbers above 5, then increment each value, then deduplicate the list.


Take a list of integers; exclude values of 5 and below, then plus one for all, then remove repeats.


Take a list of integers; remove anything 5 or less, then increment each value, then deduplicate the list.


Take a list of integers; filter to keep only values above 5, then plus one for all, then remove repeats.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [x + 1 for x in r]
    r = list(dict.fromkeys(r))
    return r


Take a list of integers; keep values greater than five, then add one to each, then drop duplicates keeping first occurrence.


Take a list of integers; keep the positive numbers, then keep only odd values, then raise each to the power of two.


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then I need each number multiplied by itself.


Take a list of integers; drop non-positive values, then keep only odd values, then square all of them.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then multiply each element by itself.


Take a list of integers; filter out the negative ones, then keep only odd values, then make each one squared.


Take a list of integers; remove all negative values, then eliminate the even numbers, then square each value in the list.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 0]
    r = [x for x in r if x % 2 != 0]
    r = [x * x for x in r]
    return r


Take a list of integers; keep the positive numbers, then keep the odd numbers, then square each.


Take a list of integers; keep only the first three, then order by distance from zero, then put the elements backwards.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then reverse that for me.


Take a list of integers; take the first 3 elements, then organize by magnitude, then flip it backwards.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then make it backwards.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then reverse the list.


Take a list of integers; show the first three, then sort by absolute value, then invert the sequence.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = sorted(r, key=abs)
    r = list(reversed(r))
    return r


Take a list of integers; keep only the first three, then sort by absolute value, then reverse the order.


Take a list of integers; keep values greater than five, then multiply each value by itself, then stop at the first non-positive value.


Take a list of integers; filter out values less than or equal to 5, then square them all, then keep the leading run of positive numbers.


Take a list of integers; keep only numbers above 5, then raise each to the power of two, then take values while they are positive.


Take a list of integers; exclude values of 5 and below, then I need each number multiplied by itself, then take positive values then stop.


Take a list of integers; remove anything 5 or less, then square all of them, then keep going while positive.


Take a list of integers; filter to keep only values above 5, then multiply each element by itself, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [x * x for x in r]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return r


Take a list of integers; keep values greater than five, then square each, then take values while they are positive.


Take a list of integers; drop the first element, then make every value non-negative, then reduce each by one.


Take a list of integers; Take everything except the first, then absolute value for all items, then Subtract 1 from all.


Take a list of integers; drop the first element, then take absolute values, then Subtract one from each.


Take a list of integers; Take everything except the first, then turn negatives into positives, then Drop each by one.


Take a list of integers; drop the first element, then abs each element, then Decrease all values by one.


Take a list of integers; Take everything except the first, then take the absolute value of each, then Remove one from each value.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = [abs(x) for x in r]
    r = [x - 1 for x in r]
    return r


Take a list of integers; drop the first element, then take the absolute value of each, then subtract one from each.


Take a list of integers; drop the first element, then sort largest to smallest, then true if already sorted smallest to largest.


Take a list of integers; Take everything except the first, then sort by descending values, then does this list go in ascending order.


Take a list of integers; drop the first element, then sort from highest to lowest, then check if the list is in ascending order.


Take a list of integers; Take everything except the first, then sort descending, then is the list sorted.


Take a list of integers; drop the first element, then sort largest first, then is it sorted.


Take a list of integers; Take everything except the first, then sort in descending order, then check if values are in increasing order.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = sorted(r, reverse=True)
    return r == sorted(r)


Take a list of integers; drop the first element, then sort descending, then return whether the list is sorted ascending.


Take a list of integers; keep multiples of three, then multiply each value by itself, then true if already sorted smallest to largest.


Take a list of integers; get rid of non-multiples of three, then square them all, then does this list go in ascending order.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then check if the list is in ascending order.


Take a list of integers; keep items where x mod 3 equals zero, then I need each number multiplied by itself, then is the list sorted.


Take a list of integers; drop anything not divisible by three, then square all of them, then is it sorted.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then check if values are in increasing order.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [x * x for x in r]
    return r == sorted(r)


Take a list of integers; keep multiples of three, then square each, then return whether the list is sorted ascending.


Take a list of integers; double each, then extend to length 3 using zeros, then drop non-positive values.


Take a list of integers; times two for each item, then pad to 3, then drop the negative numbers.


Take a list of integers; double each, then extend to length 3 using zeros, then filter out the negative ones.


Take a list of integers; times two for each item, then pad to 3, then remove all negative values.


Take a list of integers; double each, then extend to length 3 using zeros, then keep positive values only.


Take a list of integers; times two for each item, then pad to 3, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = [x * 2 for x in r]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [x for x in r if x > 0]
    return r


Take a list of integers; double each, then pad with zeros to at least three elements, then keep the positive numbers.


Take a list of integers; take values while they are positive, then remove repeated values, then true if any value equals zero.


Take a list of integers; take positive values then stop, then unique values preserving order, then check for zero.


Take a list of integers; keep going while positive, then remove repeated values, then true if any value equals zero.


Take a list of integers; stop at first non positive, then unique values preserving order, then check for zero.


Take a list of integers; take while greater than zero, then remove repeated values, then true if any value equals zero.


Take a list of integers; take values while positive, then unique values preserving order, then check for zero.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = list(dict.fromkeys(r))
    return 0 in r


Take a list of integers; take values while they are positive, then drop duplicates keeping first occurrence, then return whether the list contains a zero.


Take a list of integers; sort by absolute value, then keep values below zero, then give back the product of all values.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then product of the list.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then what's the product.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then what do they multiply to.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then give me their product.


Take a list of integers; sort by distance from zero, then get the negative numbers, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = [x for x in r if x < 0]
    return __import__('math').prod(r)


Take a list of integers; sort by absolute value, then keep the negative numbers, then return their product.


Take a list of integers; negate each, then order by distance from zero, then trim one element off each end.


Take a list of integers; reverse the signs of everything, then sort based on absolute value, then cut off the first and last.


Take a list of integers; negate each, then organize by magnitude, then remove the first and last elements.


Take a list of integers; reverse the signs of everything, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; negate each, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; reverse the signs of everything, then sort by absolute value, then eliminate the outermost elements.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = sorted(r, key=abs)
    r = r[1:-1]
    return r


Take a list of integers; negate each, then sort by absolute value, then drop the first and last elements.


Take a list of integers; take values while they are positive, then default to [0] when there is nothing, then trim one element off each end.


Take a list of integers; take positive values then stop, then when the list is empty, substitute a zero value, then cut off the first and last.


Take a list of integers; keep going while positive, then replace an empty list with one zero, then remove the first and last elements.


Take a list of integers; stop at first non positive, then zero it out if it's empty, then keep only the middle part.


Take a list of integers; take while greater than zero, then use zero if the list is empty, then drop first and last.


Take a list of integers; take values while positive, then default to zero when empty, then eliminate the outermost elements.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r if r else [0]
    r = r[1:-1]
    return r


Take a list of integers; take values while they are positive, then if empty, use a single zero, then drop the first and last elements.


Take a list of integers; pad with zeros to at least three elements, then order by distance from zero, then true if already sorted smallest to largest.


Take a list of integers; add zeros until the list has at least three values, then sort based on absolute value, then does this list go in ascending order.


Take a list of integers; pad with zeros to at least three elements, then organize by magnitude, then check if the list is in ascending order.


Take a list of integers; add zeros until the list has at least three values, then arrange by absolute value ascending, then is the list sorted.


Take a list of integers; pad with zeros to at least three elements, then sort from smallest to largest absolute value, then is it sorted.


Take a list of integers; add zeros until the list has at least three values, then sort by absolute value, then check if values are in increasing order.


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = sorted(r, key=abs)
    return r == sorted(r)


Take a list of integers; pad with zeros to at least three elements, then sort by absolute value, then return whether the list is sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then default to [0] when there is nothing, then raise each to the power of two.


Take a list of integers; drop duplicates but keep the first one, then when the list is empty, substitute a zero value, then I need each number multiplied by itself.


Take a list of integers; drop duplicates keeping first occurrence, then replace an empty list with one zero, then square all of them.


Take a list of integers; drop duplicates but keep the first one, then zero it out if it's empty, then multiply each element by itself.


Take a list of integers; drop duplicates keeping first occurrence, then use zero if the list is empty, then make each one squared.


Take a list of integers; drop duplicates but keep the first one, then default to zero when empty, then square each value in the list.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = r if r else [0]
    r = [x * x for x in r]
    return r


Take a list of integers; drop duplicates keeping first occurrence, then if empty, use a single zero, then square each.


Take a list of integers; reverse the order, then keep values divisible by 3, then reduce each by one.


Take a list of integers; reverse, then keep items where x mod 3 equals zero, then Subtract 1 from all.


Take a list of integers; flip the list around, then drop anything not divisible by three, then Subtract one from each.


Take a list of integers; flip the order around, then filter out everything except multiples of three, then Drop each by one.


Take a list of integers; put the elements backwards, then keep only multiples of three, then Decrease all values by one.


Take a list of integers; reverse that for me, then multiples of three only, then Remove one from each value.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = [x for x in r if x % 3 == 0]
    r = [x - 1 for x in r]
    return r


Take a list of integers; reverse the order, then keep multiples of three, then subtract one from each.


Take a list of integers; keep everything before the first zero, then default to [0] when there is nothing, then true if already sorted smallest to largest.


Take a list of integers; take only what comes before the initial zero, then when the list is empty, substitute a zero value, then does this list go in ascending order.


Take a list of integers; cut the list at the first zero, then replace an empty list with one zero, then check if the list is in ascending order.


Take a list of integers; cut off after the first zero appears, then zero it out if it's empty, then is the list sorted.


Take a list of integers; take values up to (excluding) the first zero, then use zero if the list is empty, then is it sorted.


Take a list of integers; keep the part before the first 0, then default to zero when empty, then check if values are in increasing order.


def solve(xs):
    r = list(xs)
    r = r[:r.index(0)] if 0 in r else r
    r = r if r else [0]
    return r == sorted(r)


Take a list of integers; keep everything before the first zero, then if empty, use a single zero, then return whether the list is sorted ascending.


Take a list of integers; take the absolute value of each, then default to [0] when there is nothing, then count the elements.


Take a list of integers; convert to absolute value, then when the list is empty, substitute a zero value, then how many items remain.


Take a list of integers; strip the signs, then replace an empty list with one zero, then tell me the length.


Take a list of integers; take abs of each, then zero it out if it's empty, then return the length.


Take a list of integers; get the absolute value of everything, then use zero if the list is empty, then count them.


Take a list of integers; apply absolute value to the whole list, then default to zero when empty, then what's the count.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = r if r else [0]
    return len(r)


Take a list of integers; take the absolute value of each, then if empty, use a single zero, then return how many remain.


Take a list of integers; keep the odd numbers, then multiply each value by itself, then true if at least one even value.


Take a list of integers; odd numbers only, then square them all, then any even.


Take a list of integers; keep the odd numbers, then raise each to the power of two, then true if at least one even value.


Take a list of integers; odd numbers only, then I need each number multiplied by itself, then any even.


Take a list of integers; keep the odd numbers, then square all of them, then true if at least one even value.


Take a list of integers; odd numbers only, then multiply each element by itself, then any even.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 != 0]
    r = [x * x for x in r]
    return any(x % 2 == 0 for x in r)


Take a list of integers; keep the odd numbers, then square each, then return whether any value is even.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then find the max, defaulting to 0.


Take a list of integers; odd numbers only, then pad to 3, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then What's the highest number in the list.


Take a list of integers; odd numbers only, then pad to 3, then Return the greatest value or default to 0.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then Find the largest element, defaulting to zero.


Take a list of integers; odd numbers only, then pad to 3, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 != 0]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return max(r) if r else 0


Take a list of integers; keep the odd numbers, then pad with zeros to at least three elements, then return the maximum (0 if empty).


Take a list of integers; keep the positive numbers, then multiply each by two, then take values up to (excluding) the first zero.


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then keep the part before the first 0.


Take a list of integers; drop non-positive values, then multiply each by two, then truncate at the first zero.


Take a list of integers; drop the negative numbers, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; filter out the negative ones, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; remove all negative values, then double each item in the list, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 0]
    r = [x * 2 for x in r]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; keep the positive numbers, then double each, then keep everything before the first zero.


Take a list of integers; double each, then remove all zero values, then give the earliest even value or zero.


Take a list of integers; times two for each item, then exclude zeros, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = [x * 2 for x in r]
    r = [x for x in r if x != 0]
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; double each, then drop the zeros, then return the first even value (0 if none).


Take a list of integers; drop duplicates keeping first occurrence, then default to [0] when there is nothing, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then when the list is empty, substitute a zero value, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then replace an empty list with one zero, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then zero it out if it's empty, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then use zero if the list is empty, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then default to zero when empty, then drop all positive numbers.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = r if r else [0]
    r = [x for x in r if x < 0]
    return r


Take a list of integers; drop duplicates keeping first occurrence, then if empty, use a single zero, then keep the negative numbers.


Take a list of integers; square each, then keep the leading run of positive numbers, then take values up to (excluding) the first zero.


Take a list of integers; each value squared, then take values while they are positive, then keep the part before the first 0.


Take a list of integers; multiply each value by itself, then take positive values then stop, then truncate at the first zero.


Take a list of integers; square them all, then keep going while positive, then delete everything starting with the first zero.


Take a list of integers; raise each to the power of two, then stop at first non positive, then remove from the first zero onwards.


Take a list of integers; I need each number multiplied by itself, then take while greater than zero, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = [x * x for x in r]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; square each, then take values while they are positive, then keep everything before the first zero.


Take a list of people records (name, age); extract the ages, then flip the sign of each, then count the elements.


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, then how many items remain.


Take a list of people records (name, age); pluck the age field from each record, then flip the sign of each, then tell me the length.


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, then return the length.


Take a list of people records (name, age); keep just each person's age, then flip the sign of each, then count them.


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then what's the count.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [-x for x in r]
    return len(r)


Take a list of people records (name, age); extract the ages, then negate each, then return how many remain.


Take a list of integers; sort ascending, then cut the list at the first zero, then give the earliest even value or zero.


Take a list of integers; Sort it from low to high, then cut off after the first zero appears, then fetch the first even element, default to 0.


Take a list of integers; arrange in increasing order, then take values up to (excluding) the first zero, then give the earliest even value or zero.


Take a list of integers; Organize these ascending, then keep the part before the first 0, then fetch the first even element, default to 0.


Take a list of integers; Sort in ascending order, then truncate at the first zero, then give the earliest even value or zero.


Take a list of integers; I need this sorted ascending, then delete everything starting with the first zero, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = r[:r.index(0)] if 0 in r else r
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; sort ascending, then keep everything before the first zero, then return the first even value (0 if none).


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then replace an empty list with one zero.


Take a list of integers; drop duplicates but keep the first one, then plus one for all, then zero it out if it's empty.