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


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


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then any even.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then zero it out if it's empty, then any even.


Take a list of integers; drop the zeros, then use zero if the list is empty, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then any even.


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


Take a list of integers; drop the zeros, then if empty, use a single zero, then return whether any value is even.


Take a list of integers; keep the even numbers, then keep only odd values, then multiply each by -1.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then square them all, then check for zero.


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then check for zero.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then multiply each element by itself, then check for zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then square each, then return whether the list contains a zero.


Take a list of integers; pad with zeros to at least three elements, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then take abs of each.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then make them all positive.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then make every value non-negative.


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


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


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


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


Take a list of integers; double each, then truncate to three items, then keep only non-zero numbers.


Take a list of integers; times two for each item, then show the first three, then strip the zeros.


Take a list of integers; double each, then take the first three, then keep only non-zero numbers.


Take a list of integers; times two for each item, then keep first 3, then strip the zeros.


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


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


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


Take a list of integers; extract negatives, then square them all, then Discard the first element.


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


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


Take a list of integers; keep the negative numbers, then square all of them, then skip the first one.


Take a list of integers; extract negatives, then multiply each element by itself, then Discard the first element.


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


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


Take a list of integers; cap each value at 10, then keep values below zero, then true if already sorted smallest to largest.


Take a list of integers; clip values at 10, then get the negative numbers, then does this list go in ascending order.


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


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


Take a list of integers; cap each value at 10, then keep values below zero, then is it sorted.


Take a list of integers; clip values at 10, then get the negative numbers, then check if values are in increasing order.


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


Take a list of integers; cap each value at 10, then keep the negative numbers, then return whether the list is sorted ascending.


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then drop non-negative values.


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


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then drop non-negative values.


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


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then drop non-negative values.


Take a list of people records (name, age); extract age values, then take the last three, then drop all positive numbers.


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


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


Take a list of integers; subtract one from each, then multiply each by two, then shift each up by ten.


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


Take a list of integers; decrement each value, then multiply each by two, then add 10 to everything.


Take a list of integers; Lower each number by one, then double each item in the list, then give everything a boost of 10.


Take a list of integers; reduce each by one, then multiply each by two, then increment each by ten.


Take a list of integers; Subtract 1 from all, then double each item in the list, then add a constant 10 to each.


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


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


Take a list of integers; drop the first and last elements, then keep values below zero, then stop at the first non-positive value.


Take a list of integers; take out the first and last items, then get the negative numbers, then keep the leading run of positive numbers.


Take a list of integers; remove both ends, then keep values below zero, then take values while they are positive.


Take a list of integers; trim the edges, then get the negative numbers, then take positive values then stop.


Take a list of integers; trim one element off each end, then keep values below zero, then keep going while positive.


Take a list of integers; cut off the first and last, then get the negative numbers, then stop at first non positive.


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


Take a list of integers; drop the first and last elements, then keep the negative numbers, then take values while they are positive.


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


Take a list of integers; sort largest first, then double each item in the list, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then multiply each by two, then take values while they are positive.


Take a list of integers; sort from greatest to least, then double each item in the list, then take positive values then stop.


Take a list of integers; sort z to a, then multiply each by two, then keep going while positive.


Take a list of integers; arrange in decreasing order, then double each item in the list, then stop at first non positive.


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


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


Take a list of integers; add one to each, then keep values above zero, then drop non-negative values.


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


Take a list of integers; add one to each, then keep only positive numbers, then drop non-negative values.


Take a list of integers; make each one bigger, then keep the positives, then drop all positive numbers.


Take a list of integers; add one to each, then remove negatives, then drop non-negative values.


Take a list of integers; make each one bigger, then keep the positive numbers, then drop all positive numbers.


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


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


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


Take a list of integers; keep the final three items, then exclude zeros, then how many items remain.


Take a list of integers; take the last three, then remove all zero values, then tell me the length.


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


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


Take a list of integers; truncate to the last three items, then exclude zeros, then what's the count.


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


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


Take a list of integers; square each, then keep values divisible by 3, then strip the signs.


Take a list of integers; each value squared, then keep items where x mod 3 equals zero, then take abs of each.


Take a list of integers; multiply each value by itself, then drop anything not divisible by three, then get the absolute value of everything.


Take a list of integers; square them all, then filter out everything except multiples of three, then apply absolute value to the whole list.


Take a list of integers; raise each to the power of two, then keep only multiples of three, then make them all positive.


Take a list of integers; I need each number multiplied by itself, then multiples of three only, then make every value non-negative.


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


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


Take a list of integers; keep values greater than five, then keep values divisible by 3, then give the number of evens.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then how many are even.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then give me the count of even values.


Take a list of integers; filter to keep only values above 5, then multiples of three only, then I need to know how many of these are even.


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


Take a list of integers; keep values greater than five, then keep multiples of three, then return how many values are even.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then true if at least one even value.


Take a list of integers; odd numbers only, then pad to 3, then any even.


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


Take a list of integers; keep the odd numbers, then pad with zeros to at least three elements, then return whether any value is even.


Take a list of integers; drop the zeros, then keep values above zero, then give the number of evens.


Take a list of integers; keep only nonzero elements, then filter for positive numbers, then find how many values are divisible by two.


Take a list of integers; drop the zeros, then keep only positive numbers, then how many are even.


Take a list of integers; keep only nonzero elements, then keep the positives, then get the total number of even values in the list.


Take a list of integers; drop the zeros, then remove negatives, then give me the count of even values.


Take a list of integers; keep only nonzero elements, then keep the positive numbers, then I need to know how many of these are even.


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


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


Take a list of integers; take the absolute value of each, then order by distance from zero, then drop non-positive values.


Take a list of integers; convert to absolute value, then sort based on absolute value, then drop the negative numbers.


Take a list of integers; strip the signs, then organize by magnitude, then filter out the negative ones.


Take a list of integers; take abs of each, then arrange by absolute value ascending, then remove all negative values.


Take a list of integers; get the absolute value of everything, then sort from smallest to largest absolute value, then keep positive values only.


Take a list of integers; apply absolute value to the whole list, then sort by absolute value, then keep values above zero.


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


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


Take a list of integers; cap each value at 10, then multiply each by two, then remove the initial run of negative numbers.


Take a list of integers; clip values at 10, then double each item in the list, then strip the front negatives.


Take a list of integers; cap each value at 10, then multiply each by two, then remove leading negative numbers.


Take a list of integers; clip values at 10, then double each item in the list, then drop negatives from start.


Take a list of integers; cap each value at 10, then multiply each by two, then strip negative values from the start.


Take a list of integers; clip values at 10, then double each item in the list, then remove negatives before the first non-negative.


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


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


Take a list of integers; take values while they are positive, then make every value non-negative, then true if already sorted smallest to largest.


Take a list of integers; take positive values then stop, then absolute value for all items, then does this list go in ascending order.


Take a list of integers; keep going while positive, then take absolute values, then check if the list is in ascending order.


Take a list of integers; stop at first non positive, then turn negatives into positives, then is the list sorted.


Take a list of integers; take while greater than zero, then abs each element, then is it sorted.


Take a list of integers; take values while positive, then take the absolute value of each, 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 = [abs(x) for x in r]
    return r == sorted(r)


Take a list of integers; take values while they are positive, then take the absolute value of each, then return whether the list is sorted ascending.


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then sort largest to smallest, then arrange by magnitude ignoring sign.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values, then put them in order by magnitude.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then arrange in order of absolute value.


Take a list of integers; exclude values of 5 and below, then sort descending, then sort by distance from zero.


Take a list of integers; remove anything 5 or less, then sort largest first, then order by how far from zero.


Take a list of integers; filter to keep only values above 5, then sort in descending order, then order by distance from zero.


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


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


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


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


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


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


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


Take a list of integers; keep evens, then eliminate the even numbers, then up to but not including the first zero.


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


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


Take a list of integers; drop the first and last elements, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; take out the first and last items, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; remove both ends, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; trim the edges, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; trim one element off each end, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; cut off the first and last, then sort by absolute value, then fetch the first even element, default to 0.


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


Take a list of integers; drop the first and last elements, then sort by absolute value, then return the first even value (0 if none).


Take a list of integers; add one to each, then clamp each to at most ten, then drop the odd numbers.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then filter out the odd numbers.


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


Take a list of integers; add one to each, then cap each value at 10, then keep the even numbers.


Take a list of integers; keep only the first three, then clamp each to at most ten, then arrange by magnitude ignoring sign.


Take a list of integers; keep the first 3 items, then don't let anything exceed 10, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then clamp each to at most ten, then arrange in order of absolute value.


Take a list of integers; remove everything after the third, then don't let anything exceed 10, then sort by distance from zero.


Take a list of integers; truncate to three items, then clamp each to at most ten, then order by how far from zero.


Take a list of integers; show the first three, then don't let anything exceed 10, then order by distance from zero.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then take abs of each.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then get the absolute value of everything.


Take a list of integers; add zeros until the list has at least three values, then show the first three, then apply absolute value to the whole list.


Take a list of integers; pad with zeros to at least three elements, then take the first three, then make them all positive.


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then make every value non-negative.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values above zero, then drop the odd numbers.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove negatives, then drop the odd numbers.


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


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


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


Take a list of integers; take values while they are positive, then default to [0] when there is nothing, then strip the signs.


Take a list of integers; take positive values then stop, then when the list is empty, substitute a zero value, then take abs of each.


Take a list of integers; keep going while positive, then replace an empty list with one zero, then get the absolute value of everything.


Take a list of integers; stop at first non positive, then zero it out if it's empty, then apply absolute value to the whole list.


Take a list of integers; take while greater than zero, then use zero if the list is empty, then make them all positive.


Take a list of integers; take values while positive, then default to zero when empty, 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 = r if r else [0]
    r = [abs(x) for x in r]
    return r


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


Take a list of integers; take the absolute value of each, then remove all zero values, then reduce each by one.


Take a list of integers; convert to absolute value, then exclude zeros, then Subtract 1 from all.


Take a list of integers; strip the signs, then remove all zero values, then Subtract one from each.


Take a list of integers; take abs of each, then exclude zeros, then Drop each by one.


Take a list of integers; get the absolute value of everything, then remove all zero values, then Decrease all values by one.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then Remove one from each value.


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


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


Take a list of integers; if empty, use a single zero, then make every value non-negative, then true if any value equals zero.


Take a list of integers; if blank use 0, then absolute value for all items, then check for zero.


Take a list of integers; default to [0] when there is nothing, then take absolute values, then true if any value equals zero.


Take a list of integers; when the list is empty, substitute a zero value, then turn negatives into positives, then check for zero.


Take a list of integers; replace an empty list with one zero, then abs each element, then true if any value equals zero.


Take a list of integers; zero it out if it's empty, then take the absolute value of each, then check for zero.


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


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


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


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


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


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


Take a list of integers; put the elements backwards, then extend to length 3 using zeros, then Find the largest element, defaulting to zero.


Take a list of integers; reverse that for me, then pad to 3, then give the largest value (0 if none).


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


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


Take a list of integers; keep values greater than five, then take the final 3 elements, then arrange in increasing order.


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


Take a list of integers; keep only numbers above 5, then give me the last three elements, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then keep only the last three, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then keep the final three items, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then take the last three, then sort smallest to largest.


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


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


Take a list of integers; cap each value at 10, then skip negatives at the start, then drop the odd numbers.


Take a list of integers; clip values at 10, then remove all negatives at the front, then filter out the odd numbers.


Take a list of integers; cap each value at 10, then remove the initial run of negative numbers, then drop the odd numbers.


Take a list of integers; clip values at 10, then strip the front negatives, then filter out the odd numbers.


Take a list of integers; cap each value at 10, then remove leading negative numbers, then drop the odd numbers.


Take a list of integers; clip values at 10, then drop negatives from start, then filter out the odd numbers.


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


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


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


Take a list of integers; keep the first 3 items, then sort by descending values, then exclude values of 5 and below.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then remove anything 5 or less.


Take a list of integers; remove everything after the third, then sort descending, then filter to keep only values above 5.


Take a list of integers; truncate to three items, then sort largest first, then get rid of values that aren't greater than five.


Take a list of integers; show the first three, then sort in descending order, then drop anything 5 or below.


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


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


Take a list of integers; subtract one from each, then drop anything 5 or below, then raise each to the power of two.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then I need each number multiplied by itself.


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


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then multiply each element by itself.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then make each one squared.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then square each value in the list.


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


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


Take a list of integers; cap each value at 10, then make every value non-negative, then true if at least one even value.


Take a list of integers; clip values at 10, then absolute value for all items, then any even.


Take a list of integers; cap each value at 10, then take absolute values, then true if at least one even value.


Take a list of integers; clip values at 10, then turn negatives into positives, then any even.


Take a list of integers; cap each value at 10, then abs each element, then true if at least one even value.


Take a list of integers; clip values at 10, then take the absolute value of each, then any even.


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


Take a list of integers; cap each value at 10, then take the absolute value of each, then return whether any value is even.


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


Take a list of integers; convert to absolute value, then sort by descending values, then maximum of 10 for all.


Take a list of integers; strip the signs, then sort from highest to lowest, then limit every value to 10.


Take a list of integers; take abs of each, then sort descending, then maximum of 10 for all.


Take a list of integers; get the absolute value of everything, then sort largest first, then limit every value to 10.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then maximum of 10 for all.


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


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


Take a list of integers; sort by absolute value, then keep only odd values, then put the elements backwards.


Take a list of integers; rearrange by distance from zero, then eliminate the even numbers, then reverse that for me.


Take a list of integers; arrange by magnitude ignoring sign, then keep only odd values, then flip it backwards.


Take a list of integers; put them in order by magnitude, then eliminate the even numbers, then make it backwards.


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


Take a list of integers; sort by distance from zero, then eliminate the even numbers, then invert the sequence.


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


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


Take a list of integers; keep multiples of three, then keep the leading run of positive numbers, then arrange in decreasing order.


Take a list of integers; get rid of non-multiples of three, then take values while they are positive, then arrange in descending order.


Take a list of integers; keep values divisible by 3, then take positive values then stop, then reverse sort.


Take a list of integers; keep items where x mod 3 equals zero, then keep going while positive, then sort largest to smallest.


Take a list of integers; drop anything not divisible by three, then stop at first non positive, then sort by descending values.


Take a list of integers; filter out everything except multiples of three, then take while greater than zero, then sort from highest to lowest.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    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; keep multiples of three, then take values while they are positive, then sort descending.


Take a list of integers; square each, then drop anything 5 or below, then count the elements.


Take a list of integers; each value squared, then keep only numbers greater than 5, then how many items remain.


Take a list of integers; multiply each value by itself, then filter for numbers above 5, then tell me the length.


Take a list of integers; square them all, then give me values where x is greater than 5, then return the length.


Take a list of integers; raise each to the power of two, then show me only the values that are bigger than five, then count them.


Take a list of integers; I need each number multiplied by itself, then keep values greater than five, then what's the count.


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


Take a list of integers; square each, then keep values greater than five, then return how many remain.


Take a list of integers; cap each value at 10, then keep only odd values, then arrange in decreasing order.


Take a list of integers; clip values at 10, then eliminate the even numbers, then arrange in descending order.


Take a list of integers; cap each value at 10, then keep only odd values, then reverse sort.


Take a list of integers; clip values at 10, then eliminate the even numbers, then sort largest to smallest.


Take a list of integers; cap each value at 10, then keep only odd values, then sort by descending values.


Take a list of integers; clip values at 10, then eliminate the even numbers, then sort from highest to lowest.


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


Take a list of integers; cap each value at 10, then keep the odd numbers, then sort descending.


Take a list of integers; subtract one from each, then default to [0] when there is nothing, then put the elements backwards.


Take a list of integers; Decrement all items, then when the list is empty, substitute a zero value, then reverse that for me.


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


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


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


Take a list of integers; Subtract 1 from all, then default to zero when empty, then invert the sequence.


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


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


Take a list of integers; keep values greater than five, then flip the sign of each, then find the max, defaulting to 0.


Take a list of integers; filter out values less than or equal to 5, then turn positives to negatives and vice versa, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep only numbers above 5, then flip the sign of each, then What's the highest number in the list.


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then Return the greatest value or default to 0.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then Find the largest element, defaulting to zero.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then give the largest value (0 if none).


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


Take a list of integers; keep values greater than five, then negate each, then return the maximum (0 if empty).


Take a list of integers; pad with zeros to at least three elements, then order by distance from zero, then true if any value equals zero.


Take a list of integers; add zeros until the list has at least three values, then sort based on absolute value, then check for zero.


Take a list of integers; pad with zeros to at least three elements, then organize by magnitude, then true if any value equals zero.


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


Take a list of integers; pad with zeros to at least three elements, then sort from smallest to largest absolute value, then true if any value equals zero.


Take a list of integers; add zeros until the list has at least three values, then sort by absolute value, then check for zero.


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


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


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


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then drop the negative numbers.


Take a list of integers; decrement each value, then filter for numbers above 5, then filter out the negative ones.


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


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


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


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


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


Take a list of integers; square each, then clamp each to at most ten, then give the number of evens.


Take a list of integers; each value squared, then don't let anything exceed 10, then find how many values are divisible by two.


Take a list of integers; multiply each value by itself, then clamp each to at most ten, then how many are even.


Take a list of integers; square them all, then don't let anything exceed 10, then get the total number of even values in the list.


Take a list of integers; raise each to the power of two, then clamp each to at most ten, then give me the count of even values.


Take a list of integers; I need each number multiplied by itself, then don't let anything exceed 10, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then remove the first item, then true if every value is unique.


Take a list of integers; Sort it from low to high, then Remove head, then check for duplicates in the values.


Take a list of integers; arrange in increasing order, then remove the first item, then do all values appear only once.


Take a list of integers; Organize these ascending, then Remove head, then check that there are no duplicates.


Take a list of integers; Sort in ascending order, then remove the first item, then are the values all unique.


Take a list of integers; I need this sorted ascending, then Remove head, then check if all values are unique.


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


Take a list of integers; sort ascending, then drop the first element, then return whether all values are distinct.


Take a list of integers; sort descending, then make every value non-negative, then reduce each by one.


Take a list of integers; sort largest first, then absolute value for all items, then Subtract 1 from all.


Take a list of integers; sort in descending order, then take absolute values, then Subtract one from each.


Take a list of integers; sort from greatest to least, then turn negatives into positives, then Drop each by one.


Take a list of integers; sort z to a, then abs each element, then Decrease all values by one.


Take a list of integers; arrange in decreasing order, then take the absolute value of each, then Remove one from each value.


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


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


Take a list of people records (name, age); extract the ages, then sort largest to smallest, then limit every value to 10.


Take a list of people records (name, age); show me all ages, then sort by descending values, then maximum of 10 for all.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest, then limit every value to 10.


Take a list of people records (name, age); get the age field, then sort descending, then maximum of 10 for all.


Take a list of people records (name, age); keep just each person's age, then sort largest first, then limit every value to 10.


Take a list of people records (name, age); extract age values, then sort in descending order, then maximum of 10 for all.


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


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


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


Take a list of integers; times two for each item, then eliminate the even numbers, then Organize these ascending.


Take a list of integers; double each, then keep only odd values, then Sort in ascending order.


Take a list of integers; times two for each item, then eliminate the even numbers, then I need this sorted ascending.


Take a list of integers; double each, then keep only odd values, then Put these in ascending order.


Take a list of integers; times two for each item, then eliminate the even numbers, then sort smallest to largest.


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


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


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


Take a list of integers; reverse the signs of everything, then keep only numbers greater than 5, then remove repeats.


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


Take a list of integers; reverse the signs of everything, then give me values where x is greater than 5, then remove repeats.


Take a list of integers; negate each, then show me only the values that are bigger than five, then deduplicate the list.


Take a list of integers; reverse the signs of everything, then keep values greater than five, then remove repeats.


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


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


Take a list of integers; add one to each, then sort largest to smallest, then stop at the first non-positive value.


Take a list of integers; make each one bigger, then sort by descending values, then keep the leading run of positive numbers.


Take a list of integers; add one to each, then sort from highest to lowest, then take values while they are positive.


Take a list of integers; make each one bigger, then sort descending, then take positive values then stop.


Take a list of integers; add one to each, then sort largest first, then keep going while positive.


Take a list of integers; make each one bigger, then sort in descending order, then stop at first non positive.


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


Take a list of integers; add one to each, then sort descending, then take values while they are positive.


Take a list of integers; keep everything before the first zero, then order by distance from zero, then truncate to the last three items.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then show only the last three.


Take a list of integers; cut the list at the first zero, then organize by magnitude, then remove all but the last three.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then take the final 3 elements.


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then drop everything except the final three.


Take a list of integers; keep the part before the first 0, then sort by absolute value, then give me the last three elements.


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


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


Take a list of strings; sort by length, shortest first, then strip spaces around each string, then count characters across all strings.


Take a list of strings; sort ascending by length, then remove leading and trailing spaces, then character count.


Take a list of strings; order strings from shortest to longest, then remove whitespace from each item, then count all the characters.


Take a list of strings; shortest to longest, then clean whitespace from each entry, then total number of characters.


Take a list of strings; arrange by string length ascending, then trim each string, then what's the total character count.


Take a list of strings; length sort, then trim whitespace from each, then add up the lengths.


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


Take a list of strings; sort by length, shortest first, then trim whitespace from each, then return the total number of characters.


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


Take a list of integers; take positive values then stop, then double each item in the list, then keep the part before the first 0.


Take a list of integers; keep going while positive, then multiply each by two, then truncate at the first zero.


Take a list of integers; stop at first non positive, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; take while greater than zero, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; take values while positive, then double each item in the list, then up to but not including the first zero.


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


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


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


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


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


Take a list of integers; make each one bigger, then extract all even numbers, then calculate the sum of all elements.


Take a list of integers; add one to each, then keep only even values, then what's the total.


Take a list of integers; make each one bigger, then extract all even numbers, then what do they add up to.


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


Take a list of integers; add one to each, then keep the even numbers, then return their sum.


Take a list of integers; double each, then keep the leading run of positive numbers, then bump each up by one.


Take a list of integers; times two for each item, then take values while they are positive, then increment each item.


Take a list of integers; double each, then take positive values then stop, then bump each up by one.


Take a list of integers; times two for each item, then keep going while positive, then increment each item.


Take a list of integers; double each, then stop at first non positive, then bump each up by one.


Take a list of integers; times two for each item, then take while greater than zero, then increment each item.


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


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


Take a list of integers; add ten to each, then keep the leading run of positive numbers, then arrange in decreasing order.


Take a list of integers; bump everything up by 10, then take values while they are positive, then arrange in descending order.


Take a list of integers; increase every value by 10, then take positive values then stop, then reverse sort.


Take a list of integers; add 10 to each item, then keep going while positive, then sort largest to smallest.


Take a list of integers; shift each up by ten, then stop at first non positive, then sort by descending values.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then sort from highest to lowest.


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in 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; add ten to each, then take values while they are positive, then sort descending.


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


Take a list of integers; Take everything except the first, then exclude zeros, then zero it out if it's empty.


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


Take a list of integers; Take everything except the first, then exclude zeros, then default to zero when empty.


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


Take a list of integers; Take everything except the first, then exclude zeros, then if no items, add a zero.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; Sort it from low to high, then pad to 3, then maximum of 10 for all.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; Organize these ascending, then pad to 3, then maximum of 10 for all.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; I need this sorted ascending, then pad to 3, then maximum of 10 for all.


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


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


Take a list of integers; keep the odd numbers, then flip the list around, then truncate to three items.


Take a list of integers; odd numbers only, then flip the order around, then show the first three.


Take a list of integers; keep the odd numbers, then put the elements backwards, then take the first three.


Take a list of integers; odd numbers only, then reverse that for me, then keep first 3.


Take a list of integers; keep the odd numbers, then flip it backwards, then truncate to first three.


Take a list of integers; odd numbers only, then make it backwards, then first three.


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


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


Take a list of integers; keep multiples of three, then flip the list around, then drop the odd numbers.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then filter out the odd numbers.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then drop the odd numbers.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then filter out the odd numbers.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then drop the odd numbers.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then filter out the odd numbers.


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


Take a list of integers; keep multiples of three, then reverse the order, then keep the even numbers.


Take a list of integers; reverse the order, then keep values below zero, then trim one element off each end.


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


Take a list of integers; flip the list around, then keep values below zero, then remove the first and last elements.


Take a list of integers; flip the order around, then get the negative numbers, then keep only the middle part.


Take a list of integers; put the elements backwards, then keep values below zero, then drop first and last.


Take a list of integers; reverse that for me, then get the negative numbers, then eliminate the outermost elements.


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


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


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


Take a list of integers; keep evens, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; keep the even numbers, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; keep evens, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; keep the even numbers, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; keep evens, then sort ascending, then drop anything 5 or below.


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


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


Take a list of integers; negate each, then increase every value by 10, then remove the initial run of negative numbers.


Take a list of integers; reverse the signs of everything, then add 10 to each item, then strip the front negatives.


Take a list of integers; negate each, then shift each up by ten, then remove leading negative numbers.


Take a list of integers; reverse the signs of everything, then increase all numbers by 10, then drop negatives from start.


Take a list of integers; negate each, then add 10 to everything, then strip negative values from the start.


Take a list of integers; reverse the signs of everything, then give everything a boost of 10, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [-x for x in r]
    r = [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; negate each, then add ten to each, then drop the leading negative values.


Take a list of integers; add one to each, then make every value non-negative, then drop the even numbers.


Take a list of integers; make each one bigger, then absolute value for all items, then strip out the evens.


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


Take a list of integers; make each one bigger, then turn negatives into positives, then strip out the evens.


Take a list of integers; add one to each, then abs each element, then drop the even numbers.


Take a list of integers; make each one bigger, then take the absolute value of each, then strip out the evens.


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


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


Take a list of strings; sort alphabetically, then keep only strings of length 3 or more, then remove surrounding whitespace.


Take a list of strings; arrange alphabetically, then get rid of short ones, then trim the whitespace off everything.


Take a list of strings; sort alphabetically, then remove strings with less than three characters, then strip spaces from all strings.


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


Take a list of strings; sort alphabetically, then filter out short strings under three chars, then clean up whitespace in the list.


Take a list of strings; arrange alphabetically, then drop strings shorter than three characters, then strip spaces around each string.


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


Take a list of strings; sort alphabetically, then drop strings shorter than three characters, then trim whitespace from each.


Take a list of integers; double each, then sort smallest to largest, then give the number of evens.


Take a list of integers; times two for each item, then Ascending sort, then find how many values are divisible by two.


Take a list of integers; double each, then Sort this ascending, then how many are even.


Take a list of integers; times two for each item, then Sort lowest to highest, then get the total number of even values in the list.


Take a list of integers; double each, then Arrange from smallest to largest, then give me the count of even values.


Take a list of integers; times two for each item, then sort ascending, then I need to know how many of these are even.


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


Take a list of integers; double each, then sort ascending, then return how many values are even.


Take a list of integers; square each, then keep only odd values, then true if any value equals zero.


Take a list of integers; each value squared, then eliminate the even numbers, then check for zero.


Take a list of integers; multiply each value by itself, then keep only odd values, then true if any value equals zero.


Take a list of integers; square them all, then eliminate the even numbers, then check for zero.


Take a list of integers; raise each to the power of two, then keep only odd values, then true if any value equals zero.


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


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


Take a list of integers; square each, then keep the odd numbers, then return whether the list contains a zero.


Take a list of integers; drop the leading negative values, then multiply each value by itself, then true only if all are positive.


Take a list of integers; cut the leading negatives, then square them all, then do all of these have positive values.


Take a list of integers; skip negatives at the start, then raise each to the power of two, then check if every value is positive.


Take a list of integers; remove all negatives at the front, then I need each number multiplied by itself, then confirm all values are positive.


Take a list of integers; remove the initial run of negative numbers, then square all of them, then all positive.


Take a list of integers; strip the front negatives, then multiply each element by itself, then check if every number is above zero.


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


Take a list of integers; drop the leading negative values, then square each, then return whether all values are positive.


Take a list of integers; reverse the order, then flip the sign of each, then drop non-negative values.


Take a list of integers; reverse, then turn positives to negatives and vice versa, then drop all positive numbers.


Take a list of integers; flip the list around, then flip the sign of each, then drop non-negative values.


Take a list of integers; flip the order around, then turn positives to negatives and vice versa, then drop all positive numbers.


Take a list of integers; put the elements backwards, then flip the sign of each, then drop non-negative values.


Take a list of integers; reverse that for me, then turn positives to negatives and vice versa, then drop all positive numbers.


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


Take a list of integers; reverse the order, then negate each, then keep the negative numbers.


Take a list of integers; sort by absolute value, then keep only even values, then keep only numbers above 5.


Take a list of integers; rearrange by distance from zero, then extract all even numbers, then exclude values of 5 and below.


Take a list of integers; arrange by magnitude ignoring sign, then keep only even values, then remove anything 5 or less.


Take a list of integers; put them in order by magnitude, then extract all even numbers, then filter to keep only values above 5.


Take a list of integers; arrange in order of absolute value, then keep only even values, then get rid of values that aren't greater than five.


Take a list of integers; sort by distance from zero, then extract all even numbers, then drop anything 5 or below.


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


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


Take a list of integers; keep the even numbers, then keep values divisible by 3, then put the elements backwards.


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


Take a list of integers; keep the even numbers, then drop anything not divisible by three, then flip it backwards.


Take a list of integers; keep evens, then filter out everything except multiples of three, then make it backwards.


Take a list of integers; keep the even numbers, then keep only multiples of three, then reverse the list.


Take a list of integers; keep evens, then multiples of three only, then invert the sequence.


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


Take a list of integers; keep the even numbers, then keep multiples of three, then reverse the order.


Take a list of integers; drop the zeros, then flip the list around, then skip the first one.


Take a list of integers; keep only nonzero elements, then flip the order around, then Discard the first element.


Take a list of integers; drop the zeros, then put the elements backwards, then skip the first one.


Take a list of integers; keep only nonzero elements, then reverse that for me, then Discard the first element.


Take a list of integers; drop the zeros, then flip it backwards, then skip the first one.


Take a list of integers; keep only nonzero elements, then make it backwards, then Discard the first element.


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


Take a list of integers; drop the zeros, then reverse the order, then drop the first element.


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


Take a list of integers; rearrange by distance from zero, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; arrange by magnitude ignoring sign, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; put them in order by magnitude, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


Take a list of integers; sort by distance from zero, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


Take a list of integers; take the absolute value of each, then cut the list at the first zero, then find the max, defaulting to 0.


Take a list of integers; convert to absolute value, then cut off after the first zero appears, then Give me the maximum, but 0 if there are no items.


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


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


Take a list of integers; get the absolute value of everything, then truncate at the first zero, then Find the largest element, defaulting to zero.


Take a list of integers; apply absolute value to the whole list, then delete everything starting with the first zero, then give the largest value (0 if none).


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


Take a list of integers; take the absolute value of each, then keep everything before the first zero, then return the maximum (0 if empty).


Take a list of integers; cap each value at 10, then default to [0] when there is nothing, then truncate to the last three items.


Take a list of integers; clip values at 10, then when the list is empty, substitute a zero value, then show only the last three.


Take a list of integers; cap each value at 10, then replace an empty list with one zero, then remove all but the last three.


Take a list of integers; clip values at 10, then zero it out if it's empty, then take the final 3 elements.


Take a list of integers; cap each value at 10, then use zero if the list is empty, then drop everything except the final three.


Take a list of integers; clip values at 10, then default to zero when empty, then give me the last three elements.


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


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


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


Take a list of integers; get rid of non-multiples of three, then flip the order around, then Subtract 1 from all.


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


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


Take a list of integers; drop anything not divisible by three, then flip it backwards, then Decrease all values by one.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then Remove one from each value.


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


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


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


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


Take a list of integers; add one to each, then Sort this ascending, then take the first three.


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


Take a list of integers; add one to each, then Arrange from smallest to largest, then truncate to first three.


Take a list of integers; make each one bigger, then sort ascending, then first three.


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


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


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then drop non-negative values.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then drop all positive numbers.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then drop non-negative values.


Take a list of people records (name, age); get the age field, then strip the front negatives, then drop all positive numbers.


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


Take a list of people records (name, age); extract age values, then drop negatives from start, then drop all positive numbers.


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


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


Take a list of integers; drop the first and last elements, then remove all zero values, then put the elements backwards.


Take a list of integers; take out the first and last items, then exclude zeros, then reverse that for me.


Take a list of integers; remove both ends, then remove all zero values, then flip it backwards.


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


Take a list of integers; trim one element off each end, then remove all zero values, then reverse the list.


Take a list of integers; cut off the first and last, then exclude zeros, then invert the sequence.


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


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


Take a list of integers; keep values greater than five, then increase every value by 10, then stop at the first non-positive value.


Take a list of integers; filter out values less than or equal to 5, then add 10 to each item, then keep the leading run of positive numbers.


Take a list of integers; keep only numbers above 5, then shift each up by ten, then take values while they are positive.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then take positive values then stop.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then keep going while positive.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    r = [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 values greater than five, then add ten to each, then take values while they are positive.


Take a list of integers; square each, then keep values divisible by 3, then shift each up by ten.


Take a list of integers; each value squared, then keep items where x mod 3 equals zero, then increase all numbers by 10.


Take a list of integers; multiply each value by itself, then drop anything not divisible by three, then add 10 to everything.


Take a list of integers; square them all, then filter out everything except multiples of three, then give everything a boost of 10.


Take a list of integers; raise each to the power of two, then keep only multiples of three, then increment each by ten.


Take a list of integers; I need each number multiplied by itself, then multiples of three only, then add a constant 10 to each.


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


Take a list of integers; square each, then keep multiples of three, then add ten to each.


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


Take a list of integers; take positive values then stop, then Remove head, then check for zero.


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


Take a list of integers; stop at first non positive, then Remove head, then check for zero.


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


Take a list of integers; take values while positive, then Remove head, then check for zero.


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


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


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


Take a list of integers; cut the leading negatives, then exclude zeros, then check for zero.


Take a list of integers; skip negatives at the start, then remove all zero values, then true if any value equals zero.


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


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


Take a list of integers; strip the front negatives, then exclude zeros, then check for zero.


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


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


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


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


Take a list of integers; flip the list around, then clamp each to at most ten, then tell me the length.


Take a list of integers; flip the order around, then don't let anything exceed 10, then return the length.


Take a list of integers; put the elements backwards, then clamp each to at most ten, then count them.


Take a list of integers; reverse that for me, then don't let anything exceed 10, then what's the count.


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


Take a list of integers; reverse the order, then cap each value at 10, then return how many remain.


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


Take a list of integers; sort largest first, then unique values preserving order, then strip the front negatives.


Take a list of integers; sort in descending order, then remove repeated values, then remove leading negative numbers.


Take a list of integers; sort from greatest to least, then unique values preserving order, then drop negatives from start.


Take a list of integers; sort z to a, then remove repeated values, then strip negative values from the start.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then drop anything not divisible by three.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then filter out everything except multiples of three.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then keep only multiples of three.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then multiples of three only.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then filter for numbers divisible by three.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then give me only the values divisible by three.


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


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


Take a list of integers; keep the negative numbers, then flip the sign of each, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; keep multiples of three, then extend to length 3 using zeros, then find the min, defaulting to 0.


Take a list of integers; get rid of non-multiples of three, then pad to 3, then minimum value, zero otherwise.


Take a list of integers; keep values divisible by 3, then extend to length 3 using zeros, then get the minimum value or zero if empty.


Take a list of integers; keep items where x mod 3 equals zero, then pad to 3, then give me the min or 0.


Take a list of integers; drop anything not divisible by three, then extend to length 3 using zeros, then return the smallest number, defaulting to 0.


Take a list of integers; filter out everything except multiples of three, then pad to 3, then return smallest or zero if empty.


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


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


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


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


Take a list of integers; decrement each value, then remove the first item, then how many are even.


Take a list of integers; Lower each number by one, then Remove head, then get the total number of even values in the list.


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


Take a list of integers; Subtract 1 from all, then Remove head, then I need to know how many of these are even.


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


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


Take a list of integers; take values while they are positive, then multiply each value by itself, then skip the first one.


Take a list of integers; take positive values then stop, then square them all, then Discard the first element.


Take a list of integers; keep going while positive, then raise each to the power of two, then skip the first one.


Take a list of integers; stop at first non positive, then I need each number multiplied by itself, then Discard the first element.


Take a list of integers; take while greater than zero, then square all of them, then skip the first one.


Take a list of integers; take values while positive, then multiply each element by itself, then Discard the first element.


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


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


Take a list of integers; add ten to each, then keep values divisible by 3, then limit every value to 10.


Take a list of integers; bump everything up by 10, then keep items where x mod 3 equals zero, then maximum of 10 for all.


Take a list of integers; increase every value by 10, then drop anything not divisible by three, then limit every value to 10.


Take a list of integers; add 10 to each item, then filter out everything except multiples of three, then maximum of 10 for all.


Take a list of integers; shift each up by ten, then keep only multiples of three, then limit every value to 10.


Take a list of integers; increase all numbers by 10, then multiples of three only, then maximum of 10 for all.


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


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


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


Take a list of people records (name, age); show me all ages, then unique values preserving order, then keep the part before the first 0.


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


Take a list of people records (name, age); get the age field, then unique values preserving order, then delete everything starting with the first zero.


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


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


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


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


Take a list of integers; drop the first element, then remove both ends, then arrange by magnitude ignoring sign.


Take a list of integers; Take everything except the first, then trim the edges, then put them in order by magnitude.


Take a list of integers; drop the first element, then trim one element off each end, then arrange in order of absolute value.


Take a list of integers; Take everything except the first, then cut off the first and last, then sort by distance from zero.


Take a list of integers; drop the first element, then remove the first and last elements, then order by how far from zero.


Take a list of integers; Take everything except the first, then keep only the middle part, then order by distance from zero.


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


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


Take a list of integers; if empty, use a single zero, then flip the sign of each, then deduplicate the list.


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then remove repeats.


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


Take a list of integers; when the list is empty, substitute a zero value, then turn positives to negatives and vice versa, then remove repeats.


Take a list of integers; replace an empty list with one zero, then flip the sign of each, then deduplicate the list.


Take a list of integers; zero it out if it's empty, then turn positives to negatives and vice versa, then remove repeats.


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


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


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


Take a list of integers; get rid of non-multiples of three, then square them all, then drop the negative numbers.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then filter out the negative ones.


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


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


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then keep values above zero.


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


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


Take a list of integers; take the absolute value of each, then increase every value by 10, then ensure at least three items by appending zeros.


Take a list of integers; convert to absolute value, then add 10 to each item, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; strip the signs, then shift each up by ten, then ensure at least three items by appending zeros.


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


Take a list of integers; get the absolute value of everything, then add 10 to everything, then ensure at least three items by appending zeros.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort by absolute value, then decrement each value, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then Lower each number by one, then check for duplicates in the values.


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


Take a list of integers; put them in order by magnitude, then Subtract 1 from all, then check that there are no duplicates.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then decrement each value, then shift each up by ten.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each, then increment each by ten.


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


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


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


Take a list of integers; double each, then remove all zero values, then trim one element off each end.


Take a list of integers; times two for each item, then exclude zeros, then cut off the first and last.


Take a list of integers; double each, then remove all zero values, then remove the first and last elements.


Take a list of integers; times two for each item, then exclude zeros, then keep only the middle part.


Take a list of integers; double each, then remove all zero values, then drop first and last.


Take a list of integers; times two for each item, then exclude zeros, then eliminate the outermost elements.


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


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


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


Take a list of integers; keep the first 3 items, then absolute value for all items, then how many items remain.


Take a list of integers; take the first 3 elements, then take absolute values, then tell me the length.


Take a list of integers; remove everything after the third, then turn negatives into positives, then return the length.


Take a list of integers; truncate to three items, then abs each element, then count them.


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


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


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


Take a list of integers; sort descending, then extend to length 3 using zeros, then shift each up by ten.


Take a list of integers; sort largest first, then pad to 3, then increase all numbers by 10.


Take a list of integers; sort in descending order, then extend to length 3 using zeros, then add 10 to everything.


Take a list of integers; sort from greatest to least, then pad to 3, then give everything a boost of 10.


Take a list of integers; sort z to a, then extend to length 3 using zeros, then increment each by ten.


Take a list of integers; arrange in decreasing order, then pad to 3, then add a constant 10 to each.


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


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


Take a list of integers; take the absolute value of each, then sort largest to smallest, then reduce each by one.


Take a list of integers; convert to absolute value, then sort by descending values, then Subtract 1 from all.