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


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


Take a list of integers; keep values greater than five, then take the final 3 elements, then give back the total.


Take a list of integers; filter out values less than or equal to 5, then drop everything except the final three, then sum r.


Take a list of integers; keep only numbers above 5, then give me the last three elements, then add them up.


Take a list of integers; exclude values of 5 and below, then keep only the last three, then calculate the sum of all elements.


Take a list of integers; remove anything 5 or less, then keep the final three items, then what's the total.


Take a list of integers; filter to keep only values above 5, then take the last three, then what do they add up to.


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


Take a list of integers; keep values greater than five, then keep only the last three, then return their sum.


Take a list of integers; take the absolute value of each, then sort largest to smallest, then drop the even numbers.


Take a list of integers; convert to absolute value, then sort by descending values, then strip out the evens.


Take a list of integers; strip the signs, then sort from highest to lowest, then drop the even numbers.


Take a list of integers; take abs of each, then sort descending, then strip out the evens.


Take a list of integers; get the absolute value of everything, then sort largest first, then drop the even numbers.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then strip out the evens.


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


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


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then return the number of strings.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then count the strings.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then return how many strings remain.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then give me the total number of strings.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then tell me how many strings we have.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then what's the string count.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = ['#' + s for s in r]
    return len(r)


Take a list of strings; sort alphabetically, then prefix each with a hash, then return how many strings remain.


Take a list of integers; negate each, then cut the list at the first zero, then give back the product of all values.


Take a list of integers; reverse the signs of everything, then cut off after the first zero appears, then product of the list.


Take a list of integers; negate each, then take values up to (excluding) the first zero, then what's the product.


Take a list of integers; reverse the signs of everything, then keep the part before the first 0, then what do they multiply to.


Take a list of integers; negate each, then truncate at the first zero, then give me their product.


Take a list of integers; reverse the signs of everything, then delete everything starting with the first zero, then multiply them all together.


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


Take a list of integers; negate each, then keep everything before the first zero, then return their product.


Take a list of integers; keep only the last three, then decrement each value, then drop non-negative values.


Take a list of integers; keep the final three items, then Lower each number by one, then drop all positive numbers.


Take a list of integers; take the last three, then reduce each by one, then drop non-negative values.


Take a list of integers; trim to the last three, then Subtract 1 from all, then drop all positive numbers.


Take a list of integers; last three only, then Subtract one from each, then drop non-negative values.


Take a list of integers; truncate to the last three items, then Drop each by one, then drop all positive numbers.


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


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


Take a list of integers; keep multiples of three, then flip the list around, then take values up to (excluding) the first zero.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then keep the part before the first 0.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then truncate at the first zero.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then delete everything starting with the first zero.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then remove from the first zero onwards.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then up to but not including the first zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the final 3 elements, then trim one element off each end.


Take a list of integers; add zeros until the list has at least three values, then drop everything except the final three, then cut off the first and last.


Take a list of integers; pad with zeros to at least three elements, then give me the last three elements, then remove the first and last elements.


Take a list of integers; add zeros until the list has at least three values, then keep only the last three, then keep only the middle part.


Take a list of integers; pad with zeros to at least three elements, then keep the final three items, then drop first and last.


Take a list of integers; add zeros until the list has at least three values, then take the last three, then eliminate the outermost elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then cut the list at the first zero, then keep only numbers above 5.


Take a list of integers; drop duplicates but keep the first one, then cut off after the first zero appears, then exclude values of 5 and below.


Take a list of integers; drop duplicates keeping first occurrence, then take values up to (excluding) the first zero, then remove anything 5 or less.


Take a list of integers; drop duplicates but keep the first one, then keep the part before the first 0, then filter to keep only values above 5.


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then get rid of values that aren't greater than five.


Take a list of integers; drop duplicates but keep the first one, then delete everything starting with the first zero, then drop anything 5 or below.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep everything before the first zero, then keep values greater than five.


Take a list of integers; add ten to each, then default to [0] when there is nothing, then give back the product of all values.


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


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


Take a list of integers; add 10 to each item, then zero it out if it's empty, then what do they multiply to.


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


Take a list of integers; increase all numbers by 10, then default to zero when empty, then multiply them all together.


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


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


Take a list of integers; take values while they are positive, then skip negatives at the start, then replace an empty list with one zero.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then zero it out if it's empty.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then use zero if the list is empty.


Take a list of integers; stop at first non positive, then strip the front negatives, then default to zero when empty.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then if there's nothing, put in a zero.


Take a list of integers; take values while positive, then drop negatives from start, then if no items, add a zero.


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


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


Take a list of integers; keep only the last three, then flip the list around, then arrange in increasing order.


Take a list of integers; keep the final three items, then flip the order around, then Organize these ascending.


Take a list of integers; take the last three, then put the elements backwards, then Sort in ascending order.


Take a list of integers; trim to the last three, then reverse that for me, then I need this sorted ascending.


Take a list of integers; last three only, then flip it backwards, then Put these in ascending order.


Take a list of integers; truncate to the last three items, then make it backwards, then sort smallest to largest.


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


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


Take a list of integers; add one to each, then order by distance from zero, then true if at least one even value.


Take a list of integers; make each one bigger, then sort based on absolute value, then any even.


Take a list of integers; add one to each, then organize by magnitude, then true if at least one even value.


Take a list of integers; make each one bigger, then arrange by absolute value ascending, then any even.


Take a list of integers; add one to each, then sort from smallest to largest absolute value, then true if at least one even value.


Take a list of integers; make each one bigger, then sort by absolute value, then any even.


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


Take a list of integers; add one to each, then sort by absolute value, then return whether any value is even.


Take a list of integers; take the absolute value of each, then flip the sign of each, then truncate to three items.


Take a list of integers; convert to absolute value, then turn positives to negatives and vice versa, then show the first three.


Take a list of integers; strip the signs, then flip the sign of each, then take the first three.


Take a list of integers; take abs of each, then turn positives to negatives and vice versa, then keep first 3.


Take a list of integers; get the absolute value of everything, then flip the sign of each, then truncate to first three.


Take a list of integers; apply absolute value to the whole list, then turn positives to negatives and vice versa, then first three.


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


Take a list of integers; take the absolute value of each, then negate each, then keep only the first three.


Take a list of integers; keep multiples of three, then make every value non-negative, then keep only numbers above 5.


Take a list of integers; get rid of non-multiples of three, then absolute value for all items, then exclude values of 5 and below.


Take a list of integers; keep values divisible by 3, then take absolute values, then remove anything 5 or less.


Take a list of integers; keep items where x mod 3 equals zero, then turn negatives into positives, then filter to keep only values above 5.


Take a list of integers; drop anything not divisible by three, then abs each element, then get rid of values that aren't greater than five.


Take a list of integers; filter out everything except multiples of three, then take the absolute value of each, then drop anything 5 or below.


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


Take a list of integers; keep multiples of three, then take the absolute value of each, then keep values greater than five.


Take a list of integers; sort descending, then order by distance from zero, then give back the product of all values.


Take a list of integers; sort largest first, then sort based on absolute value, then product of the list.


Take a list of integers; sort in descending order, then organize by magnitude, then what's the product.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending, then what do they multiply to.


Take a list of integers; sort z to a, then sort from smallest to largest absolute value, then give me their product.


Take a list of integers; arrange in decreasing order, then sort by absolute value, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = sorted(r, key=abs)
    return __import__('math').prod(r)


Take a list of integers; sort descending, then sort by absolute value, then return their product.


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


Take a list of integers; times two for each item, then remove everything after the third, then sum r.


Take a list of integers; double each, then truncate to three items, then add them up.


Take a list of integers; times two for each item, then show the first three, then calculate the sum of all elements.


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


Take a list of integers; times two for each item, then keep first 3, then what do they add up to.


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


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then drop non-negative values.


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


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


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then drop all positive numbers.


Take a list of integers; filter out the negative ones, then truncate at the first zero, then drop non-negative values.


Take a list of integers; remove all negative values, then delete everything starting with the first zero, then drop all positive numbers.


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 for x in r if x < 0]
    return r


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


Take a list of integers; keep the negative numbers, then take the final 3 elements, then truncate to three items.


Take a list of integers; extract negatives, then drop everything except the final three, then show the first three.


Take a list of integers; keep the negative numbers, then give me the last three elements, then take the first three.


Take a list of integers; extract negatives, then keep only the last three, then keep first 3.


Take a list of integers; keep the negative numbers, then keep the final three items, then truncate to first three.


Take a list of integers; extract negatives, then take the last three, then first three.


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


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


Take a list of integers; square each, then remove repeated values, then true if at least one even value.


Take a list of integers; each value squared, then unique values preserving order, then any even.


Take a list of integers; multiply each value by itself, then remove repeated values, then true if at least one even value.


Take a list of integers; square them all, then unique values preserving order, then any even.


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


Take a list of integers; I need each number multiplied by itself, then unique values preserving order, then any even.


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


Take a list of integers; square each, then drop duplicates keeping first occurrence, then return whether any value is even.


Take a list of integers; sort descending, then skip negatives at the start, then raise each to the power of two.


Take a list of integers; sort largest first, then remove all negatives at the front, then I need each number multiplied by itself.


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then square all of them.


Take a list of integers; sort from greatest to least, then strip the front negatives, then multiply each element by itself.


Take a list of integers; sort z to a, then remove leading negative numbers, then make each one squared.


Take a list of integers; arrange in decreasing order, then drop negatives from start, then square each value in the list.


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


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


Take a list of integers; keep multiples of three, then increase every value by 10, then keep only non-zero numbers.


Take a list of integers; get rid of non-multiples of three, then add 10 to each item, then strip the zeros.


Take a list of integers; keep values divisible by 3, then shift each up by ten, then keep only non-zero numbers.


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


Take a list of integers; drop anything not divisible by three, then add 10 to everything, then keep only non-zero numbers.


Take a list of integers; filter out everything except multiples of three, then give everything a boost of 10, then strip the zeros.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 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 multiples of three, then add ten to each, then drop the zeros.


Take a list of integers; keep the positive numbers, then decrement each value, then raise each to the power of two.


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


Take a list of integers; drop non-positive values, then reduce each by one, then square all of them.


Take a list of integers; drop the negative numbers, then Subtract 1 from all, then multiply each element by itself.


Take a list of integers; filter out the negative ones, then Subtract one from each, then make each one squared.


Take a list of integers; remove all negative values, then Drop each by one, then square each value in the list.


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


Take a list of integers; keep the positive numbers, then subtract one from each, then square each.


Take a list of integers; keep the odd numbers, then order by distance from zero, then true if already sorted smallest to largest.


Take a list of integers; odd numbers only, then sort based on absolute value, then does this list go in ascending order.


Take a list of integers; keep the odd numbers, then organize by magnitude, then check if the list is in ascending order.


Take a list of integers; odd numbers only, then arrange by absolute value ascending, then is the list sorted.


Take a list of integers; keep the odd numbers, then sort from smallest to largest absolute value, then is it sorted.


Take a list of integers; odd numbers only, then sort by absolute value, then check if values are in increasing order.


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


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


Take a list of integers; keep the even numbers, then multiply each by two, then truncate to three items.


Take a list of integers; keep evens, then double each item in the list, then show the first three.


Take a list of integers; keep the even numbers, then multiply each by two, then take the first three.


Take a list of integers; keep evens, then double each item in the list, then keep first 3.


Take a list of integers; keep the even numbers, then multiply each by two, then truncate to first three.


Take a list of integers; keep evens, then double each item in the list, then first three.


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


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


Take a list of integers; sort by absolute value, then remove all zero values, then count the elements.


Take a list of integers; rearrange by distance from zero, then exclude zeros, then how many items remain.


Take a list of integers; arrange by magnitude ignoring sign, then remove all zero values, then tell me the length.


Take a list of integers; put them in order by magnitude, then exclude zeros, then return the length.


Take a list of integers; arrange in order of absolute value, then remove all zero values, then count them.


Take a list of integers; sort by distance from zero, then exclude zeros, then what's the count.


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


Take a list of integers; sort by absolute value, then drop the zeros, then return how many remain.


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


Take a list of integers; each value squared, then drop everything except the final three, then fetch the first even element, default to 0.


Take a list of integers; multiply each value by itself, then give me the last three elements, then give the earliest even value or zero.


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


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


Take a list of integers; I need each number multiplied by itself, then take the last three, 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 last three, then return the first even value (0 if none).


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


Take a list of integers; get rid of non-multiples of three, then extract all even numbers, then Give me the maximum, but 0 if there are no items.


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


Take a list of integers; keep items where x mod 3 equals zero, then extract all even numbers, then Return the greatest value or default to 0.


Take a list of integers; drop anything not divisible by three, then keep only even values, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, then extract all even numbers, then give the largest value (0 if none).


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


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


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


Take a list of integers; get rid of non-multiples of three, then square them all, then any even.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then true if at least one even value.


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


Take a list of integers; drop anything not divisible by three, then square all of them, then true if at least one even value.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then any even.


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


Take a list of integers; keep multiples of three, then square each, then return whether any value is even.


Take a list of integers; cap each value at 10, then take the first 3 elements, then give back the product of all values.


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


Take a list of integers; cap each value at 10, then truncate to three items, then what's the product.


Take a list of integers; clip values at 10, then show the first three, then what do they multiply to.


Take a list of integers; cap each value at 10, then take the first three, then give me their product.


Take a list of integers; clip values at 10, then keep first 3, then multiply them all together.


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


Take a list of integers; cap each value at 10, then keep only the first three, then return their product.


Take a list of integers; drop the first and last elements, then decrement each value, then arrange in increasing order.


Take a list of integers; take out the first and last items, then Lower each number by one, then Organize these ascending.


Take a list of integers; remove both ends, then reduce each by one, then Sort in ascending order.


Take a list of integers; trim the edges, then Subtract 1 from all, then I need this sorted ascending.


Take a list of integers; trim one element off each end, then Subtract one from each, then Put these in ascending order.


Take a list of integers; cut off the first and last, then Drop each by one, then sort smallest to largest.


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


Take a list of integers; drop the first and last elements, then subtract one from each, then sort ascending.


Take a list of integers; drop the leading negative values, then increment each value, then arrange in decreasing order.


Take a list of integers; cut the leading negatives, then plus one for all, then arrange in descending order.


Take a list of integers; skip negatives at the start, then increment each value, then reverse sort.


Take a list of integers; remove all negatives at the front, then plus one for all, then sort largest to smallest.


Take a list of integers; remove the initial run of negative numbers, then increment each value, then sort by descending values.


Take a list of integers; strip the front negatives, then plus one for all, then sort from highest to lowest.


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


Take a list of integers; drop the leading negative values, then add one to each, then sort descending.


Take a list of integers; sort by absolute value, then default to [0] when there is nothing, then keep only numbers above 5.


Take a list of integers; rearrange by distance from zero, then when the list is empty, substitute a zero value, then exclude values of 5 and below.


Take a list of integers; arrange by magnitude ignoring sign, then replace an empty list with one zero, then remove anything 5 or less.


Take a list of integers; put them in order by magnitude, then zero it out if it's empty, then filter to keep only values above 5.


Take a list of integers; arrange in order of absolute value, then use zero if the list is empty, then get rid of values that aren't greater than five.


Take a list of integers; sort by distance from zero, then default to zero when empty, then drop anything 5 or below.


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


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


Take a list of integers; drop the leading negative values, then sort smallest to largest, then drop the even numbers.


Take a list of integers; cut the leading negatives, then Ascending sort, then strip out the evens.


Take a list of integers; skip negatives at the start, then Sort this ascending, then drop the even numbers.


Take a list of integers; remove all negatives at the front, then Sort lowest to highest, then strip out the evens.


Take a list of integers; remove the initial run of negative numbers, then Arrange from smallest to largest, then drop the even numbers.


Take a list of integers; strip the front negatives, then sort ascending, then strip out the evens.


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


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


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


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


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


Take a list of integers; keep only nonzero elements, then keep going while positive, then delete everything starting with the first zero.


Take a list of integers; drop the zeros, then stop at first non positive, then remove from the first zero onwards.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then up to but not including the first zero.


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


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


Take a list of integers; keep only the first three, then order by distance from zero, then keep only non-zero numbers.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then strip the zeros.


Take a list of integers; take the first 3 elements, then organize by magnitude, then keep only non-zero numbers.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then strip the zeros.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then keep only non-zero numbers.


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


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


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


Take a list of integers; double each, then increment each value, then put the elements backwards.


Take a list of integers; times two for each item, then plus one for all, then reverse that for me.


Take a list of integers; double each, then increment each value, then flip it backwards.


Take a list of integers; times two for each item, then plus one for all, then make it backwards.


Take a list of integers; double each, then increment each value, then reverse the list.


Take a list of integers; times two for each item, then plus one for all, then invert the sequence.


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


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


Take a list of integers; keep values greater than five, then remove repeated values, then limit every value to 10.


Take a list of integers; filter out values less than or equal to 5, then unique values preserving order, then maximum of 10 for all.


Take a list of integers; keep only numbers above 5, then remove repeated values, then limit every value to 10.


Take a list of integers; exclude values of 5 and below, then unique values preserving order, then maximum of 10 for all.


Take a list of integers; remove anything 5 or less, then remove repeated values, then limit every value to 10.


Take a list of integers; filter to keep only values above 5, then unique values preserving order, then maximum of 10 for all.


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


Take a list of integers; keep values greater than five, then drop duplicates keeping first occurrence, then cap each value at 10.


Take a list of people records (name, age); extract the ages, then remove the first item, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item, then ensure at least three items by appending zeros.


Take a list of people records (name, age); get the age field, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); keep just each person's age, then remove the first item, then ensure at least three items by appending zeros.


Take a list of people records (name, age); extract age values, then Remove head, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); extract the ages, then drop the first element, then pad with zeros to at least three elements.


Take a list of integers; keep values greater than five, then order by distance from zero, then trim one element off each end.


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value, then cut off the first and last.


Take a list of integers; keep only numbers above 5, then organize by magnitude, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; filter to keep only values above 5, then sort by absolute value, then eliminate the outermost elements.


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


Take a list of integers; keep values greater than five, then sort by absolute value, then drop the first and last elements.


Take a list of integers; double each, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; times two for each item, then don't let anything exceed 10, then strip the zeros.


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


Take a list of integers; double each, then cap each value at 10, then drop the zeros.


Take a list of integers; add one to each, then keep only even values, then put the elements backwards.


Take a list of integers; make each one bigger, then extract all even numbers, then reverse that for me.


Take a list of integers; add one to each, then keep only even values, then flip it backwards.


Take a list of integers; make each one bigger, then extract all even numbers, then make it backwards.


Take a list of integers; add one to each, then keep only even values, then reverse the list.


Take a list of integers; make each one bigger, then extract all even numbers, then invert the sequence.


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


Take a list of integers; add one to each, then keep the even numbers, then reverse the order.


Take a list of integers; square each, then sort largest to smallest, then shift each up by ten.


Take a list of integers; each value squared, then sort by descending values, then increase all numbers by 10.


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then add 10 to everything.


Take a list of integers; square them all, then sort descending, then give everything a boost of 10.


Take a list of integers; raise each to the power of two, then sort largest first, then increment each by ten.


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then add a constant 10 to each.


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


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


Take a list of integers; drop the leading negative values, then remove repeated values, then arrange in decreasing order.


Take a list of integers; cut the leading negatives, then unique values preserving order, then arrange in descending order.


Take a list of integers; skip negatives at the start, then remove repeated values, then reverse sort.


Take a list of integers; remove all negatives at the front, then unique values preserving order, then sort largest to smallest.


Take a list of integers; remove the initial run of negative numbers, then remove repeated values, then sort by descending values.


Take a list of integers; strip the front negatives, then unique values preserving order, then sort from highest to lowest.


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 = sorted(r, reverse=True)
    return r


Take a list of integers; drop the leading negative values, then drop duplicates keeping first occurrence, then sort descending.


Take a list of integers; sort descending, then skip negatives at the start, then bump each up by one.


Take a list of integers; sort largest first, then remove all negatives at the front, then increment each item.


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then bump each up by one.


Take a list of integers; sort from greatest to least, then strip the front negatives, then increment each item.


Take a list of integers; sort z to a, then remove leading negative numbers, then bump each up by one.


Take a list of integers; arrange in decreasing order, then drop negatives from start, then increment each item.


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


Take a list of integers; sort descending, then drop the leading negative values, then add one to each.


Take a list of integers; keep the even numbers, then order by distance from zero, then true if every value is unique.


Take a list of integers; keep evens, then sort based on absolute value, then check for duplicates in the values.


Take a list of integers; keep the even numbers, then organize by magnitude, then do all values appear only once.


Take a list of integers; keep evens, then arrange by absolute value ascending, then check that there are no duplicates.


Take a list of integers; keep the even numbers, then sort from smallest to largest absolute value, then are the values all unique.


Take a list of integers; keep evens, then sort by absolute value, then check if all values are unique.


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


Take a list of integers; keep the even numbers, then sort by absolute value, then return whether all values are distinct.


Take a list of integers; sort by absolute value, then keep values divisible by 3, then give the number of evens.


Take a list of integers; rearrange by distance from zero, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then how many are even.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then give me the count of even values.


Take a list of integers; sort by distance from zero, then multiples of three only, then I need to know how many of these are even.


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


Take a list of integers; sort by absolute value, then keep multiples of three, then return how many values are even.


Take a list of integers; drop duplicates keeping first occurrence, then cut the list at the first zero, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then cut off after the first zero appears, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then take values up to (excluding) the first zero, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then keep the part before the first 0, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then delete everything starting with the first zero, then drop all positive numbers.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep everything before the first zero, then keep the negative numbers.


Take a list of integers; keep multiples of three, then multiply each by two, then stop at the first non-positive value.


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then multiply each by two, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then keep going while positive.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [x * 2 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 double each, then take values while they are positive.


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then deduplicate the list.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then remove repeats.


Take a list of integers; strip the signs, then filter for numbers above 5, then deduplicate the list.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then remove repeats.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then deduplicate the list.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then remove repeats.


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


Take a list of integers; take the absolute value of each, then keep values greater than five, then drop duplicates keeping first occurrence.


Take a list of integers; keep the even numbers, then flip the list around, then make each twice as big.


Take a list of integers; keep evens, then flip the order around, then multiply each by 2.


Take a list of integers; keep the even numbers, then put the elements backwards, then make each twice as big.


Take a list of integers; keep evens, then reverse that for me, then multiply each by 2.


Take a list of integers; keep the even numbers, then flip it backwards, then make each twice as big.


Take a list of integers; keep evens, then make it backwards, then multiply each by 2.


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


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


Take a list of integers; sort descending, then take the final 3 elements, then true only if all are positive.


Take a list of integers; sort largest first, then drop everything except the final three, then do all of these have positive values.


Take a list of integers; sort in descending order, then give me the last three elements, then check if every value is positive.


Take a list of integers; sort from greatest to least, then keep only the last three, then confirm all values are positive.


Take a list of integers; sort z to a, then keep the final three items, then all positive.


Take a list of integers; arrange in decreasing order, then take the last three, then check if every number is above zero.


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


Take a list of integers; sort descending, then keep only the last three, then return whether all values are positive.


Take a list of integers; keep everything before the first zero, then flip the list around, then replace an empty list with one zero.


Take a list of integers; take only what comes before the initial zero, then flip the order around, then zero it out if it's empty.


Take a list of integers; cut the list at the first zero, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; cut off after the first zero appears, then reverse that for me, then default to zero when empty.


Take a list of integers; take values up to (excluding) the first zero, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; keep the part before the first 0, then make it backwards, then if no items, add a zero.


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


Take a list of integers; keep everything before the first zero, then reverse the order, then if empty, use a single zero.


Take a list of integers; keep the even numbers, then skip negatives at the start, then find the max, defaulting to 0.


Take a list of integers; keep evens, then remove all negatives at the front, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the even numbers, then remove the initial run of negative numbers, then What's the highest number in the list.


Take a list of integers; keep evens, then strip the front negatives, then Return the greatest value or default to 0.


Take a list of integers; keep the even numbers, then remove leading negative numbers, then Find the largest element, defaulting to zero.


Take a list of integers; keep evens, then drop negatives from start, then give the largest value (0 if none).


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


Take a list of integers; keep the even numbers, then drop the leading negative values, then return the maximum (0 if empty).


Take a list of integers; drop the first element, then flip the sign of each, then keep only non-zero numbers.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then strip the zeros.


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


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


Take a list of integers; take the absolute value of each, then keep values below zero, then true only if all are positive.


Take a list of integers; convert to absolute value, then get the negative numbers, then do all of these have positive values.


Take a list of integers; strip the signs, then keep values below zero, then check if every value is positive.


Take a list of integers; take abs of each, then get the negative numbers, then confirm all values are positive.


Take a list of integers; get the absolute value of everything, then keep values below zero, then all positive.


Take a list of integers; apply absolute value to the whole list, then get the negative numbers, then check if every number is above zero.


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


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


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


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


Take a list of integers; drop non-positive values, then remove repeated values, then multiply each by -1.


Take a list of integers; drop the negative numbers, then unique values preserving order, then negate.


Take a list of integers; filter out the negative ones, then remove repeated values, then multiply each by -1.


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


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


Take a list of integers; keep the positive numbers, then drop duplicates keeping first occurrence, then negate each.


Take a list of integers; if empty, use a single zero, then remove the first item, then drop non-negative values.


Take a list of integers; if blank use 0, then Remove head, then drop all positive numbers.


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


Take a list of integers; when the list is empty, substitute a zero value, then Remove head, then drop all positive numbers.


Take a list of integers; replace an empty list with one zero, then remove the first item, then drop non-negative values.


Take a list of integers; zero it out if it's empty, then Remove head, then drop all positive numbers.


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


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


Take a list of integers; take values while they are positive, then remove both ends, then true only if all are positive.


Take a list of integers; take positive values then stop, then trim the edges, then do all of these have positive values.


Take a list of integers; keep going while positive, then trim one element off each end, then check if every value is positive.


Take a list of integers; stop at first non positive, then cut off the first and last, then confirm all values are positive.


Take a list of integers; take while greater than zero, then remove the first and last elements, then all positive.


Take a list of integers; take values while positive, then keep only the middle part, then check if every number is above zero.


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


Take a list of integers; take values while they are positive, then drop the first and last elements, then return whether all values are positive.


Take a list of integers; keep only the last three, then increase every value by 10, then keep only numbers above 5.


Take a list of integers; keep the final three items, then add 10 to each item, then exclude values of 5 and below.


Take a list of integers; take the last three, then shift each up by ten, then remove anything 5 or less.


Take a list of integers; trim to the last three, then increase all numbers by 10, then filter to keep only values above 5.


Take a list of integers; last three only, then add 10 to everything, then get rid of values that aren't greater than five.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then drop anything 5 or below.


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


Take a list of integers; keep only the last three, then add ten to each, then keep values greater than five.


Take a list of integers; keep multiples of three, then extend to length 3 using zeros, then reduce each by one.


Take a list of integers; get rid of non-multiples of three, then pad to 3, then Subtract 1 from all.


Take a list of integers; keep values divisible by 3, then extend to length 3 using zeros, then Subtract one from each.


Take a list of integers; keep items where x mod 3 equals zero, then pad to 3, then Drop each by one.


Take a list of integers; drop anything not divisible by three, then extend to length 3 using zeros, then Decrease all values by one.


Take a list of integers; filter out everything except multiples of three, then pad to 3, then Remove one from each value.


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


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


Take a list of people records (name, age); extract the ages, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of people records (name, age); show me all ages, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then filter for numbers above 5, then use zero if the list is empty.


Take a list of people records (name, age); get the age field, then give me values where x is greater than 5, then default to zero when empty.


Take a list of people records (name, age); keep just each person's age, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of people records (name, age); extract age values, then keep values greater than five, then if no items, add a zero.


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


Take a list of people records (name, age); extract the ages, then keep values greater than five, then if empty, use a single zero.


Take a list of integers; drop the zeros, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then get the negative numbers, 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 = [x for x in r if x < 0]
    return next((x for x in r if x % 2 == 0), 0)


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


Take a list of integers; cap each value at 10, then keep values divisible by 3, then true if at least one even value.


Take a list of integers; clip values at 10, then keep items where x mod 3 equals zero, then any even.


Take a list of integers; cap each value at 10, then drop anything not divisible by three, then true if at least one even value.


Take a list of integers; clip values at 10, then filter out everything except multiples of three, then any even.


Take a list of integers; cap each value at 10, then keep only multiples of three, then true if at least one even value.


Take a list of integers; clip values at 10, then multiples of three only, then any even.


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


Take a list of integers; cap each value at 10, then keep multiples of three, then return whether any value is even.


Take a list of integers; subtract one from each, then keep only odd values, then true if every value is unique.


Take a list of integers; Decrement all items, then eliminate the even numbers, then check for duplicates in the values.


Take a list of integers; decrement each value, then keep only odd values, then do all values appear only once.


Take a list of integers; Lower each number by one, then eliminate the even numbers, then check that there are no duplicates.


Take a list of integers; reduce each by one, then keep only odd values, then are the values all unique.


Take a list of integers; Subtract 1 from all, then eliminate the even numbers, then check if all values are unique.


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


Take a list of integers; subtract one from each, then keep the odd numbers, then return whether all values are distinct.


Take a list of integers; drop the zeros, then keep values divisible by 3, then find the min, defaulting to 0.


Take a list of integers; keep only nonzero elements, then keep items where x mod 3 equals zero, then minimum value, zero otherwise.


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


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then give me the min or 0.


Take a list of integers; drop the zeros, then keep only multiples of three, then return the smallest number, defaulting to 0.


Take a list of integers; keep only nonzero elements, then multiples of three only, then return smallest or zero if empty.


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


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


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


Take a list of integers; if blank use 0, then get the negative numbers, then keep the part before the first 0.


Take a list of integers; default to [0] when there is nothing, then keep values below zero, then truncate at the first zero.


Take a list of integers; when the list is empty, substitute a zero value, then get the negative numbers, then delete everything starting with the first zero.


Take a list of integers; replace an empty list with one zero, then keep values below zero, then remove from the first zero onwards.


Take a list of integers; zero it out if it's empty, then get the negative numbers, 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 < 0]
    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 the negative numbers, then keep everything before the first zero.


Take a list of integers; subtract one from each, then remove both ends, then give the number of evens.


Take a list of integers; Decrement all items, then trim the edges, then find how many values are divisible by two.


Take a list of integers; decrement each value, then trim one element off each end, then how many are even.


Take a list of integers; Lower each number by one, then cut off the first and last, then get the total number of even values in the list.


Take a list of integers; reduce each by one, then remove the first and last elements, then give me the count of even values.


Take a list of integers; Subtract 1 from all, then keep only the middle part, then I need to know how many of these are even.


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


Take a list of integers; subtract one from each, then drop the first and last elements, then return how many values are even.


Take a list of integers; drop the zeros, then take the final 3 elements, then count the elements.


Take a list of integers; keep only nonzero elements, then drop everything except the final three, then how many items remain.


Take a list of integers; drop the zeros, then give me the last three elements, then tell me the length.


Take a list of integers; keep only nonzero elements, then keep only the last three, then return the length.


Take a list of integers; drop the zeros, then keep the final three items, then count them.


Take a list of integers; keep only nonzero elements, then take the last three, then what's the count.


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


Take a list of integers; drop the zeros, then keep only the last three, then return how many remain.


Take a list of integers; sort by absolute value, then take the final 3 elements, then deduplicate the list.


Take a list of integers; rearrange by distance from zero, then drop everything except the final three, then remove repeats.


Take a list of integers; arrange by magnitude ignoring sign, then give me the last three elements, then deduplicate the list.


Take a list of integers; put them in order by magnitude, then keep only the last three, then remove repeats.


Take a list of integers; arrange in order of absolute value, then keep the final three items, then deduplicate the list.


Take a list of integers; sort by distance from zero, then take the last three, then remove repeats.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = r[-3:]
    r = list(dict.fromkeys(r))
    return r


Take a list of integers; sort by absolute value, then keep only the last three, then drop duplicates keeping first occurrence.


Take a list of integers; keep the positive numbers, then remove both ends, then drop anything not divisible by three.


Take a list of integers; get rid of anything that's not positive, then trim the edges, then filter out everything except multiples of three.


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


Take a list of integers; drop the negative numbers, then cut off the first and last, then multiples of three only.


Take a list of integers; filter out the negative ones, then remove the first and last elements, then filter for numbers divisible by three.


Take a list of integers; remove all negative values, then keep only the middle part, then give me only the values divisible by three.


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


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


Take a list of integers; drop the zeros, then keep only even values, then true only if all are positive.


Take a list of integers; keep only nonzero elements, then extract all even numbers, then do all of these have positive values.


Take a list of integers; drop the zeros, then keep only even values, then check if every value is positive.


Take a list of integers; keep only nonzero elements, then extract all even numbers, then confirm all values are positive.


Take a list of integers; drop the zeros, then keep only even values, then all positive.


Take a list of integers; keep only nonzero elements, then extract all even numbers, then check if every number is above zero.


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


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


Take a list of integers; add one to each, then drop anything 5 or below, then drop non-positive values.


Take a list of integers; make each one bigger, then keep only numbers greater than 5, then drop the negative numbers.


Take a list of integers; add one to each, then filter for numbers above 5, then filter out the negative ones.


Take a list of integers; make each one bigger, then give me values where x is greater than 5, then remove all negative values.


Take a list of integers; add one to each, then show me only the values that are bigger than five, then keep positive values only.


Take a list of integers; make each one bigger, then keep values greater than five, then keep values above zero.


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


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


Take a list of integers; add one to each, then remove the first item, then arrange in decreasing order.


Take a list of integers; make each one bigger, then Remove head, then arrange in descending order.


Take a list of integers; add one to each, then remove the first item, then reverse sort.


Take a list of integers; make each one bigger, then Remove head, then sort largest to smallest.


Take a list of integers; add one to each, then remove the first item, then sort by descending values.


Take a list of integers; make each one bigger, then Remove head, then sort from highest to lowest.


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


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


Take a list of integers; sort by absolute value, then remove all zero values, then bump each up by one.


Take a list of integers; rearrange by distance from zero, then exclude zeros, then increment each item.


Take a list of integers; arrange by magnitude ignoring sign, then remove all zero values, then bump each up by one.


Take a list of integers; put them in order by magnitude, then exclude zeros, then increment each item.


Take a list of integers; arrange in order of absolute value, then remove all zero values, then bump each up by one.


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


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


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


Take a list of integers; sort ascending, then skip negatives at the start, then count the elements.


Take a list of integers; Sort it from low to high, then remove all negatives at the front, then how many items remain.


Take a list of integers; arrange in increasing order, then remove the initial run of negative numbers, then tell me the length.


Take a list of integers; Organize these ascending, then strip the front negatives, then return the length.


Take a list of integers; Sort in ascending order, then remove leading negative numbers, then count them.


Take a list of integers; I need this sorted ascending, then drop negatives from start, then what's the count.


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


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


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


Take a list of integers; keep the final three items, then cut off after the first zero appears, then any even.


Take a list of integers; take the last three, then take values up to (excluding) the first zero, then true if at least one even value.


Take a list of integers; trim to the last three, then keep the part before the first 0, then any even.


Take a list of integers; last three only, then truncate at the first zero, then true if at least one even value.


Take a list of integers; truncate to the last three items, then delete everything starting with the first zero, then any even.


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


Take a list of integers; keep only the last three, then keep everything before the first zero, then return whether any value is even.


Take a list of integers; pad with zeros to at least three elements, then flip the list around, then truncate to three items.


Take a list of integers; add zeros until the list has at least three values, then flip the order around, then show the first three.


Take a list of integers; pad with zeros to at least three elements, then put the elements backwards, then take the first three.


Take a list of integers; add zeros until the list has at least three values, then reverse that for me, then keep first 3.


Take a list of integers; pad with zeros to at least three elements, then flip it backwards, then truncate to first three.


Take a list of integers; add zeros until the list has at least three values, then make it backwards, then first three.


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


Take a list of integers; pad with zeros to at least three elements, then reverse the order, then keep only the first three.


Take a list of integers; keep the positive numbers, then flip the sign of each, then give back the total.


Take a list of integers; get rid of anything that's not positive, then turn positives to negatives and vice versa, then sum r.


Take a list of integers; drop non-positive values, then flip the sign of each, then add them up.


Take a list of integers; drop the negative numbers, then turn positives to negatives and vice versa, then calculate the sum of all elements.


Take a list of integers; filter out the negative ones, then flip the sign of each, then what's the total.


Take a list of integers; remove all negative values, then turn positives to negatives and vice versa, then what do they add up to.


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


Take a list of integers; keep the positive numbers, then negate each, then return their sum.


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


Take a list of integers; get rid of non-multiples of three, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of integers; keep values divisible by 3, then clamp each to at most ten, then remove anything 5 or less.


Take a list of integers; keep items where x mod 3 equals zero, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; drop anything not divisible by three, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; filter out everything except multiples of three, then don't let anything exceed 10, then drop anything 5 or below.


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


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


Take a list of integers; drop the leading negative values, then take the first 3 elements, then take values up to (excluding) the first zero.


Take a list of integers; cut the leading negatives, then remove everything after the third, then keep the part before the first 0.


Take a list of integers; skip negatives at the start, then truncate to three items, then truncate at the first zero.


Take a list of integers; remove all negatives at the front, then show the first three, then delete everything starting with the first zero.


Take a list of integers; remove the initial run of negative numbers, then take the first three, then remove from the first zero onwards.


Take a list of integers; strip the front negatives, then keep first 3, then up to but not including the first zero.


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 = r[:r.index(0)] if 0 in r else r
    return r


Take a list of integers; drop the leading negative values, then keep only the first three, then keep everything before the first zero.


Take a list of integers; sort by absolute value, then keep values divisible by 3, then true only if all are positive.


Take a list of integers; rearrange by distance from zero, then keep items where x mod 3 equals zero, then do all of these have positive values.


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then check if every value is positive.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then confirm all values are positive.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then all positive.


Take a list of integers; sort by distance from zero, then multiples of three only, then check if every number is above zero.


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


Take a list of integers; sort by absolute value, then keep multiples of three, then return whether all values are positive.


Take a list of integers; sort ascending, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; Sort it from low to high, then unique values preserving order, then strip the zeros.


Take a list of integers; arrange in increasing order, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; Organize these ascending, then unique values preserving order, then strip the zeros.


Take a list of integers; Sort in ascending order, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then strip the zeros.


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


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


Take a list of integers; take the absolute value of each, then keep values below zero, then true if any value equals zero.


Take a list of integers; convert to absolute value, then get the negative numbers, then check for zero.


Take a list of integers; strip the signs, then keep values below zero, then true if any value equals zero.


Take a list of integers; take abs of each, then get the negative numbers, then check for zero.


Take a list of integers; get the absolute value of everything, then keep values below zero, then true if any value equals zero.


Take a list of integers; apply absolute value to the whole list, then get the negative numbers, then check for zero.


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


Take a list of integers; take the absolute value of each, then keep the negative numbers, then return whether the list contains a zero.


Take a list of integers; keep multiples of three, then sort smallest to largest, then keep only numbers above 5.


Take a list of integers; get rid of non-multiples of three, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; keep values divisible by 3, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; keep items where x mod 3 equals zero, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; drop anything not divisible by three, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; filter out everything except multiples of three, then sort ascending, then drop anything 5 or below.


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


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


Take a list of integers; keep everything before the first zero, then clamp each to at most ten, then drop non-positive values.


Take a list of integers; take only what comes before the initial zero, then don't let anything exceed 10, then drop the negative numbers.


Take a list of integers; cut the list at the first zero, then clamp each to at most ten, then filter out the negative ones.


Take a list of integers; cut off after the first zero appears, then don't let anything exceed 10, then remove all negative values.


Take a list of integers; take values up to (excluding) the first zero, then clamp each to at most ten, then keep positive values only.


Take a list of integers; keep the part before the first 0, then don't let anything exceed 10, then keep values above zero.


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


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


Take a list of integers; add ten to each, then drop anything 5 or below, then multiply each by -1.


Take a list of integers; bump everything up by 10, then keep only numbers greater than 5, then negate.


Take a list of integers; increase every value by 10, then filter for numbers above 5, then multiply each by -1.


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


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


Take a list of integers; increase all numbers by 10, then keep values greater than five, then negate.


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


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


Take a list of integers; keep only the last three, then make every value non-negative, then multiply each by -1.


Take a list of integers; keep the final three items, then absolute value for all items, then negate.


Take a list of integers; take the last three, then take absolute values, then multiply each by -1.


Take a list of integers; trim to the last three, then turn negatives into positives, then negate.


Take a list of integers; last three only, then abs each element, then multiply each by -1.


Take a list of integers; truncate to the last three items, then take the absolute value of each, then negate.


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


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


Take a list of integers; sort by absolute value, then keep the leading run of positive numbers, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then take values while they are positive, then check for duplicates in the values.


Take a list of integers; arrange by magnitude ignoring sign, then take positive values then stop, then do all values appear only once.


Take a list of integers; put them in order by magnitude, then keep going while positive, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then stop at first non positive, then are the values all unique.


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


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


Take a list of integers; sort by absolute value, then take values while they are positive, then return whether all values are distinct.


Take a list of integers; keep everything before the first zero, then take the final 3 elements, then put the elements backwards.


Take a list of integers; take only what comes before the initial zero, then drop everything except the final three, then reverse that for me.


Take a list of integers; cut the list at the first zero, then give me the last three elements, then flip it backwards.


Take a list of integers; cut off after the first zero appears, then keep only the last three, then make it backwards.


Take a list of integers; take values up to (excluding) the first zero, then keep the final three items, then reverse the list.


Take a list of integers; keep the part before the first 0, then take the last three, then invert the sequence.


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


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


Take a list of integers; reverse the order, then remove both ends, then strip the signs.


Take a list of integers; reverse, then trim the edges, then take abs of each.


Take a list of integers; flip the list around, then trim one element off each end, then get the absolute value of everything.


Take a list of integers; flip the order around, then cut off the first and last, then apply absolute value to the whole list.


Take a list of integers; put the elements backwards, then remove the first and last elements, then make them all positive.


Take a list of integers; reverse that for me, then keep only the middle part, then make every value non-negative.


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


Take a list of integers; reverse the order, then drop the first and last elements, then take the absolute value of each.


Take a list of integers; reverse the order, then take the final 3 elements, then arrange in increasing order.


Take a list of integers; reverse, then drop everything except the final three, then Organize these ascending.


Take a list of integers; flip the list around, then give me the last three elements, then Sort in ascending order.


Take a list of integers; flip the order around, then keep only the last three, then I need this sorted ascending.


Take a list of integers; put the elements backwards, then keep the final three items, then Put these in ascending order.


Take a list of integers; reverse that for me, then take the last three, then sort smallest to largest.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then sort smallest to largest, then arrange by magnitude ignoring sign.


Take a list of integers; drop duplicates but keep the first one, then Ascending sort, then put them in order by magnitude.


Take a list of integers; drop duplicates keeping first occurrence, then Sort this ascending, then arrange in order of absolute value.


Take a list of integers; drop duplicates but keep the first one, then Sort lowest to highest, then sort by distance from zero.


Take a list of integers; drop duplicates keeping first occurrence, then Arrange from smallest to largest, then order by how far from zero.


Take a list of integers; drop duplicates but keep the first one, then sort ascending, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = sorted(r)
    r = sorted(r, key=abs)
    return r


Take a list of integers; drop duplicates keeping first occurrence, then sort ascending, then sort by absolute value.


Take a list of integers; sort ascending, then remove all zero values, then drop non-negative values.


Take a list of integers; Sort it from low to high, then exclude zeros, then drop all positive numbers.


Take a list of integers; arrange in increasing order, then remove all zero values, then drop non-negative values.


Take a list of integers; Organize these ascending, then exclude zeros, then drop all positive numbers.


Take a list of integers; Sort in ascending order, then remove all zero values, then drop non-negative values.


Take a list of integers; I need this sorted ascending, then exclude zeros, then drop all positive 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 < 0]
    return r


Take a list of integers; sort ascending, then drop the zeros, then keep the negative numbers.


Take a list of integers; drop the leading negative values, then make every value non-negative, then find the max, defaulting to 0.


Take a list of integers; cut the leading negatives, then absolute value for all items, then Give me the maximum, but 0 if there are no items.


Take a list of integers; skip negatives at the start, then take absolute values, then What's the highest number in the list.


Take a list of integers; remove all negatives at the front, then turn negatives into positives, then Return the greatest value or default to 0.


Take a list of integers; remove the initial run of negative numbers, then abs each element, then Find the largest element, defaulting to zero.


Take a list of integers; strip the front negatives, then take the absolute value of each, then give the largest value (0 if none).


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


Take a list of integers; drop the leading negative values, then take the absolute value of each, then return the maximum (0 if empty).


Take a list of integers; keep the negative numbers, then increase every value by 10, then give the number of evens.


Take a list of integers; extract negatives, then add 10 to each item, then find how many values are divisible by two.


Take a list of integers; keep the negative numbers, then shift each up by ten, then how many are even.


Take a list of integers; extract negatives, then increase all numbers by 10, then get the total number of even values in the list.


Take a list of integers; keep the negative numbers, then add 10 to everything, then give me the count of even values.


Take a list of integers; extract negatives, then give everything a boost of 10, then I need to know how many of these are even.


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


Take a list of integers; keep the negative numbers, then add ten to each, then return how many values are even.


Take a list of integers; drop the first element, then cut the list at the first zero, then true if at least one even value.


Take a list of integers; Take everything except the first, then cut off after the first zero appears, then any even.


Take a list of integers; drop the first element, then take values up to (excluding) the first zero, then true if at least one even value.


Take a list of integers; Take everything except the first, then keep the part before the first 0, then any even.


Take a list of integers; drop the first element, then truncate at the first zero, then true if at least one even value.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then any even.


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


Take a list of integers; drop the first element, then keep everything before the first zero, then return whether any value is even.


Take a list of integers; keep only the last three, then flip the sign of each, then find the max, defaulting to 0.


Take a list of integers; keep the final three items, then turn positives to negatives and vice versa, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the last three, then flip the sign of each, then What's the highest number in the list.


Take a list of integers; trim to the last three, then turn positives to negatives and vice versa, then Return the greatest value or default to 0.


Take a list of integers; last three only, then flip the sign of each, then Find the largest element, defaulting to zero.


Take a list of integers; truncate to the last three items, then turn positives to negatives and vice versa, then give the largest value (0 if none).


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


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


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


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    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; add ten to each, then cap each value at 10, then return the first even value (0 if none).


Take a list of integers; negate each, then multiply each value by itself, then stop at the first non-positive value.


Take a list of integers; reverse the signs of everything, then square them all, then keep the leading run of positive numbers.


Take a list of integers; negate each, then raise each to the power of two, then take values while they are positive.


Take a list of integers; reverse the signs of everything, then I need each number multiplied by itself, then take positive values then stop.


Take a list of integers; negate each, then square all of them, then keep going while positive.


Take a list of integers; reverse the signs of everything, then multiply each element by itself, then stop at first non positive.


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


Take a list of integers; negate each, then square each, then take values while they are positive.


Take a list of integers; drop duplicates keeping first occurrence, then sort largest to smallest, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then sort by descending values, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then sort from highest to lowest, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then sort descending, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then sort largest first, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then sort in descending order, then strip out the evens.


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


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


Take a list of integers; sort descending, then sort smallest to largest, then drop anything not divisible by three.


Take a list of integers; sort largest first, then Ascending sort, then filter out everything except multiples of three.


Take a list of integers; sort in descending order, then Sort this ascending, then keep only multiples of three.


Take a list of integers; sort from greatest to least, then Sort lowest to highest, then multiples of three only.


Take a list of integers; sort z to a, then Arrange from smallest to largest, then filter for numbers divisible by three.


Take a list of integers; arrange in decreasing order, then sort ascending, then give me only the values divisible by three.


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


Take a list of integers; sort descending, then sort ascending, then keep multiples of three.


Take a list of strings; lowercase each string, then order the strings A to Z, then remove blanks.


Take a list of strings; change to lowercase, then make it alphabetical, then eliminate empty string values.


Take a list of strings; lowercase each string, then order the strings A to Z, then filter out blank strings.


Take a list of strings; change to lowercase, then make it alphabetical, then remove strings that are empty.


Take a list of strings; lowercase each string, then order the strings A to Z, then strip out empty strings.


Take a list of strings; change to lowercase, then make it alphabetical, then keep only non-empty strings.


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


Take a list of strings; lowercase each string, then sort alphabetically, then drop empty strings.


Take a list of integers; add one to each, then keep the leading run of positive numbers, then give back the product of all values.


Take a list of integers; make each one bigger, then take values while they are positive, then product of the list.


Take a list of integers; add one to each, then take positive values then stop, then what's the product.


Take a list of integers; make each one bigger, then keep going while positive, then what do they multiply to.


Take a list of integers; add one to each, then stop at first non positive, then give me their product.


Take a list of integers; make each one bigger, then take while greater than zero, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = [x + 1 for x in r]
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return __import__('math').prod(r)


Take a list of integers; add one to each, then take values while they are positive, then return their product.


Take a list of integers; keep the odd numbers, then keep only even values, then arrange in decreasing order.


Take a list of integers; odd numbers only, then extract all even numbers, then arrange in descending order.


Take a list of integers; keep the odd numbers, then keep only even values, then reverse sort.


Take a list of integers; odd numbers only, then extract all even numbers, then sort largest to smallest.


Take a list of integers; keep the odd numbers, then keep only even values, then sort by descending values.