Take a list of integers; keep only the first three, then sort largest to smallest, then give back the product of all values.


Take a list of integers; keep the first 3 items, then sort by descending values, then product of the list.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then what's the product.


Take a list of integers; remove everything after the third, then sort descending, then what do they multiply to.


Take a list of integers; truncate to three items, then sort largest first, then give me their product.


Take a list of integers; show the first three, then sort in descending order, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = sorted(r, reverse=True)
    return __import__('math').prod(r)


Take a list of integers; keep only the first three, then sort descending, then return their product.


Take a list of integers; drop the leading negative values, then flip the list around, then give back the total.


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


Take a list of integers; skip negatives at the start, then put the elements backwards, then add them up.


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


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


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


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


Take a list of integers; drop the leading negative values, then reverse the order, then return their sum.


Take a list of integers; if empty, use a single zero, then take the final 3 elements, then skip the first one.


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


Take a list of integers; default to [0] when there is nothing, then give me the last three elements, then skip the first one.


Take a list of integers; when the list is empty, substitute a zero value, then keep only the last three, then Discard the first element.


Take a list of integers; replace an empty list with one zero, then keep the final three items, then skip the first one.


Take a list of integers; zero it out if it's empty, then take the last three, then Discard the first element.


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


Take a list of integers; if empty, use a single zero, then keep only the last three, then drop the first element.


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


Take a list of integers; Decrement all items, then unique values preserving order, then do all of these have positive values.


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


Take a list of integers; Lower each number by one, then unique values preserving order, then confirm all values are positive.


Take a list of integers; reduce each by one, then remove repeated values, then all positive.


Take a list of integers; Subtract 1 from all, then unique values preserving order, then check if every number is above zero.


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


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


Take a list of integers; take the absolute value of each, then extend to length 3 using zeros, then give back the product of all values.


Take a list of integers; convert to absolute value, then pad to 3, then product of the list.


Take a list of integers; strip the signs, then extend to length 3 using zeros, then what's the product.


Take a list of integers; take abs of each, then pad to 3, then what do they multiply to.


Take a list of integers; get the absolute value of everything, then extend to length 3 using zeros, then give me their product.


Take a list of integers; apply absolute value to the whole list, then pad to 3, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return __import__('math').prod(r)


Take a list of integers; take the absolute value of each, then pad with zeros to at least three elements, then return their product.


Take a list of integers; keep only the last three, then flip the list around, then ensure at least three items by appending zeros.


Take a list of integers; keep the final three items, then flip the order around, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the last three, then put the elements backwards, then ensure at least three items by appending zeros.


Take a list of integers; trim to the last three, then reverse that for me, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; last three only, then flip it backwards, then ensure at least three items by appending zeros.


Take a list of integers; truncate to the last three items, then make it backwards, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep the negative numbers, then remove both ends, then keep only numbers above 5.


Take a list of integers; extract negatives, then trim the edges, then exclude values of 5 and below.


Take a list of integers; keep the negative numbers, then trim one element off each end, then remove anything 5 or less.


Take a list of integers; extract negatives, then cut off the first and last, then filter to keep only values above 5.


Take a list of integers; keep the negative numbers, then remove the first and last elements, then get rid of values that aren't greater than five.


Take a list of integers; extract negatives, then keep only the middle part, then drop anything 5 or below.


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


Take a list of integers; keep the negative numbers, then drop the first and last elements, then keep values greater than five.


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then raise each to the power of two.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then I need each number multiplied by itself.


Take a list of integers; drop the zeros, then take positive values then stop, then square all of them.


Take a list of integers; keep only nonzero elements, then keep going while positive, then multiply each element by itself.


Take a list of integers; drop the zeros, then stop at first non positive, then make each one squared.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then square each value in the list.


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


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


Take a list of integers; keep only the first three, then extend to length 3 using zeros, then shift each up by ten.


Take a list of integers; keep the first 3 items, then pad to 3, then increase all numbers by 10.


Take a list of integers; take the first 3 elements, then extend to length 3 using zeros, then add 10 to everything.


Take a list of integers; remove everything after the third, then pad to 3, then give everything a boost of 10.


Take a list of integers; truncate to three items, then extend to length 3 using zeros, then increment each by ten.


Take a list of integers; show the first three, then pad to 3, then add a constant 10 to each.


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


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


Take a list of integers; keep the odd numbers, then default to [0] when there is nothing, then find the max, defaulting to 0.


Take a list of integers; odd numbers only, then when the list is empty, substitute a zero value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the odd numbers, then replace an empty list with one zero, then What's the highest number in the list.


Take a list of integers; odd numbers only, then zero it out if it's empty, then Return the greatest value or default to 0.


Take a list of integers; keep the odd numbers, then use zero if the list is empty, then Find the largest element, defaulting to zero.


Take a list of integers; odd numbers only, then default to zero when empty, 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 if r else [0]
    return max(r) if r else 0


Take a list of integers; keep the odd numbers, then if empty, use a single zero, then return the maximum (0 if empty).


Take a list of integers; take values while they are positive, then order by distance from zero, then replace an empty list with one zero.


Take a list of integers; take positive values then stop, then sort based on absolute value, then zero it out if it's empty.


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


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then default to zero when empty.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then if there's nothing, put in a zero.


Take a list of integers; take values while positive, then sort by absolute value, 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 = sorted(r, key=abs)
    r = r if r else [0]
    return r


Take a list of integers; take values while they are positive, then sort by absolute value, then if empty, use a single zero.


Take a list of integers; add one to each, then increase every value by 10, then give the earliest even value or zero.


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


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


Take a list of integers; make each one bigger, then increase all numbers by 10, then fetch the first even element, default to 0.


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


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


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


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


Take a list of integers; keep only the last three, then sort largest to smallest, then put the elements backwards.


Take a list of integers; keep the final three items, then sort by descending values, then reverse that for me.


Take a list of integers; take the last three, then sort from highest to lowest, then flip it backwards.


Take a list of integers; trim to the last three, then sort descending, then make it backwards.


Take a list of integers; last three only, then sort largest first, then reverse the list.


Take a list of integers; truncate to the last three items, then sort in descending order, then invert the sequence.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the final 3 elements, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then drop everything except the final three, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then give me the last three elements, then drop the even numbers.


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


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


Take a list of integers; add zeros until the list has at least three values, then take the last three, then strip out the evens.


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


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


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


Take a list of integers; if blank use 0, then exclude zeros, then how many items remain.


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


Take a list of integers; when the list is empty, substitute a zero value, then exclude zeros, then return the length.


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


Take a list of integers; zero it out if it's empty, then exclude zeros, then what's the count.


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


Take a list of integers; if empty, use a single zero, then drop the zeros, then return how many remain.


Take a list of integers; negate each, then order by distance from zero, then limit every value to 10.


Take a list of integers; reverse the signs of everything, then sort based on absolute value, then maximum of 10 for all.


Take a list of integers; negate each, then organize by magnitude, then limit every value to 10.


Take a list of integers; reverse the signs of everything, then arrange by absolute value ascending, then maximum of 10 for all.


Take a list of integers; negate each, then sort from smallest to largest absolute value, then limit every value to 10.


Take a list of integers; reverse the signs of everything, then sort by absolute value, then maximum of 10 for all.


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


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


Take a list of integers; drop the leading negative values, then increment each value, then trim one element off each end.


Take a list of integers; cut the leading negatives, then plus one for all, then cut off the first and last.


Take a list of integers; skip negatives at the start, then increment each value, then remove the first and last elements.


Take a list of integers; remove all negatives at the front, then plus one for all, then keep only the middle part.


Take a list of integers; remove the initial run of negative numbers, then increment each value, then drop first and last.


Take a list of integers; strip the front negatives, then plus one for all, then eliminate the outermost elements.


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


Take a list of integers; drop the leading negative values, then add one to each, then drop the first and last elements.


Take a list of integers; add ten to each, then extend to length 3 using zeros, then drop the odd numbers.


Take a list of integers; bump everything up by 10, then pad to 3, then filter out the odd numbers.


Take a list of integers; increase every value by 10, then extend to length 3 using zeros, then drop the odd numbers.


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


Take a list of integers; shift each up by ten, then extend to length 3 using zeros, then drop the odd numbers.


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


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


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


Take a list of integers; add one to each, then keep the leading run of positive numbers, then drop the even numbers.


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


Take a list of integers; add one to each, then take positive values then stop, then drop the even numbers.


Take a list of integers; make each one bigger, then keep going while positive, then strip out the evens.


Take a list of integers; add one to each, then stop at first non positive, then drop the even numbers.


Take a list of integers; make each one bigger, then take while greater than zero, then strip out the evens.


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))]
    r = [x for x in r if x % 2 != 0]
    return r


Take a list of integers; add one to each, then take values while they are positive, then keep the odd numbers.


Take a list of integers; add one to each, then decrement each value, then arrange in increasing order.


Take a list of integers; make each one bigger, then Lower each number by one, then Organize these ascending.


Take a list of integers; add one to each, then reduce each by one, then Sort in ascending order.


Take a list of integers; make each one bigger, then Subtract 1 from all, then I need this sorted ascending.


Take a list of integers; add one to each, then Subtract one from each, then Put these in ascending order.


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


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


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


Take a list of integers; keep the positive numbers, then increment each value, then give the earliest even value or zero.


Take a list of integers; get rid of anything that's not positive, then plus one for all, then fetch the first even element, default to 0.


Take a list of integers; drop non-positive values, then increment each value, then give the earliest even value or zero.


Take a list of integers; drop the negative numbers, then plus one for all, then fetch the first even element, default to 0.


Take a list of integers; filter out the negative ones, then increment each value, then give the earliest even value or zero.


Take a list of integers; remove all negative values, then plus one for all, 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 + 1 for x in r]
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; keep the positive numbers, then add one to each, then return the first even value (0 if none).


Take a list of integers; add one to each, then take the first 3 elements, then arrange in decreasing order.


Take a list of integers; make each one bigger, then remove everything after the third, then arrange in descending order.


Take a list of integers; add one to each, then truncate to three items, then reverse sort.


Take a list of integers; make each one bigger, then show the first three, then sort largest to smallest.


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


Take a list of integers; make each one bigger, then keep first 3, then sort from highest to lowest.


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


Take a list of integers; add one to each, then keep only the first three, then sort descending.


Take a list of integers; drop the first element, then take the first 3 elements, then raise each to the power of two.


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


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


Take a list of integers; Take everything except the first, then show the first three, then multiply each element by itself.


Take a list of integers; drop the first element, then take the first three, then make each one squared.


Take a list of integers; Take everything except the first, then keep first 3, then square each value in the list.


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


Take a list of integers; drop the first element, then keep only the first three, then square each.


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


Take a list of integers; times two for each item, then square them all, then Discard the first element.


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


Take a list of integers; times two for each item, then I need each number multiplied by itself, then Discard the first element.


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


Take a list of integers; times two for each item, then multiply each element by itself, then Discard the first element.


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


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


Take a list of integers; keep only the first three, then clamp each to at most ten, then find the max, defaulting to 0.


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


Take a list of integers; take the first 3 elements, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; remove everything after the third, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; truncate to three items, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; show the first three, then don't let anything exceed 10, then give the largest value (0 if none).


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


Take a list of integers; keep only the first three, then cap each value at 10, then return the maximum (0 if empty).


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then negate.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then negate.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then negate.


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


Take a list of integers; drop duplicates keeping first occurrence, then add ten to each, then negate each.


Take a list of integers; add ten to each, then drop anything 5 or below, then give the number of evens.


Take a list of integers; bump everything up by 10, then keep only numbers greater than 5, then find how many values are divisible by two.


Take a list of integers; increase every value by 10, then filter for numbers above 5, then how many are even.


Take a list of integers; add 10 to each item, then give me values where x is greater than 5, then get the total number of even values in the list.


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


Take a list of integers; increase all numbers by 10, then keep values greater than five, then I need to know how many of these are even.


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


Take a list of integers; add ten to each, then keep values greater than five, then return how many values are even.


Take a list of integers; negate each, then take the final 3 elements, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then drop everything except the final three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; negate each, then give me the last three elements, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then keep only the last three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; negate each, then keep the final three items, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then take the last three, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep everything before the first zero, then remove all zero values, then raise each to the power of two.


Take a list of integers; take only what comes before the initial zero, then exclude zeros, then I need each number multiplied by itself.


Take a list of integers; cut the list at the first zero, then remove all zero values, then square all of them.


Take a list of integers; cut off after the first zero appears, then exclude zeros, then multiply each element by itself.


Take a list of integers; take values up to (excluding) the first zero, then remove all zero values, then make each one squared.


Take a list of integers; keep the part before the first 0, then exclude zeros, then square each value in the list.


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


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


Take a list of integers; sort ascending, then cut the list at the first zero, then put the elements backwards.


Take a list of integers; Sort it from low to high, then cut off after the first zero appears, then reverse that for me.


Take a list of integers; arrange in increasing order, then take values up to (excluding) the first zero, then flip it backwards.


Take a list of integers; Organize these ascending, then keep the part before the first 0, then make it backwards.


Take a list of integers; Sort in ascending order, then truncate at the first zero, then reverse the list.


Take a list of integers; I need this sorted ascending, then delete everything starting with the first zero, then invert the sequence.


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


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


Take a list of integers; add one to each, then take the first 3 elements, then give the number of evens.


Take a list of integers; make each one bigger, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; add one to each, then truncate to three items, then how many are even.


Take a list of integers; make each one bigger, then show the first three, then get the total number of even values in the list.


Take a list of integers; add one to each, then take the first three, then give me the count of even values.


Take a list of integers; make each one bigger, then keep first 3, 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[:3]
    return sum(1 for x in r if x % 2 == 0)


Take a list of integers; add one to each, then keep only the first three, then return how many values are even.


Take a list of integers; sort descending, then default to [0] when there is nothing, then give back the total.


Take a list of integers; sort largest first, then when the list is empty, substitute a zero value, then sum r.


Take a list of integers; sort in descending order, then replace an empty list with one zero, then add them up.


Take a list of integers; sort from greatest to least, then zero it out if it's empty, then calculate the sum of all elements.


Take a list of integers; sort z to a, then use zero if the list is empty, then what's the total.


Take a list of integers; arrange in decreasing order, then default to zero when empty, then what do they add up to.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = r if r else [0]
    return sum(r)


Take a list of integers; sort descending, then if empty, use a single zero, then return their sum.


Take a list of integers; keep the positive numbers, then skip negatives at the start, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then remove all negatives at the front, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then remove the initial run of negative numbers, then add 10 to everything.


Take a list of integers; drop the negative numbers, then strip the front negatives, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then remove leading negative numbers, then increment each by ten.


Take a list of integers; remove all negative values, then drop negatives from start, then add a constant 10 to each.


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


Take a list of integers; keep the positive numbers, then drop the leading negative values, then add ten to each.


Take a list of integers; keep the even numbers, then default to [0] when there is nothing, then keep only non-zero numbers.


Take a list of integers; keep evens, then when the list is empty, substitute a zero value, then strip the zeros.


Take a list of integers; keep the even numbers, then replace an empty list with one zero, then keep only non-zero numbers.


Take a list of integers; keep evens, then zero it out if it's empty, then strip the zeros.


Take a list of integers; keep the even numbers, then use zero if the list is empty, then keep only non-zero numbers.


Take a list of integers; keep evens, then default to zero when empty, then strip the zeros.


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


Take a list of integers; keep the even numbers, then if empty, use a single zero, then drop the zeros.


Take a list of integers; take values while they are positive, then take the final 3 elements, then shift each up by ten.


Take a list of integers; take positive values then stop, then drop everything except the final three, then increase all numbers by 10.


Take a list of integers; keep going while positive, then give me the last three elements, then add 10 to everything.


Take a list of integers; stop at first non positive, then keep only the last three, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then keep the final three items, then increment each by ten.


Take a list of integers; take values while positive, then take the last three, then add a constant 10 to each.


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


Take a list of integers; take values while they are positive, then keep only the last three, then add ten to each.


Take a list of integers; add ten to each, then sort smallest to largest, then ensure at least three items by appending zeros.


Take a list of integers; bump everything up by 10, then Ascending sort, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; increase every value by 10, then Sort this ascending, then ensure at least three items by appending zeros.


Take a list of integers; add 10 to each item, then Sort lowest to highest, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then ensure at least three items by appending zeros.


Take a list of integers; increase all numbers by 10, then sort ascending, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; add ten to each, then sort ascending, then pad with zeros to at least three elements.


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


Take a list of integers; Sort it from low to high, then add 10 to each item, then remove repeats.


Take a list of integers; arrange in increasing order, then shift each up by ten, then deduplicate the list.


Take a list of integers; Organize these ascending, then increase all numbers by 10, then remove repeats.


Take a list of integers; Sort in ascending order, then add 10 to everything, then deduplicate the list.


Take a list of integers; I need this sorted ascending, then give everything a boost of 10, then remove repeats.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then arrange by magnitude ignoring sign.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then put them in order by magnitude.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then arrange in order of absolute value.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then sort by distance from zero.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then order by how far from zero.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then order by distance from zero.


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


Take a list of integers; keep values greater than five, then take values while they are positive, then sort by absolute value.


Take a list of integers; sort descending, then clamp each to at most ten, then count the elements.


Take a list of integers; sort largest first, then don't let anything exceed 10, then how many items remain.


Take a list of integers; sort in descending order, then clamp each to at most ten, then tell me the length.


Take a list of integers; sort from greatest to least, then don't let anything exceed 10, then return the length.


Take a list of integers; sort z to a, then clamp each to at most ten, then count them.


Take a list of integers; arrange in decreasing order, then don't let anything exceed 10, then what's the count.


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


Take a list of integers; sort descending, then cap each value at 10, then return how many remain.


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


Take a list of integers; take positive values then stop, then plus one for all, then fetch the first even element, default to 0.


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


Take a list of integers; stop at first non positive, then plus one for all, then fetch the first even element, default to 0.


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


Take a list of integers; take values while positive, then plus one for all, then fetch the first even element, default to 0.


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


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


Take a list of integers; if empty, use a single zero, then skip negatives at the start, then put the elements backwards.


Take a list of integers; if blank use 0, then remove all negatives at the front, then reverse that for me.


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


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


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


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


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


Take a list of integers; if empty, use a single zero, then drop the leading negative values, then reverse the order.


Take a list of integers; keep only the last three, then remove all zero values, then put the elements backwards.


Take a list of integers; keep the final three items, then exclude zeros, then reverse that for me.


Take a list of integers; take the last three, then remove all zero values, then flip it backwards.


Take a list of integers; trim to the last three, then exclude zeros, then make it backwards.


Take a list of integers; last three only, then remove all zero values, then reverse the list.


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


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


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


Take a list of integers; drop the first and last elements, then take the first 3 elements, then shift each up by ten.


Take a list of integers; take out the first and last items, then remove everything after the third, then increase all numbers by 10.


Take a list of integers; remove both ends, then truncate to three items, then add 10 to everything.


Take a list of integers; trim the edges, then show the first three, then give everything a boost of 10.


Take a list of integers; trim one element off each end, then take the first three, then increment each by ten.


Take a list of integers; cut off the first and last, then keep first 3, then add a constant 10 to each.


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


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


Take a list of integers; subtract one from each, then keep the leading run of positive numbers, then drop non-positive values.


Take a list of integers; Decrement all items, then take values while they are positive, then drop the negative numbers.


Take a list of integers; decrement each value, then take positive values then stop, then filter out the negative ones.


Take a list of integers; Lower each number by one, then keep going while positive, then remove all negative values.


Take a list of integers; reduce each by one, then stop at first non positive, then keep positive values only.


Take a list of integers; Subtract 1 from all, then take while greater than zero, then keep values above zero.


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


Take a list of integers; subtract one from each, then take values while they are positive, then keep the positive numbers.


Take a list of integers; keep only the first three, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; keep the first 3 items, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the first 3 elements, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; remove everything after the third, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; truncate to three items, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; show the first three, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; double each, then drop anything 5 or below, then drop anything not divisible by three.


Take a list of integers; times two for each item, then keep only numbers greater than 5, then filter out everything except multiples of three.


Take a list of integers; double each, then filter for numbers above 5, then keep only multiples of three.


Take a list of integers; times two for each item, then give me values where x is greater than 5, then multiples of three only.


Take a list of integers; double each, then show me only the values that are bigger than five, then filter for numbers divisible by three.


Take a list of integers; times two for each item, then keep values greater than five, then give me only the values divisible by three.


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


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


Take a list of integers; keep multiples of three, then multiply each value by itself, then trim one element off each end.


Take a list of integers; get rid of non-multiples of three, then square them all, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then remove the first and last elements.


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


Take a list of integers; drop anything not divisible by three, then square all of them, then drop first and last.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then eliminate the outermost elements.


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


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


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


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


Take a list of integers; keep only numbers above 5, then shift each up by ten, then truncate at the first zero.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then delete everything starting with the first zero.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then remove from the first zero onwards.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then up to but not including the first zero.


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


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


Take a list of integers; add one to each, then remove repeated values, then arrange in decreasing order.


Take a list of integers; make each one bigger, then unique values preserving order, then arrange in descending order.


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


Take a list of integers; make each one bigger, then unique values preserving order, then sort largest to smallest.


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


Take a list of integers; make each one bigger, then unique values preserving order, then sort from highest to lowest.


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


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


Take a list of integers; subtract one from each, then increment each value, then truncate to the last three items.


Take a list of integers; Decrement all items, then plus one for all, then show only the last three.


Take a list of integers; decrement each value, then increment each value, then remove all but the last three.


Take a list of integers; Lower each number by one, then plus one for all, then take the final 3 elements.


Take a list of integers; reduce each by one, then increment each value, then drop everything except the final three.


Take a list of integers; Subtract 1 from all, then plus one for all, then give me the last three elements.


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


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


Take a list of integers; sort ascending, then make every value non-negative, then drop anything not divisible by three.


Take a list of integers; Sort it from low to high, then absolute value for all items, then filter out everything except multiples of three.


Take a list of integers; arrange in increasing order, then take absolute values, then keep only multiples of three.


Take a list of integers; Organize these ascending, then turn negatives into positives, then multiples of three only.


Take a list of integers; Sort in ascending order, then abs each element, then filter for numbers divisible by three.


Take a list of integers; I need this sorted ascending, then take the absolute value of each, then give me only the values divisible by three.


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


Take a list of integers; sort ascending, then take the absolute value of each, then keep multiples of three.


Take a list of integers; reverse the order, then sort largest to smallest, then find the max, defaulting to 0.


Take a list of integers; reverse, then sort by descending values, then Give me the maximum, but 0 if there are no items.


Take a list of integers; flip the list around, then sort from highest to lowest, then What's the highest number in the list.


Take a list of integers; flip the order around, then sort descending, then Return the greatest value or default to 0.


Take a list of integers; put the elements backwards, then sort largest first, then Find the largest element, defaulting to zero.


Take a list of integers; reverse that for me, then sort in descending order, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = sorted(r, reverse=True)
    return max(r) if r else 0


Take a list of integers; reverse the order, then sort descending, then return the maximum (0 if empty).


Take a list of integers; reverse the order, then multiply each value by itself, then give the earliest even value or zero.


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


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


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


Take a list of integers; put the elements backwards, then square all of them, then give the earliest even value or zero.


Take a list of integers; reverse that for me, then multiply each element by itself, then fetch the first even element, default to 0.


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


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


Take a list of integers; reverse the order, then multiply each value by itself, then bump each up by one.


Take a list of integers; reverse, then square them all, then increment each item.


Take a list of integers; flip the list around, then raise each to the power of two, then bump each up by one.


Take a list of integers; flip the order around, then I need each number multiplied by itself, then increment each item.


Take a list of integers; put the elements backwards, then square all of them, then bump each up by one.


Take a list of integers; reverse that for me, then multiply each element by itself, then increment each item.


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


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


Take a list of integers; keep values greater than five, then order by distance from zero, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then organize by magnitude, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then sort from smallest to largest absolute value, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then sort by absolute value, then sort smallest to largest.


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


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


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


Take a list of integers; keep the first 3 items, then sort based on absolute value, then how many items remain.


Take a list of integers; take the first 3 elements, then organize by magnitude, then tell me the length.


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


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


Take a list of integers; show the first three, then sort by absolute value, then what's the count.


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


Take a list of integers; keep only the first three, then sort by absolute value, then return how many remain.


Take a list of integers; keep values greater than five, then flip the sign of each, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then turn positives to negatives and vice versa, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then flip the sign of each, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then sort smallest to largest.


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


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


Take a list of integers; keep multiples of three, then flip the list around, then bump each up by one.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then increment each item.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then bump each up by one.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then increment each item.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then bump each up by one.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then increment each item.


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


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


Take a list of integers; keep the even numbers, then keep only odd values, then true if already sorted smallest to largest.


Take a list of integers; keep evens, then eliminate the even numbers, then does this list go in ascending order.


Take a list of integers; keep the even numbers, then keep only odd values, then check if the list is in ascending order.


Take a list of integers; keep evens, then eliminate the even numbers, then is the list sorted.


Take a list of integers; keep the even numbers, then keep only odd values, then is it sorted.


Take a list of integers; keep evens, then eliminate the even numbers, 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 = [x for x in r if x % 2 != 0]
    return r == sorted(r)


Take a list of integers; keep the even numbers, then keep the odd numbers, then return whether the list is sorted ascending.


Take a list of integers; add ten to each, then take the first 3 elements, then limit every value to 10.


Take a list of integers; bump everything up by 10, then remove everything after the third, then maximum of 10 for all.


Take a list of integers; increase every value by 10, then truncate to three items, then limit every value to 10.


Take a list of integers; add 10 to each item, then show the first three, then maximum of 10 for all.


Take a list of integers; shift each up by ten, then take the first three, then limit every value to 10.


Take a list of integers; increase all numbers by 10, then keep first 3, then maximum of 10 for all.


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


Take a list of integers; add ten to each, then keep only the first three, then cap each value at 10.


Take a list of integers; drop the first element, then skip negatives at the start, then make each twice as big.


Take a list of integers; Take everything except the first, then remove all negatives at the front, then multiply each by 2.


Take a list of integers; drop the first element, then remove the initial run of negative numbers, then make each twice as big.


Take a list of integers; Take everything except the first, then strip the front negatives, then multiply each by 2.


Take a list of integers; drop the first element, then remove leading negative numbers, then make each twice as big.


Take a list of integers; Take everything except the first, then drop negatives from start, then multiply each by 2.


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


Take a list of integers; drop the first element, then drop the leading negative values, then double each.


Take a list of integers; if empty, use a single zero, then keep values below zero, then bump each up by one.


Take a list of integers; if blank use 0, then get the negative numbers, then increment each item.


Take a list of integers; default to [0] when there is nothing, then keep values below zero, then bump each up by one.


Take a list of integers; when the list is empty, substitute a zero value, then get the negative numbers, then increment each item.


Take a list of integers; replace an empty list with one zero, then keep values below zero, then bump each up by one.


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


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


Take a list of integers; if empty, use a single zero, then keep the negative numbers, then add one to each.


Take a list of integers; negate each, then extend to length 3 using zeros, then true if already sorted smallest to largest.


Take a list of integers; reverse the signs of everything, then pad to 3, then does this list go in ascending order.


Take a list of integers; negate each, then extend to length 3 using zeros, then check if the list is in ascending order.


Take a list of integers; reverse the signs of everything, then pad to 3, then is the list sorted.


Take a list of integers; negate each, then extend to length 3 using zeros, then is it sorted.


Take a list of integers; reverse the signs of everything, then pad to 3, then check if values are in increasing order.


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


Take a list of integers; negate each, then pad with zeros to at least three elements, then return whether the list is sorted ascending.


Take a list of integers; drop the first element, then keep the leading run of positive numbers, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then take values while they are positive, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then take positive values then stop, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then keep going while positive, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then stop at first non positive, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then take while greater than zero, then fetch the first even element, default to 0.


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


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


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


Take a list of integers; get rid of anything that's not positive, then pad to 3, then Discard the first element.


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


Take a list of integers; drop the negative numbers, then pad to 3, then Discard the first element.


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


Take a list of integers; remove all negative values, then pad to 3, then Discard the first element.


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


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


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


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then keep the part before the first 0.


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


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then delete everything starting with the first zero.


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


Take a list of integers; remove all negative values, then don't let anything exceed 10, 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 = [min(x, 10) for x in r]
    r = r[:r.index(0)] if 0 in r else r
    return r


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


Take a list of integers; add one to each, then remove the first item, then give back the product of all values.


Take a list of integers; make each one bigger, then Remove head, then product of the list.


Take a list of integers; add one to each, then remove the first item, then what's the product.


Take a list of integers; make each one bigger, then Remove head, then what do they multiply to.


Take a list of integers; add one to each, then remove the first item, then give me their product.


Take a list of integers; make each one bigger, then Remove head, then multiply them all together.


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


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


Take a list of integers; double each, then order by distance from zero, then keep only numbers above 5.


Take a list of integers; times two for each item, then sort based on absolute value, then exclude values of 5 and below.


Take a list of integers; double each, then organize by magnitude, then remove anything 5 or less.


Take a list of integers; times two for each item, then arrange by absolute value ascending, then filter to keep only values above 5.


Take a list of integers; double each, then sort from smallest to largest absolute value, then get rid of values that aren't greater than five.


Take a list of integers; times two for each item, then sort by absolute value, then drop anything 5 or below.


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


Take a list of integers; double each, then sort by absolute value, then keep values greater than five.


Take a list of people records (name, age); extract the ages, then remove repeated values, then arrange by magnitude ignoring sign.


Take a list of people records (name, age); show me all ages, then unique values preserving order, then put them in order by magnitude.


Take a list of people records (name, age); pluck the age field from each record, then remove repeated values, then arrange in order of absolute value.


Take a list of people records (name, age); get the age field, then unique values preserving order, then sort by distance from zero.


Take a list of people records (name, age); keep just each person's age, then remove repeated values, then order by how far from zero.


Take a list of people records (name, age); extract age values, then unique values preserving order, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = list(dict.fromkeys(r))
    r = sorted(r, key=abs)
    return r


Take a list of people records (name, age); extract the ages, then drop duplicates keeping first occurrence, then sort by absolute value.


Take a list of integers; drop the first element, then default to [0] when there is nothing, then find the max, defaulting to 0.


Take a list of integers; Take everything except the first, then when the list is empty, substitute a zero value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop the first element, then replace an empty list with one zero, then What's the highest number in the list.


Take a list of integers; Take everything except the first, then zero it out if it's empty, then Return the greatest value or default to 0.


Take a list of integers; drop the first element, then use zero if the list is empty, then Find the largest element, defaulting to zero.


Take a list of integers; Take everything except the first, then default to zero when empty, then give the largest value (0 if none).


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


Take a list of integers; drop the first element, then if empty, use a single zero, then return the maximum (0 if empty).


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


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


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


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


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


Take a list of integers; Take everything except the first, then take while greater than zero, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = r[1:]
    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 first element, then take values while they are positive, then keep everything before the first zero.


Take a list of integers; sort ascending, then increment each value, then drop anything not divisible by three.


Take a list of integers; Sort it from low to high, then plus one for all, then filter out everything except multiples of three.


Take a list of integers; arrange in increasing order, then increment each value, then keep only multiples of three.


Take a list of integers; Organize these ascending, then plus one for all, then multiples of three only.


Take a list of integers; Sort in ascending order, then increment each value, then filter for numbers divisible by three.


Take a list of integers; I need this sorted ascending, then plus one for all, then give me only the values divisible by three.


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


Take a list of integers; sort ascending, then add one to each, then keep multiples of three.


Take a list of integers; if empty, use a single zero, then extend to length 3 using zeros, then strip the signs.


Take a list of integers; if blank use 0, then pad to 3, then take abs of each.


Take a list of integers; default to [0] when there is nothing, then extend to length 3 using zeros, then get the absolute value of everything.


Take a list of integers; when the list is empty, substitute a zero value, then pad to 3, then apply absolute value to the whole list.


Take a list of integers; replace an empty list with one zero, then extend to length 3 using zeros, then make them all positive.


Take a list of integers; zero it out if it's empty, then pad to 3, then make every value non-negative.


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


Take a list of integers; if empty, use a single zero, then pad with zeros to at least three elements, then take the absolute value of each.


Take a list of integers; keep the even numbers, then remove both ends, then multiply each by -1.


Take a list of integers; keep evens, then trim the edges, then negate.


Take a list of integers; keep the even numbers, then trim one element off each end, then multiply each by -1.


Take a list of integers; keep evens, then cut off the first and last, then negate.


Take a list of integers; keep the even numbers, then remove the first and last elements, then multiply each by -1.


Take a list of integers; keep evens, then keep only the middle part, then negate.


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


Take a list of integers; keep the even numbers, then drop the first and last elements, then negate each.


Take a list of integers; take values while they are positive, then take the final 3 elements, then bump each up by one.


Take a list of integers; take positive values then stop, then drop everything except the final three, then increment each item.


Take a list of integers; keep going while positive, then give me the last three elements, then bump each up by one.


Take a list of integers; stop at first non positive, then keep only the last three, then increment each item.


Take a list of integers; take while greater than zero, then keep the final three items, then bump each up by one.


Take a list of integers; take values while positive, then take the last three, then increment each item.


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


Take a list of integers; take values while they are positive, then keep only the last three, then add one to each.


Take a list of integers; reverse the order, then flip the sign of each, then arrange in increasing order.


Take a list of integers; reverse, then turn positives to negatives and vice versa, then Organize these ascending.


Take a list of integers; flip the list around, then flip the sign of each, then Sort in ascending order.


Take a list of integers; flip the order around, then turn positives to negatives and vice versa, then I need this sorted ascending.


Take a list of integers; put the elements backwards, then flip the sign of each, then Put these in ascending order.


Take a list of integers; reverse that for me, then turn positives to negatives and vice versa, then sort smallest to largest.


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


Take a list of integers; reverse the order, then negate each, then sort ascending.


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then trim one element off each end.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then cut off the first and last.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then remove the first and last elements.


Take a list of people records (name, age); get the age field, then strip the front negatives, then keep only the middle part.


Take a list of people records (name, age); keep just each person's age, then remove leading negative numbers, then drop first and last.


Take a list of people records (name, age); extract age values, then drop negatives from start, then eliminate the outermost elements.


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


Take a list of people records (name, age); extract the ages, then drop the leading negative values, then drop the first and last elements.


Take a list of integers; negate each, then sort smallest to largest, then trim one element off each end.


Take a list of integers; reverse the signs of everything, then Ascending sort, then cut off the first and last.


Take a list of integers; negate each, then Sort this ascending, then remove the first and last elements.


Take a list of integers; reverse the signs of everything, then Sort lowest to highest, then keep only the middle part.


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


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


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


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


Take a list of integers; negate each, then keep only odd values, then count the elements.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then how many items remain.


Take a list of integers; negate each, then keep only odd values, then tell me the length.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then return the length.


Take a list of integers; negate each, then keep only odd values, then count them.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then what's the count.


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


Take a list of integers; negate each, then keep the odd numbers, then return how many remain.


Take a list of integers; keep the odd numbers, then sort smallest to largest, then truncate to the last three items.


Take a list of integers; odd numbers only, then Ascending sort, then show only the last three.


Take a list of integers; keep the odd numbers, then Sort this ascending, then remove all but the last three.


Take a list of integers; odd numbers only, then Sort lowest to highest, then take the final 3 elements.


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


Take a list of integers; odd numbers only, then sort ascending, then give me the last three elements.


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


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


Take a list of people records (name, age); extract the ages, then decrement each value, then give back the total.


Take a list of people records (name, age); show me all ages, then Lower each number by one, then sum r.


Take a list of people records (name, age); pluck the age field from each record, then reduce each by one, then add them up.


Take a list of people records (name, age); get the age field, then Subtract 1 from all, then calculate the sum of all elements.


Take a list of people records (name, age); keep just each person's age, then Subtract one from each, then what's the total.


Take a list of people records (name, age); extract age values, then Drop each by one, then what do they add up to.


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


Take a list of people records (name, age); extract the ages, then subtract one from each, then return their sum.


Take a list of integers; keep only the last three, then keep values below zero, then true if every value is unique.


Take a list of integers; keep the final three items, then get the negative numbers, then check for duplicates in the values.


Take a list of integers; take the last three, then keep values below zero, then do all values appear only once.


Take a list of integers; trim to the last three, then get the negative numbers, then check that there are no duplicates.


Take a list of integers; last three only, then keep values below zero, then are the values all unique.


Take a list of integers; truncate to the last three items, then get the negative numbers, then check if all values are unique.


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


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


Take a list of integers; drop the leading negative values, then default to [0] when there is nothing, then keep only non-zero numbers.


Take a list of integers; cut the leading negatives, then when the list is empty, substitute a zero value, then strip the zeros.


Take a list of integers; skip negatives at the start, then replace an empty list with one zero, then keep only non-zero numbers.


Take a list of integers; remove all negatives at the front, then zero it out if it's empty, then strip the zeros.


Take a list of integers; remove the initial run of negative numbers, then use zero if the list is empty, then keep only non-zero numbers.


Take a list of integers; strip the front negatives, then default to zero when empty, then strip the zeros.


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


Take a list of integers; drop the leading negative values, then if empty, use a single zero, then drop the zeros.


Take a list of integers; drop the leading negative values, then flip the list around, then keep only numbers above 5.


Take a list of integers; cut the leading negatives, then flip the order around, then exclude values of 5 and below.


Take a list of integers; skip negatives at the start, then put the elements backwards, then remove anything 5 or less.


Take a list of integers; remove all negatives at the front, then reverse that for me, then filter to keep only values above 5.


Take a list of integers; remove the initial run of negative numbers, then flip it backwards, then get rid of values that aren't greater than five.


Take a list of integers; strip the front negatives, then make it backwards, then drop anything 5 or below.


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


Take a list of integers; drop the leading negative values, then reverse the order, then keep values greater than five.


Take a list of integers; add one to each, then flip the sign of each, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; add one to each, then negate each, then pad with zeros to at least three elements.


Take a list of integers; keep only the last three, then order by distance from zero, then take values up to (excluding) the first zero.


Take a list of integers; keep the final three items, then sort based on absolute value, then keep the part before the first 0.


Take a list of integers; take the last three, then organize by magnitude, then truncate at the first zero.


Take a list of integers; trim to the last three, then arrange by absolute value ascending, then delete everything starting with the first zero.


Take a list of integers; last three only, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; truncate to the last three items, then sort by absolute value, then up to but not including the first zero.


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


Take a list of integers; keep only the last three, then sort by absolute value, then keep everything before the first zero.


Take a list of integers; drop the zeros, then multiply each by two, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then double each item in the list, then maximum of 10 for all.


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


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


Take a list of integers; take the absolute value of each, then remove all zero values, then truncate to three items.


Take a list of integers; convert to absolute value, then exclude zeros, then show the first three.


Take a list of integers; strip the signs, then remove all zero values, then take the first three.


Take a list of integers; take abs of each, then exclude zeros, then keep first 3.


Take a list of integers; get the absolute value of everything, then remove all zero values, then truncate to first three.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then first three.


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


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


Take a list of integers; sort ascending, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then remove repeats.


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


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then remove repeats.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then remove repeats.


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


Take a list of integers; sort ascending, then cap each value at 10, then drop duplicates keeping first occurrence.


Take a list of integers; keep everything before the first zero, then flip the list around, then strip the signs.


Take a list of integers; take only what comes before the initial zero, then flip the order around, then take abs of each.


Take a list of integers; cut the list at the first zero, then put the elements backwards, then get the absolute value of everything.


Take a list of integers; cut off after the first zero appears, then reverse that for me, then apply absolute value to the whole list.


Take a list of integers; take values up to (excluding) the first zero, then flip it backwards, then make them all positive.


Take a list of integers; keep the part before the first 0, then make it backwards, then make every value non-negative.


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


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


Take a list of integers; sort by absolute value, then multiply each by two, then strip the signs.


Take a list of integers; rearrange by distance from zero, then double each item in the list, then take abs of each.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then get the absolute value of everything.


Take a list of integers; put them in order by magnitude, then double each item in the list, then apply absolute value to the whole list.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then make them all positive.


Take a list of integers; sort by distance from zero, then double each item in the list, then make every value non-negative.


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


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


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


Take a list of integers; keep evens, then exclude zeros, then keep the part before the first 0.


Take a list of integers; keep the even numbers, then remove all zero values, then truncate at the first zero.


Take a list of integers; keep evens, then exclude zeros, then delete everything starting with the first zero.


Take a list of integers; keep the even numbers, then remove all zero values, then remove from the first zero onwards.


Take a list of integers; keep evens, then exclude zeros, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 0]
    r = [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; keep the even numbers, then drop the zeros, then keep everything before the first zero.


Take a list of integers; drop the first and last elements, then extend to length 3 using zeros, then give back the product of all values.


Take a list of integers; take out the first and last items, then pad to 3, then product of the list.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then what's the product.


Take a list of integers; trim the edges, then pad to 3, then what do they multiply to.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then give me their product.


Take a list of integers; cut off the first and last, then pad to 3, then multiply them all together.


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


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


Take a list of integers; add one to each, then default to [0] when there is nothing, then reduce each by one.


Take a list of integers; make each one bigger, then when the list is empty, substitute a zero value, then Subtract 1 from all.


Take a list of integers; add one to each, then replace an empty list with one zero, then Subtract one from each.


Take a list of integers; make each one bigger, then zero it out if it's empty, then Drop each by one.


Take a list of integers; add one to each, then use zero if the list is empty, then Decrease all values by one.


Take a list of integers; make each one bigger, then default to zero when empty, then Remove one from each value.


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


Take a list of integers; add one to each, then if empty, use a single zero, then subtract one from each.


Take a list of integers; keep only the first three, then multiply each value by itself, then drop non-positive values.


Take a list of integers; keep the first 3 items, then square them all, then drop the negative numbers.


Take a list of integers; take the first 3 elements, then raise each to the power of two, then filter out the negative ones.


Take a list of integers; remove everything after the third, then I need each number multiplied by itself, then remove all negative values.


Take a list of integers; truncate to three items, then square all of them, then keep positive values only.


Take a list of integers; show the first three, then multiply each element by itself, then keep values above zero.


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


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


Take a list of integers; double each, then flip the sign of each, then true if at least one even value.


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then any even.


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


Take a list of integers; double each, then negate each, then return whether any value is even.


Take a list of integers; sort ascending, then flip the sign of each, then put the elements backwards.


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then reverse that for me.


Take a list of integers; arrange in increasing order, then flip the sign of each, then flip it backwards.


Take a list of integers; Organize these ascending, then turn positives to negatives and vice versa, then make it backwards.


Take a list of integers; Sort in ascending order, then flip the sign of each, then reverse the list.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then invert the sequence.


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


Take a list of integers; sort ascending, then negate each, then reverse the order.


Take a list of integers; if empty, use a single zero, then sort smallest to largest, then trim one element off each end.


Take a list of integers; if blank use 0, then Ascending sort, then cut off the first and last.


Take a list of integers; default to [0] when there is nothing, then Sort this ascending, then remove the first and last elements.


Take a list of integers; when the list is empty, substitute a zero value, then Sort lowest to highest, then keep only the middle part.


Take a list of integers; replace an empty list with one zero, then Arrange from smallest to largest, then drop first and last.


Take a list of integers; zero it out if it's empty, then sort ascending, then eliminate the outermost elements.


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


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


Take a list of people records (name, age); extract the ages, then take the first 3 elements, then replace an empty list with one zero.


Take a list of people records (name, age); show me all ages, then remove everything after the third, then zero it out if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items, then use zero if the list is empty.


Take a list of people records (name, age); get the age field, then show the first three, then default to zero when empty.


Take a list of people records (name, age); keep just each person's age, then take the first three, then if there's nothing, put in a zero.


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


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


Take a list of people records (name, age); extract the ages, then keep only the first three, then if empty, use a single zero.


Take a list of integers; keep the positive numbers, then drop anything 5 or below, then true if at least one even value.


Take a list of integers; get rid of anything that's not positive, then keep only numbers greater than 5, then any even.


Take a list of integers; drop non-positive values, then filter for numbers above 5, then true if at least one even value.


Take a list of integers; drop the negative numbers, then give me values where x is greater than 5, then any even.


Take a list of integers; filter out the negative ones, then show me only the values that are bigger than five, then true if at least one even value.


Take a list of integers; remove all negative values, then keep values greater than five, then any even.


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


Take a list of integers; keep the positive numbers, then keep values greater than five, then return whether any value is even.


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


Take a list of integers; if blank use 0, then extract all even numbers, then remove repeats.


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


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


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


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


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


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


Take a list of integers; sort by absolute value, then make every value non-negative, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then absolute value for all items, then check for duplicates in the values.


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


Take a list of integers; put them in order by magnitude, then turn negatives into positives, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then abs each element, then are the values all unique.


Take a list of integers; sort by distance from zero, then take the absolute value of each, then check if all values are unique.


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


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


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


Take a list of integers; keep only nonzero elements, then extract all even numbers, then filter out everything except multiples of three.


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


Take a list of integers; keep only nonzero elements, then extract all even numbers, then multiples of three only.


Take a list of integers; drop the zeros, then keep only even values, then filter for numbers divisible by three.


Take a list of integers; keep only nonzero elements, then extract all even numbers, 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 = [x for x in r if x % 2 == 0]
    r = [x for x in r if x % 3 == 0]
    return r


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


Take a list of integers; keep values greater than five, then flip the list around, then replace an empty list with one zero.


Take a list of integers; filter out values less than or equal to 5, then flip the order around, then zero it out if it's empty.


Take a list of integers; keep only numbers above 5, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; exclude values of 5 and below, then reverse that for me, then default to zero when empty.


Take a list of integers; remove anything 5 or less, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; filter to keep only values above 5, then make it backwards, then if no items, add a zero.


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


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


Take a list of integers; drop the zeros, then order by distance from zero, then take values up to (excluding) the first zero.


Take a list of integers; keep only nonzero elements, then sort based on absolute value, then keep the part before the first 0.


Take a list of integers; drop the zeros, then organize by magnitude, then truncate at the first zero.


Take a list of integers; keep only nonzero elements, then arrange by absolute value ascending, then delete everything starting with the first zero.