Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then maximum of 10 for all.


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


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


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


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then zero it out if it's empty.


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


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then default to zero when empty.


Take a list of integers; double each, then flip the sign of each, then if there's nothing, put in a zero.


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then if no items, add a zero.


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


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


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


Take a list of integers; cut the leading negatives, then absolute value for all items, then cut off the first and last.


Take a list of integers; skip negatives at the start, then take absolute values, then remove the first and last elements.


Take a list of integers; remove all negatives at the front, then turn negatives into positives, then keep only the middle part.


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


Take a list of integers; strip the front negatives, then take the absolute value of each, then eliminate the outermost elements.


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


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


Take a list of integers; keep multiples of three, then clamp each to at most ten, then replace an empty list with one zero.


Take a list of integers; get rid of non-multiples of three, then don't let anything exceed 10, then zero it out if it's empty.


Take a list of integers; keep values divisible by 3, then clamp each to at most ten, then use zero if the list is empty.


Take a list of integers; keep items where x mod 3 equals zero, then don't let anything exceed 10, then default to zero when empty.


Take a list of integers; drop anything not divisible by three, then clamp each to at most ten, then if there's nothing, put in a zero.


Take a list of integers; filter out everything except multiples of three, then don't let anything exceed 10, then if no items, add a zero.


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


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


Take a list of integers; take values while they are positive, then skip negatives at the start, then limit every value to 10.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then maximum of 10 for all.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then limit every value to 10.


Take a list of integers; stop at first non positive, then strip the front negatives, then maximum of 10 for all.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then limit every value to 10.


Take a list of integers; take values while positive, then drop negatives from start, then maximum of 10 for all.


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


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


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then true if every value is unique.


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then check for duplicates in the values.


Take a list of integers; drop non-positive values, then clamp each to at most ten, then do all values appear only once.


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then check that there are no duplicates.


Take a list of integers; filter out the negative ones, then clamp each to at most ten, then are the values all unique.


Take a list of integers; remove all negative values, then don't let anything exceed 10, then check if all values are unique.


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


Take a list of integers; keep the positive numbers, then cap each value at 10, then return whether all values are distinct.


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


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


Take a list of integers; keep only numbers above 5, then take values up to (excluding) the first zero, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then keep the part before the first 0, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then truncate at the first zero, then drop first and last.


Take a list of integers; filter to keep only values above 5, then delete everything starting with the first zero, then eliminate the outermost elements.


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


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


Take a list of integers; pad with zeros to at least three elements, then default to [0] when there is nothing, then find the min, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then when the list is empty, substitute a zero value, then minimum value, zero otherwise.


Take a list of integers; pad with zeros to at least three elements, then replace an empty list with one zero, then get the minimum value or zero if empty.


Take a list of integers; add zeros until the list has at least three values, then zero it out if it's empty, then give me the min or 0.


Take a list of integers; pad with zeros to at least three elements, then use zero if the list is empty, then return the smallest number, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then default to zero when empty, then return smallest or zero if empty.


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


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


Take a list of integers; keep the positive numbers, then keep only odd values, then deduplicate the list.


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then remove repeats.


Take a list of integers; drop non-positive values, then keep only odd values, then deduplicate the list.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then remove repeats.


Take a list of integers; filter out the negative ones, then keep only odd values, then deduplicate the list.


Take a list of integers; remove all negative values, then eliminate the even numbers, then remove repeats.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then multiply each by -1.


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


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then multiply each by -1.


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


Take a list of integers; pad with zeros to at least three elements, then take the first three, then multiply each by -1.


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


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


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


Take a list of integers; sort ascending, then keep only odd values, then drop anything not divisible by three.


Take a list of integers; Sort it from low to high, then eliminate the even numbers, then filter out everything except multiples of three.


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


Take a list of integers; Organize these ascending, then eliminate the even numbers, then multiples of three only.


Take a list of integers; Sort in ascending order, then keep only odd values, then filter for numbers divisible by three.


Take a list of integers; I need this sorted ascending, then eliminate the even numbers, then give me only the values divisible by three.


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


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


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


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


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


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


Take a list of integers; double each, then remove all zero values, then order by how far from zero.


Take a list of integers; times two for each item, then exclude zeros, then order by distance from zero.


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


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


Take a list of integers; drop the first element, then remove repeated values, then keep only numbers above 5.


Take a list of integers; Take everything except the first, then unique values preserving order, then exclude values of 5 and below.


Take a list of integers; drop the first element, then remove repeated values, then remove anything 5 or less.


Take a list of integers; Take everything except the first, then unique values preserving order, then filter to keep only values above 5.


Take a list of integers; drop the first element, then remove repeated values, then get rid of values that aren't greater than five.


Take a list of integers; Take everything except the first, then unique values preserving order, then drop anything 5 or below.


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


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


Take a list of integers; add one to each, then remove both ends, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then trim the edges, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; add one to each, then trim one element off each end, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then cut off the first and last, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; make each one bigger, then keep only the middle part, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; subtract one from each, then remove repeated values, then drop the even numbers.


Take a list of integers; Decrement all items, then unique values preserving order, then strip out the evens.


Take a list of integers; decrement each value, then remove repeated values, then drop the even numbers.


Take a list of integers; Lower each number by one, then unique values preserving order, then strip out the evens.


Take a list of integers; reduce each by one, then remove repeated values, then drop the even numbers.


Take a list of integers; Subtract 1 from all, then unique values preserving order, then strip out the evens.


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


Take a list of integers; subtract one from each, then drop duplicates keeping first occurrence, then keep the odd numbers.


Take a list of integers; subtract one from each, then extend to length 3 using zeros, then find the min, defaulting to 0.


Take a list of integers; Decrement all items, then pad to 3, then minimum value, zero otherwise.


Take a list of integers; decrement each value, then extend to length 3 using zeros, then get the minimum value or zero if empty.


Take a list of integers; Lower each number by one, then pad to 3, then give me the min or 0.


Take a list of integers; reduce each by one, then extend to length 3 using zeros, then return the smallest number, defaulting to 0.


Take a list of integers; Subtract 1 from all, then pad to 3, then return smallest or zero if empty.


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


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


Take a list of integers; keep everything before the first zero, then remove the first item, then count the elements.


Take a list of integers; take only what comes before the initial zero, then Remove head, then how many items remain.


Take a list of integers; cut the list at the first zero, then remove the first item, then tell me the length.


Take a list of integers; cut off after the first zero appears, then Remove head, then return the length.


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


Take a list of integers; keep the part before the first 0, then Remove head, then what's the count.


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


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


Take a list of strings; sort by length, shortest first, then strip spaces around each string, then prepend a hash mark to each.


Take a list of strings; sort ascending by length, then remove leading and trailing spaces, then prefix all with #.


Take a list of strings; order strings from shortest to longest, then remove whitespace from each item, then prepend a hash mark to each.


Take a list of strings; shortest to longest, then clean whitespace from each entry, then prefix all with #.


Take a list of strings; arrange by string length ascending, then trim each string, then prepend a hash mark to each.


Take a list of strings; length sort, then trim whitespace from each, then prefix all with #.


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


Take a list of strings; sort by length, shortest first, then trim whitespace from each, then prefix each with a hash.


Take a list of integers; take values while they are positive, then increment each value, then multiply each by -1.


Take a list of integers; take positive values then stop, then plus one for all, then negate.


Take a list of integers; keep going while positive, then increment each value, then multiply each by -1.


Take a list of integers; stop at first non positive, then plus one for all, then negate.


Take a list of integers; take while greater than zero, then increment each value, then multiply each by -1.


Take a list of integers; take values while positive, then plus one for all, then negate.


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


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


Take a list of integers; keep only the last three, then multiply each value by itself, then strip the signs.


Take a list of integers; keep the final three items, then square them all, then take abs of each.


Take a list of integers; take the last three, then raise each to the power of two, then get the absolute value of everything.


Take a list of integers; trim to the last three, then I need each number multiplied by itself, then apply absolute value to the whole list.


Take a list of integers; last three only, then square all of them, then make them all positive.


Take a list of integers; truncate to the last three items, then multiply each element by itself, then make every value non-negative.


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


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


Take a list of integers; keep the negative numbers, then remove both ends, then arrange by magnitude ignoring sign.


Take a list of integers; extract negatives, then trim the edges, then put them in order by magnitude.


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


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


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


Take a list of integers; extract negatives, then keep only the middle part, then order by distance from zero.


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


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


Take a list of integers; keep the positive numbers, then make every value non-negative, then keep only non-zero numbers.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then strip the zeros.


Take a list of integers; drop non-positive values, then take absolute values, then keep only non-zero numbers.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then strip the zeros.


Take a list of integers; filter out the negative ones, then abs each element, then keep only non-zero numbers.


Take a list of integers; remove all negative values, then take the absolute value of each, then strip the zeros.


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


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


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


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


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


Take a list of integers; drop the negative numbers, then double each item in the list, then multiply each element by itself.


Take a list of integers; filter out the negative ones, then multiply each by two, then make each one squared.


Take a list of integers; remove all negative values, then double each item in the list, then square each value in the list.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then stop at the first non-positive value.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, then keep the leading run of positive numbers.


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then take values while they are positive.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, then take positive values then stop.


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then keep going while positive.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [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; pad with zeros to at least three elements, then keep the even numbers, then take values while they are positive.


Take a list of integers; if empty, use a single zero, then decrement each value, then give the number of evens.


Take a list of integers; if blank use 0, then Lower each number by one, then find how many values are divisible by two.


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


Take a list of integers; when the list is empty, substitute a zero value, then Subtract 1 from all, then get the total number of even values in the list.


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then give me the count of even values.


Take a list of integers; zero it out if it's empty, then Drop each by one, then I need to know how many of these are even.


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


Take a list of integers; if empty, use a single zero, then subtract one from each, then return how many values are even.


Take a list of integers; drop duplicates keeping first occurrence, then make every value non-negative, then find the max, defaulting to 0.


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


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


Take a list of integers; drop duplicates but keep the first one, then turn negatives into positives, then Return the greatest value or default to 0.


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


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


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


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


Take a list of integers; if empty, use a single zero, then flip the sign of each, then find the min, defaulting to 0.


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then minimum value, zero otherwise.


Take a list of integers; default to [0] when there is nothing, then flip the sign of each, then get the minimum value or zero if empty.


Take a list of integers; when the list is empty, substitute a zero value, then turn positives to negatives and vice versa, then give me the min or 0.


Take a list of integers; replace an empty list with one zero, then flip the sign of each, then return the smallest number, defaulting to 0.


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then drop everything except the final three, then negate.


Take a list of integers; keep values divisible by 3, then give me the last three elements, then multiply each by -1.


Take a list of integers; keep items where x mod 3 equals zero, then keep only the last three, then negate.


Take a list of integers; drop anything not divisible by three, then keep the final three items, then multiply each by -1.


Take a list of integers; filter out everything except multiples of three, then take the last three, then negate.


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


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


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


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


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


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then strip the zeros.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then keep only non-zero numbers.


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


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


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


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


Take a list of integers; keep only nonzero elements, then keep items where x mod 3 equals zero, then keep the part before the first 0.


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


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then delete everything starting with the first zero.


Take a list of integers; drop the zeros, then keep only multiples of three, then remove from the first zero onwards.


Take a list of integers; keep only nonzero elements, then multiples of three only, 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 = [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; drop the zeros, then keep multiples of three, then keep everything before the first zero.


Take a list of integers; take the absolute value of each, then keep values divisible by 3, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then keep items where x mod 3 equals zero, then put them in order by magnitude.


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


Take a list of integers; take abs of each, then filter out everything except multiples of three, then sort by distance from zero.


Take a list of integers; get the absolute value of everything, then keep only multiples of three, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then multiples of three only, then order by distance from zero.


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


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


Take a list of integers; keep the negative numbers, then multiply each by two, then true if every value is unique.


Take a list of integers; extract negatives, then double each item in the list, then check for duplicates in the values.


Take a list of integers; keep the negative numbers, then multiply each by two, then do all values appear only once.


Take a list of integers; extract negatives, then double each item in the list, then check that there are no duplicates.


Take a list of integers; keep the negative numbers, then multiply each by two, then are the values all unique.


Take a list of integers; extract negatives, then double each item in the list, then check if all values are unique.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then trim one element off each end.


Take a list of integers; keep evens, then keep only numbers greater than 5, then cut off the first and last.


Take a list of integers; keep the even numbers, then filter for numbers above 5, then remove the first and last elements.


Take a list of integers; keep evens, then give me values where x is greater than 5, then keep only the middle part.


Take a list of integers; keep the even numbers, then show me only the values that are bigger than five, then drop first and last.


Take a list of integers; keep evens, then keep values greater than five, then eliminate the outermost elements.


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


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


Take a list of integers; square each, then extend to length 3 using zeros, then arrange in increasing order.


Take a list of integers; each value squared, then pad to 3, then Organize these ascending.


Take a list of integers; multiply each value by itself, then extend to length 3 using zeros, then Sort in ascending order.


Take a list of integers; square them all, then pad to 3, then I need this sorted ascending.


Take a list of integers; raise each to the power of two, then extend to length 3 using zeros, then Put these in ascending order.


Take a list of integers; I need each number multiplied by itself, then pad to 3, then sort smallest to largest.


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


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


Take a list of integers; keep everything before the first zero, then decrement each value, then put the elements backwards.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then reverse that for me.


Take a list of integers; cut the list at the first zero, then reduce each by one, then flip it backwards.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then make it backwards.


Take a list of integers; take values up to (excluding) the first zero, then Subtract one from each, then reverse the list.


Take a list of integers; keep the part before the first 0, then Drop each by one, then invert the sequence.


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


Take a list of integers; keep everything before the first zero, then subtract one from each, then reverse the order.


Take a list of integers; subtract one from each, then cut the list at the first zero, then trim one element off each end.


Take a list of integers; Decrement all items, then cut off after the first zero appears, then cut off the first and last.


Take a list of integers; decrement each value, then take values up to (excluding) the first zero, then remove the first and last elements.


Take a list of integers; Lower each number by one, then keep the part before the first 0, then keep only the middle part.


Take a list of integers; reduce each by one, then truncate at the first zero, then drop first and last.


Take a list of integers; Subtract 1 from all, then delete everything starting with the first zero, then eliminate the outermost elements.


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 = r[1:-1]
    return r


Take a list of integers; subtract one from each, then keep everything before the first zero, then drop the first and last elements.


Take a list of people records (name, age); extract the ages, then extend to length 3 using zeros, then trim one element off each end.


Take a list of people records (name, age); show me all ages, then pad to 3, then cut off the first and last.


Take a list of people records (name, age); pluck the age field from each record, then extend to length 3 using zeros, then remove the first and last elements.


Take a list of people records (name, age); get the age field, then pad to 3, then keep only the middle part.


Take a list of people records (name, age); keep just each person's age, then extend to length 3 using zeros, then drop first and last.


Take a list of people records (name, age); extract age values, then pad to 3, then eliminate the outermost elements.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then strip the signs.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then take abs of each.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then get the absolute value of everything.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then apply absolute value to the whole list.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then make them all positive.


Take a list of integers; sort by distance from zero, then get the negative numbers, then make every value non-negative.


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


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


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


Take a list of people records (name, age); show me all ages, then Remove head, then strip the front negatives.


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


Take a list of people records (name, age); get the age field, then Remove head, then drop negatives from start.


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


Take a list of people records (name, age); extract age values, then Remove head, then remove negatives before the first non-negative.


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


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


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then arrange in increasing order.


Take a list of integers; if blank use 0, then remove everything after the third, then Organize these ascending.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then Sort in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then I need this sorted ascending.


Take a list of integers; replace an empty list with one zero, then take the first three, then Put these in ascending order.


Take a list of integers; zero it out if it's empty, then keep first 3, then sort smallest to largest.


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


Take a list of integers; if empty, use a single zero, then keep only the first three, then sort ascending.


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


Take a list of integers; reverse the signs of everything, then sort by descending values, then show the first three.


Take a list of integers; negate each, then sort from highest to lowest, then take the first three.


Take a list of integers; reverse the signs of everything, then sort descending, then keep first 3.


Take a list of integers; negate each, then sort largest first, then truncate to first three.


Take a list of integers; reverse the signs of everything, then sort in descending order, then first three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the list around, then remove the initial run of negative numbers.


Take a list of integers; drop duplicates but keep the first one, then flip the order around, then strip the front negatives.


Take a list of integers; drop duplicates keeping first occurrence, then put the elements backwards, then remove leading negative numbers.


Take a list of integers; drop duplicates but keep the first one, then reverse that for me, then drop negatives from start.


Take a list of integers; drop duplicates keeping first occurrence, then flip it backwards, then strip negative values from the start.


Take a list of integers; drop duplicates but keep the first one, then make it backwards, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = list(reversed(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 reverse the order, then drop the leading negative values.


Take a list of integers; add ten to each, then clamp each to at most ten, then skip the first one.


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then Discard the first element.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then skip the first one.


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


Take a list of integers; shift each up by ten, then clamp each to at most ten, then skip the first one.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then Discard the first element.


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


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


Take a list of integers; double each, then keep values above zero, then drop anything not divisible by three.


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


Take a list of integers; double each, then keep only positive numbers, then keep only multiples of three.


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


Take a list of integers; double each, then remove negatives, then filter for numbers divisible by three.


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


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


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


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


Take a list of integers; take out the first and last items, then drop everything except the final three, then increment each item.


Take a list of integers; remove both ends, then give me the last three elements, then bump each up by one.


Take a list of integers; trim the edges, then keep only the last three, then increment each item.


Take a list of integers; trim one element off each end, then keep the final three items, then bump each up by one.


Take a list of integers; cut off the first and last, then take the last three, then increment each item.


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


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


Take a list of integers; drop the zeros, then sort smallest to largest, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then Ascending sort, then any even.


Take a list of integers; drop the zeros, then Sort this ascending, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then any even.


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then sort ascending, then any even.


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


Take a list of integers; drop the zeros, then sort ascending, then return whether any value is even.


Take a list of integers; subtract one from each, then keep values divisible by 3, then drop non-negative values.


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


Take a list of integers; decrement each value, then drop anything not divisible by three, then drop non-negative values.


Take a list of integers; Lower each number by one, then filter out everything except multiples of three, then drop all positive numbers.


Take a list of integers; reduce each by one, then keep only multiples of three, then drop non-negative values.


Take a list of integers; Subtract 1 from all, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; keep the odd numbers, then keep values above zero, then arrange in decreasing order.


Take a list of integers; odd numbers only, then filter for positive numbers, then arrange in descending order.


Take a list of integers; keep the odd numbers, then keep only positive numbers, then reverse sort.


Take a list of integers; odd numbers only, then keep the positives, then sort largest to smallest.


Take a list of integers; keep the odd numbers, then remove negatives, then sort by descending values.


Take a list of integers; odd numbers only, then keep the positive numbers, then sort from highest to lowest.


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


Take a list of integers; keep the odd numbers, then keep the positive numbers, then sort descending.


Take a list of integers; keep only the first three, then keep only even values, then shift each up by ten.


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


Take a list of integers; take the first 3 elements, then keep only even values, then add 10 to everything.


Take a list of integers; remove everything after the third, then extract all even numbers, then give everything a boost of 10.


Take a list of integers; truncate to three items, then keep only even values, then increment each by ten.


Take a list of integers; show the first three, then extract all even numbers, then add a constant 10 to each.


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


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


Take a list of integers; keep everything before the first zero, then remove all zero values, then multiply each by -1.


Take a list of integers; take only what comes before the initial zero, then exclude zeros, then negate.


Take a list of integers; cut the list at the first zero, then remove all zero values, then multiply each by -1.


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then order by distance from zero, then remove the initial run of negative numbers.


Take a list of people records (name, age); show me all ages, then sort based on absolute value, then strip the front negatives.


Take a list of people records (name, age); pluck the age field from each record, then organize by magnitude, then remove leading negative numbers.


Take a list of people records (name, age); get the age field, then arrange by absolute value ascending, then drop negatives from start.


Take a list of people records (name, age); keep just each person's age, then sort from smallest to largest absolute value, then strip negative values from the start.


Take a list of people records (name, age); extract age values, then sort by absolute value, then remove negatives before the first non-negative.


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


Take a list of people records (name, age); extract the ages, then sort by absolute value, then drop the leading negative values.


Take a list of integers; keep only the first three, then remove both ends, then bump each up by one.


Take a list of integers; keep the first 3 items, then trim the edges, then increment each item.


Take a list of integers; take the first 3 elements, then trim one element off each end, then bump each up by one.


Take a list of integers; remove everything after the third, then cut off the first and last, then increment each item.


Take a list of integers; truncate to three items, then remove the first and last elements, then bump each up by one.


Take a list of integers; show the first three, then keep only the middle part, then increment each item.


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


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


Take a list of people records (name, age); extract the ages, then increase every value by 10, then find the min, defaulting to 0.


Take a list of people records (name, age); show me all ages, then add 10 to each item, then minimum value, zero otherwise.


Take a list of people records (name, age); pluck the age field from each record, then shift each up by ten, then get the minimum value or zero if empty.


Take a list of people records (name, age); get the age field, then increase all numbers by 10, then give me the min or 0.


Take a list of people records (name, age); keep just each person's age, then add 10 to everything, then return the smallest number, defaulting to 0.


Take a list of people records (name, age); extract age values, then give everything a boost of 10, then return smallest or zero if empty.


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


Take a list of people records (name, age); extract the ages, then add ten to each, then return the minimum (0 if empty).


Take a list of integers; if empty, use a single zero, then make every value non-negative, then shift each up by ten.


Take a list of integers; if blank use 0, then absolute value for all items, then increase all numbers by 10.


Take a list of integers; default to [0] when there is nothing, then take absolute values, then add 10 to everything.


Take a list of integers; when the list is empty, substitute a zero value, then turn negatives into positives, then give everything a boost of 10.


Take a list of integers; replace an empty list with one zero, then abs each element, then increment each by ten.


Take a list of integers; zero it out if it's empty, then take the absolute value of each, then add a constant 10 to each.


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


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


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


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


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


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


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


Take a list of integers; make each one bigger, then extract all even numbers, then square each value in the list.


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


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


Take a list of integers; add ten to each, then flip the list around, then truncate to the last three items.


Take a list of integers; bump everything up by 10, then flip the order around, then show only the last three.


Take a list of integers; increase every value by 10, then put the elements backwards, then remove all but the last three.


Take a list of integers; add 10 to each item, then reverse that for me, then take the final 3 elements.


Take a list of integers; shift each up by ten, then flip it backwards, then drop everything except the final three.


Take a list of integers; increase all numbers by 10, then make it backwards, then give me the last three elements.


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


Take a list of integers; add ten to each, then reverse the order, then keep only the last three.


Take a list of integers; negate each, then keep the leading run of positive numbers, then find the max, defaulting to 0.


Take a list of integers; reverse the signs of everything, then take values while they are positive, then Give me the maximum, but 0 if there are no items.


Take a list of integers; negate each, then take positive values then stop, then What's the highest number in the list.


Take a list of integers; reverse the signs of everything, then keep going while positive, then Return the greatest value or default to 0.


Take a list of integers; negate each, then stop at first non positive, then Find the largest element, defaulting to zero.


Take a list of integers; reverse the signs of everything, then take while greater than zero, then give the largest value (0 if none).


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


Take a list of integers; negate each, then take values while they are positive, then return the maximum (0 if empty).


Take a list of integers; sort by absolute value, then keep the leading run of positive numbers, then true if already sorted smallest to largest.


Take a list of integers; rearrange by distance from zero, then take values while they are positive, then does this list go in ascending order.


Take a list of integers; arrange by magnitude ignoring sign, then take positive values then stop, then check if the list is in ascending order.


Take a list of integers; put them in order by magnitude, then keep going while positive, then is the list sorted.


Take a list of integers; arrange in order of absolute value, then stop at first non positive, then is it sorted.


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


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


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


Take a list of integers; if empty, use a single zero, then sort smallest to largest, then drop non-positive values.


Take a list of integers; if blank use 0, then Ascending sort, then drop the negative numbers.


Take a list of integers; default to [0] when there is nothing, then Sort this ascending, then filter out the negative ones.


Take a list of integers; when the list is empty, substitute a zero value, then Sort lowest to highest, then remove all negative values.


Take a list of integers; replace an empty list with one zero, then Arrange from smallest to largest, then keep positive values only.


Take a list of integers; zero it out if it's empty, then sort ascending, then keep values above zero.


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


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


Take a list of integers; double each, then flip the list around, then find the min, defaulting to 0.


Take a list of integers; times two for each item, then flip the order around, then minimum value, zero otherwise.


Take a list of integers; double each, then put the elements backwards, then get the minimum value or zero if empty.


Take a list of integers; times two for each item, then reverse that for me, then give me the min or 0.


Take a list of integers; double each, then flip it backwards, then return the smallest number, defaulting to 0.


Take a list of integers; times two for each item, then make it backwards, then return smallest or zero if empty.


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


Take a list of integers; double each, then reverse the order, then return the minimum (0 if empty).


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then truncate to the last three items.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then show only the last three.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then remove all but the last three.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then take the final 3 elements.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then drop everything except the final three.


Take a list of integers; keep the part before the first 0, then keep values greater than five, then give me the last three elements.


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


Take a list of integers; keep everything before the first zero, then keep values greater than five, then keep only the last three.


Take a list of integers; keep the negative numbers, then make every value non-negative, then replace an empty list with one zero.


Take a list of integers; extract negatives, then absolute value for all items, then zero it out if it's empty.


Take a list of integers; keep the negative numbers, then take absolute values, then use zero if the list is empty.


Take a list of integers; extract negatives, then turn negatives into positives, then default to zero when empty.


Take a list of integers; keep the negative numbers, then abs each element, then if there's nothing, put in a zero.


Take a list of integers; extract negatives, then take the absolute value of each, then if no items, add a zero.


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


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


Take a list of integers; sort descending, then remove all zero values, then truncate to three items.


Take a list of integers; sort largest first, then exclude zeros, then show the first three.


Take a list of integers; sort in descending order, then remove all zero values, then take the first three.


Take a list of integers; sort from greatest to least, then exclude zeros, then keep first 3.


Take a list of integers; sort z to a, then remove all zero values, then truncate to first three.


Take a list of integers; arrange in decreasing order, then exclude zeros, then first three.


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


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


Take a list of strings; drop empty strings, then take each string's first letter, then return them as one comma-separated string.


Take a list of strings; get rid of blanks, then give me the first letter of everything, then separate by comma.


Take a list of strings; remove blanks, then reduce each string to its first character, then join with commas.


Take a list of strings; eliminate empty string values, then take first char drop blanks, then comma join.


Take a list of strings; filter out blank strings, then keep first letters only, then combine using commas.


Take a list of strings; remove strings that are empty, then first letter from each item that isn't empty, then connect with commas between each item.


def solve(xs):
    r = list(xs)
    r = [s for s in r if s]
    r = [s[0] for s in r if s]
    return ','.join(r)


Take a list of strings; drop empty strings, then keep the first character of each (dropping empties), then join them with commas.


Take a list of integers; add one to each, then keep values below zero, then give the number of evens.


Take a list of integers; make each one bigger, then get the negative numbers, then find how many values are divisible by two.


Take a list of integers; add one to each, then keep values below zero, then how many are even.


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


Take a list of integers; add one to each, then keep values below zero, then give me the count of even values.


Take a list of integers; make each one bigger, then get the negative numbers, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then remove both ends, then truncate to three items.


Take a list of integers; Sort it from low to high, then trim the edges, then show the first three.


Take a list of integers; arrange in increasing order, then trim one element off each end, then take the first three.


Take a list of integers; Organize these ascending, then cut off the first and last, then keep first 3.


Take a list of integers; Sort in ascending order, then remove the first and last elements, then truncate to first three.


Take a list of integers; I need this sorted ascending, then keep only the middle part, then first three.


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


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


Take a list of integers; if empty, use a single zero, then flip the sign of each, then make each twice as big.


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then multiply each by 2.


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


Take a list of integers; when the list is empty, substitute a zero value, then turn positives to negatives and vice versa, then multiply each by 2.


Take a list of integers; replace an empty list with one zero, then flip the sign of each, then make each twice as big.


Take a list of integers; zero it out if it's empty, then turn positives to negatives and vice versa, then multiply each by 2.


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


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


Take a list of integers; keep the positive numbers, then skip negatives at the start, then keep only numbers above 5.


Take a list of integers; get rid of anything that's not positive, then remove all negatives at the front, then exclude values of 5 and below.


Take a list of integers; drop non-positive values, then remove the initial run of negative numbers, then remove anything 5 or less.


Take a list of integers; drop the negative numbers, then strip the front negatives, then filter to keep only values above 5.


Take a list of integers; filter out the negative ones, then remove leading negative numbers, then get rid of values that aren't greater than five.


Take a list of integers; remove all negative values, then drop negatives from start, then drop anything 5 or below.


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


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


Take a list of integers; subtract one from each, then remove all zero values, then limit every value to 10.


Take a list of integers; Decrement all items, then exclude zeros, then maximum of 10 for all.


Take a list of integers; decrement each value, then remove all zero values, then limit every value to 10.


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


Take a list of integers; reduce each by one, then remove all zero values, then limit every value to 10.


Take a list of integers; Subtract 1 from all, then exclude zeros, then maximum of 10 for all.


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


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


Take a list of integers; drop the zeros, then sort smallest to largest, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then Ascending sort, then negate.


Take a list of integers; drop the zeros, then Sort this ascending, then multiply each by -1.


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


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then sort ascending, then negate.


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


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


Take a list of integers; keep the odd numbers, then remove the first item, then trim one element off each end.


Take a list of integers; odd numbers only, then Remove head, then cut off the first and last.


Take a list of integers; keep the odd numbers, then remove the first item, then remove the first and last elements.


Take a list of integers; odd numbers only, then Remove head, then keep only the middle part.


Take a list of integers; keep the odd numbers, then remove the first item, then drop first and last.


Take a list of integers; odd numbers only, then Remove head, then eliminate the outermost elements.


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


Take a list of integers; keep the odd numbers, then drop the first element, then drop the first and last elements.


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


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then multiply each by 2.


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


Take a list of integers; keep only nonzero elements, then strip the front negatives, then multiply each by 2.


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


Take a list of integers; keep only nonzero elements, then drop negatives from start, then multiply each by 2.


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


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


Take a list of integers; if empty, use a single zero, then increment each value, then trim one element off each end.


Take a list of integers; if blank use 0, then plus one for all, then cut off the first and last.


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


Take a list of integers; when the list is empty, substitute a zero value, then plus one for all, then keep only the middle part.


Take a list of integers; replace an empty list with one zero, then increment each value, then drop first and last.


Take a list of integers; zero it out if it's empty, then plus one for all, then eliminate the outermost elements.


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


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


Take a list of people records (name, age); extract the ages, then increase every value by 10, then give the number of evens.


Take a list of people records (name, age); show me all ages, then add 10 to each item, then find how many values are divisible by two.


Take a list of people records (name, age); pluck the age field from each record, then shift each up by ten, then how many are even.


Take a list of people records (name, age); get the age field, then increase all numbers by 10, then get the total number of even values in the list.


Take a list of people records (name, age); keep just each person's age, then add 10 to everything, then give me the count of even values.


Take a list of people records (name, age); extract age values, then give everything a boost of 10, then I need to know how many of these are even.


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


Take a list of people records (name, age); extract the ages, then add ten to each, then return how many values are even.


Take a list of integers; drop the first and last elements, then increase every value by 10, then give the number of evens.


Take a list of integers; take out the first and last items, then add 10 to each item, then find how many values are divisible by two.


Take a list of integers; remove both ends, then shift each up by ten, then how many are even.


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


Take a list of integers; trim one element off each end, then add 10 to everything, then give me the count of even values.


Take a list of integers; cut off the first and last, then give everything a boost of 10, then I need to know how many of these are even.


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


Take a list of integers; drop the first and last elements, then add ten to each, then return how many values are even.


Take a list of integers; reverse the order, then remove repeated values, then true if any value equals zero.


Take a list of integers; reverse, then unique values preserving order, then check for zero.


Take a list of integers; flip the list around, then remove repeated values, then true if any value equals zero.


Take a list of integers; flip the order around, then unique values preserving order, then check for zero.


Take a list of integers; put the elements backwards, then remove repeated values, then true if any value equals zero.


Take a list of integers; reverse that for me, then unique values preserving order, then check for zero.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = list(dict.fromkeys(r))
    return 0 in r


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


Take a list of people records (name, age); extract the ages, then make every value non-negative, then shift each up by ten.


Take a list of people records (name, age); show me all ages, then absolute value for all items, then increase all numbers by 10.


Take a list of people records (name, age); pluck the age field from each record, then take absolute values, then add 10 to everything.


Take a list of people records (name, age); get the age field, then turn negatives into positives, then give everything a boost of 10.


Take a list of people records (name, age); keep just each person's age, then abs each element, then increment each by ten.


Take a list of people records (name, age); extract age values, then take the absolute value of each, then add a constant 10 to each.


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


Take a list of people records (name, age); extract the ages, then take the absolute value of each, then add ten to each.


Take a list of strings; trim whitespace from each, then order strings from shortest to longest, then find the longest one, defaulting to empty.


Take a list of strings; strip whitespace from every element, then shortest to longest, then Longest string, or nothing if there isn't one.


Take a list of strings; remove surrounding whitespace, then arrange by string length ascending, then find the longest one, defaulting to empty.


Take a list of strings; trim the whitespace off everything, then length sort, then Longest string, or nothing if there isn't one.


Take a list of strings; strip spaces from all strings, then sort by length shortest first, then find the longest one, defaulting to empty.


Take a list of strings; strip all the strings, then organize by string length least to greatest, then Longest string, or nothing if there isn't one.


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


Take a list of strings; trim whitespace from each, then sort by length, shortest first, then return the longest string (empty if none).


Take a list of integers; drop the zeros, then flip the list around, then true if already sorted smallest to largest.


Take a list of integers; keep only nonzero elements, then flip the order around, then does this list go in ascending order.


Take a list of integers; drop the zeros, then put the elements backwards, then check if the list is in ascending order.


Take a list of integers; keep only nonzero elements, then reverse that for me, then is the list sorted.


Take a list of integers; drop the zeros, then flip it backwards, then is it sorted.


Take a list of integers; keep only nonzero elements, then make it backwards, then check if values are in increasing order.


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


Take a list of integers; drop the zeros, then reverse the order, then return whether the list is sorted ascending.


Take a list of integers; pad with zeros to at least three elements, then flip the list around, then true only if all are positive.


Take a list of integers; add zeros until the list has at least three values, then flip the order around, then do all of these have positive values.


Take a list of integers; pad with zeros to at least three elements, then put the elements backwards, then check if every value is positive.


Take a list of integers; add zeros until the list has at least three values, then reverse that for me, then confirm all values are positive.


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


Take a list of integers; add zeros until the list has at least three values, then make it backwards, then check if every number is above zero.


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


Take a list of integers; pad with zeros to at least three elements, then reverse the order, then return whether all values are positive.


Take a list of integers; negate each, then default to [0] when there is nothing, then count the elements.


Take a list of integers; reverse the signs of everything, then when the list is empty, substitute a zero value, then how many items remain.


Take a list of integers; negate each, then replace an empty list with one zero, then tell me the length.


Take a list of integers; reverse the signs of everything, then zero it out if it's empty, then return the length.


Take a list of integers; negate each, then use zero if the list is empty, then count them.


Take a list of integers; reverse the signs of everything, then default to zero when empty, then what's the count.


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


Take a list of integers; negate each, then if empty, use a single zero, then return how many remain.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then give back the product of all values.


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


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then what's the product.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then what do they multiply to.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then give me their product.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then multiply them all together.


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


Take a list of integers; pad with zeros to at least three elements, then drop duplicates keeping first occurrence, then return their product.


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


Take a list of integers; make each one bigger, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; negate each, then make every value non-negative, then limit every value to 10.


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


Take a list of integers; negate each, then take absolute values, then limit every value to 10.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then maximum of 10 for all.


Take a list of integers; negate each, then abs each element, then limit every value to 10.


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


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


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


Take a list of integers; sort by absolute value, then keep only even values, then raise each to the power of two.


Take a list of integers; rearrange by distance from zero, then extract all even numbers, then I need each number multiplied by itself.


Take a list of integers; arrange by magnitude ignoring sign, then keep only even values, then square all of them.


Take a list of integers; put them in order by magnitude, then extract all even numbers, then multiply each element by itself.


Take a list of integers; arrange in order of absolute value, then keep only even values, then make each one squared.


Take a list of integers; sort by distance from zero, then extract all even numbers, then square each value in the list.


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


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


Take a list of integers; drop the first element, then multiply each by two, then find the min, defaulting to 0.


Take a list of integers; Take everything except the first, then double each item in the list, then minimum value, zero otherwise.


Take a list of integers; drop the first element, then multiply each by two, then get the minimum value or zero if empty.


Take a list of integers; Take everything except the first, then double each item in the list, then give me the min or 0.


Take a list of integers; drop the first element, then multiply each by two, then return the smallest number, defaulting to 0.


Take a list of integers; Take everything except the first, then double each item in the list, then return smallest or zero if empty.


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


Take a list of integers; drop the first element, then double each, then return the minimum (0 if empty).


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


Take a list of integers; bump everything up by 10, then square them all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; increase every value by 10, then raise each to the power of two, then What's the highest number in the list.


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


Take a list of integers; shift each up by ten, then square all of them, then Find the largest element, defaulting to zero.


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


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


Take a list of integers; add ten to each, then square each, then return the maximum (0 if empty).


Take a list of integers; reverse the order, then keep values below zero, then give back the product of all values.


Take a list of integers; reverse, then get the negative numbers, then product of the list.


Take a list of integers; flip the list around, then keep values below zero, then what's the product.


Take a list of integers; flip the order around, then get the negative numbers, then what do they multiply to.


Take a list of integers; put the elements backwards, then keep values below zero, then give me their product.


Take a list of integers; reverse that for me, then get the negative numbers, then multiply them all together.


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


Take a list of integers; reverse the order, then keep the negative numbers, then return their product.


Take a list of integers; square each, then keep values divisible by 3, then drop non-negative values.


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


Take a list of integers; multiply each value by itself, then drop anything not divisible by three, then drop non-negative values.


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


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


Take a list of integers; I need each number multiplied by itself, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; keep only the first three, then make every value non-negative, then true if already sorted smallest to largest.


Take a list of integers; keep the first 3 items, then absolute value for all items, then does this list go in ascending order.


Take a list of integers; take the first 3 elements, then take absolute values, then check if the list is in ascending order.


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


Take a list of integers; truncate to three items, then abs each element, then is it sorted.


Take a list of integers; show the first three, then take the absolute value of each, then check if values are in increasing order.


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


Take a list of integers; keep only the first three, then take the absolute value of each, then return whether the list is sorted ascending.


Take a list of integers; add ten to each, then keep the leading run of positive numbers, then count the elements.


Take a list of integers; bump everything up by 10, then take values while they are positive, then how many items remain.


Take a list of integers; increase every value by 10, then take positive values then stop, then tell me the length.


Take a list of integers; add 10 to each item, then keep going while positive, then return the length.


Take a list of integers; shift each up by ten, then stop at first non positive, then count them.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then what's the count.


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


Take a list of integers; add ten to each, then take values while they are positive, then return how many remain.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then true only if all are positive.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then do all of these have positive values.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then check if every value is positive.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then confirm all values are positive.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then all positive.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then check if every number is above zero.


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


Take a list of integers; pad with zeros to at least three elements, then double each, then return whether all values are positive.


Take a list of people records (name, age); extract the ages, then increase every value by 10, then reduce each by one.


Take a list of people records (name, age); show me all ages, then add 10 to each item, then Subtract 1 from all.


Take a list of people records (name, age); pluck the age field from each record, then shift each up by ten, then Subtract one from each.


Take a list of people records (name, age); get the age field, then increase all numbers by 10, then Drop each by one.


Take a list of people records (name, age); keep just each person's age, then add 10 to everything, then Decrease all values by one.


Take a list of people records (name, age); extract age values, then give everything a boost of 10, then Remove one from each value.


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


Take a list of people records (name, age); extract the ages, then add ten to each, then subtract one from each.


Take a list of integers; sort by absolute value, then sort largest to smallest, then drop non-positive values.


Take a list of integers; rearrange by distance from zero, then sort by descending values, then drop the negative numbers.


Take a list of integers; arrange by magnitude ignoring sign, then sort from highest to lowest, then filter out the negative ones.


Take a list of integers; put them in order by magnitude, then sort descending, then remove all negative values.


Take a list of integers; arrange in order of absolute value, then sort largest first, then keep positive values only.


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


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


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


Take a list of integers; drop the leading negative values, then multiply each value by itself, then drop non-negative values.


Take a list of integers; cut the leading negatives, then square them all, then drop all positive numbers.


Take a list of integers; skip negatives at the start, then raise each to the power of two, then drop non-negative values.


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


Take a list of integers; remove the initial run of negative numbers, then square all of them, then drop non-negative values.


Take a list of integers; strip the front negatives, then multiply each element by itself, then drop all positive numbers.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then strip the signs.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then take abs of each.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then get the absolute value of everything.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then apply absolute value to the whole list.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then make them all positive.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then make every value non-negative.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the odd numbers, then take the absolute value of each.


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


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then reverse that for me.


Take a list of integers; drop the first element, then clamp each to at most ten, then flip it backwards.


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


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


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


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


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


Take a list of integers; drop the first element, then keep only even values, then give the number of evens.


Take a list of integers; Take everything except the first, then extract all even numbers, then find how many values are divisible by two.


Take a list of integers; drop the first element, then keep only even values, then how many are even.


Take a list of integers; Take everything except the first, then extract all even numbers, then get the total number of even values in the list.


Take a list of integers; drop the first element, then keep only even values, then give me the count of even values.


Take a list of integers; Take everything except the first, then extract all even numbers, then I need to know how many of these are even.


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


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


Take a list of integers; take the absolute value of each, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; convert to absolute value, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; strip the signs, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; take abs of each, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; get the absolute value of everything, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; apply absolute value to the whole list, then Remove head, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; cap each value at 10, then flip the sign of each, then replace an empty list with one zero.


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then zero it out if it's empty.


Take a list of integers; cap each value at 10, then flip the sign of each, then use zero if the list is empty.


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then default to zero when empty.


Take a list of integers; cap each value at 10, then flip the sign of each, then if there's nothing, put in a zero.


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then if no items, add a zero.


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


Take a list of integers; cap each value at 10, then negate each, then if empty, use a single zero.


Take a list of integers; sort by absolute value, then remove all zero values, then take values up to (excluding) the first zero.


Take a list of integers; rearrange by distance from zero, then exclude zeros, then keep the part before the first 0.


Take a list of integers; arrange by magnitude ignoring sign, then remove all zero values, then truncate at the first zero.


Take a list of integers; put them in order by magnitude, then exclude zeros, then delete everything starting with the first zero.


Take a list of integers; arrange in order of absolute value, then remove all zero values, then remove from the first zero onwards.


Take a list of integers; sort by distance from zero, then exclude zeros, then up to but not including the first zero.


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


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


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


Take a list of integers; reverse the signs of everything, then when the list is empty, substitute a zero value, then strip out the evens.


Take a list of integers; negate each, then replace an empty list with one zero, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then zero it out if it's empty, then strip out the evens.


Take a list of integers; negate each, then use zero if the list is empty, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then default to zero when empty, then strip out the evens.


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


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


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


Take a list of integers; keep only nonzero elements, then extract all even numbers, then keep the part before the first 0.


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


Take a list of integers; keep only nonzero elements, then extract all even numbers, then delete everything starting with the first zero.