Take a list of integers; drop anything not divisible by three, then remove the first and last elements, then make each twice as big.


Take a list of integers; filter out everything except multiples of three, then keep only the middle part, then multiply each by 2.


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


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


Take a list of integers; keep the even numbers, then increment each value, then drop anything not divisible by three.


Take a list of integers; keep evens, then plus one for all, then filter out everything except multiples of three.


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


Take a list of integers; keep evens, then plus one for all, then multiples of three only.


Take a list of integers; keep the even numbers, then increment each value, then filter for numbers divisible by three.


Take a list of integers; keep evens, then plus one for all, then give me only the values divisible by three.


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


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


Take a list of integers; add ten to each, then increment each value, then truncate to three items.


Take a list of integers; bump everything up by 10, then plus one for all, then show the first three.


Take a list of integers; increase every value by 10, then increment each value, then take the first three.


Take a list of integers; add 10 to each item, then plus one for all, then keep first 3.


Take a list of integers; shift each up by ten, then increment each value, then truncate to first three.


Take a list of integers; increase all numbers by 10, then plus one for all, then first three.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then arrange in decreasing order.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then arrange in descending order.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then reverse sort.


Take a list of people records (name, age); get the age field, then extract all even numbers, then sort largest to smallest.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then sort by descending values.


Take a list of people records (name, age); extract age values, then extract all even numbers, then sort from highest to lowest.


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


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


Take a list of integers; take values while they are positive, then flip the list around, then remove the initial run of negative numbers.


Take a list of integers; take positive values then stop, then flip the order around, then strip the front negatives.


Take a list of integers; keep going while positive, then put the elements backwards, then remove leading negative numbers.


Take a list of integers; stop at first non positive, then reverse that for me, then drop negatives from start.


Take a list of integers; take while greater than zero, then flip it backwards, then strip negative values from the start.


Take a list of integers; take values while positive, then make it backwards, then remove negatives before the first non-negative.


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


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


Take a list of integers; reverse the order, then clamp each to at most ten, then stop at the first non-positive value.


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


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


Take a list of integers; flip the order around, then don't let anything exceed 10, then take positive values then stop.


Take a list of integers; put the elements backwards, then clamp each to at most ten, then keep going while positive.


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


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


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


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


Take a list of integers; Take everything except the first, then get the negative numbers, then exclude values of 5 and below.


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


Take a list of integers; Take everything except the first, then get the negative numbers, then filter to keep only values above 5.


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


Take a list of integers; Take everything except the first, then get the negative numbers, then drop anything 5 or below.


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


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


Take a list of integers; if empty, use a single zero, then increase every value by 10, then true if any value equals zero.


Take a list of integers; if blank use 0, then add 10 to each item, then check for zero.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then true if any value equals zero.


Take a list of integers; when the list is empty, substitute a zero value, then increase all numbers by 10, then check for zero.


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then true if any value equals zero.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then check for zero.


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


Take a list of integers; if empty, use a single zero, then add ten to each, then return whether the list contains a zero.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then give back the product of all values.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then what's the product.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then what do they multiply to.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then give me their product.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then multiply them all together.


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


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


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


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


Take a list of integers; flip the list around, then keep only even values, then square all of them.


Take a list of integers; flip the order around, then extract all even numbers, then multiply each element by itself.


Take a list of integers; put the elements backwards, then keep only even values, then make each one squared.


Take a list of integers; reverse that for me, then extract all even numbers, then square each value in the list.


def solve(xs):
    r = list(xs)
    r = list(reversed(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; reverse the order, then keep the even numbers, then square each.


Take a list of integers; keep values greater than five, then default to [0] when there is nothing, then give the earliest even value or zero.


Take a list of integers; filter out values less than or equal to 5, then when the list is empty, substitute a zero value, then fetch the first even element, default to 0.


Take a list of integers; keep only numbers above 5, then replace an empty list with one zero, then give the earliest even value or zero.


Take a list of integers; exclude values of 5 and below, then zero it out if it's empty, then fetch the first even element, default to 0.


Take a list of integers; remove anything 5 or less, then use zero if the list is empty, then give the earliest even value or zero.


Take a list of integers; filter to keep only values above 5, then default to zero when empty, then fetch the first even element, default to 0.


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


Take a list of integers; keep values greater than five, then if empty, use a single zero, then return the first even value (0 if none).


Take a list of integers; keep the even numbers, then order by distance from zero, then trim one element off each end.


Take a list of integers; keep evens, then sort based on absolute value, then cut off the first and last.


Take a list of integers; keep the even numbers, then organize by magnitude, then remove the first and last elements.


Take a list of integers; keep evens, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; keep the even numbers, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; keep evens, then sort by absolute value, then eliminate the outermost elements.


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


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


Take a list of integers; drop the first and last elements, then multiply each value by itself, then keep only non-zero numbers.


Take a list of integers; take out the first and last items, then square them all, then strip the zeros.


Take a list of integers; remove both ends, then raise each to the power of two, then keep only non-zero numbers.


Take a list of integers; trim the edges, then I need each number multiplied by itself, then strip the zeros.


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


Take a list of integers; cut off the first and last, then multiply each element by itself, then strip the zeros.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    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 first and last elements, then square each, then drop the zeros.


Take a list of integers; subtract one from each, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; Decrement all items, then square them all, then Organize these ascending.


Take a list of integers; decrement each value, then raise each to the power of two, then Sort in ascending order.


Take a list of integers; Lower each number by one, then I need each number multiplied by itself, then I need this sorted ascending.


Take a list of integers; reduce each by one, then square all of them, then Put these in ascending order.


Take a list of integers; Subtract 1 from all, then multiply each element by itself, then sort smallest to largest.


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


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


Take a list of integers; negate each, then keep only odd values, then give the earliest even value or zero.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then fetch the first even element, default to 0.


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


Take a list of integers; negate each, then keep the odd numbers, then return the first even value (0 if none).


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then maximum of 10 for all.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the even numbers, then cap each value at 10.


Take a list of integers; take the absolute value of each, then remove both ends, then give the number of evens.


Take a list of integers; convert to absolute value, then trim the edges, then find how many values are divisible by two.


Take a list of integers; strip the signs, then trim one element off each end, then how many are even.


Take a list of integers; take abs of each, then cut off the first and last, then get the total number of even values in the list.


Take a list of integers; get the absolute value of everything, then remove the first and last elements, then give me the count of even values.


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then I need to know how many of these are even.


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


Take a list of integers; take the absolute value of each, then drop the first and last elements, then return how many values are even.


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


Take a list of integers; keep evens, then pad to 3, then minimum value, zero otherwise.


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


Take a list of integers; keep evens, then pad to 3, then give me the min or 0.


Take a list of integers; keep the even numbers, then extend to length 3 using zeros, then return the smallest number, defaulting to 0.


Take a list of integers; keep evens, then pad to 3, then return smallest or zero if empty.


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


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


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


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


Take a list of integers; arrange by magnitude ignoring sign, then keep only odd values, then true if any value equals zero.


Take a list of integers; put them in order by magnitude, then eliminate the even numbers, then check for zero.


Take a list of integers; arrange in order of absolute value, then keep only odd values, then true if any value equals zero.


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


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


Take a list of integers; sort by absolute value, then keep the odd numbers, then return whether the list contains a zero.


Take a list of integers; take the absolute value of each, then decrement each value, then drop non-negative values.


Take a list of integers; convert to absolute value, then Lower each number by one, then drop all positive numbers.


Take a list of integers; strip the signs, then reduce each by one, then drop non-negative values.


Take a list of integers; take abs of each, then Subtract 1 from all, then drop all positive numbers.


Take a list of integers; get the absolute value of everything, then Subtract one from each, then drop non-negative values.


Take a list of integers; apply absolute value to the whole list, then Drop each by one, then drop all positive numbers.


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


Take a list of integers; take the absolute value of each, then subtract one from each, then keep the negative numbers.


Take a list of strings; sort by length, shortest first, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; sort ascending by length, then make each one start with a hash, then sort by letter.


Take a list of strings; order strings from shortest to longest, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; shortest to longest, then make each one start with a hash, then sort by letter.


Take a list of strings; arrange by string length ascending, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; length sort, then make each one start with a hash, then sort by letter.


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


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


Take a list of integers; keep only the first three, then extend to length 3 using zeros, then truncate to the last three items.


Take a list of integers; keep the first 3 items, then pad to 3, then show only the last three.


Take a list of integers; take the first 3 elements, then extend to length 3 using zeros, then remove all but the last three.


Take a list of integers; remove everything after the third, then pad to 3, then take the final 3 elements.


Take a list of integers; truncate to three items, then extend to length 3 using zeros, then drop everything except the final three.


Take a list of integers; show the first three, then pad to 3, then give me the last three elements.


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


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


Take a list of integers; drop the first element, then flip the sign of each, then arrange by magnitude ignoring sign.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then put them in order by magnitude.


Take a list of integers; drop the first element, then flip the sign of each, then arrange in order of absolute value.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then sort by distance from zero.


Take a list of integers; drop the first element, then flip the sign of each, then order by how far from zero.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then order by distance from zero.


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


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


Take a list of integers; sort ascending, then skip negatives at the start, then drop non-positive values.


Take a list of integers; Sort it from low to high, then remove all negatives at the front, then drop the negative numbers.


Take a list of integers; arrange in increasing order, then remove the initial run of negative numbers, then filter out the negative ones.


Take a list of integers; Organize these ascending, then strip the front negatives, then remove all negative values.


Take a list of integers; Sort in ascending order, then remove leading negative numbers, then keep positive values only.


Take a list of integers; I need this sorted ascending, then drop negatives from start, then keep values above zero.


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


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


Take a list of integers; negate each, then remove all zero values, then true if every value is unique.


Take a list of integers; reverse the signs of everything, then exclude zeros, then check for duplicates in the values.


Take a list of integers; negate each, then remove all zero values, then do all values appear only once.


Take a list of integers; reverse the signs of everything, then exclude zeros, then check that there are no duplicates.


Take a list of integers; negate each, then remove all zero values, then are the values all unique.


Take a list of integers; reverse the signs of everything, then exclude zeros, then check if all values are unique.


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


Take a list of integers; negate each, then drop the zeros, then return whether all values are distinct.


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


Take a list of integers; extract negatives, then double each item in the list, then put them in order by magnitude.


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


Take a list of integers; extract negatives, then double each item in the list, then sort by distance from zero.


Take a list of integers; keep the negative numbers, then multiply each by two, then order by how far from zero.


Take a list of integers; extract negatives, then double each item in the list, then order by distance from zero.


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


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


Take a list of integers; double each, then keep values divisible by 3, then replace an empty list with one zero.


Take a list of integers; times two for each item, then keep items where x mod 3 equals zero, then zero it out if it's empty.


Take a list of integers; double each, then drop anything not divisible by three, then use zero if the list is empty.


Take a list of integers; times two for each item, then filter out everything except multiples of three, then default to zero when empty.


Take a list of integers; double each, then keep only multiples of three, then if there's nothing, put in a zero.


Take a list of integers; times two for each item, then multiples of three only, 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 if x % 3 == 0]
    r = r if r else [0]
    return r


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


Take a list of integers; reverse the order, then keep values below zero, then make each twice as big.


Take a list of integers; reverse, then get the negative numbers, then multiply each by 2.


Take a list of integers; flip the list around, then keep values below zero, then make each twice as big.


Take a list of integers; flip the order around, then get the negative numbers, then multiply each by 2.


Take a list of integers; put the elements backwards, then keep values below zero, then make each twice as big.


Take a list of integers; reverse that for me, then get the negative numbers, then multiply each by 2.


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


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


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


Take a list of integers; keep the first 3 items, then flip the order around, then increment each item.


Take a list of integers; take the first 3 elements, then put the elements backwards, then bump each up by one.


Take a list of integers; remove everything after the third, then reverse that for me, then increment each item.


Take a list of integers; truncate to three items, then flip it backwards, then bump each up by one.


Take a list of integers; show the first three, then make it backwards, then increment each item.


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


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


Take a list of integers; pad with zeros to at least three elements, then flip the sign of each, then truncate to the last three items.


Take a list of integers; add zeros until the list has at least three values, then turn positives to negatives and vice versa, then show only the last three.


Take a list of integers; pad with zeros to at least three elements, then flip the sign of each, then remove all but the last three.


Take a list of integers; add zeros until the list has at least three values, then turn positives to negatives and vice versa, then take the final 3 elements.


Take a list of integers; pad with zeros to at least three elements, then flip the sign of each, then drop everything except the final three.


Take a list of integers; add zeros until the list has at least three values, then turn positives to negatives and vice versa, then give me the last three elements.


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


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


Take a list of integers; double each, then flip the sign of each, then remove the initial run of negative numbers.


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


Take a list of integers; double each, then flip the sign of each, then remove leading negative numbers.


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


Take a list of integers; double each, then flip the sign of each, then strip negative values from the start.


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then remove negatives before the first non-negative.


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


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


Take a list of people records (name, age); extract the ages, then extend to length 3 using zeros, then keep only numbers above 5.


Take a list of people records (name, age); show me all ages, then pad to 3, then exclude values of 5 and below.


Take a list of people records (name, age); pluck the age field from each record, then extend to length 3 using zeros, then remove anything 5 or less.


Take a list of people records (name, age); get the age field, then pad to 3, then filter to keep only values above 5.


Take a list of people records (name, age); keep just each person's age, then extend to length 3 using zeros, then get rid of values that aren't greater than five.


Take a list of people records (name, age); extract age values, then pad to 3, then drop anything 5 or below.


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


Take a list of people records (name, age); extract the ages, then pad with zeros to at least three elements, then keep values greater than five.


Take a list of integers; subtract one from each, then make every value non-negative, then arrange in increasing order.


Take a list of integers; Decrement all items, then absolute value for all items, then Organize these ascending.


Take a list of integers; decrement each value, then take absolute values, then Sort in ascending order.


Take a list of integers; Lower each number by one, then turn negatives into positives, then I need this sorted ascending.


Take a list of integers; reduce each by one, then abs each element, then Put these in ascending order.


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


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


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


Take a list of people records (name, age); extract the ages, then remove both ends, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then trim the edges, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); pluck the age field from each record, then trim one element off each end, then ensure at least three items by appending zeros.


Take a list of people records (name, age); get the age field, then cut off the first and last, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); keep just each person's age, then remove the first and last elements, then ensure at least three items by appending zeros.


Take a list of people records (name, age); extract age values, 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 = [d['age'] for d in r]
    r = r[1:-1]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; keep the negative numbers, then remove both ends, then skip the first one.


Take a list of integers; extract negatives, then trim the edges, then Discard the first element.


Take a list of integers; keep the negative numbers, then trim one element off each end, then skip the first one.


Take a list of integers; extract negatives, then cut off the first and last, then Discard the first element.


Take a list of integers; keep the negative numbers, then remove the first and last elements, then skip the first one.


Take a list of integers; extract negatives, then keep only the middle part, then Discard the first element.


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


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


Take a list of integers; keep the negative numbers, then flip the sign of each, then make each twice as big.


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


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


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


Take a list of integers; add one to each, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; make each one bigger, then Remove head, then minimum value, zero otherwise.


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


Take a list of integers; make each one bigger, then Remove head, then give me the min or 0.


Take a list of integers; add one to each, then remove the first item, then return the smallest number, defaulting to 0.


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


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then keep only numbers above 5.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then exclude values of 5 and below.


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then remove anything 5 or less.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then filter to keep only values above 5.


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then get rid of values that aren't greater than five.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then drop anything 5 or below.


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


Take a list of integers; pad with zeros to at least three elements, then keep the negative numbers, then keep values greater than five.


Take a list of integers; add ten to each, then flip the list around, then count the elements.


Take a list of integers; bump everything up by 10, then flip the order around, then how many items remain.


Take a list of integers; increase every value by 10, then put the elements backwards, then tell me the length.


Take a list of integers; add 10 to each item, then reverse that for me, then return the length.


Take a list of integers; shift each up by ten, then flip it backwards, then count them.


Take a list of integers; increase all numbers by 10, then make it backwards, then what's the count.


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


Take a list of integers; add ten to each, then reverse the order, then return how many remain.


Take a list of integers; keep the negative numbers, then take the final 3 elements, then remove the initial run of negative numbers.


Take a list of integers; extract negatives, then drop everything except the final three, then strip the front negatives.


Take a list of integers; keep the negative numbers, then give me the last three elements, then remove leading negative numbers.


Take a list of integers; extract negatives, then keep only the last three, then drop negatives from start.


Take a list of integers; keep the negative numbers, then keep the final three items, then strip negative values from the start.


Take a list of integers; extract negatives, then take the last three, then remove negatives before the first non-negative.


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


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


Take a list of integers; drop the first and last elements, then extend to length 3 using zeros, then arrange in decreasing order.


Take a list of integers; take out the first and last items, then pad to 3, then arrange in descending order.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then reverse sort.


Take a list of integers; trim the edges, then pad to 3, then sort largest to smallest.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then sort by descending values.


Take a list of integers; cut off the first and last, then pad to 3, then sort from highest to lowest.


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


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


Take a list of integers; keep everything before the first zero, then make every value non-negative, then true only if all are positive.


Take a list of integers; take only what comes before the initial zero, then absolute value for all items, then do all of these have positive values.


Take a list of integers; cut the list at the first zero, then take absolute values, then check if every value is positive.


Take a list of integers; cut off after the first zero appears, then turn negatives into positives, then confirm all values are positive.


Take a list of integers; take values up to (excluding) the first zero, then abs each element, then all positive.


Take a list of integers; keep the part before the first 0, then take the absolute value of each, then check if every number is above zero.


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


Take a list of integers; keep everything before the first zero, then take the absolute value of each, then return whether all values are positive.


Take a list of integers; square each, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; each value squared, then cut off after the first zero appears, then show only the last three.


Take a list of integers; multiply each value by itself, then take values up to (excluding) the first zero, then remove all but the last three.


Take a list of integers; square them all, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; raise each to the power of two, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; I need each number multiplied by itself, then delete everything starting with the first zero, then give me the last three elements.


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


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


Take a list of integers; keep multiples of three, then take the final 3 elements, then drop non-negative values.


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


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


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


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


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


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


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


Take a list of integers; drop the first and last elements, then increment each value, then find the max, defaulting to 0.


Take a list of integers; take out the first and last items, then plus one for all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; remove both ends, then increment each value, then What's the highest number in the list.


Take a list of integers; trim the edges, then plus one for all, then Return the greatest value or default to 0.


Take a list of integers; trim one element off each end, then increment each value, then Find the largest element, defaulting to zero.


Take a list of integers; cut off the first and last, then plus one for all, then give the largest value (0 if none).


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


Take a list of integers; drop the first and last elements, then add one to each, then return the maximum (0 if empty).


Take a list of integers; take values while they are positive, then keep values below zero, then arrange by magnitude ignoring sign.


Take a list of integers; take positive values then stop, then get the negative numbers, then put them in order by magnitude.


Take a list of integers; keep going while positive, then keep values below zero, then arrange in order of absolute value.


Take a list of integers; stop at first non positive, then get the negative numbers, then sort by distance from zero.


Take a list of integers; take while greater than zero, then keep values below zero, then order by how far from zero.


Take a list of integers; take values while positive, then get the negative numbers, then order by distance from zero.


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


Take a list of integers; take values while they are positive, then keep the negative numbers, then sort by absolute value.


Take a list of integers; keep multiples of three, then remove all zero values, then limit every value to 10.


Take a list of integers; get rid of non-multiples of three, then exclude zeros, then maximum of 10 for all.


Take a list of integers; keep values divisible by 3, then remove all zero values, then limit every value to 10.


Take a list of integers; keep items where x mod 3 equals zero, then exclude zeros, then maximum of 10 for all.


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


Take a list of integers; filter out everything except multiples of three, then exclude zeros, then maximum of 10 for all.


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


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


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


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


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


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


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


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


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = r[1:]
    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 first element, then keep everything before the first zero.


Take a list of integers; keep the even numbers, then cut the list at the first zero, then true if already sorted smallest to largest.


Take a list of integers; keep evens, then cut off after the first zero appears, then does this list go in ascending order.


Take a list of integers; keep the even numbers, then take values up to (excluding) the first zero, then check if the list is in ascending order.


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


Take a list of integers; keep the even numbers, then truncate at the first zero, then is it sorted.


Take a list of integers; keep evens, then delete everything starting with the first zero, then check if values are in increasing order.


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


Take a list of integers; keep the even numbers, then keep everything before the first zero, then return whether the list is sorted ascending.


Take a list of integers; sort by absolute value, then cut the list at the first zero, then keep only non-zero numbers.


Take a list of integers; rearrange by distance from zero, then cut off after the first zero appears, then strip the zeros.


Take a list of integers; arrange by magnitude ignoring sign, then take values up to (excluding) the first zero, then keep only non-zero numbers.


Take a list of integers; put them in order by magnitude, then keep the part before the first 0, then strip the zeros.


Take a list of integers; arrange in order of absolute value, then truncate at the first zero, then keep only non-zero numbers.


Take a list of integers; sort by distance from zero, then delete everything starting with the first zero, then strip the zeros.


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


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


Take a list of integers; keep only the first three, then take the final 3 elements, then give the number of evens.


Take a list of integers; keep the first 3 items, then drop everything except the final three, then find how many values are divisible by two.


Take a list of integers; take the first 3 elements, then give me the last three elements, then how many are even.


Take a list of integers; remove everything after the third, then keep only the last three, then get the total number of even values in the list.


Take a list of integers; truncate to three items, then keep the final three items, then give me the count of even values.


Take a list of integers; show the first three, then take the last three, then I need to know how many of these are even.


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


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


Take a list of integers; keep the negative numbers, then remove the first item, then arrange in decreasing order.


Take a list of integers; extract negatives, then Remove head, then arrange in descending order.


Take a list of integers; keep the negative numbers, then remove the first item, then reverse sort.


Take a list of integers; extract negatives, then Remove head, then sort largest to smallest.


Take a list of integers; keep the negative numbers, then remove the first item, then sort by descending values.


Take a list of integers; extract negatives, then Remove head, then sort from highest to lowest.


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


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


Take a list of integers; drop the zeros, then remove both ends, then drop non-negative values.


Take a list of integers; keep only nonzero elements, then trim the edges, then drop all positive numbers.


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


Take a list of integers; keep only nonzero elements, then cut off the first and last, then drop all positive numbers.


Take a list of integers; drop the zeros, then remove the first and last elements, then drop non-negative values.


Take a list of integers; keep only nonzero elements, then keep only the middle part, then drop all positive numbers.


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


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


Take a list of integers; if empty, use a single zero, then multiply each by two, then stop at the first non-positive value.


Take a list of integers; if blank use 0, then double each item in the list, then keep the leading run of positive numbers.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then take values while they are positive.


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


Take a list of integers; replace an empty list with one zero, then multiply each by two, then keep going while positive.


Take a list of integers; zero it out if it's empty, then double each item in the list, then stop at first non positive.


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


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


Take a list of integers; keep the negative numbers, then make every value non-negative, then give the earliest even value or zero.


Take a list of integers; extract negatives, then absolute value for all items, then fetch the first even element, default to 0.


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


Take a list of integers; extract negatives, then turn negatives into positives, then fetch the first even element, default to 0.


Take a list of integers; keep the negative numbers, then abs each element, then give the earliest even value or zero.


Take a list of integers; extract negatives, then take the absolute value of each, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then maximum of 10 for all.


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


Take a list of integers; drop duplicates but keep the first one, then filter out everything except multiples of three, then maximum of 10 for all.


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then multiples of three only, then maximum of 10 for all.


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


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


Take a list of integers; add one to each, then multiply each by two, then find the min, defaulting to 0.


Take a list of integers; make each one bigger, then double each item in the list, then minimum value, zero otherwise.


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


Take a list of integers; make each one bigger, then double each item in the list, then give me the min or 0.


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


Take a list of integers; make each one bigger, then double each item in the list, then return smallest or zero if empty.


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


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


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


Take a list of integers; extract negatives, then Lower each number by one, then Discard the first element.


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


Take a list of integers; extract negatives, then Subtract 1 from all, then Discard the first element.


Take a list of integers; keep the negative numbers, then Subtract one from each, then skip the first one.


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


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


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


Take a list of integers; drop the leading negative values, then keep values divisible by 3, then true if at least one even value.


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


Take a list of integers; skip negatives at the start, then drop anything not divisible by three, then true if at least one even value.


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


Take a list of integers; remove the initial run of negative numbers, then keep only multiples of three, then true if at least one even value.


Take a list of integers; strip the front negatives, then multiples of three only, then any even.


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


Take a list of integers; drop the leading negative values, then keep multiples of three, then return whether any value is even.


Take a list of integers; take values while they are positive, then take the final 3 elements, then find the max, defaulting to 0.


Take a list of integers; take positive values then stop, then drop everything except the final three, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep going while positive, then give me the last three elements, then What's the highest number in the list.


Take a list of integers; stop at first non positive, then keep only the last three, then Return the greatest value or default to 0.


Take a list of integers; take while greater than zero, then keep the final three items, then Find the largest element, defaulting to zero.


Take a list of integers; take values while positive, then take the last three, then give the largest value (0 if none).


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


Take a list of integers; take values while they are positive, then keep only the last three, then return the maximum (0 if empty).


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


Take a list of integers; odd numbers only, then remove everything after the third, then take abs of each.


Take a list of integers; keep the odd numbers, then truncate to three items, then get the absolute value of everything.


Take a list of integers; odd numbers only, then show the first three, then apply absolute value to the whole list.


Take a list of integers; keep the odd numbers, then take the first three, then make them all positive.


Take a list of integers; odd numbers only, then keep first 3, then make every value non-negative.


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


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


Take a list of integers; keep only the first three, then skip negatives at the start, then drop anything not divisible by three.


Take a list of integers; keep the first 3 items, then remove all negatives at the front, then filter out everything except multiples of three.


Take a list of integers; take the first 3 elements, then remove the initial run of negative numbers, then keep only multiples of three.


Take a list of integers; remove everything after the third, then strip the front negatives, then multiples of three only.


Take a list of integers; truncate to three items, then remove leading negative numbers, then filter for numbers divisible by three.


Take a list of integers; show the first three, then drop negatives from start, then give me only the values divisible by three.


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


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


Take a list of integers; keep the odd numbers, then drop anything 5 or below, then strip the signs.


Take a list of integers; odd numbers only, then keep only numbers greater than 5, then take abs of each.


Take a list of integers; keep the odd numbers, then filter for numbers above 5, then get the absolute value of everything.


Take a list of integers; odd numbers only, then give me values where x is greater than 5, then apply absolute value to the whole list.


Take a list of integers; keep the odd numbers, then show me only the values that are bigger than five, then make them all positive.


Take a list of integers; odd numbers only, then keep values greater than five, then make every value non-negative.


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


Take a list of integers; keep the odd numbers, then keep values greater than five, then take the absolute value of each.


Take a list of integers; add ten to each, then drop anything 5 or below, then drop non-negative values.


Take a list of integers; bump everything up by 10, then keep only numbers greater than 5, then drop all positive numbers.


Take a list of integers; increase every value by 10, then filter for numbers above 5, then drop non-negative values.


Take a list of integers; add 10 to each item, then give me values where x is greater than 5, then drop all positive numbers.


Take a list of integers; shift each up by ten, then show me only the values that are bigger than five, then drop non-negative values.


Take a list of integers; increase all numbers by 10, then keep values greater than five, then drop all positive numbers.


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


Take a list of integers; add ten to each, then keep values greater than five, then keep the negative numbers.


Take a list of integers; drop the zeros, then remove the first item, then count the elements.


Take a list of integers; keep only nonzero elements, then Remove head, then how many items remain.


Take a list of integers; drop the zeros, then remove the first item, then tell me the length.


Take a list of integers; keep only nonzero elements, then Remove head, then return the length.


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


Take a list of integers; keep only nonzero elements, then Remove head, then what's the count.


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


Take a list of integers; drop the zeros, then drop the first element, then return how many remain.


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


Take a list of integers; reverse the signs of everything, then double each item in the list, then increase all numbers by 10.


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


Take a list of integers; reverse the signs of everything, then double each item in the list, then give everything a boost of 10.


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


Take a list of integers; reverse the signs of everything, then double each item in the list, then add a constant 10 to each.


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


Take a list of integers; negate each, then double each, then add ten to each.


Take a list of strings; lowercase each string, then convert each to upper case, then remove surrounding whitespace.


Take a list of strings; change to lowercase, then change all strings to uppercase, then trim the whitespace off everything.


Take a list of strings; lowercase each string, then make every string uppercase, then strip spaces from all strings.


Take a list of strings; change to lowercase, then uppercase each one, then strip all the strings.


Take a list of strings; lowercase each string, then make all the strings uppercase, then clean up whitespace in the list.


Take a list of strings; change to lowercase, then convert all strings to uppercase letters, then strip spaces around each string.


def solve(xs):
    r = list(xs)
    r = [s.lower() for s in r]
    r = [s.upper() for s in r]
    r = [s.strip() for s in r]
    return r


Take a list of strings; lowercase each string, then uppercase each string, then trim whitespace from each.


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


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


Take a list of integers; multiply each value by itself, then clamp each to at most ten, then tell me the length.


Take a list of integers; square them all, then don't let anything exceed 10, then return the length.


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


Take a list of integers; I need each number multiplied by itself, then don't let anything exceed 10, then what's the count.


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


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


Take a list of integers; keep only the first three, then sort smallest to largest, then true if already sorted smallest to largest.


Take a list of integers; keep the first 3 items, then Ascending sort, then does this list go in ascending order.


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


Take a list of integers; remove everything after the third, then Sort lowest to highest, then is the list sorted.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then is it sorted.


Take a list of integers; show the first three, then sort ascending, then check if values are in increasing order.


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


Take a list of integers; keep only the first three, then sort ascending, then return whether the list is sorted ascending.


Take a list of people records (name, age); extract the ages, then multiply each by two, then drop non-negative values.


Take a list of people records (name, age); show me all ages, then double each item in the list, then drop all positive numbers.


Take a list of people records (name, age); pluck the age field from each record, then multiply each by two, then drop non-negative values.


Take a list of people records (name, age); get the age field, then double each item in the list, then drop all positive numbers.


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


Take a list of people records (name, age); extract age values, then double each item in the list, then drop all positive numbers.


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


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


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


Take a list of integers; each value squared, then eliminate the even numbers, then drop the negative numbers.


Take a list of integers; multiply each value by itself, then keep only odd values, then filter out the negative ones.


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


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


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


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


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


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


Take a list of integers; keep evens, then eliminate the even numbers, then check for duplicates in the values.


Take a list of integers; keep the even numbers, then keep only odd values, then do all values appear only once.


Take a list of integers; keep evens, then eliminate the even numbers, then check that there are no duplicates.


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


Take a list of integers; keep evens, then eliminate the even numbers, then check if all values are unique.


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


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


Take a list of integers; add ten to each, then decrement each value, then multiply each by -1.


Take a list of integers; bump everything up by 10, then Lower each number by one, then negate.


Take a list of integers; increase every value by 10, then reduce each by one, then multiply each by -1.


Take a list of integers; add 10 to each item, then Subtract 1 from all, then negate.


Take a list of integers; shift each up by ten, then Subtract one from each, then multiply each by -1.


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


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


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


Take a list of integers; keep values greater than five, then remove the first item, then limit every value to 10.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then maximum of 10 for all.


Take a list of integers; keep only numbers above 5, then remove the first item, then limit every value to 10.


Take a list of integers; exclude values of 5 and below, then Remove head, then maximum of 10 for all.


Take a list of integers; remove anything 5 or less, then remove the first item, then limit every value to 10.


Take a list of integers; filter to keep only values above 5, then Remove head, then maximum of 10 for all.


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


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


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


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


Take a list of integers; remove both ends, then extend to length 3 using zeros, then add them up.


Take a list of integers; trim the edges, then pad to 3, then calculate the sum of all elements.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then what's the total.


Take a list of integers; cut off the first and last, then pad to 3, then what do they add up to.


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


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


Take a list of integers; double each, then remove repeated values, then stop at the first non-positive value.


Take a list of integers; times two for each item, then unique values preserving order, then keep the leading run of positive numbers.


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


Take a list of integers; times two for each item, then unique values preserving order, then take positive values then stop.


Take a list of integers; double each, then remove repeated values, then keep going while positive.


Take a list of integers; times two for each item, then unique values preserving order, then stop at first non positive.


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


Take a list of integers; double each, then drop duplicates keeping first occurrence, then take values while they are positive.


Take a list of strings; sort alphabetically, then take each string's first letter, then remove blanks.


Take a list of strings; arrange alphabetically, then give me the first letter of everything, then eliminate empty string values.


Take a list of strings; sort alphabetically, then reduce each string to its first character, then filter out blank strings.


Take a list of strings; arrange alphabetically, then take first char drop blanks, then remove strings that are empty.


Take a list of strings; sort alphabetically, then keep first letters only, then strip out empty strings.


Take a list of strings; arrange alphabetically, then first letter from each item that isn't empty, then keep only non-empty strings.


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


Take a list of strings; sort alphabetically, then keep the first character of each (dropping empties), then drop empty strings.


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


Take a list of integers; sort largest first, then keep items where x mod 3 equals zero, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then drop anything not divisible by three, then take values while they are positive.


Take a list of integers; sort from greatest to least, then filter out everything except multiples of three, then take positive values then stop.


Take a list of integers; sort z to a, then keep only multiples of three, then keep going while positive.


Take a list of integers; arrange in decreasing order, then multiples of three only, then stop at first non positive.


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


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


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


Take a list of integers; take out the first and last items, then sort by descending values, then zero it out if it's empty.


Take a list of integers; remove both ends, then sort from highest to lowest, then use zero if the list is empty.


Take a list of integers; trim the edges, then sort descending, then default to zero when empty.


Take a list of integers; trim one element off each end, then sort largest first, then if there's nothing, put in a zero.


Take a list of integers; cut off the first and last, then sort in descending order, then if no items, add a zero.


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


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


Take a list of integers; if empty, use a single zero, then take the final 3 elements, then drop anything not divisible by three.


Take a list of integers; if blank use 0, then drop everything except the final three, then filter out everything except multiples of three.


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


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


Take a list of integers; replace an empty list with one zero, then keep the final three items, then filter for numbers divisible by three.


Take a list of integers; zero it out if it's empty, then take the last three, then give me only the values divisible by three.


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


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


Take a list of integers; drop the leading negative values, then keep only odd values, then find the max, defaulting to 0.


Take a list of integers; cut the leading negatives, then eliminate the even numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; skip negatives at the start, then keep only odd values, then What's the highest number in the list.


Take a list of integers; remove all negatives at the front, then eliminate the even numbers, then Return the greatest value or default to 0.


Take a list of integers; remove the initial run of negative numbers, then keep only odd values, then Find the largest element, defaulting to zero.


Take a list of integers; strip the front negatives, then eliminate the even numbers, then give the largest value (0 if none).


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


Take a list of integers; drop the leading negative values, then keep the odd numbers, then return the maximum (0 if empty).


Take a list of strings; sort alphabetically, then convert each to lower case, then find how long the longest string is.


Take a list of strings; arrange alphabetically, then lowercase each one, then give the length of the longest string in the list.


Take a list of strings; sort alphabetically, then convert each to lower case, then get me the longest string's length.


Take a list of strings; arrange alphabetically, then lowercase each one, then give the maximum string length.


Take a list of strings; sort alphabetically, then convert each to lower case, then max length of all strings.


Take a list of strings; arrange alphabetically, then lowercase each one, then what's the max string length.


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


Take a list of strings; sort alphabetically, then lowercase each string, then return the length of the longest string (0 if none).


Take a list of integers; keep the odd numbers, then increment each value, then drop non-negative values.


Take a list of integers; odd numbers only, then plus one for all, then drop all positive numbers.


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


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


Take a list of integers; keep the odd numbers, then keep values below zero, then reduce each by one.


Take a list of integers; odd numbers only, then get the negative numbers, then Subtract 1 from all.


Take a list of integers; keep the odd numbers, then keep values below zero, then Subtract one from each.


Take a list of integers; odd numbers only, then get the negative numbers, then Drop each by one.


Take a list of integers; keep the odd numbers, then keep values below zero, then Decrease all values by one.


Take a list of integers; odd numbers only, then get the negative numbers, then Remove one from each value.


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


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


Take a list of integers; keep only the last three, then increment each value, then true only if all are positive.


Take a list of integers; keep the final three items, then plus one for all, then do all of these have positive values.


Take a list of integers; take the last three, then increment each value, then check if every value is positive.


Take a list of integers; trim to the last three, then plus one for all, then confirm all values are positive.


Take a list of integers; last three only, then increment each value, then all positive.


Take a list of integers; truncate to the last three items, then plus one for all, then check if every number is above zero.


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


Take a list of integers; keep only the last three, then add one to each, then return whether all values are positive.


Take a list of integers; double each, then keep the leading run of positive numbers, then true only if all are positive.


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


Take a list of integers; double each, then take positive values then stop, then check if every value is positive.


Take a list of integers; times two for each item, then keep going while positive, then confirm all values are positive.


Take a list of integers; double each, then stop at first non positive, then all positive.


Take a list of integers; times two for each item, then take while greater than zero, then check if every number is above zero.


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


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


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then arrange in decreasing order.


Take a list of integers; clip values at 10, then pad to 3, then arrange in descending order.


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then reverse sort.


Take a list of integers; clip values at 10, then pad to 3, then sort largest to smallest.


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then sort by descending values.


Take a list of integers; clip values at 10, then pad to 3, then sort from highest to lowest.


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


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


Take a list of integers; sort descending, then multiply each by two, then remove the initial run of negative numbers.


Take a list of integers; sort largest first, then double each item in the list, then strip the front negatives.


Take a list of integers; sort in descending order, then multiply each by two, then remove leading negative numbers.


Take a list of integers; sort from greatest to least, then double each item in the list, then drop negatives from start.


Take a list of integers; sort z to a, then multiply each by two, then strip negative values from the start.


Take a list of integers; arrange in decreasing order, then double each item in the list, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; times two for each item, then absolute value for all items, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; double each, then take absolute values, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then turn negatives into positives, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; times two for each item, then take the absolute value of each, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; if blank use 0, then flip the order around, then multiply each by 2.


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


Take a list of integers; when the list is empty, substitute a zero value, then reverse that for me, then multiply each by 2.


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


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


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


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


Take a list of integers; cap each value at 10, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; clip values at 10, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; cap each value at 10, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; clip values at 10, then zero it out if it's empty, then increment each item.


Take a list of integers; cap each value at 10, then use zero if the list is empty, then bump each up by one.


Take a list of integers; clip values at 10, then default to zero when empty, then increment each item.


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


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


Take a list of people records (name, age); extract the ages, then cut the list at the first zero, then give the number of evens.


Take a list of people records (name, age); show me all ages, then cut off after the first zero appears, 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 take values up to (excluding) the first zero, then how many are even.


Take a list of people records (name, age); get the age field, then keep the part before the first 0, 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 truncate at the first zero, then give me the count of even values.


Take a list of people records (name, age); extract age values, then delete everything starting with the first zero, 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 = r[:r.index(0)] if 0 in r else r
    return sum(1 for x in r if x % 2 == 0)


Take a list of people records (name, age); extract the ages, then keep everything before the first zero, then return how many values are even.


Take a list of integers; double each, then remove both ends, then true only if all are positive.


Take a list of integers; times two for each item, then trim the edges, then do all of these have positive values.


Take a list of integers; double each, then trim one element off each end, then check if every value is positive.


Take a list of integers; times two for each item, then cut off the first and last, then confirm all values are positive.


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


Take a list of integers; times two for each item, then keep only the middle part, then check if every number is above zero.


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


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


Take a list of integers; sort ascending, then flip the list around, then shift each up by ten.


Take a list of integers; Sort it from low to high, then flip the order around, then increase all numbers by 10.


Take a list of integers; arrange in increasing order, then put the elements backwards, then add 10 to everything.


Take a list of integers; Organize these ascending, then reverse that for me, then give everything a boost of 10.


Take a list of integers; Sort in ascending order, then flip it backwards, then increment each by ten.


Take a list of integers; I need this sorted ascending, then make it backwards, then add a constant 10 to each.


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


Take a list of integers; sort ascending, then reverse the order, then add ten to each.


Take a list of integers; negate each, then take the final 3 elements, then reduce each by one.


Take a list of integers; reverse the signs of everything, then drop everything except the final three, then Subtract 1 from all.


Take a list of integers; negate each, then give me the last three elements, then Subtract one from each.


Take a list of integers; reverse the signs of everything, then keep only the last three, then Drop each by one.


Take a list of integers; negate each, then keep the final three items, then Decrease all values by one.


Take a list of integers; reverse the signs of everything, then take the last three, then Remove one from each value.


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


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


Take a list of strings; lowercase each string, then strip spaces around each string, then deduplicate the strings.


Take a list of strings; change to lowercase, then remove leading and trailing spaces, then filter out duplicate strings retain first.


Take a list of strings; lowercase each string, then remove whitespace from each item, then strip duplicates preserve order.


Take a list of strings; change to lowercase, then clean whitespace from each entry, then remove repeated strings.


Take a list of strings; lowercase each string, then trim each string, then keep unique strings first appearance.


Take a list of strings; change to lowercase, then trim whitespace from each, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; lowercase each string, then trim whitespace from each, then drop duplicate strings keeping the first.


Take a list of integers; double each, then remove the first item, then remove the initial run of negative numbers.


Take a list of integers; times two for each item, then Remove head, then strip the front negatives.


Take a list of integers; double each, then remove the first item, then remove leading negative numbers.


Take a list of integers; times two for each item, then Remove head, then drop negatives from start.


Take a list of integers; double each, then remove the first item, then strip negative values from the start.


Take a list of integers; times two for each item, then Remove head, then remove negatives before the first non-negative.


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


Take a list of integers; keep the even numbers, then increase every value by 10, then deduplicate the list.


Take a list of integers; keep evens, then add 10 to each item, then remove repeats.


Take a list of integers; keep the even numbers, then shift each up by ten, then deduplicate the list.


Take a list of integers; keep evens, then increase all numbers by 10, then remove repeats.


Take a list of integers; keep the even numbers, then add 10 to everything, then deduplicate the list.


Take a list of integers; keep evens, then give everything a boost of 10, then remove repeats.


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


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


Take a list of integers; keep only the first three, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; keep the first 3 items, then unique values preserving order, then strip the zeros.


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


Take a list of integers; remove everything after the third, then unique values preserving order, then strip the zeros.


Take a list of integers; truncate to three items, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; show the first three, then unique values preserving order, then strip the zeros.


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


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


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


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then remove repeats.


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


Take a list of integers; put them in order by magnitude, then get the negative numbers, then remove repeats.


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


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


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


Take a list of integers; sort by absolute value, then keep the negative numbers, then drop duplicates keeping first occurrence.


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


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


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


Take a list of integers; flip the order around, then strip the front negatives, then multiply each element by itself.


Take a list of integers; put the elements backwards, then remove leading negative numbers, then make each one squared.


Take a list of integers; reverse that for me, then drop negatives from start, then square each value in the list.


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


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


Take a list of integers; double each, then keep values above zero, then replace an empty list with one zero.


Take a list of integers; times two for each item, then filter for positive numbers, then zero it out if it's empty.


Take a list of integers; double each, then keep only positive numbers, then use zero if the list is empty.


Take a list of integers; times two for each item, then keep the positives, then default to zero when empty.


Take a list of integers; double each, then remove negatives, then if there's nothing, put in a zero.


Take a list of integers; times two for each item, then keep the positive numbers, 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 if x > 0]
    r = r if r else [0]
    return r


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


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


Take a list of integers; drop duplicates but keep the first one, then Lower each number by one, then keep the leading run of positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then reduce each by one, then take values while they are positive.


Take a list of integers; drop duplicates but keep the first one, then Subtract 1 from all, then take positive values then stop.


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each, then keep going while positive.


Take a list of integers; drop duplicates but keep the first one, then Drop each by one, then stop at first non positive.


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


Take a list of integers; drop duplicates keeping first occurrence, then subtract one from each, then take values while they are positive.


Take a list of integers; subtract one from each, then keep only odd values, then ensure at least three items by appending zeros.


Take a list of integers; Decrement all items, then eliminate the even numbers, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; Lower each number by one, then eliminate the even numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; reduce each by one, then keep only odd values, then ensure at least three items by appending zeros.


Take a list of integers; Subtract 1 from all, then eliminate the even numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of people records (name, age); extract the ages, then order by distance from zero, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then sort based on absolute value, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); get the age field, then arrange by absolute value ascending, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); keep just each person's age, then sort from smallest to largest absolute value, then ensure at least three items by appending zeros.


Take a list of people records (name, age); extract age values, then sort by absolute value, then ensure minimum length of three by adding zeros to the end.


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