Take a list of integers; put the elements backwards, then square all of them, then give me the count of even values.


Take a list of integers; reverse that for me, then multiply each element by itself, then I need to know how many of these are even.


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


Take a list of integers; reverse the order, then square each, then return how many values are even.


Take a list of integers; if empty, use a single zero, then take the final 3 elements, then give back the product of all values.


Take a list of integers; if blank use 0, then drop everything except the final three, then product of the list.


Take a list of integers; default to [0] when there is nothing, then give me the last three elements, then what's the product.


Take a list of integers; when the list is empty, substitute a zero value, then keep only the last three, then what do they multiply to.


Take a list of integers; replace an empty list with one zero, then keep the final three items, then give me their product.


Take a list of integers; zero it out if it's empty, then take the last three, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    r = r[-3:]
    return __import__('math').prod(r)


Take a list of integers; if empty, use a single zero, then keep only the last three, then return their product.


Take a list of integers; if empty, use a single zero, then keep only even values, then count the elements.


Take a list of integers; if blank use 0, then extract all even numbers, then how many items remain.


Take a list of integers; default to [0] when there is nothing, then keep only even values, then tell me the length.


Take a list of integers; when the list is empty, substitute a zero value, then extract all even numbers, then return the length.


Take a list of integers; replace an empty list with one zero, then keep only even values, then count them.


Take a list of integers; zero it out if it's empty, then extract all even numbers, then what's the count.


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


Take a list of integers; if empty, use a single zero, then keep the even numbers, then return how many remain.


Take a list of integers; drop the zeros, then flip the sign of each, then make each twice as big.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then multiply each by 2.


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


Take a list of integers; drop the zeros, then negate each, then double each.


Take a list of integers; keep the negative numbers, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; extract negatives, then take values while they are positive, then take abs of each.


Take a list of integers; keep the negative numbers, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; extract negatives, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; keep the negative numbers, then stop at first non positive, then make them all positive.


Take a list of integers; extract negatives, then take while greater than zero, then make every value non-negative.


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 = [abs(x) for x in r]
    return r


Take a list of integers; keep the negative numbers, then take values while they are positive, then take the absolute value of each.


Take a list of integers; keep only the last three, then remove both ends, then remove the initial run of negative numbers.


Take a list of integers; keep the final three items, then trim the edges, then strip the front negatives.


Take a list of integers; take the last three, then trim one element off each end, then remove leading negative numbers.


Take a list of integers; trim to the last three, then cut off the first and last, then drop negatives from start.


Take a list of integers; last three only, then remove the first and last elements, then strip negative values from the start.


Take a list of integers; truncate to the last three items, then keep only the middle part, then remove negatives before the first non-negative.


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


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


Take a list of integers; double each, then keep only even values, then give back the product of all values.


Take a list of integers; times two for each item, then extract all even numbers, then product of the list.


Take a list of integers; double each, then keep only even values, then what's the product.


Take a list of integers; times two for each item, then extract all even numbers, then what do they multiply to.


Take a list of integers; double each, then keep only even values, then give me their product.


Take a list of integers; times two for each item, then extract all even numbers, then multiply them all together.


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


Take a list of integers; double each, then keep the even numbers, then return their product.


Take a list of strings; drop empty strings, then strip spaces around each string, then true if a blank string is present.


Take a list of strings; get rid of blanks, then remove leading and trailing spaces, then check for empty strings in the list.


Take a list of strings; remove blanks, then remove whitespace from each item, then check if there's an empty string.


Take a list of strings; eliminate empty string values, then clean whitespace from each entry, then does the collection contain an empty string value somewhere.


Take a list of strings; filter out blank strings, then trim each string, then whether any element is blank.


Take a list of strings; remove strings that are empty, then trim whitespace from each, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = [s for s in r if s]
    r = [s.strip() for s in r]
    return any(s == '' for s in r)


Take a list of strings; drop empty strings, then trim whitespace from each, then return whether any string is empty.


Take a list of integers; keep everything before the first zero, then increase every value by 10, then trim one element off each end.


Take a list of integers; take only what comes before the initial zero, then add 10 to each item, then cut off the first and last.


Take a list of integers; cut the list at the first zero, then shift each up by ten, then remove the first and last elements.


Take a list of integers; cut off after the first zero appears, then increase all numbers by 10, then keep only the middle part.


Take a list of integers; take values up to (excluding) the first zero, then add 10 to everything, then drop first and last.


Take a list of integers; keep the part before the first 0, then give everything a boost of 10, then eliminate the outermost elements.


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


Take a list of integers; keep everything before the first zero, then add ten to each, then drop the first and last elements.


Take a list of integers; drop the leading negative values, then keep values above zero, then true if any value equals zero.


Take a list of integers; cut the leading negatives, then filter for positive numbers, then check for zero.


Take a list of integers; skip negatives at the start, then keep only positive numbers, then true if any value equals zero.


Take a list of integers; remove all negatives at the front, then keep the positives, then check for zero.


Take a list of integers; remove the initial run of negative numbers, then remove negatives, then true if any value equals zero.


Take a list of integers; strip the front negatives, then keep the positive numbers, 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 = [x for x in r if x > 0]
    return 0 in r


Take a list of integers; drop the leading negative values, then keep the positive numbers, then return whether the list contains a zero.


Take a list of integers; take the absolute value of each, then flip the list around, then remove the initial run of negative numbers.


Take a list of integers; convert to absolute value, then flip the order around, then strip the front negatives.


Take a list of integers; strip the signs, then put the elements backwards, then remove leading negative numbers.


Take a list of integers; take abs of each, then reverse that for me, then drop negatives from start.


Take a list of integers; get the absolute value of everything, then flip it backwards, then strip negative values from the start.


Take a list of integers; apply absolute value to the whole list, then make it backwards, then remove negatives before the first non-negative.


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


Take a list of integers; take the absolute value of each, then reverse the order, then drop the leading negative values.


Take a list of integers; sort ascending, then take the final 3 elements, then give back the total.


Take a list of integers; Sort it from low to high, then drop everything except the final three, then sum r.


Take a list of integers; arrange in increasing order, then give me the last three elements, then add them up.


Take a list of integers; Organize these ascending, then keep only the last three, then calculate the sum of all elements.


Take a list of integers; Sort in ascending order, then keep the final three items, then what's the total.


Take a list of integers; I need this sorted ascending, then take the last three, then what do they add up to.


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


Take a list of integers; sort ascending, then keep only the last three, then return their sum.


Take a list of integers; keep only the first three, then remove both ends, then strip the signs.


Take a list of integers; keep the first 3 items, then trim the edges, then take abs of each.


Take a list of integers; take the first 3 elements, then trim one element off each end, then get the absolute value of everything.


Take a list of integers; remove everything after the third, then cut off the first and last, then apply absolute value to the whole list.


Take a list of integers; truncate to three items, then remove the first and last elements, then make them all positive.


Take a list of integers; show the first three, then keep only the middle part, then make every value non-negative.


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


Take a list of integers; keep only the first three, then drop the first and last elements, then take the absolute value of each.


Take a list of integers; keep the odd numbers, then keep values above zero, then true if at least one even value.


Take a list of integers; odd numbers only, then filter for positive numbers, then any even.


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


Take a list of integers; odd numbers only, then keep the positives, then any even.


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


Take a list of integers; odd numbers only, then keep the positive numbers, then any even.


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


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


Take a list of integers; keep multiples of three, then sort largest to smallest, then give the earliest even value or zero.


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


Take a list of integers; keep values divisible by 3, then sort from highest to lowest, then give the earliest even value or zero.


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


Take a list of integers; drop anything not divisible by three, then sort largest first, then give the earliest even value or zero.


Take a list of integers; filter out everything except multiples of three, then sort in descending 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 = sorted(r, reverse=True)
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; keep multiples of three, then sort descending, then return the first even value (0 if none).


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then take values up to (excluding) the first zero.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then keep the part before the first 0.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then truncate at the first zero.


Take a list of integers; when the list is empty, substitute a zero value, then give me values where x is greater than 5, then delete everything starting with the first zero.


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five, then remove from the first zero onwards.


Take a list of integers; zero it out if it's empty, then keep values greater than five, then up to but not including the first zero.


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then keep everything before the first zero.


Take a list of integers; add ten to each, then remove the first item, then keep only numbers above 5.


Take a list of integers; bump everything up by 10, then Remove head, then exclude values of 5 and below.


Take a list of integers; increase every value by 10, then remove the first item, then remove anything 5 or less.


Take a list of integers; add 10 to each item, then Remove head, then filter to keep only values above 5.


Take a list of integers; shift each up by ten, then remove the first item, then get rid of values that aren't greater than five.


Take a list of integers; increase all numbers by 10, then Remove head, then drop anything 5 or below.


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


Take a list of integers; add ten to each, then drop the first element, then keep values greater than five.


Take a list of integers; add one to each, then clamp each to at most ten, then true if already sorted smallest to largest.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then does this list go in ascending order.


Take a list of integers; add one to each, then clamp each to at most ten, then check if the list is in ascending order.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then is the list sorted.


Take a list of integers; add one to each, then clamp each to at most ten, then is it sorted.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then check if values are in increasing order.


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


Take a list of integers; add one to each, then cap each value at 10, then return whether the list is sorted ascending.


Take a list of integers; drop the zeros, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep only the last three, then remove all zero values, then reduce each by one.


Take a list of integers; keep the final three items, then exclude zeros, then Subtract 1 from all.


Take a list of integers; take the last three, then remove all zero values, then Subtract one from each.


Take a list of integers; trim to the last three, then exclude zeros, then Drop each by one.


Take a list of integers; last three only, then remove all zero values, then Decrease all values by one.


Take a list of integers; truncate to the last three items, then exclude zeros, then Remove one from each value.


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


Take a list of integers; keep only the last three, then drop the zeros, then subtract one from each.


Take a list of integers; if empty, use a single zero, then keep values below zero, then count the elements.


Take a list of integers; if blank use 0, then get the negative numbers, then how many items remain.


Take a list of integers; default to [0] when there is nothing, then keep values below zero, then tell me the length.


Take a list of integers; when the list is empty, substitute a zero value, then get the negative numbers, then return the length.


Take a list of integers; replace an empty list with one zero, then keep values below zero, then count them.


Take a list of integers; zero it out if it's empty, then get the negative numbers, then what's the count.


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


Take a list of integers; if empty, use a single zero, then keep the negative numbers, then return how many remain.


Take a list of integers; take values while they are positive, then remove repeated values, then multiply each by -1.


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


Take a list of integers; keep going while positive, then remove repeated values, then multiply each by -1.


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


Take a list of integers; take while greater than zero, then remove repeated values, then multiply each by -1.


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


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 = [-x for x in r]
    return r


Take a list of integers; take values while they are positive, then drop duplicates keeping first occurrence, then negate each.


Take a list of integers; reverse the order, then keep only even values, then take values up to (excluding) the first zero.


Take a list of integers; reverse, then extract all even numbers, then keep the part before the first 0.


Take a list of integers; flip the list around, then keep only even values, then truncate at the first zero.


Take a list of integers; flip the order around, then extract all even numbers, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then keep only even values, then remove from the first zero onwards.


Take a list of integers; reverse that for me, then extract all even numbers, then up to but not including the first zero.


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


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


Take a list of integers; reverse the order, then default to [0] when there is nothing, then remove the initial run of negative numbers.


Take a list of integers; reverse, then when the list is empty, substitute a zero value, then strip the front negatives.


Take a list of integers; flip the list around, then replace an empty list with one zero, then remove leading negative numbers.


Take a list of integers; flip the order around, then zero it out if it's empty, then drop negatives from start.


Take a list of integers; put the elements backwards, then use zero if the list is empty, then strip negative values from the start.


Take a list of integers; reverse that for me, then default to zero when empty, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = list(reversed(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; reverse the order, then if empty, use a single zero, then drop the leading negative values.


Take a list of integers; sort by absolute value, then cut the list at the first zero, then drop the even numbers.


Take a list of integers; rearrange by distance from zero, then cut off after the first zero appears, then strip out the evens.


Take a list of integers; arrange by magnitude ignoring sign, then take values up to (excluding) the first zero, then drop the even numbers.


Take a list of integers; put them in order by magnitude, then keep the part before the first 0, then strip out the evens.


Take a list of integers; arrange in order of absolute value, then truncate at the first zero, then drop the even numbers.


Take a list of integers; sort by distance from zero, then delete everything starting with the first zero, then strip out the evens.


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


Take a list of integers; sort by absolute value, then keep everything before the first zero, then keep the odd numbers.


Take a list of integers; add one to each, then remove repeated values, then give back the total.


Take a list of integers; make each one bigger, then unique values preserving order, then sum r.


Take a list of integers; add one to each, then remove repeated values, then add them up.


Take a list of integers; make each one bigger, then unique values preserving order, then calculate the sum of all elements.


Take a list of integers; add one to each, then remove repeated values, then what's the total.


Take a list of integers; make each one bigger, then unique values preserving order, then what do they add up to.


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


Take a list of integers; add one to each, then drop duplicates keeping first occurrence, then return their sum.


Take a list of integers; add one to each, then take the final 3 elements, then remove the initial run of negative numbers.


Take a list of integers; make each one bigger, then drop everything except the final three, then strip the front negatives.


Take a list of integers; add one to each, then give me the last three elements, then remove leading negative numbers.


Take a list of integers; make each one bigger, then keep only the last three, then drop negatives from start.


Take a list of integers; add one to each, then keep the final three items, then strip negative values from the start.


Take a list of integers; make each one bigger, then take the last three, then remove negatives before the first non-negative.


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


Take a list of integers; add one to each, then keep only the last three, then drop the leading negative values.


Take a list of integers; keep multiples of three, then clamp each to at most ten, then stop at the first non-positive value.


Take a list of integers; get rid of non-multiples of three, then don't let anything exceed 10, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then clamp each to at most ten, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then don't let anything exceed 10, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then clamp each to at most ten, then keep going while positive.


Take a list of integers; filter out everything except multiples of three, then don't let anything exceed 10, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [min(x, 10) 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 multiples of three, then cap each value at 10, then take values while they are positive.


Take a list of integers; square each, then take the first 3 elements, then give the earliest even value or zero.


Take a list of integers; each value squared, then remove everything after the third, then fetch the first even element, default to 0.


Take a list of integers; multiply each value by itself, then truncate to three items, then give the earliest even value or zero.


Take a list of integers; square them all, then show the first three, then fetch the first even element, default to 0.


Take a list of integers; raise each to the power of two, then take the first three, then give the earliest even value or zero.


Take a list of integers; I need each number multiplied by itself, then keep first 3, then fetch the first even element, default to 0.


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


Take a list of integers; square each, then keep only the first three, then return the first even value (0 if none).


Take a list of integers; subtract one from each, then keep values below zero, then true if already sorted smallest to largest.


Take a list of integers; Decrement all items, then get the negative numbers, then does this list go in ascending order.


Take a list of integers; decrement each value, then keep values below zero, then check if the list is in ascending order.


Take a list of integers; Lower each number by one, then get the negative numbers, then is the list sorted.


Take a list of integers; reduce each by one, then keep values below zero, then is it sorted.


Take a list of integers; Subtract 1 from all, then get the negative numbers, then check if values are in increasing order.


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


Take a list of integers; subtract one from each, then keep the negative numbers, then return whether the list is sorted ascending.


Take a list of integers; subtract one from each, then increment each value, then deduplicate the list.


Take a list of integers; Decrement all items, then plus one for all, then remove repeats.


Take a list of integers; decrement each value, then increment each value, then deduplicate the list.


Take a list of integers; Lower each number by one, then plus one for all, then remove repeats.


Take a list of integers; reduce each by one, then increment each value, then deduplicate the list.


Take a list of integers; Subtract 1 from all, then plus one for all, then remove repeats.


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


Take a list of integers; subtract one from each, then add one to each, then drop duplicates keeping first occurrence.


Take a list of integers; add ten to each, then clamp each to at most ten, then strip the signs.


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then take abs of each.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then get the absolute value of everything.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then apply absolute value to the whole list.


Take a list of integers; shift each up by ten, then clamp each to at most ten, then make them all positive.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then make every value non-negative.


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


Take a list of integers; add ten to each, then cap each value at 10, then take the absolute value of each.


Take a list of integers; keep multiples of three, then keep only odd values, then trim one element off each end.


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then keep only odd values, then remove the first and last elements.


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


Take a list of integers; drop anything not divisible by three, then keep only odd values, then drop first and last.


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


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 = r[1:-1]
    return r


Take a list of integers; keep multiples of three, then keep the odd numbers, then drop the first and last elements.


Take a list of people records (name, age); extract the ages, then keep only even values, then take values up to (excluding) the first zero.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then keep the part before the first 0.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then truncate at the first zero.


Take a list of people records (name, age); get the age field, then extract all even numbers, then delete everything starting with the first zero.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then remove from the first zero onwards.


Take a list of people records (name, age); extract age values, then extract all even numbers, then up to but not including the first zero.


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then keep everything before the first zero.


Take a list of integers; add ten to each, then default to [0] when there is nothing, then deduplicate the list.


Take a list of integers; bump everything up by 10, then when the list is empty, substitute a zero value, then remove repeats.


Take a list of integers; increase every value by 10, then replace an empty list with one zero, then deduplicate the list.


Take a list of integers; add 10 to each item, then zero it out if it's empty, then remove repeats.


Take a list of integers; shift each up by ten, then use zero if the list is empty, then deduplicate the list.


Take a list of integers; increase all numbers by 10, then default to zero when empty, then remove repeats.


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


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


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


Take a list of integers; keep only nonzero elements, then square them all, then any even.


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


Take a list of integers; keep only nonzero elements, then I need each number multiplied by itself, then any even.


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


Take a list of integers; keep only nonzero elements, then multiply each element by itself, then any even.


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


Take a list of integers; drop the zeros, then square each, then return whether any value is even.


Take a list of integers; take values while they are positive, then cut the list at the first zero, then arrange by magnitude ignoring sign.


Take a list of integers; take positive values then stop, then cut off after the first zero appears, then put them in order by magnitude.


Take a list of integers; keep going while positive, then take values up to (excluding) the first zero, then arrange in order of absolute value.


Take a list of integers; stop at first non positive, then keep the part before the first 0, then sort by distance from zero.


Take a list of integers; take while greater than zero, then truncate at the first zero, then order by how far from zero.


Take a list of integers; take values while positive, then delete everything starting with the first zero, then order by distance from zero.


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 = sorted(r, key=abs)
    return r


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


Take a list of integers; drop the leading negative values, then take the final 3 elements, then drop the odd numbers.


Take a list of integers; cut the leading negatives, then drop everything except the final three, then filter out the odd numbers.


Take a list of integers; skip negatives at the start, then give me the last three elements, then drop the odd numbers.


Take a list of integers; remove all negatives at the front, then keep only the last three, then filter out the odd numbers.


Take a list of integers; remove the initial run of negative numbers, then keep the final three items, then drop the odd numbers.


Take a list of integers; strip the front negatives, then take the last three, then filter out the odd numbers.


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


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


Take a list of integers; sort ascending, then clamp each to at most ten, then arrange by magnitude ignoring sign.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then put them in order by magnitude.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then arrange in order of absolute value.


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then sort by distance from zero.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then order by how far from zero.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then order by distance from zero.


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


Take a list of integers; sort ascending, then cap each value at 10, then sort by absolute value.


Take a list of strings; uppercase each string, then keep only non-empty strings, then prepend a hash mark to each.


Take a list of strings; make it all caps, then filter empty strings, then prefix all with #.


Take a list of strings; convert each to upper case, then remove empty strings from the list, then prepend a hash mark to each.


Take a list of strings; change all strings to uppercase, then clean up empty strings, then prefix all with #.


Take a list of strings; make every string uppercase, then delete empty entries, then prepend a hash mark to each.


Take a list of strings; uppercase each one, then drop empty strings, then prefix all with #.


def solve(xs):
    r = list(xs)
    r = [s.upper() for s in r]
    r = [s for s in r if s]
    r = ['#' + s for s in r]
    return r


Take a list of strings; uppercase each string, then drop empty strings, then prefix each with a hash.


Take a list of integers; take the absolute value of each, then decrement each value, then drop the odd numbers.


Take a list of integers; convert to absolute value, then Lower each number by one, then filter out the odd numbers.


Take a list of integers; strip the signs, then reduce each by one, then drop the odd numbers.


Take a list of integers; take abs of each, then Subtract 1 from all, then filter out the odd numbers.


Take a list of integers; get the absolute value of everything, then Subtract one from each, then drop the odd numbers.


Take a list of integers; apply absolute value to the whole list, then Drop each by one, then filter out the odd numbers.


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


Take a list of integers; take the absolute value of each, then subtract one from each, then keep the even numbers.


Take a list of integers; add one to each, then increase every value by 10, then arrange in decreasing order.


Take a list of integers; make each one bigger, then add 10 to each item, then arrange in descending order.


Take a list of integers; add one to each, then shift each up by ten, then reverse sort.


Take a list of integers; make each one bigger, then increase all numbers by 10, then sort largest to smallest.


Take a list of integers; add one to each, then add 10 to everything, then sort by descending values.


Take a list of integers; make each one bigger, then give everything a boost of 10, then sort from highest to lowest.


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


Take a list of integers; add one to each, then add ten to each, then sort descending.


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


Take a list of integers; Sort it from low to high, then eliminate the even numbers, then put them in order by magnitude.


Take a list of integers; arrange in increasing order, then keep only odd values, then arrange in order of absolute value.


Take a list of integers; Organize these ascending, then eliminate the even numbers, then sort by distance from zero.


Take a list of integers; Sort in ascending order, then keep only odd values, then order by how far from zero.


Take a list of integers; I need this sorted ascending, then eliminate the even numbers, then order by distance from zero.


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


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


Take a list of integers; keep multiples of three, then flip the sign of each, then true if every value is unique.


Take a list of integers; get rid of non-multiples of three, then turn positives to negatives and vice versa, then check for duplicates in the values.


Take a list of integers; keep values divisible by 3, then flip the sign of each, then do all values appear only once.


Take a list of integers; keep items where x mod 3 equals zero, then turn positives to negatives and vice versa, then check that there are no duplicates.


Take a list of integers; drop anything not divisible by three, then flip the sign of each, then are the values all unique.


Take a list of integers; filter out everything except multiples of three, then turn positives to negatives and vice versa, then check if all values are unique.


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


Take a list of integers; keep multiples of three, then negate each, then return whether all values are distinct.


Take a list of integers; keep only the first three, then remove the first item, then deduplicate the list.


Take a list of integers; keep the first 3 items, then Remove head, then remove repeats.


Take a list of integers; take the first 3 elements, then remove the first item, then deduplicate the list.


Take a list of integers; remove everything after the third, then Remove head, then remove repeats.


Take a list of integers; truncate to three items, then remove the first item, then deduplicate the list.


Take a list of integers; show the first three, then Remove head, then remove repeats.


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


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


Take a list of integers; drop the first element, then remove all zero values, then make each twice as big.


Take a list of integers; Take everything except the first, then exclude zeros, then multiply each by 2.


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


Take a list of integers; drop the first element, then drop the zeros, then double each.


Take a list of integers; cap each value at 10, then increment each value, then trim one element off each end.


Take a list of integers; clip values at 10, then plus one for all, then cut off the first and last.


Take a list of integers; cap each value at 10, then increment each value, then remove the first and last elements.


Take a list of integers; clip values at 10, then plus one for all, then keep only the middle part.


Take a list of integers; cap each value at 10, then increment each value, then drop first and last.


Take a list of integers; clip values at 10, then plus one for all, then eliminate the outermost elements.


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


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


Take a list of integers; sort ascending, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of integers; Sort it from low to high, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; arrange in increasing order, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; Organize these ascending, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; Sort in ascending order, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; I need this sorted ascending, then keep values greater than five, then if no items, add a zero.


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


Take a list of integers; sort ascending, then keep values greater than five, then if empty, use a single zero.


Take a list of integers; double each, then sort largest to smallest, then strip the signs.


Take a list of integers; times two for each item, then sort by descending values, then take abs of each.


Take a list of integers; double each, then sort from highest to lowest, then get the absolute value of everything.


Take a list of integers; times two for each item, then sort descending, then apply absolute value to the whole list.


Take a list of integers; double each, then sort largest first, then make them all positive.


Take a list of integers; times two for each item, then sort in descending order, then make every value non-negative.


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


Take a list of integers; double each, then sort descending, then take the absolute value of each.


Take a list of integers; double each, then remove all zero values, then deduplicate the list.


Take a list of integers; times two for each item, then exclude zeros, then remove repeats.


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


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


Take a list of integers; double each, then take the final 3 elements, then drop the odd numbers.


Take a list of integers; times two for each item, then drop everything except the final three, then filter out the odd numbers.


Take a list of integers; double each, then give me the last three elements, then drop the odd numbers.


Take a list of integers; times two for each item, then keep only the last three, then filter out the odd numbers.


Take a list of integers; double each, then keep the final three items, then drop the odd numbers.


Take a list of integers; times two for each item, then take the last three, then filter out the odd numbers.


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


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


Take a list of integers; cap each value at 10, then take the final 3 elements, then arrange by magnitude ignoring sign.


Take a list of integers; clip values at 10, then drop everything except the final three, then put them in order by magnitude.


Take a list of integers; cap each value at 10, then give me the last three elements, then arrange in order of absolute value.


Take a list of integers; clip values at 10, then keep only the last three, then sort by distance from zero.


Take a list of integers; cap each value at 10, then keep the final three items, then order by how far from zero.


Take a list of integers; clip values at 10, then take the last three, then order by distance from zero.


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


Take a list of integers; cap each value at 10, then keep only the last three, then sort by absolute value.


Take a list of integers; keep the negative numbers, then flip the list around, then give back the total.


Take a list of integers; extract negatives, then flip the order around, then sum r.


Take a list of integers; keep the negative numbers, then put the elements backwards, then add them up.


Take a list of integers; extract negatives, then reverse that for me, then calculate the sum of all elements.


Take a list of integers; keep the negative numbers, then flip it backwards, then what's the total.


Take a list of integers; extract negatives, then make it backwards, then what do they add up to.


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


Take a list of integers; keep the negative numbers, then reverse the order, then return their sum.


Take a list of integers; drop the first and last elements, then keep values below zero, then true if at least one even value.


Take a list of integers; take out the first and last items, then get the negative numbers, then any even.


Take a list of integers; remove both ends, then keep values below zero, then true if at least one even value.


Take a list of integers; trim the edges, then get the negative numbers, then any even.


Take a list of integers; trim one element off each end, then keep values below zero, then true if at least one even value.


Take a list of integers; cut off the first and last, then get the negative numbers, then any even.


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


Take a list of integers; drop the first and last elements, then keep the negative numbers, then return whether any value is even.


Take a list of integers; sort by absolute value, then drop anything 5 or below, then give back the total.


Take a list of integers; rearrange by distance from zero, then keep only numbers greater than 5, then sum r.


Take a list of integers; arrange by magnitude ignoring sign, then filter for numbers above 5, then add them up.


Take a list of integers; put them in order by magnitude, then give me values where x is greater than 5, then calculate the sum of all elements.


Take a list of integers; arrange in order of absolute value, then show me only the values that are bigger than five, then what's the total.


Take a list of integers; sort by distance from zero, then keep values greater than five, then what do they add up to.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = [x for x in r if x > 5]
    return sum(r)


Take a list of integers; sort by absolute value, then keep values greater than five, then return their sum.


Take a list of integers; sort ascending, then decrement each value, then shift each up by ten.


Take a list of integers; Sort it from low to high, then Lower each number by one, then increase all numbers by 10.


Take a list of integers; arrange in increasing order, then reduce each by one, then add 10 to everything.


Take a list of integers; Organize these ascending, then Subtract 1 from all, then give everything a boost of 10.


Take a list of integers; Sort in ascending order, then Subtract one from each, then increment each by ten.


Take a list of integers; I need this sorted ascending, then Drop each by one, then add a constant 10 to each.


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


Take a list of integers; sort ascending, then subtract one from each, then add ten to each.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then shift each up by ten.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then increase all numbers by 10.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then add 10 to everything.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then give everything a boost of 10.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then increment each by ten.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then add a constant 10 to each.


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


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


Take a list of integers; sort descending, then make every value non-negative, then arrange by magnitude ignoring sign.


Take a list of integers; sort largest first, then absolute value for all items, then put them in order by magnitude.


Take a list of integers; sort in descending order, then take absolute values, then arrange in order of absolute value.


Take a list of integers; sort from greatest to least, then turn negatives into positives, then sort by distance from zero.


Take a list of integers; sort z to a, then abs each element, then order by how far from zero.


Take a list of integers; arrange in decreasing order, then take the absolute value of each, then order by distance from zero.


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


Take a list of integers; sort descending, then take the absolute value of each, then sort by absolute value.


Take a list of integers; sort by absolute value, then sort smallest to largest, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then Ascending sort, then check for duplicates in the values.


Take a list of integers; arrange by magnitude ignoring sign, then Sort this ascending, then do all values appear only once.


Take a list of integers; put them in order by magnitude, then Sort lowest to highest, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then Arrange from smallest to largest, then are the values all unique.


Take a list of integers; sort by distance from zero, then sort ascending, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = sorted(r)
    return len(r) == len(set(r))


Take a list of integers; sort by absolute value, then sort ascending, then return whether all values are distinct.


Take a list of integers; drop the first and last elements, then take the final 3 elements, then true if at least one even value.


Take a list of integers; take out the first and last items, then drop everything except the final three, then any even.


Take a list of integers; remove both ends, then give me the last three elements, then true if at least one even value.


Take a list of integers; trim the edges, then keep only the last three, then any even.


Take a list of integers; trim one element off each end, then keep the final three items, then true if at least one even value.


Take a list of integers; cut off the first and last, then take the last three, then any even.


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


Take a list of integers; drop the first and last elements, then keep only the last three, then return whether any value is even.


Take a list of integers; cap each value at 10, then take the first 3 elements, then remove the initial run of negative numbers.


Take a list of integers; clip values at 10, then remove everything after the third, then strip the front negatives.


Take a list of integers; cap each value at 10, then truncate to three items, then remove leading negative numbers.


Take a list of integers; clip values at 10, then show the first three, then drop negatives from start.


Take a list of integers; cap each value at 10, then take the first three, then strip negative values from the start.


Take a list of integers; clip values at 10, then keep first 3, then remove negatives before the first non-negative.


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


Take a list of integers; cap each value at 10, then keep only the first three, then drop the leading negative values.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then raise each to the power of two.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then I need each number multiplied by itself.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then square all of them.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then multiply each element by itself.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then make each one squared.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then square each value in the list.


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


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


Take a list of integers; drop the first element, then increase every value by 10, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then add 10 to each item, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then shift each up by ten, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then increase all numbers by 10, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then add 10 to everything, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then give everything a boost of 10, then fetch the first even element, default to 0.


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


Take a list of integers; drop the first element, then add ten to each, then return the first even value (0 if none).


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then skip the first one.


Take a list of integers; keep only nonzero elements, then pad to 3, then Discard the first element.


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


Take a list of integers; drop the zeros, then pad with zeros to at least three elements, then drop the first element.


Take a list of integers; pad with zeros to at least three elements, then cut the list at the first zero, then drop anything not divisible by three.


Take a list of integers; add zeros until the list has at least three values, then cut off after the first zero appears, then filter out everything except multiples of three.


Take a list of integers; pad with zeros to at least three elements, then take values up to (excluding) the first zero, then keep only multiples of three.


Take a list of integers; add zeros until the list has at least three values, then keep the part before the first 0, then multiples of three only.


Take a list of integers; pad with zeros to at least three elements, then truncate at the first zero, then filter for numbers divisible by three.


Take a list of integers; add zeros until the list has at least three values, then delete everything starting with the first zero, then give me only the values divisible by three.


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


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


Take a list of integers; take values while they are positive, then increase every value by 10, then true if every value is unique.


Take a list of integers; take positive values then stop, then add 10 to each item, then check for duplicates in the values.


Take a list of integers; keep going while positive, then shift each up by ten, then do all values appear only once.


Take a list of integers; stop at first non positive, then increase all numbers by 10, then check that there are no duplicates.


Take a list of integers; take while greater than zero, then add 10 to everything, then are the values all unique.


Take a list of integers; take values while positive, then give everything a boost of 10, then check if all values are unique.


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


Take a list of integers; take values while they are positive, then add ten to each, then return whether all values are distinct.


Take a list of integers; drop the zeros, then increment each value, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then check for zero.


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


Take a list of integers; drop the zeros, then add one to each, then return whether the list contains a zero.


Take a list of integers; add ten to each, then remove all zero values, then arrange by magnitude ignoring sign.


Take a list of integers; bump everything up by 10, then exclude zeros, then put them in order by magnitude.


Take a list of integers; increase every value by 10, then remove all zero values, then arrange in order of absolute value.


Take a list of integers; add 10 to each item, then exclude zeros, then sort by distance from zero.


Take a list of integers; shift each up by ten, then remove all zero values, then order by how far from zero.


Take a list of integers; increase all numbers by 10, then exclude zeros, then order by distance from zero.


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, key=abs)
    return r


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


Take a list of integers; sort by absolute value, then increase every value by 10, then deduplicate the list.


Take a list of integers; rearrange by distance from zero, then add 10 to each item, then remove repeats.


Take a list of integers; arrange by magnitude ignoring sign, then shift each up by ten, then deduplicate the list.


Take a list of integers; put them in order by magnitude, then increase all numbers by 10, then remove repeats.


Take a list of integers; arrange in order of absolute value, then add 10 to everything, then deduplicate the list.


Take a list of integers; sort by distance from zero, then give everything a boost of 10, then remove repeats.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = [x + 10 for x in r]
    r = list(dict.fromkeys(r))
    return r


Take a list of integers; sort by absolute value, then add ten to each, then drop duplicates keeping first occurrence.


Take a list of strings; sort alphabetically, then keep only strings of length 3 or more, then make every string lowercase.


Take a list of strings; arrange alphabetically, then get rid of short ones, then make it all lowercase.


Take a list of strings; sort alphabetically, then remove strings with less than three characters, then make every string lowercase.


Take a list of strings; arrange alphabetically, then remove all strings under three characters in length, then make it all lowercase.


Take a list of strings; sort alphabetically, then filter out short strings under three chars, then make every string lowercase.


Take a list of strings; arrange alphabetically, then drop strings shorter than three characters, then make it all lowercase.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = [s for s in r if len(s) >= 3]
    r = [s.lower() for s in r]
    return r


Take a list of strings; sort alphabetically, then drop strings shorter than three characters, then lowercase each string.


Take a list of integers; reverse the order, then keep values divisible by 3, then give back the total.


Take a list of integers; reverse, then keep items where x mod 3 equals zero, then sum r.


Take a list of integers; flip the list around, then drop anything not divisible by three, then add them up.


Take a list of integers; flip the order around, then filter out everything except multiples of three, then calculate the sum of all elements.


Take a list of integers; put the elements backwards, then keep only multiples of three, then what's the total.


Take a list of integers; reverse that for me, then multiples of three only, then what do they add up to.


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


Take a list of integers; reverse the order, then keep multiples of three, then return their sum.


Take a list of integers; subtract one from each, then keep values divisible by 3, then keep only non-zero numbers.


Take a list of integers; Decrement all items, then keep items where x mod 3 equals zero, then strip the zeros.


Take a list of integers; decrement each value, then drop anything not divisible by three, then keep only non-zero numbers.


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


Take a list of integers; reduce each by one, then keep only multiples of three, then keep only non-zero numbers.


Take a list of integers; Subtract 1 from all, then multiples of three only, then strip the zeros.


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the odd numbers, then sort ascending, then keep the even numbers.


Take a list of integers; cap each value at 10, then keep only even values, then make each twice as big.


Take a list of integers; clip values at 10, then extract all even numbers, then multiply each by 2.


def solve(xs):
    r = list(xs)
    r = [min(x, 10) for x in 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; cap each value at 10, then keep the even numbers, then double each.


Take a list of integers; if empty, use a single zero, then clamp each to at most ten, then drop anything not divisible by three.


Take a list of integers; if blank use 0, then don't let anything exceed 10, then filter out everything except multiples of three.


Take a list of integers; default to [0] when there is nothing, then clamp each to at most ten, then keep only multiples of three.


Take a list of integers; when the list is empty, substitute a zero value, then don't let anything exceed 10, then multiples of three only.


Take a list of integers; replace an empty list with one zero, then clamp each to at most ten, then filter for numbers divisible by three.


Take a list of integers; zero it out if it's empty, then don't let anything exceed 10, then give me only the values divisible by three.


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


Take a list of integers; if empty, use a single zero, then cap each value at 10, then keep multiples of three.


Take a list of integers; pad with zeros to at least three elements, then decrement each value, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then Lower each number by one, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then reduce each by one, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then Subtract 1 from all, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then Subtract one from each, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then Drop each by one, then strip out the evens.


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


Take a list of integers; pad with zeros to at least three elements, then subtract one from each, then keep the odd numbers.


Take a list of integers; keep only the last three, then cut the list at the first zero, then stop at the first non-positive value.


Take a list of integers; keep the final three items, then cut off after the first zero appears, then keep the leading run of positive numbers.


Take a list of integers; take the last three, then take values up to (excluding) the first zero, then take values while they are positive.


Take a list of integers; trim to the last three, then keep the part before the first 0, then take positive values then stop.


Take a list of integers; last three only, then truncate at the first zero, then keep going while positive.


Take a list of integers; truncate to the last three items, then delete everything starting with the first zero, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    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))]
    return r


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


Take a list of integers; drop the first and last elements, then default to [0] when there is nothing, then put the elements backwards.


Take a list of integers; take out the first and last items, then when the list is empty, substitute a zero value, then reverse that for me.


Take a list of integers; remove both ends, then replace an empty list with one zero, then flip it backwards.


Take a list of integers; trim the edges, then zero it out if it's empty, then make it backwards.


Take a list of integers; trim one element off each end, then use zero if the list is empty, then reverse the list.


Take a list of integers; cut off the first and last, then default to zero when empty, then invert the sequence.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = r if r else [0]
    r = list(reversed(r))
    return r


Take a list of integers; drop the first and last elements, then if empty, use a single zero, then reverse the order.


Take a list of integers; keep everything before the first zero, then keep values divisible by 3, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then keep items where x mod 3 equals zero, then minimum value, zero otherwise.


Take a list of integers; cut the list at the first zero, then drop anything not divisible by three, then get the minimum value or zero if empty.


Take a list of integers; cut off after the first zero appears, then filter out everything except multiples of three, then give me the min or 0.


Take a list of integers; take values up to (excluding) the first zero, then keep only multiples of three, then return the smallest number, defaulting to 0.


Take a list of integers; keep the part before the first 0, then multiples of three only, then return smallest or zero if empty.


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 % 3 == 0]
    return min(r) if r else 0


Take a list of integers; keep everything before the first zero, then keep multiples of three, then return the minimum (0 if empty).


Take a list of people records (name, age); sort records by age, youngest first, then pluck the name field from each record, then arrange by string length ascending.


Take a list of people records (name, age); put the youngest at the top, then Grab the names, then length sort.


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


Take a list of people records (name, age); put the youngest at the top, then List the names, then organize by string length least to greatest.


Take a list of people records (name, age); sort records by age, youngest first, then Extract the names, then shortest strings first.


Take a list of people records (name, age); put the youngest at the top, then Get the name field, then i want them ordered by how short they are.


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


Take a list of people records (name, age); sort records by age, youngest first, then extract the names, then sort by length, shortest first.


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


Take a list of integers; bump everything up by 10, then eliminate the even numbers, then put them in order by magnitude.


Take a list of integers; increase every value by 10, then keep only odd values, then arrange in order of absolute value.


Take a list of integers; add 10 to each item, then eliminate the even numbers, then sort by distance from zero.


Take a list of integers; shift each up by ten, then keep only odd values, then order by how far from zero.


Take a list of integers; increase all numbers by 10, then eliminate the even numbers, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = [x + 10 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; add ten to each, then keep the odd numbers, then sort by absolute value.


Take a list of integers; add ten to each, then sort smallest to largest, then keep only numbers above 5.


Take a list of integers; bump everything up by 10, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; increase every value by 10, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; add 10 to each item, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; increase all numbers by 10, then sort ascending, then drop anything 5 or below.


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


Take a list of integers; add ten to each, then sort ascending, then keep values greater than five.


Take a list of integers; sort ascending, then keep values above zero, then drop the odd numbers.


Take a list of integers; Sort it from low to high, then filter for positive numbers, then filter out the odd numbers.


Take a list of integers; arrange in increasing order, then keep only positive numbers, then drop the odd numbers.


Take a list of integers; Organize these ascending, then keep the positives, then filter out the odd numbers.


Take a list of integers; Sort in ascending order, then remove negatives, then drop the odd numbers.


Take a list of integers; I need this sorted ascending, then keep the positive numbers, then filter out the odd numbers.


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


Take a list of integers; sort ascending, then keep the positive numbers, then keep the even numbers.


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


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


Take a list of integers; keep the odd numbers, then shift each up by ten, then filter out the negative ones.


Take a list of integers; odd numbers only, then increase all numbers by 10, then remove all negative values.


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


Take a list of integers; odd numbers only, then give everything a boost of 10, then keep values above zero.


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 > 0]
    return r


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


Take a list of integers; sort by absolute value, then keep values above zero, then give back the total.


Take a list of integers; rearrange by distance from zero, then filter for positive numbers, then sum r.


Take a list of integers; arrange by magnitude ignoring sign, then keep only positive numbers, then add them up.


Take a list of integers; put them in order by magnitude, then keep the positives, then calculate the sum of all elements.


Take a list of integers; arrange in order of absolute value, then remove negatives, then what's the total.


Take a list of integers; sort by distance from zero, then keep the positive numbers, then what do they add up to.


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


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


Take a list of integers; keep only the last three, then skip negatives at the start, then true if at least one even value.


Take a list of integers; keep the final three items, then remove all negatives at the front, then any even.


Take a list of integers; take the last three, then remove the initial run of negative numbers, then true if at least one even value.


Take a list of integers; trim to the last three, then strip the front negatives, then any even.


Take a list of integers; last three only, then remove leading negative numbers, then true if at least one even value.


Take a list of integers; truncate to the last three items, then drop negatives from start, then any even.


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


Take a list of integers; keep only the last three, then drop the leading negative values, then return whether any value is even.


Take a list of integers; cap each value at 10, then keep only odd values, then give the number of evens.


Take a list of integers; clip values at 10, then eliminate the even numbers, then find how many values are divisible by two.


Take a list of integers; cap each value at 10, then keep only odd values, then how many are even.


Take a list of integers; clip values at 10, then eliminate the even numbers, then get the total number of even values in the list.


Take a list of integers; cap each value at 10, then keep only odd values, then give me the count of even values.


Take a list of integers; clip values at 10, then eliminate the even numbers, then I need to know how many of these are even.


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


Take a list of integers; cap each value at 10, then keep the odd numbers, then return how many values are even.


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then find the min, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then minimum value, zero otherwise.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then get the minimum value or zero if empty.


Take a list of integers; add zeros until the list has at least three values, then show the first three, then give me the min or 0.


Take a list of integers; pad with zeros to at least three elements, then take the first three, then return the smallest number, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then return smallest or zero if empty.


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


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


Take a list of integers; keep the positive numbers, then remove repeated values, then give back the product of all values.


Take a list of integers; get rid of anything that's not positive, then unique values preserving order, then product of the list.


Take a list of integers; drop non-positive values, then remove repeated values, then what's the product.


Take a list of integers; drop the negative numbers, then unique values preserving order, then what do they multiply to.


Take a list of integers; filter out the negative ones, then remove repeated values, then give me their product.


Take a list of integers; remove all negative values, then unique values preserving order, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 0]
    r = list(dict.fromkeys(r))
    return __import__('math').prod(r)


Take a list of integers; keep the positive numbers, then drop duplicates keeping first occurrence, then return their product.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then find the max, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then give the largest value (0 if none).


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


Take a list of integers; drop duplicates keeping first occurrence, then cap each value at 10, then return the maximum (0 if empty).


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then add 10 to everything.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then truncate at the first zero, then increment each by ten.


Take a list of integers; remove all negative values, then delete everything starting with the first zero, then add a constant 10 to each.


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


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


Take a list of integers; keep multiples of three, then drop anything 5 or below, then true only if all are positive.


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then do all of these have positive values.


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then check if every value is positive.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then confirm all values are positive.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then all positive.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then check if every number is above zero.


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


Take a list of integers; keep multiples of three, then keep values greater than five, then return whether all values are positive.


Take a list of integers; keep only the last three, then keep only odd values, then skip the first one.


Take a list of integers; keep the final three items, then eliminate the even numbers, then Discard the first element.


Take a list of integers; take the last three, then keep only odd values, then skip the first one.


Take a list of integers; trim to the last three, then eliminate the even numbers, then Discard the first element.


Take a list of integers; last three only, then keep only odd values, then skip the first one.


Take a list of integers; truncate to the last three items, then eliminate the even numbers, then Discard the first element.


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


Take a list of integers; keep only the last three, then keep the odd numbers, then drop the first element.


Take a list of integers; sort by absolute value, then remove the first item, then trim one element off each end.


Take a list of integers; rearrange by distance from zero, then Remove head, then cut off the first and last.


Take a list of integers; arrange by magnitude ignoring sign, then remove the first item, then remove the first and last elements.


Take a list of integers; put them in order by magnitude, then Remove head, then keep only the middle part.


Take a list of integers; arrange in order of absolute value, then remove the first item, then drop first and last.


Take a list of integers; sort by distance from zero, then Remove head, then eliminate the outermost elements.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then remove the initial run of negative numbers.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then strip the front negatives.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then remove leading negative numbers.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then drop negatives from start.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then strip negative values from the start.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then remove negatives before the first non-negative.


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


Take a list of integers; pad with zeros to at least three elements, then keep the odd numbers, then drop the leading negative values.


Take a list of integers; keep everything before the first zero, then remove the first item, then give the number of evens.


Take a list of integers; take only what comes before the initial zero, then Remove head, then find how many values are divisible by two.


Take a list of integers; cut the list at the first zero, then remove the first item, then how many are even.


Take a list of integers; cut off after the first zero appears, then Remove head, then get the total number of even values in the list.


Take a list of integers; take values up to (excluding) the first zero, then remove the first item, then give me the count of even values.


Take a list of integers; keep the part before the first 0, then Remove head, then I need to know how many of these are even.


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


Take a list of integers; keep everything before the first zero, then drop the first element, then return how many values are even.


Take a list of integers; keep only the first three, then multiply each by two, then keep only numbers above 5.


Take a list of integers; keep the first 3 items, then double each item in the list, then exclude values of 5 and below.


Take a list of integers; take the first 3 elements, then multiply each by two, then remove anything 5 or less.


Take a list of integers; remove everything after the third, then double each item in the list, then filter to keep only values above 5.


Take a list of integers; truncate to three items, then multiply each by two, then get rid of values that aren't greater than five.


Take a list of integers; show the first three, then double each item in the list, then drop anything 5 or below.


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


Take a list of integers; keep only the first three, then double each, then keep values greater than five.


Take a list of integers; pad with zeros to at least three elements, then increase every value by 10, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then add 10 to each item, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then shift each up by ten, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then increase all numbers by 10, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then add 10 to everything, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then give everything a boost of 10, then strip out the evens.


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


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


Take a list of integers; keep values greater than five, then extend to length 3 using zeros, then take values up to (excluding) the first zero.


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


Take a list of integers; keep only numbers above 5, then extend to length 3 using zeros, then truncate at the first zero.


Take a list of integers; exclude values of 5 and below, then pad to 3, then delete everything starting with the first zero.


Take a list of integers; remove anything 5 or less, then extend to length 3 using zeros, then remove from the first zero onwards.


Take a list of integers; filter to keep only values above 5, then pad to 3, 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 = r + [0] * (3 - len(r)) if len(r) < 3 else 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 pad with zeros to at least three elements, then keep everything before the first zero.


Take a list of integers; sort by absolute value, then remove the first item, then shift each up by ten.


Take a list of integers; rearrange by distance from zero, then Remove head, then increase all numbers by 10.


Take a list of integers; arrange by magnitude ignoring sign, then remove the first item, then add 10 to everything.


Take a list of integers; put them in order by magnitude, then Remove head, then give everything a boost of 10.


Take a list of integers; arrange in order of absolute value, then remove the first item, then increment each by ten.


Take a list of integers; sort by distance from zero, then Remove head, then add a constant 10 to each.


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


Take a list of integers; sort by absolute value, then drop the first element, then add ten to each.


Take a list of integers; drop the leading negative values, then take the first 3 elements, then drop the odd numbers.


Take a list of integers; cut the leading negatives, then remove everything after the third, then filter out the odd numbers.


Take a list of integers; skip negatives at the start, then truncate to three items, then drop the odd numbers.


Take a list of integers; remove all negatives at the front, then show the first three, then filter out the odd numbers.


Take a list of integers; remove the initial run of negative numbers, then take the first three, then drop the odd numbers.


Take a list of integers; strip the front negatives, then keep first 3, then filter out the odd numbers.


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


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


Take a list of integers; sort ascending, then keep values above zero, then arrange in decreasing order.


Take a list of integers; Sort it from low to high, then filter for positive numbers, then arrange in descending order.


Take a list of integers; arrange in increasing order, then keep only positive numbers, then reverse sort.


Take a list of integers; Organize these ascending, then keep the positives, then sort largest to smallest.


Take a list of integers; Sort in ascending order, then remove negatives, then sort by descending values.


Take a list of integers; I need this sorted ascending, then keep the positive numbers, then sort from highest to lowest.


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


Take a list of integers; sort ascending, then keep the positive numbers, then sort descending.


Take a list of integers; drop the first and last elements, then flip the list around, then drop anything not divisible by three.


Take a list of integers; take out the first and last items, then flip the order around, then filter out everything except multiples of three.


Take a list of integers; remove both ends, then put the elements backwards, then keep only multiples of three.


Take a list of integers; trim the edges, then reverse that for me, then multiples of three only.


Take a list of integers; trim one element off each end, then flip it backwards, then filter for numbers divisible by three.


Take a list of integers; cut off the first and last, then make it backwards, then give me only the values divisible by three.


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


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


Take a list of integers; keep the even numbers, then take the first 3 elements, then give back the total.


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


Take a list of integers; keep the even numbers, then truncate to three items, then add them up.


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


Take a list of integers; keep the even numbers, then take the first three, then what's the total.


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


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


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


Take a list of integers; keep only the last three, then remove all zero values, then true if at least one even value.


Take a list of integers; keep the final three items, then exclude zeros, then any even.


Take a list of integers; take the last three, then remove all zero values, then true if at least one even value.


Take a list of integers; trim to the last three, then exclude zeros, then any even.


Take a list of integers; last three only, then remove all zero values, then true if at least one even value.


Take a list of integers; truncate to the last three items, then exclude zeros, then any even.


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


Take a list of integers; keep only the last three, then drop the zeros, then return whether any value is even.


Take a list of integers; sort by absolute value, then keep only even values, then count the elements.


Take a list of integers; rearrange by distance from zero, then extract all even numbers, then how many items remain.


Take a list of integers; arrange by magnitude ignoring sign, then keep only even values, then tell me the length.


Take a list of integers; put them in order by magnitude, then extract all even numbers, then return the length.


Take a list of integers; arrange in order of absolute value, then keep only even values, then count them.


Take a list of integers; sort by distance from zero, then extract all even numbers, then what's the count.


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


Take a list of integers; sort by absolute value, then keep the even numbers, then return how many remain.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then truncate to the last three items.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then show only the last three.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then remove all but the last three.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then take the final 3 elements.