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


Take a list of integers; take the absolute value of each, then take the final 3 elements, then find the max, defaulting to 0.


Take a list of integers; convert to absolute value, then drop everything except the final three, then Give me the maximum, but 0 if there are no items.


Take a list of integers; strip the signs, then give me the last three elements, then What's the highest number in the list.


Take a list of integers; take abs of each, then keep only the last three, then Return the greatest value or default to 0.


Take a list of integers; get the absolute value of everything, then keep the final three items, then Find the largest element, defaulting to zero.


Take a list of integers; apply absolute value to the whole list, then take the last three, then give the largest value (0 if none).


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


Take a list of integers; take the absolute value of each, then keep only the last three, then return the maximum (0 if empty).


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then arrange in decreasing order.


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then reverse sort.


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


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


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


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


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


Take a list of integers; keep only the first three, then remove all zero values, then give back the product of all values.


Take a list of integers; keep the first 3 items, then exclude zeros, then product of the list.


Take a list of integers; take the first 3 elements, then remove all zero values, then what's the product.


Take a list of integers; remove everything after the third, then exclude zeros, then what do they multiply to.


Take a list of integers; truncate to three items, then remove all zero values, then give me their product.


Take a list of integers; show the first three, then exclude zeros, then multiply them all together.


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


Take a list of integers; keep only the first three, then drop the zeros, then return their product.


Take a list of integers; drop the first and last elements, then keep only even values, then find the max, defaulting to 0.


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


Take a list of integers; remove both ends, then keep only even values, then What's the highest number in the list.


Take a list of integers; trim the edges, then extract all even numbers, then Return the greatest value or default to 0.


Take a list of integers; trim one element off each end, then keep only even values, then Find the largest element, defaulting to zero.


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


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


Take a list of integers; drop the first and last elements, then keep the even numbers, then return the maximum (0 if empty).


Take a list of integers; keep the positive numbers, then skip negatives at the start, then true if already sorted smallest to largest.


Take a list of integers; get rid of anything that's not positive, then remove all negatives at the front, then does this list go in ascending order.


Take a list of integers; drop non-positive values, then remove the initial run of negative numbers, then check if the list is in ascending order.


Take a list of integers; drop the negative numbers, then strip the front negatives, then is the list sorted.


Take a list of integers; filter out the negative ones, then remove leading negative numbers, then is it sorted.


Take a list of integers; remove all negative values, then drop negatives from start, then check if values are in increasing order.


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


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


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


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


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


Take a list of integers; exclude values of 5 and below, then Remove head, then keep only the middle part.


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


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


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


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


Take a list of integers; keep everything before the first zero, then take the final 3 elements, then skip the first one.


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


Take a list of integers; cut the list at the first zero, then give me the last three elements, then skip the first one.


Take a list of integers; cut off after the first zero appears, then keep only the last three, then Discard the first element.


Take a list of integers; take values up to (excluding) the first zero, then keep the final three items, then skip the first one.


Take a list of integers; keep the part before the first 0, then take the last three, then Discard the first element.


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


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


Take a list of integers; subtract one from each, then keep the leading run of positive numbers, then drop the even numbers.


Take a list of integers; Decrement all items, then take values while they are positive, then strip out the evens.


Take a list of integers; decrement each value, then take positive values then stop, then drop the even numbers.


Take a list of integers; Lower each number by one, then keep going while positive, then strip out the evens.


Take a list of integers; reduce each by one, then stop at first non positive, then drop the even numbers.


Take a list of integers; Subtract 1 from all, then take while greater than zero, then strip out the evens.


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


Take a list of integers; subtract one from each, then take values while they are positive, then keep the odd numbers.


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


Take a list of integers; times two for each item, then absolute value for all items, then cut off the first and last.


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


Take a list of integers; times two for each item, then turn negatives into positives, then keep only the middle part.


Take a list of integers; double each, then abs each element, then drop first and last.


Take a list of integers; times two for each item, then take the absolute value of each, then eliminate the outermost elements.


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


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


Take a list of integers; keep only the first three, then remove all zero values, then ensure at least three items by appending zeros.


Take a list of integers; keep the first 3 items, then exclude zeros, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; truncate to three items, then remove all zero values, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; negate each, then remove all zero values, then give the number of evens.


Take a list of integers; reverse the signs of everything, then exclude zeros, then find how many values are divisible by two.


Take a list of integers; negate each, then remove all zero values, then how many are even.


Take a list of integers; reverse the signs of everything, then exclude zeros, then get the total number of even values in the list.


Take a list of integers; negate each, then remove all zero values, then give me the count of even values.


Take a list of integers; reverse the signs of everything, then exclude zeros, then I need to know how many of these are even.


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


Take a list of integers; negate each, then drop the zeros, then return how many values are even.


Take a list of integers; drop the leading negative values, then take the first 3 elements, then truncate to the last three items.


Take a list of integers; cut the leading negatives, then remove everything after the third, then show only the last three.


Take a list of integers; skip negatives at the start, then truncate to three items, then remove all but the last three.


Take a list of integers; remove all negatives at the front, then show the first three, then take the final 3 elements.


Take a list of integers; remove the initial run of negative numbers, then take the first three, then drop everything except the final three.


Take a list of integers; strip the front negatives, then keep first 3, then give me the last three elements.


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


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


Take a list of strings; drop empty strings, then remove repeated strings, then find how long the longest string is.


Take a list of strings; get rid of blanks, then keep unique strings first appearance, then give the length of the longest string in the list.


Take a list of strings; remove blanks, then eliminate repeated strings preserve first occurrence, then get me the longest string's length.


Take a list of strings; eliminate empty string values, then drop duplicate strings keeping the first, then give the maximum string length.


Take a list of strings; filter out blank strings, then dedupe, then max length of all strings.


Take a list of strings; remove strings that are empty, then remove duplicate strings keep first, then what's the max string length.


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


Take a list of strings; drop empty strings, then drop duplicate strings keeping the first, then return the length of the longest string (0 if none).


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; extract negatives, then don't let anything exceed 10, then remove repeats.


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


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


Take a list of integers; reverse the order, then remove all zero values, then arrange by magnitude ignoring sign.


Take a list of integers; reverse, then exclude zeros, then put them in order by magnitude.


Take a list of integers; flip the list around, then remove all zero values, then arrange in order of absolute value.


Take a list of integers; flip the order around, then exclude zeros, then sort by distance from zero.


Take a list of integers; put the elements backwards, then remove all zero values, then order by how far from zero.


Take a list of integers; reverse that for me, then exclude zeros, then order by distance from zero.


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


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


Take a list of integers; sort descending, then remove repeated values, then arrange by magnitude ignoring sign.


Take a list of integers; sort largest first, then unique values preserving order, then put them in order by magnitude.


Take a list of integers; sort in descending order, then remove repeated values, then arrange in order of absolute value.


Take a list of integers; sort from greatest to least, then unique values preserving order, then sort by distance from zero.


Take a list of integers; sort z to a, then remove repeated values, then order by how far from zero.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = list(dict.fromkeys(r))
    r = sorted(r, key=abs)
    return r


Take a list of integers; sort descending, then drop duplicates keeping first occurrence, then sort by absolute value.


Take a list of integers; take the absolute value of each, then take the final 3 elements, then make each twice as big.


Take a list of integers; convert to absolute value, then drop everything except the final three, then multiply each by 2.


Take a list of integers; strip the signs, then give me the last three elements, then make each twice as big.


Take a list of integers; take abs of each, then keep only the last three, then multiply each by 2.


Take a list of integers; get the absolute value of everything, then keep the final three items, then make each twice as big.


Take a list of integers; apply absolute value to the whole list, then take the last three, then multiply each by 2.


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


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


Take a list of integers; keep the even numbers, then remove both ends, then stop at the first non-positive value.


Take a list of integers; keep evens, then trim the edges, then keep the leading run of positive numbers.


Take a list of integers; keep the even numbers, then trim one element off each end, then take values while they are positive.


Take a list of integers; keep evens, then cut off the first and last, then take positive values then stop.


Take a list of integers; keep the even numbers, then remove the first and last elements, then keep going while positive.


Take a list of integers; keep evens, then keep only the middle part, then stop at first non positive.


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


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


Take a list of integers; drop the first and last elements, then flip the sign of each, then drop the even numbers.


Take a list of integers; take out the first and last items, then turn positives to negatives and vice versa, then strip out the evens.


Take a list of integers; remove both ends, then flip the sign of each, then drop the even numbers.


Take a list of integers; trim the edges, then turn positives to negatives and vice versa, then strip out the evens.


Take a list of integers; trim one element off each end, then flip the sign of each, then drop the even numbers.


Take a list of integers; cut off the first and last, then turn positives to negatives and vice versa, then strip out the evens.


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


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


Take a list of integers; drop the first element, then drop anything 5 or below, then truncate to three items.


Take a list of integers; Take everything except the first, then keep only numbers greater than 5, then show the first three.


Take a list of integers; drop the first element, then filter for numbers above 5, then take the first three.


Take a list of integers; Take everything except the first, then give me values where x is greater than 5, then keep first 3.


Take a list of integers; drop the first element, then show me only the values that are bigger than five, then truncate to first three.


Take a list of integers; Take everything except the first, then keep values greater than five, then first three.


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


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


Take a list of integers; keep everything before the first zero, then sort smallest to largest, then give the number of evens.


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


Take a list of integers; cut the list at the first zero, then Sort this ascending, then how many are even.


Take a list of integers; cut off after the first zero appears, then Sort lowest to highest, then get the total number of even values in the list.


Take a list of integers; take values up to (excluding) the first zero, then Arrange from smallest to largest, then give me the count of even values.


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


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


Take a list of integers; keep everything before the first zero, then sort ascending, then return how many values are even.


Take a list of integers; add one to each, then multiply each by two, then count the elements.


Take a list of integers; make each one bigger, then double each item in the list, then how many items remain.


Take a list of integers; add one to each, then multiply each by two, then tell me the length.


Take a list of integers; make each one bigger, then double each item in the list, then return the length.


Take a list of integers; add one to each, then multiply each by two, then count them.


Take a list of integers; make each one bigger, then double each item in the list, then what's the count.


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


Take a list of integers; add one to each, then double each, then return how many remain.


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then drop non-positive values.


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


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then filter out the negative ones.


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


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then keep positive values only.


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


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


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


Take a list of integers; subtract one from each, then keep values above zero, then true only if all are positive.


Take a list of integers; Decrement all items, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; decrement each value, then keep only positive numbers, then check if every value is positive.


Take a list of integers; Lower each number by one, then keep the positives, then confirm all values are positive.


Take a list of integers; reduce each by one, then remove negatives, then all positive.


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then check if every number is above zero.


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


Take a list of integers; subtract one from each, then keep the positive numbers, then return whether all values are positive.


Take a list of integers; keep multiples of three, then decrement each value, then truncate to three items.


Take a list of integers; get rid of non-multiples of three, then Lower each number by one, then show the first three.


Take a list of integers; keep values divisible by 3, then reduce each by one, then take the first three.


Take a list of integers; keep items where x mod 3 equals zero, then Subtract 1 from all, then keep first 3.


Take a list of integers; drop anything not divisible by three, then Subtract one from each, then truncate to first three.


Take a list of integers; filter out everything except multiples of three, then Drop each by one, then first three.


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


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


Take a list of integers; pad with zeros to at least three elements, then increase every value by 10, then find the min, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then add 10 to each item, then minimum value, zero otherwise.


Take a list of integers; pad with zeros to at least three elements, then shift each up by ten, then get the minimum value or zero if empty.


Take a list of integers; add zeros until the list has at least three values, then increase all numbers by 10, then give me the min or 0.


Take a list of integers; pad with zeros to at least three elements, then add 10 to everything, then return the smallest number, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then give everything a boost of 10, then return smallest or zero if empty.


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


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


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then arrange in descending order.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then reverse sort.


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


Take a list of integers; drop the zeros, then use zero if the list is empty, then sort by descending values.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then sort from highest to lowest.


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


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


Take a list of integers; reverse the order, then take the final 3 elements, then take values up to (excluding) the first zero.


Take a list of integers; reverse, then drop everything except the final three, then keep the part before the first 0.


Take a list of integers; flip the list around, then give me the last three elements, then truncate at the first zero.


Take a list of integers; flip the order around, then keep only the last three, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then keep the final three items, then remove from the first zero onwards.


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


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


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


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


Take a list of integers; if blank use 0, then eliminate the even numbers, then Organize these ascending.


Take a list of integers; default to [0] when there is nothing, then keep only odd values, then Sort in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then eliminate the even numbers, then I need this sorted ascending.


Take a list of integers; replace an empty list with one zero, then keep only odd values, then Put these in ascending order.


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


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


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


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then arrange by magnitude ignoring sign.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then put them in order by magnitude.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then arrange in order of absolute value.


Take a list of people records (name, age); get the age field, then zero it out if it's empty, then sort by distance from zero.


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then order by how far from zero.


Take a list of people records (name, age); extract age values, then default to zero when empty, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r if r else [0]
    r = sorted(r, key=abs)
    return r


Take a list of people records (name, age); extract the ages, then if empty, use a single zero, then sort by absolute value.


Take a list of integers; drop the leading negative values, then decrement each value, then put the elements backwards.


Take a list of integers; cut the leading negatives, then Lower each number by one, then reverse that for me.


Take a list of integers; skip negatives at the start, then reduce each by one, then flip it backwards.


Take a list of integers; remove all negatives at the front, then Subtract 1 from all, then make it backwards.


Take a list of integers; remove the initial run of negative numbers, then Subtract one from each, then reverse the list.


Take a list of integers; strip the front negatives, then Drop each by one, then invert the sequence.


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


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


Take a list of integers; reverse the order, then order by distance from zero, then keep only numbers above 5.


Take a list of integers; reverse, then sort based on absolute value, then exclude values of 5 and below.


Take a list of integers; flip the list around, then organize by magnitude, then remove anything 5 or less.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then filter to keep only values above 5.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then get rid of values that aren't greater than five.


Take a list of integers; reverse that for me, then sort by absolute value, then drop anything 5 or below.


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


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


Take a list of integers; reverse the order, then multiply each by two, then arrange by magnitude ignoring sign.


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


Take a list of integers; flip the list around, then multiply each by two, then arrange in order of absolute value.


Take a list of integers; flip the order around, then double each item in the list, then sort by distance from zero.


Take a list of integers; put the elements backwards, then multiply each by two, then order by how far from zero.


Take a list of integers; reverse that for me, then double each item in the list, then order by distance from zero.


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


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


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


Take a list of integers; keep the first 3 items, then take values while they are positive, then strip the front negatives.


Take a list of integers; take the first 3 elements, then take positive values then stop, then remove leading negative numbers.


Take a list of integers; remove everything after the third, then keep going while positive, then drop negatives from start.


Take a list of integers; truncate to three items, then stop at first non positive, then strip negative values from the start.


Take a list of integers; show the first three, then take while greater than zero, then remove negatives before the first non-negative.


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


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


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; add zeros until the list has at least three values, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


Take a list of people records (name, age); extract the names, then remove repeated strings, then arrange by string length ascending.


Take a list of people records (name, age); Give me the names, then keep unique strings first appearance, then length sort.


Take a list of people records (name, age); pluck the name field from each record, then eliminate repeated strings preserve first occurrence, then sort by length shortest first.


Take a list of people records (name, age); Grab the names, then drop duplicate strings keeping the first, then organize by string length least to greatest.


Take a list of people records (name, age); keep just each person's name, then dedupe, then shortest strings first.


Take a list of people records (name, age); List the names, then remove duplicate strings keep first, then i want them ordered by how short they are.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = list(dict.fromkeys(r))
    r = sorted(r, key=len)
    return r


Take a list of people records (name, age); extract the names, then drop duplicate strings keeping the first, then sort by length, shortest first.


Take a list of integers; add one to each, then drop anything 5 or below, then trim one element off each end.


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


Take a list of integers; add one to each, then filter for numbers above 5, then remove the first and last elements.


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


Take a list of integers; add one to each, then show me only the values that are bigger than five, then drop first and last.


Take a list of integers; make each one bigger, then keep values greater than five, then eliminate the outermost elements.


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


Take a list of integers; add one to each, then keep values greater than five, then drop the first and last elements.


Take a list of strings; drop duplicate strings keeping the first, then keep only strings of length 3 or more, then make every string uppercase.


Take a list of strings; dedupe, then get rid of short ones, then uppercase each one.


Take a list of strings; remove duplicate strings keep first, then remove strings with less than three characters, then make all the strings uppercase.


Take a list of strings; remove repeating strings first one stays, then remove all strings under three characters in length, then convert all strings to uppercase letters.


Take a list of strings; delete duplicate strings keep the first one, then filter out short strings under three chars, then convert to uppercase.


Take a list of strings; deduplicate the strings, then drop strings shorter than three characters, then i need these in uppercase.


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


Take a list of strings; drop duplicate strings keeping the first, then drop strings shorter than three characters, then uppercase each string.


Take a list of integers; take values while they are positive, then remove both ends, then bump each up by one.


Take a list of integers; take positive values then stop, then trim the edges, then increment each item.


Take a list of integers; keep going while positive, then trim one element off each end, then bump each up by one.


Take a list of integers; stop at first non positive, then cut off the first and last, then increment each item.


Take a list of integers; take while greater than zero, then remove the first and last elements, then bump each up by one.


Take a list of integers; take values while positive, then keep only the middle part, then increment each item.


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


Take a list of integers; take values while they are positive, then drop the first and last elements, then add one to each.


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then drop non-negative values.


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


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then drop non-negative values.


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


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then drop non-negative values.


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


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


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


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


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


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


Take a list of integers; Lower each number by one, then strip the front negatives, then keep only the middle part.


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


Take a list of integers; Subtract 1 from all, then drop negatives from start, then eliminate the outermost elements.


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


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


Take a list of integers; sort by absolute value, then make every value non-negative, then drop non-positive values.


Take a list of integers; rearrange by distance from zero, then absolute value for all items, then drop the negative numbers.


Take a list of integers; arrange by magnitude ignoring sign, then take absolute values, then filter out the negative ones.


Take a list of integers; put them in order by magnitude, then turn negatives into positives, then remove all negative values.


Take a list of integers; arrange in order of absolute value, then abs each element, then keep positive values only.


Take a list of integers; sort by distance from zero, then take the absolute value of each, then keep values above zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then sort largest to smallest, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then sort by descending values, then strip the zeros.


Take a list of integers; drop duplicates keeping first occurrence, then sort from highest to lowest, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then sort descending, then strip the zeros.


Take a list of integers; drop duplicates keeping first occurrence, then sort largest first, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then sort in descending order, then strip the zeros.


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


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


Take a list of integers; keep the even numbers, then skip negatives at the start, then bump each up by one.


Take a list of integers; keep evens, then remove all negatives at the front, then increment each item.


Take a list of integers; keep the even numbers, then remove the initial run of negative numbers, then bump each up by one.


Take a list of integers; keep evens, then strip the front negatives, then increment each item.


Take a list of integers; keep the even numbers, then remove leading negative numbers, then bump each up by one.


Take a list of integers; keep evens, then drop negatives from start, then increment each item.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then replace an empty list with one zero.


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then zero it out if it's empty.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then use zero if the list is empty.


Take a list of integers; add zeros until the list has at least three values, then show the first three, then default to zero when empty.


Take a list of integers; pad with zeros to at least three elements, then take the first three, then if there's nothing, put in a zero.


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


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


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


Take a list of people records (name, age); extract the ages, then order by distance from zero, then true if already sorted smallest to largest.


Take a list of people records (name, age); show me all ages, then sort based on absolute value, then does this list go in ascending order.


Take a list of people records (name, age); pluck the age field from each record, then organize by magnitude, then check if the list is in ascending order.


Take a list of people records (name, age); get the age field, then arrange by absolute value ascending, then is the list sorted.


Take a list of people records (name, age); keep just each person's age, then sort from smallest to largest absolute value, then is it sorted.


Take a list of people records (name, age); extract age values, then sort by absolute value, then check if values are in increasing order.


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


Take a list of people records (name, age); extract the ages, then sort by absolute value, then return whether the list is sorted ascending.


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


Take a list of integers; odd numbers only, then cut off after the first zero appears, then cut off the first and last.


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


Take a list of integers; odd numbers only, then keep the part before the first 0, then keep only the middle part.


Take a list of integers; keep the odd numbers, then truncate at the first zero, then drop first and last.


Take a list of integers; odd numbers only, then delete everything starting with the first zero, then eliminate the outermost elements.


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


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


Take a list of integers; sort descending, then extend to length 3 using zeros, then multiply each by -1.


Take a list of integers; sort largest first, then pad to 3, then negate.


Take a list of integers; sort in descending order, then extend to length 3 using zeros, then multiply each by -1.


Take a list of integers; sort from greatest to least, then pad to 3, then negate.


Take a list of integers; sort z to a, then extend to length 3 using zeros, then multiply each by -1.


Take a list of integers; arrange in decreasing order, then pad to 3, then negate.


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


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


Take a list of integers; take values while they are positive, then keep values below zero, then true if at least one even value.


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


Take a list of integers; keep going while positive, then keep values below zero, then true if at least one even value.


Take a list of integers; stop at first non positive, then get the negative numbers, then any even.


Take a list of integers; take while greater than zero, then keep values below zero, then true if at least one even value.


Take a list of integers; take values while positive, then get the negative numbers, 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 < 0]
    return any(x % 2 == 0 for x in r)


Take a list of integers; take values while they are positive, then keep the negative numbers, then return whether any value is even.


Take a list of integers; sort descending, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; sort largest first, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort in descending order, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; sort from greatest to least, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort z to a, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    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; sort descending, then keep the even numbers, then pad with zeros to at least three elements.


Take a list of integers; drop the first element, then take the final 3 elements, then true if any value equals zero.


Take a list of integers; Take everything except the first, then drop everything except the final three, then check for zero.


Take a list of integers; drop the first element, then give me the last three elements, then true if any value equals zero.


Take a list of integers; Take everything except the first, then keep only the last three, then check for zero.


Take a list of integers; drop the first element, then keep the final three items, then true if any value equals zero.


Take a list of integers; Take everything except the first, then take the last three, then check for zero.


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


Take a list of integers; drop the first element, then keep only the last three, then return whether the list contains a zero.


Take a list of integers; sort by absolute value, then multiply each value by itself, then ensure at least three items by appending zeros.


Take a list of integers; rearrange by distance from zero, then square them all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then ensure at least three items by appending zeros.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in order of absolute value, then square all of them, then ensure at least three items by appending zeros.


Take a list of integers; sort by distance from zero, then multiply each element by itself, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then shift each up by ten.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then increase all numbers by 10.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then add 10 to everything.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then give everything a boost of 10.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then increment each by ten.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then add a constant 10 to each.


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


Take a list of integers; keep values greater than five, then take values while they are positive, then add ten to each.


Take a list of integers; keep the even numbers, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; keep evens, then double each item in the list, then fetch the first even element, default to 0.


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


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


Take a list of strings; sort alphabetically, then strip spaces around each string, then return them as one comma-separated string.


Take a list of strings; arrange alphabetically, then remove leading and trailing spaces, then separate by comma.


Take a list of strings; sort alphabetically, then remove whitespace from each item, then join with commas.


Take a list of strings; arrange alphabetically, then clean whitespace from each entry, then comma join.


Take a list of strings; sort alphabetically, then trim each string, then combine using commas.


Take a list of strings; arrange alphabetically, then trim whitespace from each, then connect with commas between each item.


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


Take a list of strings; sort alphabetically, then trim whitespace from each, then join them with commas.


Take a list of people records (name, age); extract the ages, then flip the sign of each, then give the number of evens.


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, 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 flip the sign of each, then how many are even.


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, 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 flip the sign of each, then give me the count of even values.


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then I need to know how many of these are even.


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


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


Take a list of integers; drop the first and last elements, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then show only the last three.


Take a list of integers; remove both ends, then take values up to (excluding) the first zero, then remove all but the last three.


Take a list of integers; trim the edges, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; trim one element off each end, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; cut off the first and last, then delete everything starting with the first zero, then give me the last three elements.


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


Take a list of integers; drop the first and last elements, then keep everything before the first zero, then keep only the last three.


Take a list of integers; keep values greater than five, then multiply each by two, then count the elements.


Take a list of integers; filter out values less than or equal to 5, then double each item in the list, then how many items remain.


Take a list of integers; keep only numbers above 5, then multiply each by two, then tell me the length.


Take a list of integers; exclude values of 5 and below, then double each item in the list, then return the length.


Take a list of integers; remove anything 5 or less, then multiply each by two, then count them.


Take a list of integers; filter to keep only values above 5, then double each item in the list, then what's the count.


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


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


Take a list of integers; keep multiples of three, then remove both ends, then strip the signs.


Take a list of integers; get rid of non-multiples of three, then trim the edges, then take abs of each.


Take a list of integers; keep values divisible by 3, then trim one element off each end, then get the absolute value of everything.


Take a list of integers; keep items where x mod 3 equals zero, then cut off the first and last, then apply absolute value to the whole list.


Take a list of integers; drop anything not divisible by three, then remove the first and last elements, then make them all positive.


Take a list of integers; filter out everything except multiples of three, then keep only the middle part, then make every value non-negative.


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


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


Take a list of integers; take the absolute value of each, then keep values divisible by 3, then drop non-positive values.


Take a list of integers; convert to absolute value, then keep items where x mod 3 equals zero, then drop the negative numbers.


Take a list of integers; strip the signs, then drop anything not divisible by three, then filter out the negative ones.


Take a list of integers; take abs of each, then filter out everything except multiples of three, then remove all negative values.


Take a list of integers; get the absolute value of everything, then keep only multiples of three, then keep positive values only.


Take a list of integers; apply absolute value to the whole list, then multiples of three only, then keep values above zero.


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


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


Take a list of integers; subtract one from each, then order by distance from zero, then find the min, defaulting to 0.


Take a list of integers; Decrement all items, then sort based on absolute value, then minimum value, zero otherwise.


Take a list of integers; decrement each value, then organize by magnitude, then get the minimum value or zero if empty.


Take a list of integers; Lower each number by one, then arrange by absolute value ascending, then give me the min or 0.


Take a list of integers; reduce each by one, then sort from smallest to largest absolute value, then return the smallest number, defaulting to 0.


Take a list of integers; Subtract 1 from all, then sort by absolute value, then return smallest or zero if empty.


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


Take a list of integers; subtract one from each, then sort by absolute value, then return the minimum (0 if empty).


Take a list of people records (name, age); extract the names, then order the strings A to Z, then true if a blank string is present.


Take a list of people records (name, age); Give me the names, then make it alphabetical, then check for empty strings in the list.


Take a list of people records (name, age); pluck the name field from each record, then order the strings A to Z, then check if there's an empty string.


Take a list of people records (name, age); Grab the names, then make it alphabetical, then does the collection contain an empty string value somewhere.


Take a list of people records (name, age); keep just each person's name, then order the strings A to Z, then whether any element is blank.


Take a list of people records (name, age); List the names, then make it alphabetical, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = sorted(r)
    return any(s == '' for s in r)


Take a list of people records (name, age); extract the names, then sort alphabetically, then return whether any string is empty.


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


Take a list of integers; bump everything up by 10, then absolute value for all items, then filter out the odd numbers.


Take a list of integers; increase every value by 10, then take absolute values, then drop the odd numbers.


Take a list of integers; add 10 to each item, then turn negatives into positives, then filter out the odd numbers.


Take a list of integers; shift each up by ten, then abs each element, then drop the odd numbers.


Take a list of integers; increase all numbers by 10, then take the absolute value of each, then filter out the odd numbers.


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


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


Take a list of integers; keep the even numbers, then keep the leading run of positive numbers, then true if any value equals zero.


Take a list of integers; keep evens, then take values while they are positive, then check for zero.


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


Take a list of integers; keep evens, then keep going while positive, then check for zero.


Take a list of integers; keep the even numbers, then stop at first non positive, then true if any value equals zero.


Take a list of integers; keep evens, then take while greater than zero, then check for zero.


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


Take a list of integers; keep the even numbers, then take values while they are positive, then return whether the list contains a zero.


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, 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 unique values preserving order, 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 = list(dict.fromkeys(r))
    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 drop duplicates keeping first occurrence, then keep values greater than five.


Take a list of integers; drop the first element, then make every value non-negative, then drop non-positive values.


Take a list of integers; Take everything except the first, then absolute value for all items, then drop the negative numbers.


Take a list of integers; drop the first element, then take absolute values, then filter out the negative ones.


Take a list of integers; Take everything except the first, then turn negatives into positives, then remove all negative values.


Take a list of integers; drop the first element, then abs each element, then keep positive values only.


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


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


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


Take a list of integers; drop the zeros, then cut the list at the first zero, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then arrange in descending order.


Take a list of integers; drop the zeros, then take values up to (excluding) the first zero, then reverse sort.


Take a list of integers; keep only nonzero elements, then keep the part before the first 0, then sort largest to smallest.


Take a list of integers; drop the zeros, then truncate at the first zero, then sort by descending values.


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then sort from highest to lowest.


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


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


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


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


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


Take a list of integers; put them in order by magnitude, then double each item in the list, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then are the values all unique.


Take a list of integers; sort by distance from zero, then double each item in the list, then check if all values are unique.


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


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


Take a list of integers; keep values greater than five, then multiply each by two, then true if already sorted smallest to largest.


Take a list of integers; filter out values less than or equal to 5, then double each item in the list, then does this list go in ascending order.


Take a list of integers; keep only numbers above 5, then multiply each by two, then check if the list is in ascending order.


Take a list of integers; exclude values of 5 and below, then double each item in the list, then is the list sorted.


Take a list of integers; remove anything 5 or less, then multiply each by two, then is it sorted.


Take a list of integers; filter to keep only values above 5, then double each item in the list, then check if values are in increasing order.


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


Take a list of integers; keep values greater than five, then double each, then return whether the list is sorted ascending.


Take a list of integers; keep the positive numbers, then take the final 3 elements, then drop the even numbers.


Take a list of integers; get rid of anything that's not positive, then drop everything except the final three, then strip out the evens.


Take a list of integers; drop non-positive values, then give me the last three elements, then drop the even numbers.


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


Take a list of integers; filter out the negative ones, then keep the final three items, then drop the even numbers.


Take a list of integers; remove all negative values, then take the last three, then strip out the evens.


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


Take a list of integers; keep the positive numbers, then keep only the last three, then keep the odd numbers.


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


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


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


Take a list of integers; trim to the last three, then cut off the first and last, then check that there are no duplicates.


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


Take a list of integers; truncate to the last three items, then keep only the middle part, then check if all values are unique.


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


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


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


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


Take a list of integers; increase every value by 10, then put the elements backwards, then take the first three.


Take a list of integers; add 10 to each item, then reverse that for me, then keep first 3.


Take a list of integers; shift each up by ten, then flip it backwards, then truncate to first three.


Take a list of integers; increase all numbers by 10, then make it backwards, then first three.


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


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


Take a list of integers; take values while they are positive, then keep values divisible by 3, then reduce each by one.


Take a list of integers; take positive values then stop, then keep items where x mod 3 equals zero, then Subtract 1 from all.


Take a list of integers; keep going while positive, then drop anything not divisible by three, then Subtract one from each.


Take a list of integers; stop at first non positive, then filter out everything except multiples of three, then Drop each by one.


Take a list of integers; take while greater than zero, then keep only multiples of three, then Decrease all values by one.


Take a list of integers; take values while positive, then multiples of three only, then Remove one from each value.


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


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


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then give back the total.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then sum r.


Take a list of integers; drop the zeros, then take positive values then stop, then add them up.


Take a list of integers; keep only nonzero elements, then keep going while positive, then calculate the sum of all elements.


Take a list of integers; drop the zeros, then stop at first non positive, then what's the total.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then what do they add up to.


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


Take a list of integers; drop the zeros, then take values while they are positive, then return their sum.


Take a list of integers; drop the first element, then multiply each value by itself, then shift each up by ten.


Take a list of integers; Take everything except the first, then square them all, then increase all numbers by 10.


Take a list of integers; drop the first element, then raise each to the power of two, then add 10 to everything.


Take a list of integers; Take everything except the first, then I need each number multiplied by itself, then give everything a boost of 10.


Take a list of integers; drop the first element, then square all of them, then increment each by ten.


Take a list of integers; Take everything except the first, then multiply each element by itself, then add a constant 10 to each.


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


Take a list of integers; drop the first element, then square each, then add ten to each.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then drop anything not divisible by three.


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


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then keep only multiples of three.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then multiples of three only.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then filter for numbers divisible by three.


Take a list of integers; drop duplicates but keep the first one, then multiply each element by itself, then give me only the values divisible by three.


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


Take a list of integers; drop duplicates keeping first occurrence, then square each, then keep multiples of three.


Take a list of integers; double each, then increment each value, then truncate to the last three items.


Take a list of integers; times two for each item, then plus one for all, then show only the last three.


Take a list of integers; double each, then increment each value, then remove all but the last three.


Take a list of integers; times two for each item, then plus one for all, then take the final 3 elements.


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


Take a list of integers; times two for each item, then plus one for all, then give me the last three elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then drop all positive numbers.


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


Take a list of integers; drop duplicates keeping first occurrence, then negate each, then keep the negative numbers.


Take a list of integers; sort by absolute value, then increment each value, then raise each to the power of two.


Take a list of integers; rearrange by distance from zero, then plus one for all, then I need each number multiplied by itself.


Take a list of integers; arrange by magnitude ignoring sign, then increment each value, then square all of them.


Take a list of integers; put them in order by magnitude, then plus one for all, then multiply each element by itself.


Take a list of integers; arrange in order of absolute value, then increment each value, then make each one squared.


Take a list of integers; sort by distance from zero, then plus one for all, then square each value in the list.


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


Take a list of integers; sort by absolute value, then add one to each, then square each.


Take a list of integers; keep multiples of three, then drop anything 5 or below, then stop at the first non-positive value.


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then keep going while positive.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then stop at first non positive.


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


Take a list of integers; keep multiples of three, then keep values greater than five, then take values while they are positive.


Take a list of integers; reverse the order, then multiply each by two, then multiply each by -1.


Take a list of integers; reverse, then double each item in the list, then negate.


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


Take a list of integers; flip the order around, then double each item in the list, then negate.


Take a list of integers; put the elements backwards, then multiply each by two, then multiply each by -1.


Take a list of integers; reverse that for me, then double each item in the list, then negate.


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


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


Take a list of integers; keep the positive numbers, then default to [0] when there is nothing, then true if any value equals zero.


Take a list of integers; get rid of anything that's not positive, then when the list is empty, substitute a zero value, then check for zero.


Take a list of integers; drop non-positive values, then replace an empty list with one zero, then true if any value equals zero.


Take a list of integers; drop the negative numbers, then zero it out if it's empty, then check for zero.


Take a list of integers; filter out the negative ones, then use zero if the list is empty, then true if any value equals zero.


Take a list of integers; remove all negative values, then default to zero when empty, then check for zero.


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


Take a list of integers; keep the positive numbers, then if empty, use a single zero, then return whether the list contains a zero.


Take a list of integers; pad with zeros to at least three elements, then drop anything 5 or below, then keep only non-zero numbers.


Take a list of integers; add zeros until the list has at least three values, then keep only numbers greater than 5, then strip the zeros.


Take a list of integers; pad with zeros to at least three elements, then filter for numbers above 5, then keep only non-zero numbers.


Take a list of integers; add zeros until the list has at least three values, then give me values where x is greater than 5, then strip the zeros.


Take a list of integers; pad with zeros to at least three elements, then show me only the values that are bigger than five, then keep only non-zero numbers.


Take a list of integers; add zeros until the list has at least three values, then keep values greater than five, then strip the zeros.


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


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


Take a list of integers; keep values greater than five, then sort smallest to largest, then reduce each by one.


Take a list of integers; filter out values less than or equal to 5, then Ascending sort, then Subtract 1 from all.


Take a list of integers; keep only numbers above 5, then Sort this ascending, then Subtract one from each.


Take a list of integers; exclude values of 5 and below, then Sort lowest to highest, then Drop each by one.


Take a list of integers; remove anything 5 or less, then Arrange from smallest to largest, then Decrease all values by one.


Take a list of integers; filter to keep only values above 5, then sort ascending, then Remove one from each value.


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


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


Take a list of integers; keep the even numbers, then keep values below zero, then limit every value to 10.


Take a list of integers; keep evens, then get the negative numbers, then maximum of 10 for all.


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


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


Take a list of integers; drop the leading negative values, then cut the list at the first zero, then true if every value is unique.


Take a list of integers; cut the leading negatives, then cut off after the first zero appears, then check for duplicates in the values.


Take a list of integers; skip negatives at the start, then take values up to (excluding) the first zero, then do all values appear only once.


Take a list of integers; remove all negatives at the front, then keep the part before the first 0, then check that there are no duplicates.


Take a list of integers; remove the initial run of negative numbers, then truncate at the first zero, then are the values all unique.


Take a list of integers; strip the front negatives, then delete everything starting with the first zero, then check if all values are unique.


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


Take a list of integers; drop the leading negative values, then keep everything before the first zero, then return whether all values are distinct.


Take a list of integers; cap each value at 10, then drop anything 5 or below, then strip the signs.


Take a list of integers; clip values at 10, then keep only numbers greater than 5, then take abs of each.


Take a list of integers; cap each value at 10, then filter for numbers above 5, then get the absolute value of everything.


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


Take a list of integers; cap each value at 10, then show me only the values that are bigger than five, then make them all positive.


Take a list of integers; clip values at 10, then keep values greater than five, then make every value non-negative.


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


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


Take a list of integers; cap each value at 10, then flip the sign of each, then drop the odd numbers.


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then filter out the odd numbers.


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


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


Take a list of integers; keep the negative numbers, then multiply each by two, then keep only numbers above 5.


Take a list of integers; extract negatives, then double each item in the list, then exclude values of 5 and below.


Take a list of integers; keep the negative numbers, then multiply each by two, then remove anything 5 or less.


Take a list of integers; extract negatives, then double each item in the list, then filter to keep only values above 5.


Take a list of integers; keep the negative numbers, then multiply each by two, then get rid of values that aren't greater than five.


Take a list of integers; extract negatives, then double each item in the list, then drop anything 5 or below.


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


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


Take a list of integers; keep the odd numbers, then make every value non-negative, then give the number of evens.


Take a list of integers; odd numbers only, then absolute value for all items, then find how many values are divisible by two.


Take a list of integers; keep the odd numbers, then take absolute values, then how many are even.


Take a list of integers; odd numbers only, then turn negatives into positives, then get the total number of even values in the list.


Take a list of integers; keep the odd numbers, then abs each element, then give me the count of even values.


Take a list of integers; odd numbers only, then take the absolute value of each, then I need to know how many of these are even.


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


Take a list of integers; keep the odd numbers, then take the absolute value of each, then return how many values are even.


Take a list of integers; keep only the last three, then clamp each to at most ten, then strip the signs.


Take a list of integers; keep the final three items, then don't let anything exceed 10, then take abs of each.


Take a list of integers; take the last three, then clamp each to at most ten, then get the absolute value of everything.


Take a list of integers; trim to the last three, then don't let anything exceed 10, then apply absolute value to the whole list.


Take a list of integers; last three only, then clamp each to at most ten, then make them all positive.


Take a list of integers; truncate to the last three items, then don't let anything exceed 10, then make every value non-negative.


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


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


Take a list of integers; drop the zeros, then keep values above zero, then find the max, defaulting to 0.


Take a list of integers; keep only nonzero elements, then filter for positive numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop the zeros, then keep only positive numbers, then What's the highest number in the list.


Take a list of integers; keep only nonzero elements, then keep the positives, then Return the greatest value or default to 0.


Take a list of integers; drop the zeros, then remove negatives, then Find the largest element, defaulting to zero.


Take a list of integers; keep only nonzero elements, then keep the positive numbers, then give the largest value (0 if none).


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


Take a list of integers; drop the zeros, then keep the positive numbers, then return the maximum (0 if empty).


Take a list of integers; take the absolute value of each, then remove repeated values, then arrange in increasing order.


Take a list of integers; convert to absolute value, then unique values preserving order, then Organize these ascending.


Take a list of integers; strip the signs, then remove repeated values, then Sort in ascending order.


Take a list of integers; take abs of each, then unique values preserving order, then I need this sorted ascending.


Take a list of integers; get the absolute value of everything, then remove repeated values, then Put these in ascending order.


Take a list of integers; apply absolute value to the whole list, then unique values preserving order, then sort smallest to largest.


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


Take a list of integers; take the absolute value of each, then drop duplicates keeping first occurrence, then sort ascending.


Take a list of integers; keep everything before the first zero, then clamp each to at most ten, then put the elements backwards.


Take a list of integers; take only what comes before the initial zero, then don't let anything exceed 10, then reverse that for me.


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


Take a list of integers; cut off after the first zero appears, then don't let anything exceed 10, then make it backwards.


Take a list of integers; take values up to (excluding) the first zero, then clamp each to at most ten, then reverse the list.


Take a list of integers; keep the part before the first 0, then don't let anything exceed 10, then invert the sequence.


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


Take a list of integers; keep everything before the first zero, then cap each value at 10, then reverse the order.


Take a list of integers; keep values greater than five, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; filter out values less than or equal to 5, then get the negative numbers, then fetch the first even element, default to 0.


Take a list of integers; keep only numbers above 5, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; exclude values of 5 and below, then get the negative numbers, then fetch the first even element, default to 0.


Take a list of integers; remove anything 5 or less, then keep values below zero, then give the earliest even value or zero.


Take a list of integers; filter to keep only values above 5, then get the negative numbers, 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 = [x for x in r if x < 0]
    return next((x for x in r if x % 2 == 0), 0)


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


Take a list of integers; drop the first element, then remove repeated values, then strip the signs.


Take a list of integers; Take everything except the first, then unique values preserving order, then take abs of each.


Take a list of integers; drop the first element, then remove repeated values, then get the absolute value of everything.


Take a list of integers; Take everything except the first, then unique values preserving order, then apply absolute value to the whole list.


Take a list of integers; drop the first element, then remove repeated values, then make them all positive.


Take a list of integers; Take everything except the first, then unique values preserving order, then make every value non-negative.


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


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


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then truncate to three items.


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


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then take the first three.


Take a list of people records (name, age); get the age field, then keep only the last three, then keep first 3.


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then truncate to first three.


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


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


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


Take a list of integers; take values while they are positive, then take the final 3 elements, then drop non-positive values.


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


Take a list of integers; keep going while positive, then give me the last three elements, then filter out the negative ones.


Take a list of integers; stop at first non positive, then keep only the last three, then remove all negative values.


Take a list of integers; take while greater than zero, then keep the final three items, then keep positive values only.


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


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


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


Take a list of integers; add one to each, then skip negatives at the start, then give the earliest even value or zero.


Take a list of integers; make each one bigger, then remove all negatives at the front, then fetch the first even element, default to 0.


Take a list of integers; add one to each, then remove the initial run of negative numbers, then give the earliest even value or zero.


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


Take a list of integers; add one to each, then remove leading negative numbers, then give the earliest even value or zero.


Take a list of integers; make each one bigger, then drop negatives from start, then fetch the first even element, default to 0.


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


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


Take a list of integers; sort by absolute value, then take the final 3 elements, then true if any value equals zero.


Take a list of integers; rearrange by distance from zero, then drop everything except the final three, then check for zero.


Take a list of integers; arrange by magnitude ignoring sign, then give me the last three elements, then true if any value equals zero.


Take a list of integers; put them in order by magnitude, then keep only the last three, then check for zero.


Take a list of integers; arrange in order of absolute value, then keep the final three items, then true if any value equals zero.


Take a list of integers; sort by distance from zero, then take the last three, then check for zero.


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


Take a list of integers; sort by absolute value, then keep only the last three, then return whether the list contains a zero.


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


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then keep the part before the first 0.


Take a list of integers; keep values divisible by 3, then multiply each by two, then truncate at the first zero.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then up to but not including the first zero.


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


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


Take a list of integers; cap each value at 10, then remove all zero values, then make each twice as big.


Take a list of integers; clip values at 10, then exclude zeros, then multiply each by 2.


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


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


Take a list of integers; keep values greater than five, then remove both ends, then bump each up by one.


Take a list of integers; filter out values less than or equal to 5, then trim the edges, then increment each item.


Take a list of integers; keep only numbers above 5, then trim one element off each end, then bump each up by one.


Take a list of integers; exclude values of 5 and below, then cut off the first and last, then increment each item.


Take a list of integers; remove anything 5 or less, then remove the first and last elements, then bump each up by one.


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


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


Take a list of integers; keep values greater than five, then drop the first and last elements, then add one to each.


Take a list of people records (name, age); extract the names, then order strings from shortest to longest, then return them as one comma-separated string.


Take a list of people records (name, age); Give me the names, then shortest to longest, then separate by comma.