Take a list of integers; subtract one from each, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; Decrement all items, then get the negative numbers, then fetch the first even element, default to 0.


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


Take a list of integers; Lower each number by one, then get the negative numbers, then fetch the first even element, default to 0.


Take a list of integers; reduce each by one, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; Subtract 1 from all, then get the negative numbers, then fetch the first even element, default to 0.


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


Take a list of integers; subtract one from each, then keep the negative numbers, then return the first even value (0 if none).


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


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


Take a list of integers; flip the list around, then organize by magnitude, then do all values appear only once.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then check that there are no duplicates.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then are the values all unique.


Take a list of integers; reverse that for me, then sort by absolute value, then check if all values are unique.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove both ends, then truncate to the last three items.


Take a list of integers; add zeros until the list has at least three values, then trim the edges, then show only the last three.


Take a list of integers; pad with zeros to at least three elements, then trim one element off each end, then remove all but the last three.


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


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


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


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


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


Take a list of integers; reverse the order, then order by distance from zero, then true only if all are positive.


Take a list of integers; reverse, then sort based on absolute value, then do all of these have positive values.


Take a list of integers; flip the list around, then organize by magnitude, then check if every value is positive.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then confirm all values are positive.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then all positive.


Take a list of integers; reverse that for me, then sort by absolute value, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = sorted(r, key=abs)
    return all(x > 0 for x in r)


Take a list of integers; reverse the order, then sort by absolute value, then return whether all values are positive.


Take a list of integers; square each, then take the first 3 elements, then drop anything not divisible by three.


Take a list of integers; each value squared, then remove everything after the third, then filter out everything except multiples of three.


Take a list of integers; multiply each value by itself, then truncate to three items, then keep only multiples of three.


Take a list of integers; square them all, then show the first three, then multiples of three only.


Take a list of integers; raise each to the power of two, then take the first three, then filter for numbers divisible by three.


Take a list of integers; I need each number multiplied by itself, then keep first 3, then give me only the values divisible by three.


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


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


Take a list of integers; sort ascending, then make every value non-negative, then ensure at least three items by appending zeros.


Take a list of integers; Sort it from low to high, then absolute value for all items, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in increasing order, then take absolute values, then ensure at least three items by appending zeros.


Take a list of integers; Organize these ascending, then turn negatives into positives, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; Sort in ascending order, then abs each element, then ensure at least three items by appending zeros.


Take a list of integers; I need this sorted ascending, then take the absolute value of each, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of people records (name, age); extract the ages, then remove the first item, then deduplicate the list.


Take a list of people records (name, age); show me all ages, then Remove head, then remove repeats.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item, then deduplicate the list.


Take a list of people records (name, age); get the age field, then Remove head, then remove repeats.


Take a list of people records (name, age); keep just each person's age, then remove the first item, then deduplicate the list.


Take a list of people records (name, age); extract age values, then Remove head, then remove repeats.


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


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


Take a list of integers; drop the first and last elements, then make every value non-negative, then keep only non-zero numbers.


Take a list of integers; take out the first and last items, then absolute value for all items, then strip the zeros.


Take a list of integers; remove both ends, then take absolute values, then keep only non-zero numbers.


Take a list of integers; trim the edges, then turn negatives into positives, then strip the zeros.


Take a list of integers; trim one element off each end, then abs each element, then keep only non-zero numbers.


Take a list of integers; cut off the first and last, then take the absolute value of each, then strip the zeros.


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


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


Take a list of integers; negate each, then skip negatives at the start, then trim one element off each end.


Take a list of integers; reverse the signs of everything, then remove all negatives at the front, then cut off the first and last.


Take a list of integers; negate each, then remove the initial run of negative numbers, then remove the first and last elements.


Take a list of integers; reverse the signs of everything, then strip the front negatives, then keep only the middle part.


Take a list of integers; negate each, then remove leading negative numbers, then drop first and last.


Take a list of integers; reverse the signs of everything, then drop negatives from start, then eliminate the outermost elements.


def solve(xs):
    r = list(xs)
    r = [-x for x 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 integers; negate each, then drop the leading negative values, then drop the first and last elements.


Take a list of integers; add one to each, then keep values below zero, then truncate to three items.


Take a list of integers; make each one bigger, then get the negative numbers, then show the first three.


Take a list of integers; add one to each, then keep values below zero, then take the first three.


Take a list of integers; make each one bigger, then get the negative numbers, then keep first 3.


Take a list of integers; add one to each, then keep values below zero, then truncate to first three.


Take a list of integers; make each one bigger, then get the negative numbers, then first three.


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


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


Take a list of integers; square each, then flip the list around, then give the earliest even value or zero.


Take a list of integers; each value squared, then flip the order around, then fetch the first even element, default to 0.


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


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


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


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


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


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


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


Take a list of integers; keep the first 3 items, then flip the order around, then any even.


Take a list of integers; take the first 3 elements, then put the elements backwards, then true if at least one even value.


Take a list of integers; remove everything after the third, then reverse that for me, then any even.


Take a list of integers; truncate to three items, then flip it backwards, then true if at least one even value.


Take a list of integers; show the first three, then make it backwards, then any even.


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


Take a list of integers; keep only the first three, then reverse the order, then return whether any value is even.


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


Take a list of integers; make each one bigger, then flip the order around, then fetch the first even element, default to 0.


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


Take a list of integers; make each one bigger, then reverse that for me, then fetch the first even element, default to 0.


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


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


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


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


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then raise each to the power of two.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then I need each number multiplied by itself.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then square all of them.


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


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then make each one squared.


Take a list of people records (name, age); extract age values, then default to zero when empty, then square each value in the list.


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


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


Take a list of integers; keep the even numbers, then increment each value, then arrange in decreasing order.


Take a list of integers; keep evens, then plus one for all, then arrange in descending order.


Take a list of integers; keep the even numbers, then increment each value, then reverse sort.


Take a list of integers; keep evens, then plus one for all, then sort largest to smallest.


Take a list of integers; keep the even numbers, then increment each value, then sort by descending values.


Take a list of integers; keep evens, then plus one for all, then sort from highest to lowest.


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


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


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


Take a list of integers; make each one bigger, then turn positives to negatives and vice versa, then any even.


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


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


Take a list of integers; sort descending, then order by distance from zero, then replace an empty list with one zero.


Take a list of integers; sort largest first, then sort based on absolute value, then zero it out if it's empty.


Take a list of integers; sort in descending order, then organize by magnitude, then use zero if the list is empty.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending, then default to zero when empty.


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


Take a list of integers; arrange in decreasing order, then sort by absolute value, then if no items, add a zero.


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


Take a list of integers; sort descending, then sort by absolute value, then if empty, use a single zero.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the negative numbers, then take positive values then stop, then give the earliest even value or zero.


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


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


Take a list of integers; extract negatives, then take while greater than zero, 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 = 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; keep the negative numbers, then take values while they are positive, then return the first even value (0 if none).


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then show only the last three.


Take a list of integers; drop the zeros, then keep values below zero, then remove all but the last three.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then take the final 3 elements.


Take a list of integers; drop the zeros, then keep values below zero, then drop everything except the final three.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then give me the last three elements.


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


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


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then remove the initial run of negative numbers.


Take a list of integers; take only what comes before the initial zero, then pad to 3, then strip the front negatives.


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then remove leading negative numbers.


Take a list of integers; cut off after the first zero appears, then pad to 3, then drop negatives from start.


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then strip negative values from the start.


Take a list of integers; keep the part before the first 0, then pad to 3, then remove negatives before the first non-negative.


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


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


Take a list of integers; take the absolute value of each, then take the final 3 elements, then drop the even numbers.


Take a list of integers; convert to absolute value, then drop everything except the final three, then strip out the evens.


Take a list of integers; strip the signs, then give me the last three elements, then drop the even numbers.


Take a list of integers; take abs of each, then keep only the last three, then strip out the evens.


Take a list of integers; get the absolute value of everything, then keep the final three items, then drop the even numbers.


Take a list of integers; apply absolute value to the whole list, then take the last three, then strip out the evens.


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


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


Take a list of integers; add one to each, then keep values divisible by 3, then true if already sorted smallest to largest.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then does this list go in ascending order.


Take a list of integers; add one to each, then drop anything not divisible by three, then check if the list is in ascending order.


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then is the list sorted.


Take a list of integers; add one to each, then keep only multiples of three, then is it sorted.


Take a list of integers; make each one bigger, then multiples of three only, then check if values are in increasing order.


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


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


Take a list of integers; sort by absolute value, then clamp each to at most ten, then true if already sorted smallest to largest.


Take a list of integers; rearrange by distance from zero, then don't let anything exceed 10, then does this list go in ascending order.


Take a list of integers; arrange by magnitude ignoring sign, then clamp each to at most ten, then check if the list is in ascending order.


Take a list of integers; put them in order by magnitude, then don't let anything exceed 10, then is the list sorted.


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


Take a list of integers; sort by distance from zero, then don't let anything exceed 10, then check if values are in increasing order.


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


Take a list of integers; sort by absolute value, then cap each value at 10, then return whether the list is sorted ascending.


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


Take a list of integers; take only what comes before the initial zero, then filter for positive numbers, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; cut off after the first zero appears, then keep the positives, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take values up to (excluding) the first zero, then remove negatives, then ensure at least three items by appending zeros.


Take a list of integers; keep the part before the first 0, then keep the positive numbers, then ensure minimum length of three by adding zeros to the end.


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 = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; reverse the order, then multiply each by two, then arrange in decreasing order.


Take a list of integers; reverse, then double each item in the list, then arrange in descending order.


Take a list of integers; flip the list around, then multiply each by two, then reverse sort.


Take a list of integers; flip the order around, then double each item in the list, then sort largest to smallest.


Take a list of integers; put the elements backwards, then multiply each by two, then sort by descending values.


Take a list of integers; reverse that for me, then double each item in the list, then sort from highest to lowest.


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


Take a list of integers; reverse the order, then double each, then sort descending.


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


Take a list of integers; make each one bigger, then square them all, then any even.


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


Take a list of integers; make each one bigger, then I need each number multiplied by itself, then any even.


Take a list of integers; add one to each, then square all of them, then true if at least one even value.


Take a list of integers; make each one bigger, then multiply each element by itself, then any even.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values above zero, then true only if all are positive.


Take a list of integers; drop duplicates but keep the first one, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; drop duplicates keeping first occurrence, then keep only positive numbers, then check if every value is positive.


Take a list of integers; drop duplicates but keep the first one, then keep the positives, then confirm all values are positive.


Take a list of integers; drop duplicates keeping first occurrence, then remove negatives, then all positive.


Take a list of integers; drop duplicates but keep the first one, then keep the positive numbers, then check if every number is above zero.


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


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


Take a list of integers; sort descending, then remove both ends, then ensure at least three items by appending zeros.


Take a list of integers; sort largest first, then trim the edges, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort in descending order, then trim one element off each end, then ensure at least three items by appending zeros.


Take a list of integers; sort from greatest to least, then cut off the first and last, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort z to a, then remove the first and last elements, then ensure at least three items by appending zeros.


Take a list of integers; arrange in decreasing order, then keep only the middle part, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the leading negative values, then take the final 3 elements, then stop at the first non-positive value.


Take a list of integers; cut the leading negatives, then drop everything except the final three, then keep the leading run of positive numbers.


Take a list of integers; skip negatives at the start, then give me the last three elements, then take values while they are positive.


Take a list of integers; remove all negatives at the front, then keep only the last three, then take positive values then stop.


Take a list of integers; remove the initial run of negative numbers, then keep the final three items, then keep going while positive.


Take a list of integers; strip the front negatives, then take the last three, then stop at first non positive.


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


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


Take a list of integers; take the absolute value of each, then remove all zero values, then drop the even numbers.


Take a list of integers; convert to absolute value, then exclude zeros, then strip out the evens.


Take a list of integers; strip the signs, then remove all zero values, then drop the even numbers.


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


Take a list of integers; get the absolute value of everything, then remove all zero values, then drop the even numbers.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then strip out the evens.


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


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


Take a list of integers; take the absolute value of each, then keep values divisible by 3, then arrange in increasing order.


Take a list of integers; convert to absolute value, then keep items where x mod 3 equals zero, then Organize these ascending.


Take a list of integers; strip the signs, then drop anything not divisible by three, then Sort in ascending order.


Take a list of integers; take abs of each, then filter out everything except multiples of three, then I need this sorted ascending.


Take a list of integers; get the absolute value of everything, then keep only multiples of three, then Put these in ascending order.


Take a list of integers; apply absolute value to the whole list, then multiples of three only, then sort smallest to largest.


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


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


Take a list of integers; drop the first element, then remove repeated values, then replace an empty list with one zero.


Take a list of integers; Take everything except the first, then unique values preserving order, then zero it out if it's empty.


Take a list of integers; drop the first element, then remove repeated values, then use zero if the list is empty.


Take a list of integers; Take everything except the first, then unique values preserving order, then default to zero when empty.


Take a list of integers; drop the first element, then remove repeated values, then if there's nothing, put in a zero.


Take a list of integers; Take everything except the first, then unique values preserving order, then if no items, add a zero.


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


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


Take a list of integers; drop the first element, then clamp each to at most ten, then count the elements.


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


Take a list of integers; drop the first element, then clamp each to at most ten, then tell me the length.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then return the length.


Take a list of integers; drop the first element, then clamp each to at most ten, then count them.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then what's the count.


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


Take a list of integers; drop the first element, then cap each value at 10, then return how many remain.


Take a list of strings; drop duplicate strings keeping the first, then convert each to lower case, then true if a blank string is present.


Take a list of strings; dedupe, then lowercase each one, then check for empty strings in the list.


Take a list of strings; remove duplicate strings keep first, then convert each to lower case, then check if there's an empty string.


Take a list of strings; remove repeating strings first one stays, then lowercase each one, then does the collection contain an empty string value somewhere.


Take a list of strings; delete duplicate strings keep the first one, then convert each to lower case, then whether any element is blank.


Take a list of strings; deduplicate the strings, then lowercase each one, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = [s.lower() for s in r]
    return any(s == '' for s in r)


Take a list of strings; drop duplicate strings keeping the first, then lowercase each string, then return whether any string is empty.


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


Take a list of integers; make each one bigger, then unique values preserving order, then Subtract 1 from all.


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


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


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


Take a list of integers; make each one bigger, then unique values preserving order, then Remove one from each value.


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


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


Take a list of integers; reverse the order, then default to [0] when there is nothing, then take values up to (excluding) the first zero.


Take a list of integers; reverse, then when the list is empty, substitute a zero value, then keep the part before the first 0.


Take a list of integers; flip the list around, then replace an empty list with one zero, then truncate at the first zero.


Take a list of integers; flip the order around, then zero it out if it's empty, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then use zero if the list is empty, then remove from the first zero onwards.


Take a list of integers; reverse that for me, then default to zero when empty, then up to but not including the first zero.


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


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


Take a list of integers; add one to each, then keep values above zero, then strip the signs.


Take a list of integers; make each one bigger, then filter for positive numbers, then take abs of each.


Take a list of integers; add one to each, then keep only positive numbers, then get the absolute value of everything.


Take a list of integers; make each one bigger, then keep the positives, then apply absolute value to the whole list.


Take a list of integers; add one to each, then remove negatives, then make them all positive.


Take a list of integers; make each one bigger, then keep the positive numbers, then make every value non-negative.


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


Take a list of integers; add one to each, then keep the positive numbers, then take the absolute value of each.


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


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


Take a list of integers; drop non-positive values, then increment each value, then square all of them.


Take a list of integers; drop the negative numbers, then plus one for all, then multiply each element by itself.


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


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


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


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


Take a list of integers; drop the leading negative values, then keep values above zero, then arrange in increasing order.


Take a list of integers; cut the leading negatives, then filter for positive numbers, then Organize these ascending.


Take a list of integers; skip negatives at the start, then keep only positive numbers, then Sort in ascending order.


Take a list of integers; remove all negatives at the front, then keep the positives, then I need this sorted ascending.


Take a list of integers; remove the initial run of negative numbers, then remove negatives, then Put these in ascending order.


Take a list of integers; strip the front negatives, then keep the positive numbers, then sort smallest to largest.


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


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


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


Take a list of integers; keep the final three items, then don't let anything exceed 10, then keep the leading run of positive numbers.


Take a list of integers; take the last three, then clamp each to at most ten, then take values while they are positive.


Take a list of integers; trim to the last three, then don't let anything exceed 10, then take positive values then stop.


Take a list of integers; last three only, then clamp each to at most ten, then keep going while positive.


Take a list of integers; truncate to the last three items, then don't let anything exceed 10, then stop at first non positive.


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


Take a list of integers; keep only the last three, then cap each value at 10, then take values while they are positive.


Take a list of integers; negate each, then decrement each value, then replace an empty list with one zero.


Take a list of integers; reverse the signs of everything, then Lower each number by one, then zero it out if it's empty.


Take a list of integers; negate each, then reduce each by one, then use zero if the list is empty.


Take a list of integers; reverse the signs of everything, then Subtract 1 from all, then default to zero when empty.


Take a list of integers; negate each, then Subtract one from each, then if there's nothing, put in a zero.


Take a list of integers; reverse the signs of everything, then Drop each by one, then if no items, add a zero.


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


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


Take a list of people records (name, age); extract the ages, then keep only odd values, then drop the odd numbers.


Take a list of people records (name, age); show me all ages, then eliminate the even numbers, then filter out the odd numbers.


Take a list of people records (name, age); pluck the age field from each record, then keep only odd values, then drop the odd numbers.


Take a list of people records (name, age); get the age field, then eliminate the even numbers, then filter out the odd numbers.


Take a list of people records (name, age); keep just each person's age, then keep only odd values, then drop the odd numbers.


Take a list of people records (name, age); extract age values, then eliminate the even numbers, then filter out the odd numbers.


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


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


Take a list of integers; keep the positive numbers, then multiply each by two, then arrange in increasing order.


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then Organize these ascending.


Take a list of integers; drop non-positive values, then multiply each by two, then Sort in ascending order.


Take a list of integers; drop the negative numbers, then double each item in the list, then I need this sorted ascending.


Take a list of integers; filter out the negative ones, then multiply each by two, then Put these in ascending order.


Take a list of integers; remove all negative values, then double each item in the list, then sort smallest to largest.


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


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


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


Take a list of integers; filter out values less than or equal to 5, then get the negative numbers, then cut off the first and last.


Take a list of integers; keep only numbers above 5, then keep values below zero, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then get the negative numbers, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then keep values below zero, then drop first and last.


Take a list of integers; filter to keep only values above 5, then get the negative numbers, then eliminate the outermost elements.


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


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


Take a list of strings; sort alphabetically, then remove repeated strings, then make every string lowercase.


Take a list of strings; arrange alphabetically, then keep unique strings first appearance, then make it all lowercase.


Take a list of strings; sort alphabetically, then eliminate repeated strings preserve first occurrence, then make every string lowercase.


Take a list of strings; arrange alphabetically, then drop duplicate strings keeping the first, then make it all lowercase.


Take a list of strings; sort alphabetically, then dedupe, then make every string lowercase.


Take a list of strings; arrange alphabetically, then remove duplicate strings keep first, then make it all lowercase.


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


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


Take a list of integers; cap each value at 10, then keep values below zero, then give back the total.


Take a list of integers; clip values at 10, then get the negative numbers, then sum r.


Take a list of integers; cap each value at 10, then keep values below zero, then add them up.


Take a list of integers; clip values at 10, then get the negative numbers, then calculate the sum of all elements.


Take a list of integers; cap each value at 10, then keep values below zero, then what's the total.


Take a list of integers; clip values at 10, then get the negative numbers, then what do they add up to.


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


Take a list of integers; cap each value at 10, then keep the negative numbers, then return their sum.


Take a list of integers; keep the odd numbers, then remove repeated values, then find the min, defaulting to 0.


Take a list of integers; odd numbers only, then unique values preserving order, then minimum value, zero otherwise.


Take a list of integers; keep the odd numbers, then remove repeated values, then get the minimum value or zero if empty.


Take a list of integers; odd numbers only, then unique values preserving order, then give me the min or 0.


Take a list of integers; keep the odd numbers, then remove repeated values, then return the smallest number, defaulting to 0.


Take a list of integers; odd numbers only, then unique values preserving order, then return smallest or zero if empty.


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


Take a list of integers; keep the odd numbers, then drop duplicates keeping first occurrence, then return the minimum (0 if empty).


Take a list of integers; keep the positive numbers, then take the first 3 elements, then true if at least one even value.


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then any even.


Take a list of integers; drop non-positive values, then truncate to three items, then true if at least one even value.


Take a list of integers; drop the negative numbers, then show the first three, then any even.


Take a list of integers; filter out the negative ones, then take the first three, then true if at least one even value.


Take a list of integers; remove all negative values, then keep first 3, then any even.


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


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


Take a list of integers; take the absolute value of each, then keep values above zero, then skip the first one.


Take a list of integers; convert to absolute value, then filter for positive numbers, then Discard the first element.


Take a list of integers; strip the signs, then keep only positive numbers, then skip the first one.


Take a list of integers; take abs of each, then keep the positives, then Discard the first element.


Take a list of integers; get the absolute value of everything, then remove negatives, then skip the first one.


Take a list of integers; apply absolute value to the whole list, then keep the positive numbers, then Discard the first element.


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


Take a list of integers; take the absolute value of each, then keep the positive numbers, then drop the first element.


Take a list of strings; drop empty strings, then convert each to upper case, then arrange by string length ascending.


Take a list of strings; get rid of blanks, then change all strings to uppercase, then length sort.


Take a list of strings; remove blanks, then make every string uppercase, then sort by length shortest first.


Take a list of strings; eliminate empty string values, then uppercase each one, then organize by string length least to greatest.


Take a list of strings; filter out blank strings, then make all the strings uppercase, then shortest strings first.


Take a list of strings; remove strings that are empty, then convert all strings to uppercase letters, then i want them ordered by how short they are.


def solve(xs):
    r = list(xs)
    r = [s for s in r if s]
    r = [s.upper() for s in r]
    r = sorted(r, key=len)
    return r


Take a list of strings; drop empty strings, then uppercase each string, then sort by length, shortest first.


Take a list of integers; if empty, use a single zero, then cut the list at the first zero, then give back the product of all values.


Take a list of integers; if blank use 0, then cut off after the first zero appears, then product of the list.


Take a list of integers; default to [0] when there is nothing, then take values up to (excluding) the first zero, then what's the product.


Take a list of integers; when the list is empty, substitute a zero value, then keep the part before the first 0, then what do they multiply to.


Take a list of integers; replace an empty list with one zero, then truncate at the first zero, then give me their product.


Take a list of integers; zero it out if it's empty, then delete everything starting with the first zero, then multiply them all together.


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


Take a list of integers; if empty, use a single zero, then keep everything before the first zero, then return their product.


Take a list of integers; if empty, use a single zero, then keep only even values, then limit every value to 10.


Take a list of integers; if blank use 0, then extract all even numbers, then maximum of 10 for all.


Take a list of integers; default to [0] when there is nothing, then keep only even values, then limit every value to 10.


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


Take a list of integers; replace an empty list with one zero, then keep only even values, then limit every value to 10.


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


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


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


Take a list of integers; drop the first and last elements, then cut the list at the first zero, then count the elements.


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then how many items remain.


Take a list of integers; remove both ends, then take values up to (excluding) the first zero, then tell me the length.


Take a list of integers; trim the edges, then keep the part before the first 0, then return the length.


Take a list of integers; trim one element off each end, then truncate at the first zero, then count them.


Take a list of integers; cut off the first and last, then delete everything starting with the first zero, then what's the count.


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


Take a list of integers; drop the first and last elements, then keep everything before the first zero, then return how many remain.


Take a list of integers; drop the leading negative values, then keep values below zero, then true if already sorted smallest to largest.


Take a list of integers; cut the leading negatives, then get the negative numbers, then does this list go in ascending order.


Take a list of integers; skip negatives at the start, then keep values below zero, then check if the list is in ascending order.


Take a list of integers; remove all negatives at the front, then get the negative numbers, then is the list sorted.


Take a list of integers; remove the initial run of negative numbers, then keep values below zero, then is it sorted.


Take a list of integers; strip the front negatives, then get the negative numbers, then check if values are in increasing order.


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


Take a list of integers; drop the leading negative values, then keep the negative numbers, then return whether the list is sorted ascending.


Take a list of integers; keep values greater than five, then increase every value by 10, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then add 10 to each item, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then shift each up by ten, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then sort smallest to largest.


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then reduce each by one.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then Subtract 1 from all.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then Subtract one from each.


Take a list of integers; when the list is empty, substitute a zero value, then give me values where x is greater than 5, then Drop each by one.


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five, then Decrease all values by one.


Take a list of integers; zero it out if it's empty, then keep values greater than five, then Remove one from each value.


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then subtract one from each.


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


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then I need each number multiplied by itself.


Take a list of integers; keep values divisible by 3, then keep only odd values, then square all of them.


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then multiply each element by itself.


Take a list of integers; drop anything not divisible by three, then keep only odd values, then make each one squared.


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then square each value in the list.


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


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


Take a list of integers; drop the first and last elements, then make every value non-negative, then arrange in decreasing order.


Take a list of integers; take out the first and last items, then absolute value for all items, then arrange in descending order.


Take a list of integers; remove both ends, then take absolute values, then reverse sort.


Take a list of integers; trim the edges, then turn negatives into positives, then sort largest to smallest.


Take a list of integers; trim one element off each end, then abs each element, then sort by descending values.


Take a list of integers; cut off the first and last, then take the absolute value of each, then sort from highest to lowest.


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


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


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


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


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


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


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


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


def solve(xs):
    r = list(xs)
    r = [x * 2 for x in 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; double each, then square each, then return the first even value (0 if none).


Take a list of integers; keep only the last three, then keep values divisible by 3, then drop non-negative values.


Take a list of integers; keep the final three items, then keep items where x mod 3 equals zero, then drop all positive numbers.


Take a list of integers; take the last three, then drop anything not divisible by three, then drop non-negative values.


Take a list of integers; trim to the last three, then filter out everything except multiples of three, then drop all positive numbers.


Take a list of integers; last three only, then keep only multiples of three, then drop non-negative values.


Take a list of integers; truncate to the last three items, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; take values while they are positive, then skip negatives at the start, then arrange in decreasing order.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then arrange in descending order.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then reverse sort.


Take a list of integers; stop at first non positive, then strip the front negatives, then sort largest to smallest.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then sort by descending values.


Take a list of integers; take values while positive, then drop negatives from start, then sort from highest to lowest.


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


Take a list of integers; take values while they are positive, then drop the leading negative values, then sort descending.


Take a list of integers; sort by absolute value, then keep values below zero, then true if every value is unique.


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


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


Take a list of integers; put them in order by magnitude, then get the negative numbers, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then are the values all unique.


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


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


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


Take a list of integers; drop the zeros, then take the first 3 elements, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then remove everything after the third, then arrange in descending order.


Take a list of integers; drop the zeros, then truncate to three items, then reverse sort.


Take a list of integers; keep only nonzero elements, then show the first three, then sort largest to smallest.


Take a list of integers; drop the zeros, then take the first three, then sort by descending values.


Take a list of integers; keep only nonzero elements, then keep first 3, then sort from highest to lowest.


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


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


Take a list of integers; square each, then take the first 3 elements, then multiply each by -1.


Take a list of integers; each value squared, then remove everything after the third, then negate.


Take a list of integers; multiply each value by itself, then truncate to three items, then multiply each by -1.


Take a list of integers; square them all, then show the first three, then negate.


Take a list of integers; raise each to the power of two, then take the first three, then multiply each by -1.


Take a list of integers; I need each number multiplied by itself, then keep first 3, then negate.


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


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


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


Take a list of integers; keep evens, then eliminate the even numbers, then how many items remain.


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


Take a list of integers; keep evens, then eliminate the even numbers, then return the length.


Take a list of integers; keep the even numbers, then keep only odd values, then count them.


Take a list of integers; keep evens, then eliminate the even numbers, then what's the count.


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 len(r)


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


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


Take a list of integers; cut the leading negatives, then add 10 to each item, then drop the negative numbers.


Take a list of integers; skip negatives at the start, then shift each up by ten, then filter out the negative ones.


Take a list of integers; remove all negatives at the front, then increase all numbers by 10, then remove all negative values.


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


Take a list of integers; strip the front negatives, then give everything a boost of 10, then keep values above zero.


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


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


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


Take a list of integers; times two for each item, then square them all, then keep the leading run of positive numbers.


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


Take a list of integers; times two for each item, then I need each number multiplied by itself, then take positive values then stop.


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


Take a list of integers; times two for each item, then multiply each element by itself, then stop at first non positive.


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


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


Take a list of integers; drop the leading negative values, then keep only even values, then true if every value is unique.


Take a list of integers; cut the leading negatives, then extract all even numbers, then check for duplicates in the values.


Take a list of integers; skip negatives at the start, then keep only even values, then do all values appear only once.


Take a list of integers; remove all negatives at the front, then extract all even numbers, then check that there are no duplicates.


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then are the values all unique.


Take a list of integers; strip the front negatives, then extract all even numbers, then check if all values are unique.


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


Take a list of integers; drop the leading negative values, then keep the even numbers, then return whether all values are distinct.


Take a list of people records (name, age); extract the ages, then keep values divisible by 3, then bump each up by one.


Take a list of people records (name, age); show me all ages, then keep items where x mod 3 equals zero, then increment each item.


Take a list of people records (name, age); pluck the age field from each record, then drop anything not divisible by three, then bump each up by one.


Take a list of people records (name, age); get the age field, then filter out everything except multiples of three, then increment each item.


Take a list of people records (name, age); keep just each person's age, then keep only multiples of three, then bump each up by one.


Take a list of people records (name, age); extract age values, then multiples of three only, then increment each item.


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


Take a list of people records (name, age); extract the ages, then keep multiples of three, then add one to each.


Take a list of integers; pad with zeros to at least three elements, then order by distance from zero, then stop at the first non-positive value.


Take a list of integers; add zeros until the list has at least three values, then sort based on absolute value, then keep the leading run of positive numbers.


Take a list of integers; pad with zeros to at least three elements, then organize by magnitude, then take values while they are positive.


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


Take a list of integers; pad with zeros to at least three elements, then sort from smallest to largest absolute value, then keep going while positive.


Take a list of integers; add zeros until the list has at least three values, then sort by absolute value, then stop at first non positive.


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


Take a list of integers; pad with zeros to at least three elements, then sort by absolute value, then take values while they are positive.


Take a list of integers; take the absolute value of each, then remove both ends, then true if every value is unique.


Take a list of integers; convert to absolute value, then trim the edges, then check for duplicates in the values.


Take a list of integers; strip the signs, then trim one element off each end, then do all values appear only once.


Take a list of integers; take abs of each, then cut off the first and last, then check that there are no duplicates.


Take a list of integers; get the absolute value of everything, then remove the first and last elements, then are the values all unique.


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then check if all values are unique.


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


Take a list of integers; take the absolute value of each, then drop the first and last elements, then return whether all values are distinct.


Take a list of integers; keep the even numbers, then cut the list at the first zero, then multiply each by -1.


Take a list of integers; keep evens, then cut off after the first zero appears, then negate.


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


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


Take a list of integers; keep the even numbers, then truncate at the first zero, then multiply each by -1.


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


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


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


Take a list of integers; if empty, use a single zero, then decrement each value, then multiply each by -1.


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


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


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


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then multiply each by -1.


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


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


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


Take a list of integers; drop the leading negative values, then remove repeated values, then true if already sorted smallest to largest.


Take a list of integers; cut the leading negatives, then unique values preserving order, then does this list go in ascending order.


Take a list of integers; skip negatives at the start, then remove repeated values, then check if the list is in ascending order.


Take a list of integers; remove all negatives at the front, then unique values preserving order, then is the list sorted.


Take a list of integers; remove the initial run of negative numbers, then remove repeated values, then is it sorted.


Take a list of integers; strip the front negatives, then unique values preserving order, then check if values are in increasing order.


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


Take a list of integers; drop the leading negative values, then drop duplicates keeping first occurrence, then return whether the list is sorted ascending.


Take a list of integers; keep values greater than five, then flip the sign of each, then true if any value equals zero.


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


Take a list of integers; keep only numbers above 5, then flip the sign of each, then true if any value equals zero.


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then check for zero.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then true if any value equals zero.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then check for zero.


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


Take a list of integers; keep values greater than five, then negate each, then return whether the list contains a zero.


Take a list of integers; keep the positive numbers, then make every value non-negative, then make each twice as big.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then multiply each by 2.


Take a list of integers; drop non-positive values, then take absolute values, then make each twice as big.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then multiply each by 2.


Take a list of integers; filter out the negative ones, then abs each element, then make each twice as big.


Take a list of integers; remove all negative values, then take the absolute value of each, then multiply each by 2.


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


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


Take a list of integers; keep only the first three, then remove both ends, then true if every value is unique.


Take a list of integers; keep the first 3 items, then trim the edges, then check for duplicates in the values.


Take a list of integers; take the first 3 elements, then trim one element off each end, then do all values appear only once.


Take a list of integers; remove everything after the third, then cut off the first and last, then check that there are no duplicates.


Take a list of integers; truncate to three items, then remove the first and last elements, then are the values all unique.


Take a list of integers; show the first three, then keep only the middle part, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = r[1:-1]
    return len(r) == len(set(r))


Take a list of integers; keep only the first three, then drop the first and last elements, then return whether all values are distinct.


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


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


Take a list of integers; cut the list at the first zero, then trim one element off each end, then how many are even.


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


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


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


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


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


Take a list of integers; double each, then keep only even values, then true if every value is unique.


Take a list of integers; times two for each item, then extract all even numbers, then check for duplicates in the values.


Take a list of integers; double each, then keep only even values, then do all values appear only once.


Take a list of integers; times two for each item, then extract all even numbers, then check that there are no duplicates.


Take a list of integers; double each, then keep only even values, then are the values all unique.


Take a list of integers; times two for each item, then extract all even numbers, then check if all values are unique.


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


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


Take a list of integers; pad with zeros to at least three elements, then increment each value, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then drop all positive numbers.


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


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


Take a list of integers; square each, then keep values divisible by 3, then skip the first one.


Take a list of integers; each value squared, then keep items where x mod 3 equals zero, then Discard the first element.


Take a list of integers; multiply each value by itself, then drop anything not divisible by three, then skip the first one.


Take a list of integers; square them all, then filter out everything except multiples of three, then Discard the first element.


Take a list of integers; raise each to the power of two, then keep only multiples of three, then skip the first one.


Take a list of integers; I need each number multiplied by itself, then multiples of three only, then Discard the first element.


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


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


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then drop anything not divisible by three.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then filter out everything except multiples of three.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then keep only multiples of three.


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


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then filter for numbers divisible by three.


Take a list of people records (name, age); extract age values, then default to zero when empty, then give me only the values divisible by three.


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


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


Take a list of integers; negate each, then keep values below zero, then truncate to three items.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then show the first three.


Take a list of integers; negate each, then keep values below zero, then take the first three.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then keep first 3.


Take a list of integers; negate each, then keep values below zero, then truncate to first three.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then first three.


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


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


Take a list of integers; sort ascending, then drop anything 5 or below, then drop the even numbers.


Take a list of integers; Sort it from low to high, then keep only numbers greater than 5, then strip out the evens.


Take a list of integers; arrange in increasing order, then filter for numbers above 5, then drop the even numbers.


Take a list of integers; Organize these ascending, then give me values where x is greater than 5, then strip out the evens.


Take a list of integers; Sort in ascending order, then show me only the values that are bigger than five, then drop the even numbers.


Take a list of integers; I need this sorted ascending, then keep values greater than five, then strip out the evens.


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


Take a list of integers; sort ascending, then keep values greater than five, then keep the odd numbers.


Take a list of integers; drop the leading negative values, then decrement each value, then strip the signs.


Take a list of integers; cut the leading negatives, then Lower each number by one, then take abs of each.


Take a list of integers; skip negatives at the start, then reduce each by one, then get the absolute value of everything.


Take a list of integers; remove all negatives at the front, then Subtract 1 from all, then apply absolute value to the whole list.


Take a list of integers; remove the initial run of negative numbers, then Subtract one from each, then make them all positive.


Take a list of integers; strip the front negatives, then Drop each by one, then make every value non-negative.


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


Take a list of integers; drop the leading negative values, then subtract one from each, then take the absolute value of each.


Take a list of integers; drop the zeros, then flip the list around, then strip the signs.


Take a list of integers; keep only nonzero elements, then flip the order around, then take abs of each.


Take a list of integers; drop the zeros, then put the elements backwards, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then reverse that for me, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then flip it backwards, then make them all positive.


Take a list of integers; keep only nonzero elements, then make it backwards, then make every value non-negative.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then find the max, defaulting to 0.


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then What's the highest number in the list.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then Return the greatest value or default to 0.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then Find the largest element, defaulting to zero.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then give the largest value (0 if none).


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


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


Take a list of integers; keep only the last three, then make every value non-negative, then skip the first one.


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


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


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


Take a list of integers; last three only, then abs each element, then skip the first one.


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


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


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


Take a list of integers; sort descending, then skip negatives at the start, then strip the signs.


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


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then get the absolute value of everything.


Take a list of integers; sort from greatest to least, then strip the front negatives, then apply absolute value to the whole list.


Take a list of integers; sort z to a, then remove leading negative numbers, then make them all positive.


Take a list of integers; arrange in decreasing order, then drop negatives from start, then make every value non-negative.


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


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


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


Take a list of integers; get rid of non-multiples of three, then drop everything except the final three, then fetch the first even element, default to 0.


Take a list of integers; keep values divisible by 3, then give me the last three elements, then give the earliest even value or zero.


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


Take a list of integers; drop anything not divisible by three, then keep the final three items, then give the earliest even value or zero.


Take a list of integers; filter out everything except multiples of three, then take the last three, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep only the first three, then flip the sign of each, then give the number of evens.


Take a list of integers; keep the first 3 items, then turn positives to negatives and vice versa, then find how many values are divisible by two.


Take a list of integers; take the first 3 elements, then flip the sign of each, then how many are even.


Take a list of integers; remove everything after the third, then turn positives to negatives and vice versa, then get the total number of even values in the list.


Take a list of integers; truncate to three items, then flip the sign of each, then give me the count of even values.


Take a list of integers; show the first three, then turn positives to negatives and vice versa, then I need to know how many of these are even.


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


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


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


Take a list of integers; take out the first and last items, then absolute value for all items, then Subtract 1 from all.


Take a list of integers; remove both ends, then take absolute values, then Subtract one from each.


Take a list of integers; trim the edges, then turn negatives into positives, then Drop each by one.


Take a list of integers; trim one element off each end, then abs each element, then Decrease all values by one.


Take a list of integers; cut off the first and last, then take the absolute value of each, then Remove one from each value.


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


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


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


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


Take a list of integers; keep only numbers above 5, then replace an empty list with one zero, then filter out the negative ones.


Take a list of integers; exclude values of 5 and below, then zero it out if it's empty, then remove all negative values.


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


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


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


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


Take a list of integers; reverse the order, then make every value non-negative, then take values up to (excluding) the first zero.


Take a list of integers; reverse, then absolute value for all items, then keep the part before the first 0.


Take a list of integers; flip the list around, then take absolute values, then truncate at the first zero.


Take a list of integers; flip the order around, then turn negatives into positives, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then abs each element, then remove from the first zero onwards.


Take a list of integers; reverse that for me, then take the absolute value of each, then up to but not including the first zero.


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


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


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then replace an empty list with one zero.


Take a list of integers; take only what comes before the initial zero, then pad to 3, then zero it out if it's empty.


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then use zero if the list is empty.


Take a list of integers; cut off after the first zero appears, then pad to 3, then default to zero when empty.


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then if there's nothing, put in a zero.


Take a list of integers; keep the part before the first 0, then pad to 3, then if no items, add a zero.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then truncate to three items.


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


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then take the first three.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then keep first 3.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then truncate to first three.


Take a list of integers; sort by distance from zero, then get the negative numbers, then first three.


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


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


Take a list of integers; keep only the last three, then sort largest to smallest, then give the number of evens.


Take a list of integers; keep the final three items, then sort by descending values, then find how many values are divisible by two.


Take a list of integers; take the last three, then sort from highest to lowest, then how many are even.


Take a list of integers; trim to the last three, then sort descending, then get the total number of even values in the list.


Take a list of integers; last three only, then sort largest first, then give me the count of even values.


Take a list of integers; truncate to the last three items, then sort in descending order, then I need to know how many of these are even.


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


Take a list of integers; keep only the last three, then sort descending, then return how many values are even.


Take a list of integers; sort ascending, then flip the list around, then give the number of evens.


Take a list of integers; Sort it from low to high, then flip the order around, then find how many values are divisible by two.


Take a list of integers; arrange in increasing order, then put the elements backwards, then how many are even.


Take a list of integers; Organize these ascending, then reverse that for me, then get the total number of even values in the list.


Take a list of integers; Sort in ascending order, then flip it backwards, then give me the count of even values.


Take a list of integers; I need this sorted ascending, then make it backwards, then I need to know how many of these are even.


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


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


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


Take a list of integers; if blank use 0, then square them all, then take abs of each.


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


Take a list of integers; when the list is empty, substitute a zero value, then I need each number multiplied by itself, then apply absolute value to the whole list.


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


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


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


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


Take a list of integers; square each, then order by distance from zero, then count the elements.


Take a list of integers; each value squared, then sort based on absolute value, then how many items remain.


Take a list of integers; multiply each value by itself, then organize by magnitude, then tell me the length.


Take a list of integers; square them all, then arrange by absolute value ascending, then return the length.


Take a list of integers; raise each to the power of two, then sort from smallest to largest absolute value, then count them.


Take a list of integers; I need each number multiplied by itself, then sort by absolute value, then what's the count.


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


Take a list of integers; square each, then sort by absolute value, then return how many remain.


Take a list of strings; sort alphabetically, then keep only strings of length 3 or more, then deduplicate the strings.


Take a list of strings; arrange alphabetically, then get rid of short ones, then filter out duplicate strings retain first.


Take a list of strings; sort alphabetically, then remove strings with less than three characters, then strip duplicates preserve order.


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


Take a list of strings; sort alphabetically, then filter out short strings under three chars, then keep unique strings first appearance.


Take a list of strings; arrange alphabetically, then drop strings shorter than three characters, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; sort alphabetically, then drop strings shorter than three characters, then drop duplicate strings keeping the first.