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


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then give me the last three elements.


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


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


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


Take a list of integers; keep the first 3 items, then drop everything except the final three, then filter out everything except multiples of three.


Take a list of integers; take the first 3 elements, then give me the last three elements, then keep only multiples of three.


Take a list of integers; remove everything after the third, then keep only the last three, then multiples of three only.


Take a list of integers; truncate to three items, then keep the final three items, then filter for numbers divisible by three.


Take a list of integers; show the first three, then take the last three, then give me only the values divisible by three.


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


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


Take a list of people records (name, age); extract the names, then strip spaces around each string, then reduce each string to its first character.


Take a list of people records (name, age); Give me the names, then remove leading and trailing spaces, then take first char drop blanks.


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


Take a list of people records (name, age); Grab the names, then clean whitespace from each entry, then first letter from each item that isn't empty.


Take a list of people records (name, age); keep just each person's name, then trim each string, then grab the first char from each.


Take a list of people records (name, age); List the names, then trim whitespace from each, then isolate the first character per entry.


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


Take a list of people records (name, age); extract the names, then trim whitespace from each, then keep the first character of each (dropping empties).


Take a list of integers; sort descending, then default to [0] when there is nothing, then drop the even numbers.


Take a list of integers; sort largest first, then when the list is empty, substitute a zero value, then strip out the evens.


Take a list of integers; sort in descending order, then replace an empty list with one zero, then drop the even numbers.


Take a list of integers; sort from greatest to least, then zero it out if it's empty, then strip out the evens.


Take a list of integers; sort z to a, then use zero if the list is empty, then drop the even numbers.


Take a list of integers; arrange in decreasing order, then default to zero when empty, then strip out the evens.


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


Take a list of integers; sort descending, then if empty, use a single zero, then keep the odd numbers.


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


Take a list of integers; extract negatives, then Remove head, then keep the part before the first 0.


Take a list of integers; keep the negative numbers, then remove the first item, then truncate at the first zero.


Take a list of integers; extract negatives, then Remove head, then delete everything starting with the first zero.


Take a list of integers; keep the negative numbers, then remove the first item, then remove from the first zero onwards.


Take a list of integers; extract negatives, then Remove head, then up to but not including the first zero.


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


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


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


Take a list of integers; clip values at 10, then take values while they are positive, then drop all positive numbers.


Take a list of integers; cap each value at 10, then take positive values then stop, then drop non-negative values.


Take a list of integers; clip values at 10, then keep going while positive, then drop all positive numbers.


Take a list of integers; cap each value at 10, then stop at first non positive, then drop non-negative values.


Take a list of integers; clip values at 10, then take while greater than zero, then drop all positive 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 < 0]
    return r


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


Take a list of integers; keep multiples of three, then remove repeated values, then true if already sorted smallest to largest.


Take a list of integers; get rid of non-multiples of three, then unique values preserving order, then does this list go in ascending order.


Take a list of integers; keep values divisible by 3, then remove repeated values, then check if the list is in ascending order.


Take a list of integers; keep items where x mod 3 equals zero, then unique values preserving order, then is the list sorted.


Take a list of integers; drop anything not divisible by three, then remove repeated values, then is it sorted.


Take a list of integers; filter out everything except multiples of three, then unique values preserving order, then check if values are in increasing order.


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


Take a list of integers; keep multiples of three, then drop duplicates keeping first occurrence, then return whether the list is sorted ascending.


Take a list of integers; take the absolute value of each, then extend to length 3 using zeros, then remove the initial run of negative numbers.


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


Take a list of integers; strip the signs, then extend to length 3 using zeros, then remove leading negative numbers.


Take a list of integers; take abs of each, then pad to 3, then drop negatives from start.


Take a list of integers; get the absolute value of everything, then extend to length 3 using zeros, then strip negative values from the start.


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


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


Take a list of integers; take the absolute value of each, then pad with zeros to at least three elements, then drop the leading negative values.


Take a list of integers; keep values greater than five, then keep values above zero, then multiply each by -1.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then negate.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then multiply each by -1.


Take a list of integers; exclude values of 5 and below, then keep the positives, then negate.


Take a list of integers; remove anything 5 or less, then remove negatives, then multiply each by -1.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers, then negate.


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


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


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


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


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


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


Take a list of integers; square each, then multiply each by two, then give back the total.


Take a list of integers; each value squared, then double each item in the list, then sum r.


Take a list of integers; multiply each value by itself, then multiply each by two, then add them up.


Take a list of integers; square them all, then double each item in the list, then calculate the sum of all elements.


Take a list of integers; raise each to the power of two, then multiply each by two, then what's the total.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then what do they add up to.


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


Take a list of integers; square each, then double each, then return their sum.


Take a list of integers; square each, then order by distance from zero, then skip the first one.


Take a list of integers; each value squared, then sort based on absolute value, then Discard the first element.


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


Take a list of integers; square them all, then arrange by absolute value ascending, then Discard the first element.


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


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then strip out the evens.


Take a list of integers; keep values divisible by 3, then multiply each by two, then drop the even numbers.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then strip out the evens.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then drop the even numbers.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then strip out the evens.


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


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


Take a list of integers; subtract one from each, then multiply each by two, then trim one element off each end.


Take a list of integers; Decrement all items, then double each item in the list, then cut off the first and last.


Take a list of integers; decrement each value, then multiply each by two, then remove the first and last elements.


Take a list of integers; Lower each number by one, then double each item in the list, then keep only the middle part.


Take a list of integers; reduce each by one, then multiply each by two, then drop first and last.


Take a list of integers; Subtract 1 from all, then double each item in the list, then eliminate the outermost elements.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; sort ascending, then keep values divisible by 3, then take values up to (excluding) the first zero.


Take a list of integers; Sort it from low to high, then keep items where x mod 3 equals zero, then keep the part before the first 0.


Take a list of integers; arrange in increasing order, then drop anything not divisible by three, then truncate at the first zero.


Take a list of integers; Organize these ascending, then filter out everything except multiples of three, then delete everything starting with the first zero.


Take a list of integers; Sort in ascending order, then keep only multiples of three, then remove from the first zero onwards.


Take a list of integers; I need this sorted ascending, then multiples of three only, then up to but not including the first zero.


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


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


Take a list of integers; drop the first and last elements, then sort smallest to largest, then stop at the first non-positive value.


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


Take a list of integers; remove both ends, then Sort this ascending, then take values while they are positive.


Take a list of integers; trim the edges, then Sort lowest to highest, then take positive values then stop.


Take a list of integers; trim one element off each end, then Arrange from smallest to largest, then keep going while positive.


Take a list of integers; cut off the first and last, then sort ascending, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = sorted(r)
    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 sort ascending, then take values while they are positive.


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


Take a list of integers; reverse, then sort by descending values, then filter out the odd numbers.


Take a list of integers; flip the list around, then sort from highest to lowest, then drop the odd numbers.


Take a list of integers; flip the order around, then sort descending, then filter out the odd numbers.


Take a list of integers; put the elements backwards, then sort largest first, then drop the odd numbers.


Take a list of integers; reverse that for me, then sort in descending order, then filter out the odd numbers.


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


Take a list of integers; reverse the order, then sort descending, then keep the even numbers.


Take a list of integers; sort descending, then make every value non-negative, then stop at the first non-positive value.


Take a list of integers; sort largest first, then absolute value for all items, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then take absolute values, then take values while they are positive.


Take a list of integers; sort from greatest to least, then turn negatives into positives, then take positive values then stop.


Take a list of integers; sort z to a, then abs each element, then keep going while positive.


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


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


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


Take a list of integers; keep everything before the first zero, then take the final 3 elements, then give back the product of all values.


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


Take a list of integers; cut the list at the first zero, then give me the last three elements, then what's the product.


Take a list of integers; cut off after the first zero appears, then keep only the last three, then what do they multiply to.


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


Take a list of integers; keep the part before the first 0, then take the last three, then multiply them all together.


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


Take a list of integers; keep everything before the first zero, then keep only the last three, then return their product.


Take a list of integers; pad with zeros to at least three elements, then keep values above zero, then raise each to the power of two.


Take a list of integers; add zeros until the list has at least three values, then filter for positive numbers, then I need each number multiplied by itself.


Take a list of integers; pad with zeros to at least three elements, then keep only positive numbers, then square all of them.


Take a list of integers; add zeros until the list has at least three values, then keep the positives, then multiply each element by itself.


Take a list of integers; pad with zeros to at least three elements, then remove negatives, then make each one squared.


Take a list of integers; add zeros until the list has at least three values, then keep the positive numbers, then square each value in the list.


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


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


Take a list of integers; take values while they are positive, then clamp each to at most ten, then true if any value equals zero.


Take a list of integers; take positive values then stop, then don't let anything exceed 10, then check for zero.


Take a list of integers; keep going while positive, then clamp each to at most ten, then true if any value equals zero.


Take a list of integers; stop at first non positive, then don't let anything exceed 10, then check for zero.


Take a list of integers; take while greater than zero, then clamp each to at most ten, then true if any value equals zero.


Take a list of integers; take values while positive, then don't let anything exceed 10, 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 = [min(x, 10) for x in r]
    return 0 in r


Take a list of integers; take values while they are positive, then cap each value at 10, then return whether the list contains a zero.


Take a list of integers; negate each, then remove both ends, then shift each up by ten.


Take a list of integers; reverse the signs of everything, then trim the edges, then increase all numbers by 10.


Take a list of integers; negate each, then trim one element off each end, then add 10 to everything.


Take a list of integers; reverse the signs of everything, then cut off the first and last, then give everything a boost of 10.


Take a list of integers; negate each, then remove the first and last elements, then increment each by ten.


Take a list of integers; reverse the signs of everything, then keep only the middle part, then add a constant 10 to each.


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


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


Take a list of integers; drop the leading negative values, then clamp each to at most ten, then make each twice as big.


Take a list of integers; cut the leading negatives, then don't let anything exceed 10, then multiply each by 2.


Take a list of integers; skip negatives at the start, then clamp each to at most ten, then make each twice as big.


Take a list of integers; remove all negatives at the front, then don't let anything exceed 10, then multiply each by 2.


Take a list of integers; remove the initial run of negative numbers, then clamp each to at most ten, then make each twice as big.


Take a list of integers; strip the front negatives, then don't let anything exceed 10, then multiply each by 2.


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


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


Take a list of integers; drop the leading negative values, then keep values divisible by 3, then drop non-positive values.


Take a list of integers; cut the leading negatives, then keep items where x mod 3 equals zero, then drop the negative numbers.


Take a list of integers; skip negatives at the start, then drop anything not divisible by three, then filter out the negative ones.


Take a list of integers; remove all negatives at the front, then filter out everything except multiples of three, then remove all negative values.


Take a list of integers; remove the initial run of negative numbers, then keep only multiples of three, then keep positive values only.


Take a list of integers; strip the front negatives, then multiples of three only, then keep values above zero.


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


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


Take a list of integers; keep the odd numbers, then multiply each value by itself, then find the max, defaulting to 0.


Take a list of integers; odd numbers only, then square them all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the odd numbers, then raise each to the power of two, then What's the highest number in the list.


Take a list of integers; odd numbers only, then I need each number multiplied by itself, then Return the greatest value or default to 0.


Take a list of integers; keep the odd numbers, then square all of them, then Find the largest element, defaulting to zero.


Take a list of integers; odd numbers only, then multiply each element by itself, then give the largest value (0 if none).


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


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


Take a list of integers; drop the leading negative values, then take the final 3 elements, then ensure at least three items by appending zeros.


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


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


Take a list of integers; remove all negatives at the front, then keep only the last three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove the initial run of negative numbers, then keep the final three items, then ensure at least three items by appending zeros.


Take a list of integers; strip the front negatives, then take the last three, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep everything before the first zero, then take the first 3 elements, then multiply each by -1.


Take a list of integers; take only what comes before the initial zero, then remove everything after the third, then negate.


Take a list of integers; cut the list at the first zero, then truncate to three items, then multiply each by -1.


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


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


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


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


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


Take a list of integers; square each, then keep values divisible by 3, then stop at the first non-positive value.


Take a list of integers; each value squared, then keep items where x mod 3 equals zero, then keep the leading run of positive numbers.


Take a list of integers; multiply each value by itself, then drop anything not divisible by three, then take values while they are positive.


Take a list of integers; square them all, then filter out everything except multiples of three, then take positive values then stop.


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


Take a list of integers; I need each number multiplied by itself, then multiples of three only, then stop at first non positive.


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


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


Take a list of integers; keep values greater than five, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; filter out values less than or equal to 5, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; keep only numbers above 5, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; exclude values of 5 and below, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


def solve(xs):
    r = list(xs)
    r = [x for x in r if x > 5]
    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; keep values greater than five, then cap each value at 10, then return the first even value (0 if none).


Take a list of integers; keep only the first three, then keep values above zero, then find the min, defaulting to 0.


Take a list of integers; keep the first 3 items, then filter for positive numbers, then minimum value, zero otherwise.


Take a list of integers; take the first 3 elements, then keep only positive numbers, then get the minimum value or zero if empty.


Take a list of integers; remove everything after the third, then keep the positives, then give me the min or 0.


Take a list of integers; truncate to three items, then remove negatives, then return the smallest number, defaulting to 0.


Take a list of integers; show the first three, then keep the positive numbers, then return smallest or zero if empty.


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


Take a list of integers; keep only the first three, then keep the positive numbers, then return the minimum (0 if empty).


Take a list of strings; lowercase each string, then keep only non-empty strings, then arrange by string length ascending.


Take a list of strings; change to lowercase, then filter empty strings, then length sort.


Take a list of strings; lowercase each string, then remove empty strings from the list, then sort by length shortest first.


Take a list of strings; change to lowercase, then clean up empty strings, then organize by string length least to greatest.


Take a list of strings; lowercase each string, then delete empty entries, then shortest strings first.


Take a list of strings; change to lowercase, then drop empty strings, then i want them ordered by how short they are.


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


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


Take a list of integers; take the absolute value of each, then increase every value by 10, then multiply each by -1.


Take a list of integers; convert to absolute value, then add 10 to each item, then negate.


Take a list of integers; strip the signs, then shift each up by ten, then multiply each by -1.


Take a list of integers; take abs of each, then increase all numbers by 10, then negate.


Take a list of integers; get the absolute value of everything, then add 10 to everything, then multiply each by -1.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then negate.


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


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


Take a list of integers; drop the first element, then increase every value by 10, then ensure at least three items by appending zeros.


Take a list of integers; Take everything except the first, then add 10 to each item, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the first element, then add 10 to everything, then ensure at least three items by appending zeros.


Take a list of integers; Take everything except the first, 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 = r[1:]
    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; drop the first element, then add ten to each, then pad with zeros to at least three elements.


Take a list of integers; keep everything before the first zero, then keep values divisible by 3, then stop at the first non-positive value.


Take a list of integers; take only what comes before the initial zero, then keep items where x mod 3 equals zero, then keep the leading run of positive numbers.


Take a list of integers; cut the list at the first zero, then drop anything not divisible by three, then take values while they are positive.


Take a list of integers; cut off after the first zero appears, then filter out everything except multiples of three, then take positive values then stop.


Take a list of integers; take values up to (excluding) the first zero, then keep only multiples of three, then keep going while positive.


Take a list of integers; keep the part before the first 0, then multiples of three only, then stop at first non positive.


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


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


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then give back the product of all values.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then product of the list.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then what's the product.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then what do they multiply to.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then give me their product.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then multiply them all together.


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))]
    return __import__('math').prod(r)


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


Take a list of integers; cap each value at 10, then decrement each value, then keep only numbers above 5.


Take a list of integers; clip values at 10, then Lower each number by one, then exclude values of 5 and below.


Take a list of integers; cap each value at 10, then reduce each by one, then remove anything 5 or less.


Take a list of integers; clip values at 10, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; cap each value at 10, then Subtract one from each, then get rid of values that aren't greater than five.


Take a list of integers; clip values at 10, then Drop each by one, then drop anything 5 or below.


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


Take a list of integers; cap each value at 10, then subtract one from each, then keep values greater than five.


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


Take a list of integers; keep only nonzero elements, then remove everything after the third, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the zeros, then truncate to three items, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then show the first three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the zeros, then take the first three, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then keep first 3, 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 = r[:3]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; keep values greater than five, then remove both ends, then drop non-positive values.


Take a list of integers; filter out values less than or equal to 5, then trim the edges, then drop the negative numbers.


Take a list of integers; keep only numbers above 5, then trim one element off each end, then filter out the negative ones.


Take a list of integers; exclude values of 5 and below, then cut off the first and last, then remove all negative values.


Take a list of integers; remove anything 5 or less, then remove the first and last elements, then keep positive values only.


Take a list of integers; filter to keep only values above 5, then keep only the middle part, then keep values above zero.


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


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


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


Take a list of integers; make each one bigger, then keep only numbers greater than 5, then filter out everything except multiples of three.


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


Take a list of integers; make each one bigger, then give me values where x is greater than 5, then multiples of three only.


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


Take a list of integers; make each one bigger, then keep values greater than five, then give me only the values divisible by three.


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


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


Take a list of integers; drop the zeros, then take the final 3 elements, then keep only numbers above 5.


Take a list of integers; keep only nonzero elements, then drop everything except the final three, then exclude values of 5 and below.


Take a list of integers; drop the zeros, then give me the last three elements, then remove anything 5 or less.


Take a list of integers; keep only nonzero elements, then keep only the last three, then filter to keep only values above 5.


Take a list of integers; drop the zeros, then keep the final three items, then get rid of values that aren't greater than five.


Take a list of integers; keep only nonzero elements, then take the last three, then drop anything 5 or below.


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


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


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


Take a list of integers; extract negatives, then trim the edges, then filter out everything except multiples of three.


Take a list of integers; keep the negative numbers, then trim one element off each end, then keep only multiples of three.


Take a list of integers; extract negatives, then cut off the first and last, then multiples of three only.


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


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


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


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


Take a list of integers; add one to each, then decrement each value, then find the min, defaulting to 0.


Take a list of integers; make each one bigger, then Lower each number by one, then minimum value, zero otherwise.


Take a list of integers; add one to each, then reduce each by one, then get the minimum value or zero if empty.


Take a list of integers; make each one bigger, then Subtract 1 from all, then give me the min or 0.


Take a list of integers; add one to each, then Subtract one from each, then return the smallest number, defaulting to 0.


Take a list of integers; make each one bigger, then Drop each by one, then return smallest or zero if empty.


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


Take a list of integers; add one to each, then subtract one from each, then return the minimum (0 if empty).


Take a list of people records (name, age); extract the ages, then flip the list around, then arrange in increasing order.


Take a list of people records (name, age); show me all ages, then flip the order around, then Organize these ascending.


Take a list of people records (name, age); pluck the age field from each record, then put the elements backwards, then Sort in ascending order.


Take a list of people records (name, age); get the age field, then reverse that for me, then I need this sorted ascending.


Take a list of people records (name, age); keep just each person's age, then flip it backwards, then Put these in ascending order.


Take a list of people records (name, age); extract age values, then make it backwards, then sort smallest to largest.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = list(reversed(r))
    r = sorted(r)
    return r


Take a list of people records (name, age); extract the ages, then reverse the order, then sort ascending.


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


Take a list of integers; keep only nonzero elements, then Ascending sort, then cut off the first and last.


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


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then keep only the middle part.


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


Take a list of integers; keep only nonzero elements, then sort ascending, then eliminate the outermost elements.


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


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


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


Take a list of integers; make each one bigger, then unique values preserving order, then drop the negative numbers.


Take a list of integers; add one to each, then remove repeated values, then filter out the negative ones.


Take a list of integers; make each one bigger, then unique values preserving order, then remove all negative values.


Take a list of integers; add one to each, then remove repeated values, then keep positive values only.


Take a list of integers; make each one bigger, then unique values preserving order, then keep values above zero.


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


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


Take a list of integers; keep multiples of three, then keep the leading run of positive numbers, then replace an empty list with one zero.


Take a list of integers; get rid of non-multiples of three, then take values while they are positive, then zero it out if it's empty.


Take a list of integers; keep values divisible by 3, then take positive values then stop, then use zero if the list is empty.


Take a list of integers; keep items where x mod 3 equals zero, then keep going while positive, then default to zero when empty.


Take a list of integers; drop anything not divisible by three, then stop at first non positive, then if there's nothing, put in a zero.


Take a list of integers; filter out everything except multiples of three, then take while greater than zero, then if no items, add a zero.


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 = r if r else [0]
    return r


Take a list of integers; keep multiples of three, then take values while they are positive, then if empty, use a single zero.


Take a list of integers; square each, then remove the first item, then limit every value to 10.


Take a list of integers; each value squared, then Remove head, then maximum of 10 for all.


Take a list of integers; multiply each value by itself, then remove the first item, then limit every value to 10.


Take a list of integers; square them all, then Remove head, then maximum of 10 for all.


Take a list of integers; raise each to the power of two, then remove the first item, then limit every value to 10.


Take a list of integers; I need each number multiplied by itself, then Remove head, then maximum of 10 for all.


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


Take a list of integers; square each, then drop the first element, then cap each value at 10.


Take a list of integers; drop the first and last elements, then keep only odd values, then true only if all are positive.


Take a list of integers; take out the first and last items, then eliminate the even numbers, then do all of these have positive values.


Take a list of integers; remove both ends, then keep only odd values, then check if every value is positive.


Take a list of integers; trim the edges, then eliminate the even numbers, then confirm all values are positive.


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


Take a list of integers; cut off the first and last, then eliminate the even numbers, then check if every number is above zero.


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


Take a list of integers; drop the first and last elements, then keep the odd numbers, then return whether all values are positive.


Take a list of integers; take values while they are positive, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; take positive values then stop, then square them all, then Organize these ascending.


Take a list of integers; keep going while positive, then raise each to the power of two, then Sort in ascending order.


Take a list of integers; stop at first non positive, then I need each number multiplied by itself, then I need this sorted ascending.


Take a list of integers; take while greater than zero, then square all of them, then Put these in ascending order.


Take a list of integers; take values while positive, then multiply each element by itself, then sort smallest to largest.


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


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


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


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


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


Take a list of integers; odd numbers only, then show the first three, then filter out the odd numbers.


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


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


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


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


Take a list of integers; double each, then flip the list around, then drop the even numbers.


Take a list of integers; times two for each item, then flip the order around, then strip out the evens.


Take a list of integers; double each, then put the elements backwards, then drop the even numbers.


Take a list of integers; times two for each item, then reverse that for me, then strip out the evens.


Take a list of integers; double each, then flip it backwards, then drop the even numbers.


Take a list of integers; times two for each item, then make it backwards, then strip out the evens.


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


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


Take a list of integers; keep only the first three, then extend to length 3 using zeros, then put the elements backwards.


Take a list of integers; keep the first 3 items, then pad to 3, then reverse that for me.


Take a list of integers; take the first 3 elements, then extend to length 3 using zeros, then flip it backwards.


Take a list of integers; remove everything after the third, then pad to 3, then make it backwards.


Take a list of integers; truncate to three items, then extend to length 3 using zeros, then reverse the list.


Take a list of integers; show the first three, then pad to 3, then invert the sequence.


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


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


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


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


Take a list of integers; take the last three, then take values up to (excluding) the first zero, then filter out the negative ones.


Take a list of integers; trim to the last three, then keep the part before the first 0, then remove all negative values.


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


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


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


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


Take a list of integers; cap each value at 10, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; clip values at 10, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the zeros, then drop anything 5 or below, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then keep only numbers greater than 5, then maximum of 10 for all.


Take a list of integers; drop the zeros, then filter for numbers above 5, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then give me values where x is greater than 5, then maximum of 10 for all.


Take a list of integers; drop the zeros, then show me only the values that are bigger than five, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then keep values greater than five, then maximum of 10 for all.


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


Take a list of integers; drop the zeros, then keep values greater than five, then cap each value at 10.


Take a list of integers; negate each, then multiply each value by itself, then find the min, defaulting to 0.


Take a list of integers; reverse the signs of everything, then square them all, then minimum value, zero otherwise.


Take a list of integers; negate each, then raise each to the power of two, then get the minimum value or zero if empty.


Take a list of integers; reverse the signs of everything, then I need each number multiplied by itself, then give me the min or 0.


Take a list of integers; negate each, then square all of them, then return the smallest number, defaulting to 0.


Take a list of integers; reverse the signs of everything, then multiply each element by itself, then return smallest or zero if empty.


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


Take a list of integers; negate each, then square each, then return the minimum (0 if empty).


Take a list of integers; take values while they are positive, then flip the list around, then drop anything not divisible by three.


Take a list of integers; take positive values then stop, then flip the order around, then filter out everything except multiples of three.


Take a list of integers; keep going while positive, then put the elements backwards, then keep only multiples of three.


Take a list of integers; stop at first non positive, then reverse that for me, then multiples of three only.


Take a list of integers; take while greater than zero, then flip it backwards, then filter for numbers divisible by three.


Take a list of integers; take values while positive, then make it backwards, then give me only the values divisible by three.


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


Take a list of integers; take values while they are positive, then reverse the order, then keep multiples of three.


Take a list of integers; keep only the last three, then drop anything 5 or below, then deduplicate the list.


Take a list of integers; keep the final three items, then keep only numbers greater than 5, then remove repeats.


Take a list of integers; take the last three, then filter for numbers above 5, then deduplicate the list.


Take a list of integers; trim to the last three, then give me values where x is greater than 5, then remove repeats.


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


Take a list of integers; truncate to the last three items, then keep values greater than five, then remove repeats.


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


Take a list of integers; keep only the last three, then keep values greater than five, then drop duplicates keeping first occurrence.


Take a list of integers; cap each value at 10, then multiply each by two, then skip the first one.


Take a list of integers; clip values at 10, then double each item in the list, then Discard the first element.


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


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


Take a list of integers; keep only the first three, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then fetch the first even element, default to 0.


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


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; show the first three, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop the zeros, then increment each value, then replace an empty list with one zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then zero it out if it's empty.


Take a list of integers; drop the zeros, then increment each value, then use zero if the list is empty.


Take a list of integers; keep only nonzero elements, then plus one for all, then default to zero when empty.


Take a list of integers; drop the zeros, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then if no items, add a zero.


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


Take a list of integers; drop the zeros, then add one to each, then if empty, use a single zero.


Take a list of integers; drop the zeros, then sort largest to smallest, then arrange by magnitude ignoring sign.


Take a list of integers; keep only nonzero elements, then sort by descending values, then put them in order by magnitude.


Take a list of integers; drop the zeros, then sort from highest to lowest, then arrange in order of absolute value.


Take a list of integers; keep only nonzero elements, then sort descending, then sort by distance from zero.


Take a list of integers; drop the zeros, then sort largest first, then order by how far from zero.


Take a list of integers; keep only nonzero elements, 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 != 0]
    r = sorted(r, reverse=True)
    r = sorted(r, key=abs)
    return r


Take a list of integers; drop the zeros, then sort descending, then sort by absolute value.


Take a list of integers; sort by absolute value, then drop anything 5 or below, then arrange in increasing order.


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


Take a list of integers; arrange by magnitude ignoring sign, then filter for numbers above 5, then Sort in ascending order.


Take a list of integers; put them in order by magnitude, then give me values where x is greater than 5, then I need this sorted ascending.


Take a list of integers; arrange in order of absolute value, then show me only the values that are bigger than five, then Put these in ascending order.


Take a list of integers; sort by distance from zero, then keep values greater than five, then sort smallest to largest.


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


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


Take a list of integers; keep multiples of three, then clamp each to at most ten, then truncate to the last three items.


Take a list of integers; get rid of non-multiples of three, then don't let anything exceed 10, then show only the last three.


Take a list of integers; keep values divisible by 3, then clamp each to at most ten, then remove all but the last three.


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


Take a list of integers; drop anything not divisible by three, then clamp each to at most ten, then drop everything except the final three.


Take a list of integers; filter out everything except multiples of three, then don't let anything exceed 10, then give me the last three elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then keep only non-zero numbers.


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


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then keep only non-zero numbers.


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


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then keep only non-zero numbers.


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


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


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


Take a list of integers; negate each, then sort largest to smallest, then make each twice as big.


Take a list of integers; reverse the signs of everything, then sort by descending values, then multiply each by 2.


Take a list of integers; negate each, then sort from highest to lowest, then make each twice as big.


Take a list of integers; reverse the signs of everything, then sort descending, then multiply each by 2.


Take a list of integers; negate each, then sort largest first, then make each twice as big.


Take a list of integers; reverse the signs of everything, then sort in descending order, then multiply each by 2.


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


Take a list of integers; negate each, then sort descending, then double each.


Take a list of integers; if empty, use a single zero, then keep only odd values, then arrange in decreasing order.


Take a list of integers; if blank use 0, then eliminate the even numbers, then arrange in descending order.


Take a list of integers; default to [0] when there is nothing, then keep only odd values, then reverse sort.


Take a list of integers; when the list is empty, substitute a zero value, then eliminate the even numbers, then sort largest to smallest.


Take a list of integers; replace an empty list with one zero, then keep only odd values, then sort by descending values.


Take a list of integers; zero it out if it's empty, then eliminate the even numbers, then sort from highest to lowest.


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


Take a list of integers; if empty, use a single zero, then keep the odd numbers, then sort descending.


Take a list of integers; drop the zeros, then sort smallest to largest, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then Ascending sort, then arrange in descending order.


Take a list of integers; drop the zeros, then Sort this ascending, then reverse sort.


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then sort largest to smallest.


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then sort by descending values.


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


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


Take a list of integers; drop the zeros, then sort ascending, then sort descending.


Take a list of integers; keep the odd numbers, then keep values divisible by 3, then keep only numbers above 5.


Take a list of integers; odd numbers only, then keep items where x mod 3 equals zero, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then drop anything not divisible by three, then remove anything 5 or less.


Take a list of integers; odd numbers only, then filter out everything except multiples of three, then filter to keep only values above 5.


Take a list of integers; keep the odd numbers, then keep only multiples of three, then get rid of values that aren't greater than five.


Take a list of integers; odd numbers only, then multiples of three only, then drop anything 5 or below.


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


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


Take a list of integers; add one to each, then decrement each value, then limit every value to 10.


Take a list of integers; make each one bigger, then Lower each number by one, then maximum of 10 for all.


Take a list of integers; add one to each, then reduce each by one, then limit every value to 10.


Take a list of integers; make each one bigger, then Subtract 1 from all, then maximum of 10 for all.


Take a list of integers; add one to each, then Subtract one from each, then limit every value to 10.


Take a list of integers; make each one bigger, then Drop each by one, then maximum of 10 for all.


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


Take a list of integers; add one to each, then subtract one from each, then cap each value at 10.


Take a list of integers; take values while they are positive, then take the final 3 elements, then multiply each by -1.


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


Take a list of integers; keep going while positive, then give me the last three elements, then multiply each by -1.


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


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


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


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


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


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


Take a list of integers; cut the leading negatives, then get the negative numbers, then keep the leading run of positive numbers.


Take a list of integers; skip negatives at the start, then keep values below zero, then take values while they are positive.


Take a list of integers; remove all negatives at the front, then get the negative numbers, then take positive values then stop.


Take a list of integers; remove the initial run of negative numbers, then keep values below zero, then keep going while positive.


Take a list of integers; strip the front negatives, then get the negative numbers, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    r = [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 leading negative values, then keep the negative numbers, then take values while they are positive.


Take a list of integers; keep the odd numbers, then remove the first item, then give back the total.


Take a list of integers; odd numbers only, then Remove head, then sum r.


Take a list of integers; keep the odd numbers, then remove the first item, then add them up.


Take a list of integers; odd numbers only, then Remove head, then calculate the sum of all elements.


Take a list of integers; keep the odd numbers, then remove the first item, then what's the total.


Take a list of integers; odd numbers only, then Remove head, then what do they add up to.


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


Take a list of integers; keep the odd numbers, then drop the first element, then return their sum.


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


Take a list of integers; add zeros until the list has at least three values, then keep items where x mod 3 equals zero, then strip the front negatives.


Take a list of integers; pad with zeros to at least three elements, then drop anything not divisible by three, then remove leading negative numbers.


Take a list of integers; add zeros until the list has at least three values, then filter out everything except multiples of three, then drop negatives from start.


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


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


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


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


Take a list of people records (name, age); extract the ages, then cut the list at the first zero, then put the elements backwards.


Take a list of people records (name, age); show me all ages, then cut off after the first zero appears, then reverse that for me.


Take a list of people records (name, age); pluck the age field from each record, then take values up to (excluding) the first zero, then flip it backwards.


Take a list of people records (name, age); get the age field, then keep the part before the first 0, then make it backwards.


Take a list of people records (name, age); keep just each person's age, then truncate at the first zero, then reverse the list.


Take a list of people records (name, age); extract age values, then delete everything starting with the first zero, then invert the sequence.


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


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


Take a list of integers; if empty, use a single zero, then remove all zero values, then drop the even numbers.


Take a list of integers; if blank use 0, then exclude zeros, then strip out the evens.


Take a list of integers; default to [0] when there is nothing, then remove all zero values, then drop the even numbers.


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


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


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


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    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; if empty, use a single zero, then drop the zeros, then keep the odd numbers.


Take a list of integers; sort ascending, then order by distance from zero, then take values up to (excluding) the first zero.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then keep the part before the first 0.


Take a list of integers; arrange in increasing order, then organize by magnitude, then truncate at the first zero.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then delete everything starting with the first zero.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then up to but not including the first zero.


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


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


Take a list of integers; if empty, use a single zero, then keep values below zero, then stop at the first non-positive value.


Take a list of integers; if blank use 0, then get the negative numbers, then keep the leading run of positive numbers.


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


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


Take a list of integers; replace an empty list with one zero, then keep values below zero, then keep going while positive.


Take a list of integers; zero it out if it's empty, then get the negative numbers, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    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; if empty, use a single zero, then keep the negative numbers, then take values while they are positive.


Take a list of integers; keep everything before the first zero, then keep only even values, then arrange in decreasing order.


Take a list of integers; take only what comes before the initial zero, then extract all even numbers, then arrange in descending order.


Take a list of integers; cut the list at the first zero, then keep only even values, then reverse sort.


Take a list of integers; cut off after the first zero appears, then extract all even numbers, then sort largest to smallest.


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


Take a list of integers; keep the part before the first 0, then extract all even numbers, then sort from highest to lowest.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then take values up to (excluding) the first zero, then take values while they are positive.


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


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then keep going while positive.


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


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


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


Take a list of integers; drop the zeros, then remove the first item, then strip the signs.


Take a list of integers; keep only nonzero elements, then Remove head, then take abs of each.


Take a list of integers; drop the zeros, then remove the first item, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then Remove head, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then remove the first item, then make them all positive.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then arrange in decreasing order.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then arrange in descending order.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then reverse sort.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then sort largest to smallest.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then sort by descending values.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then sort from highest to lowest.


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


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then ensure at least three items by appending zeros.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); extract the ages, then cap each value at 10, then pad with zeros to at least three elements.


Take a list of integers; take the absolute value of each, then sort largest to smallest, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then sort by descending values, then put them in order by magnitude.


Take a list of integers; strip the signs, then sort from highest to lowest, then arrange in order of absolute value.


Take a list of integers; take abs of each, then sort descending, then sort by distance from zero.


Take a list of integers; get the absolute value of everything, then sort largest first, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then order by distance from zero.


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


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


Take a list of integers; sort by absolute value, then multiply each by two, then drop the odd numbers.


Take a list of integers; rearrange by distance from zero, then double each item in the list, then filter out the odd numbers.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then drop the odd numbers.


Take a list of integers; put them in order by magnitude, then double each item in the list, then filter out the odd numbers.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then drop the odd numbers.


Take a list of integers; sort by distance from zero, then double each item in the list, then filter out the odd numbers.


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


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


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then give the earliest even value or zero.


Take a list of integers; keep the final three items, then pad to 3, then fetch the first even element, default to 0.


Take a list of integers; take the last three, then extend to length 3 using zeros, then give the earliest even value or zero.


Take a list of integers; trim to the last three, then pad to 3, then fetch the first even element, default to 0.


Take a list of integers; last three only, then extend to length 3 using zeros, then give the earliest even value or zero.


Take a list of integers; truncate to the last three items, then pad to 3, then fetch the first even element, default to 0.


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


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


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


Take a list of integers; cut the leading negatives, then square them all, then arrange in descending order.


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


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then cut the list at the first zero, then truncate to three items.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then truncate to first three.


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


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


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


Take a list of integers; drop the first element, then order by distance from zero, then give back the total.


Take a list of integers; Take everything except the first, then sort based on absolute value, then sum r.


Take a list of integers; drop the first element, then organize by magnitude, then add them up.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then calculate the sum of all elements.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then what's the total.


Take a list of integers; Take everything except the first, then sort by absolute value, then what do they add up to.


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


Take a list of integers; drop the first element, then sort by absolute value, then return their sum.


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


Take a list of integers; each value squared, then drop everything except the final three, then negate.


Take a list of integers; multiply each value by itself, then give me the last three elements, then multiply each by -1.


Take a list of integers; square them all, then keep only the last three, then negate.


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


Take a list of integers; I need each number multiplied by itself, then take the last three, then negate.


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


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


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


Take a list of integers; keep the final three items, then remove all negatives at the front, then cut off the first and last.


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


Take a list of integers; trim to the last three, then strip the front negatives, then keep only the middle part.


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


Take a list of integers; truncate to the last three items, then drop negatives from start, then eliminate the outermost elements.


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


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


Take a list of integers; add one to each, then keep only odd values, then remove the initial run of negative numbers.


Take a list of integers; make each one bigger, then eliminate the even numbers, then strip the front negatives.


Take a list of integers; add one to each, then keep only odd values, then remove leading negative numbers.


Take a list of integers; make each one bigger, then eliminate the even numbers, then drop negatives from start.


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


Take a list of integers; make each one bigger, then eliminate the even numbers, then remove negatives before the first non-negative.


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


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


Take a list of integers; add one to each, then cut the list at the first zero, then arrange in increasing order.


Take a list of integers; make each one bigger, then cut off after the first zero appears, then Organize these ascending.


Take a list of integers; add one to each, then take values up to (excluding) the first zero, then Sort in ascending order.


Take a list of integers; make each one bigger, then keep the part before the first 0, then I need this sorted ascending.


Take a list of integers; add one to each, then truncate at the first zero, then Put these in ascending order.


Take a list of integers; make each one bigger, then delete everything starting with the first zero, then sort smallest to largest.


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


Take a list of integers; add one to each, then keep everything before the first zero, then sort ascending.


Take a list of integers; drop the first element, then keep values divisible by 3, then drop non-negative values.


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


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


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


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


Take a list of integers; Take everything except the first, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; keep multiples of three, then flip the list around, then give the number of evens.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then find how many values are divisible by two.


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


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then get the total number of even values in the list.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then give me the count of even values.


Take a list of integers; filter out everything except multiples of three, then make it backwards, 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 % 3 == 0]
    r = list(reversed(r))
    return sum(1 for x in r if x % 2 == 0)


Take a list of integers; keep multiples of three, then reverse the order, then return how many values are even.


Take a list of integers; sort descending, then keep only even values, then keep only non-zero numbers.


Take a list of integers; sort largest first, then extract all even numbers, then strip the zeros.


Take a list of integers; sort in descending order, then keep only even values, then keep only non-zero numbers.


Take a list of integers; sort from greatest to least, then extract all even numbers, then strip the zeros.


Take a list of integers; sort z to a, then keep only even values, then keep only non-zero numbers.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then strip the zeros.


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


Take a list of integers; sort descending, then keep the even numbers, then drop the zeros.


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


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


Take a list of integers; double each, then give me the last three elements, then keep only multiples of three.


Take a list of integers; times two for each item, then keep only the last three, then multiples of three only.


Take a list of integers; double each, then keep the final three items, then filter for numbers divisible by three.


Take a list of integers; times two for each item, then take the last three, then give me only the values divisible by three.


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


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


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


Take a list of integers; convert to absolute value, then Lower each number by one, then arrange in descending order.


Take a list of integers; strip the signs, then reduce each by one, then reverse sort.


Take a list of integers; take abs of each, then Subtract 1 from all, then sort largest to smallest.


Take a list of integers; get the absolute value of everything, then Subtract one from each, then sort by descending values.


Take a list of integers; apply absolute value to the whole list, then Drop each by one, then sort from highest to lowest.


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


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


Take a list of integers; keep the even numbers, then make every value non-negative, then true if any value equals zero.


Take a list of integers; keep evens, then absolute value for all items, then check for zero.


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


Take a list of integers; keep evens, then turn negatives into positives, then check for zero.


Take a list of integers; keep the even numbers, then abs each element, then true if any value equals zero.


Take a list of integers; keep evens, then take the absolute value of each, then check for zero.


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


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


Take a list of integers; reverse the order, then skip negatives at the start, then true if every value is unique.


Take a list of integers; reverse, then remove all negatives at the front, then check for duplicates in the values.


Take a list of integers; flip the list around, then remove the initial run of negative numbers, then do all values appear only once.


Take a list of integers; flip the order around, then strip the front negatives, then check that there are no duplicates.


Take a list of integers; put the elements backwards, then remove leading negative numbers, then are the values all unique.


Take a list of integers; reverse that for me, then drop negatives from start, then check if all values are unique.


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


Take a list of integers; reverse the order, then drop the leading negative values, then return whether all values are distinct.


Take a list of integers; sort by absolute value, then drop anything 5 or below, then limit every value to 10.


Take a list of integers; rearrange by distance from zero, then keep only numbers greater than 5, then maximum of 10 for all.


Take a list of integers; arrange by magnitude ignoring sign, then filter for numbers above 5, then limit every value to 10.


Take a list of integers; put them in order by magnitude, then give me values where x is greater than 5, then maximum of 10 for all.


Take a list of integers; arrange in order of absolute value, then show me only the values that are bigger than five, then limit every value to 10.


Take a list of integers; sort by distance from zero, then keep values greater than five, then maximum of 10 for all.


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


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


Take a list of integers; add ten to each, then remove repeated values, then true only if all are positive.


Take a list of integers; bump everything up by 10, then unique values preserving order, then do all of these have positive values.


Take a list of integers; increase every value by 10, then remove repeated values, then check if every value is positive.


Take a list of integers; add 10 to each item, then unique values preserving order, then confirm all values are positive.


Take a list of integers; shift each up by ten, then remove repeated values, then all positive.


Take a list of integers; increase all numbers by 10, then unique values preserving order, then check if every number is above zero.