Take a list of people records (name, age); pluck the name field from each record, then arrange by string length ascending, then join with commas.


Take a list of people records (name, age); Grab the names, then length sort, then comma join.


Take a list of people records (name, age); keep just each person's name, then sort by length shortest first, then combine using commas.


Take a list of people records (name, age); List the names, then organize by string length least to greatest, then connect with commas between each item.


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


Take a list of people records (name, age); extract the names, then sort by length, shortest first, then join them with commas.


Take a list of integers; keep the negative numbers, then remove the first item, then find the max, defaulting to 0.


Take a list of integers; extract negatives, then Remove head, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the negative numbers, then remove the first item, then What's the highest number in the list.


Take a list of integers; extract negatives, then Remove head, then Return the greatest value or default to 0.


Take a list of integers; keep the negative numbers, then remove the first item, then Find the largest element, defaulting to zero.


Take a list of integers; extract negatives, then Remove head, then give the largest value (0 if none).


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


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


Take a list of integers; sort by absolute value, then remove both ends, then remove the initial run of negative numbers.


Take a list of integers; rearrange by distance from zero, then trim the edges, then strip the front negatives.


Take a list of integers; arrange by magnitude ignoring sign, then trim one element off each end, then remove leading negative numbers.


Take a list of integers; put them in order by magnitude, then cut off the first and last, then drop negatives from start.


Take a list of integers; arrange in order of absolute value, then remove the first and last elements, then strip negative values from the start.


Take a list of integers; sort by distance from zero, then keep only the middle part, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    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; sort by absolute value, then drop the first and last elements, then drop the leading negative values.


Take a list of strings; drop strings shorter than three characters, then remove repeated strings, then return them as one comma-separated string.


Take a list of strings; eliminate strings below length three, then keep unique strings first appearance, then separate by comma.


Take a list of strings; remove short strings (under 3 chars), then eliminate repeated strings preserve first occurrence, then join with commas.


Take a list of strings; only keep strings with three or more characters, then drop duplicate strings keeping the first, then comma join.


Take a list of strings; keep only strings that are at least three characters long, then dedupe, then combine using commas.


Take a list of strings; filter strings shorter than 3 chars, then remove duplicate strings keep first, then connect with commas between each item.


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


Take a list of strings; drop strings shorter than three characters, then drop duplicate strings keeping the first, then join them with commas.


Take a list of integers; sort ascending, then remove all zero values, then replace an empty list with one zero.


Take a list of integers; Sort it from low to high, then exclude zeros, then zero it out if it's empty.


Take a list of integers; arrange in increasing order, then remove all zero values, then use zero if the list is empty.


Take a list of integers; Organize these ascending, then exclude zeros, then default to zero when empty.


Take a list of integers; Sort in ascending order, then remove all zero values, then if there's nothing, put in a zero.


Take a list of integers; I need this sorted ascending, then exclude zeros, then if no items, add a zero.


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


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


Take a list of integers; keep the even numbers, then flip the list around, then give back the product of all values.


Take a list of integers; keep evens, then flip the order around, then product of the list.


Take a list of integers; keep the even numbers, then put the elements backwards, then what's the product.


Take a list of integers; keep evens, then reverse that for me, then what do they multiply to.


Take a list of integers; keep the even numbers, then flip it backwards, then give me their product.


Take a list of integers; keep evens, then make it backwards, then multiply them all together.


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


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


Take a list of integers; take the absolute value of each, then keep values above zero, then true if already sorted smallest to largest.


Take a list of integers; convert to absolute value, then filter for positive numbers, then does this list go in ascending order.


Take a list of integers; strip the signs, then keep only positive numbers, then check if the list is in ascending order.


Take a list of integers; take abs of each, then keep the positives, then is the list sorted.


Take a list of integers; get the absolute value of everything, then remove negatives, then is it sorted.


Take a list of integers; apply absolute value to the whole list, then keep the positive numbers, then check if values are in increasing order.


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


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then keep only numbers above 5.


Take a list of people records (name, age); show me all ages, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of people records (name, age); pluck the age field from each record, then clamp each to at most ten, then remove anything 5 or less.


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then drop anything 5 or below.


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


Take a list of people records (name, age); extract the ages, then cap each value at 10, then keep values greater than five.


Take a list of strings; lowercase each string, then remove repeated strings, then count characters across all strings.


Take a list of strings; change to lowercase, then keep unique strings first appearance, then character count.


Take a list of strings; lowercase each string, then eliminate repeated strings preserve first occurrence, then count all the characters.


Take a list of strings; change to lowercase, then drop duplicate strings keeping the first, then total number of characters.


Take a list of strings; lowercase each string, then dedupe, then what's the total character count.


Take a list of strings; change to lowercase, then remove duplicate strings keep first, then add up the lengths.


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


Take a list of strings; lowercase each string, then drop duplicate strings keeping the first, then return the total number of characters.


Take a list of integers; keep values greater than five, then keep values divisible by 3, then true only if all are positive.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then confirm all values are positive.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then all positive.


Take a list of integers; filter to keep only values above 5, then multiples of three only, then check if every number is above zero.


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


Take a list of integers; keep values greater than five, then keep multiples of three, then return whether all values are positive.


Take a list of integers; keep values greater than five, then decrement each value, then arrange by magnitude ignoring sign.


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


Take a list of integers; keep only numbers above 5, then reduce each by one, then arrange in order of absolute value.


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


Take a list of integers; remove anything 5 or less, then Subtract one from each, then order by how far from zero.


Take a list of integers; filter to keep only values above 5, then Drop each by one, then order by distance from zero.


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


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


Take a list of integers; if empty, use a single zero, then decrement each value, then true if already sorted smallest to largest.


Take a list of integers; if blank use 0, then Lower each number by one, then does this list go in ascending order.


Take a list of integers; default to [0] when there is nothing, then reduce each by one, then check if the list is in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then Subtract 1 from all, then is the list sorted.


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then is it sorted.


Take a list of integers; zero it out if it's empty, then Drop each by one, then check if values are in increasing order.


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


Take a list of integers; if empty, use a single zero, then subtract one from each, then return whether the list is sorted ascending.


Take a list of integers; drop the zeros, then keep values above zero, then arrange by magnitude ignoring sign.


Take a list of integers; keep only nonzero elements, then filter for positive numbers, then put them in order by magnitude.


Take a list of integers; drop the zeros, then keep only positive numbers, then arrange in order of absolute value.


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


Take a list of integers; drop the zeros, then remove negatives, then order by how far from zero.


Take a list of integers; keep only nonzero elements, then keep the positive numbers, then order by distance from zero.


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


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


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


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then check for duplicates in the values.


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


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then check that there are no duplicates.


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


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then check if all values are unique.


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


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


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


Take a list of integers; sort largest first, then square them all, then strip the front negatives.


Take a list of integers; sort in descending order, then raise each to the power of two, then remove leading negative numbers.


Take a list of integers; sort from greatest to least, then I need each number multiplied by itself, then drop negatives from start.


Take a list of integers; sort z to a, then square all of them, then strip negative values from the start.


Take a list of integers; arrange in decreasing order, then multiply each element by itself, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then find how many values are divisible by two.


Take a list of integers; drop non-positive values, then keep only odd values, then how many are even.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then get the total number of even values in the list.


Take a list of integers; filter out the negative ones, then keep only odd values, then give me the count of even values.


Take a list of integers; remove all negative values, then eliminate the even numbers, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then drop anything 5 or below, then true if at least one even value.


Take a list of integers; Sort it from low to high, then keep only numbers greater than 5, then any even.


Take a list of integers; arrange in increasing order, then filter for numbers above 5, then true if at least one even value.


Take a list of integers; Organize these ascending, then give me values where x is greater than 5, then any even.


Take a list of integers; Sort in ascending order, then show me only the values that are bigger than five, then true if at least one even value.


Take a list of integers; I need this sorted ascending, then keep values greater than five, then any even.


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


Take a list of integers; sort ascending, then keep values greater than five, then return whether any value is even.


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


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


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


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


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


Take a list of integers; times two for each item, then multiples of three only, then strip out the evens.


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


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


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


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


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


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


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


Take a list of integers; Subtract 1 from all, then take the absolute value of each, then eliminate the outermost elements.


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


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


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then drop non-negative values.


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


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [x * 2 for x in r]
    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 double each, then keep the negative numbers.


Take a list of integers; keep the negative numbers, then keep values divisible by 3, then give back the total.


Take a list of integers; extract negatives, then keep items where x mod 3 equals zero, then sum r.


Take a list of integers; keep the negative numbers, then drop anything not divisible by three, then add them up.


Take a list of integers; extract negatives, then filter out everything except multiples of three, then calculate the sum of all elements.


Take a list of integers; keep the negative numbers, then keep only multiples of three, then what's the total.


Take a list of integers; extract negatives, then multiples of three only, then what do they add up to.


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


Take a list of integers; keep the negative numbers, then keep multiples of three, then return their sum.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then true only if all are positive.


Take a list of integers; drop duplicates but keep the first one, then square them all, then do all of these have positive values.


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then check if every value is positive.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then confirm all values are positive.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then all positive.


Take a list of integers; drop duplicates but keep the first one, then multiply each element by itself, then check if every number is above zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then square each, then return whether all values are positive.


Take a list of integers; drop the leading negative values, then take the first 3 elements, then give the number of evens.


Take a list of integers; cut the leading negatives, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; skip negatives at the start, then truncate to three items, then how many are even.


Take a list of integers; remove all negatives at the front, then show the first three, then get the total number of even values in the list.


Take a list of integers; remove the initial run of negative numbers, then take the first three, then give me the count of even values.


Take a list of integers; strip the front negatives, then keep first 3, then I need to know how many of these are even.


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


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


Take a list of integers; subtract one from each, then keep values below zero, then truncate to three items.


Take a list of integers; Decrement all items, then get the negative numbers, then show the first three.


Take a list of integers; decrement each value, then keep values below zero, then take the first three.


Take a list of integers; Lower each number by one, then get the negative numbers, then keep first 3.


Take a list of integers; reduce each by one, then keep values below zero, then truncate to first three.


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


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


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


Take a list of integers; negate each, then increase every value by 10, then arrange by magnitude ignoring sign.


Take a list of integers; reverse the signs of everything, then add 10 to each item, then put them in order by magnitude.


Take a list of integers; negate each, then shift each up by ten, then arrange in order of absolute value.


Take a list of integers; reverse the signs of everything, then increase all numbers by 10, then sort by distance from zero.


Take a list of integers; negate each, then add 10 to everything, then order by how far from zero.


Take a list of integers; reverse the signs of everything, then give everything a boost of 10, then order by distance from zero.


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


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


Take a list of integers; keep only the first three, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; keep the first 3 items, then Remove head, then minimum value, zero otherwise.


Take a list of integers; take the first 3 elements, then remove the first item, then get the minimum value or zero if empty.


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


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


Take a list of integers; show the first three, then Remove head, then return smallest or zero if empty.


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


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


Take a list of integers; keep the odd numbers, then cut the list at the first zero, then raise each to the power of two.


Take a list of integers; odd numbers only, then cut off after the first zero appears, then I need each number multiplied by itself.


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


Take a list of integers; odd numbers only, then keep the part before the first 0, then multiply each element by itself.


Take a list of integers; keep the odd numbers, then truncate at the first zero, then make each one squared.


Take a list of integers; odd numbers only, then delete everything starting with the first zero, then square each value in the list.


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


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


Take a list of integers; sort descending, then increase every value by 10, then true if already sorted smallest to largest.


Take a list of integers; sort largest first, then add 10 to each item, then does this list go in ascending order.


Take a list of integers; sort in descending order, then shift each up by ten, then check if the list is in ascending order.


Take a list of integers; sort from greatest to least, then increase all numbers by 10, then is the list sorted.


Take a list of integers; sort z to a, then add 10 to everything, then is it sorted.


Take a list of integers; arrange in decreasing order, then give everything a boost of 10, then check if values are in increasing order.


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


Take a list of integers; sort descending, then add ten to each, then return whether the list is sorted ascending.


Take a list of strings; drop empty strings, then strip spaces around each string, then arrange in lexicographic order.


Take a list of strings; get rid of blanks, then remove leading and trailing spaces, then sort by letter.


Take a list of strings; remove blanks, then remove whitespace from each item, then arrange in lexicographic order.


Take a list of strings; eliminate empty string values, then clean whitespace from each entry, then sort by letter.


Take a list of strings; filter out blank strings, then trim each string, then arrange in lexicographic order.


Take a list of strings; remove strings that are empty, then trim whitespace from each, then sort by letter.


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


Take a list of strings; drop empty strings, then trim whitespace from each, then sort alphabetically.


Take a list of integers; drop the first element, then keep values below zero, then count the elements.


Take a list of integers; Take everything except the first, then get the negative numbers, then how many items remain.


Take a list of integers; drop the first element, then keep values below zero, then tell me the length.


Take a list of integers; Take everything except the first, then get the negative numbers, then return the length.


Take a list of integers; drop the first element, then keep values below zero, then count them.


Take a list of integers; Take everything except the first, then get the negative numbers, then what's the count.


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


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


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


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


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


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


Take a list of integers; negate each, then use zero if the list is empty, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then default to zero when empty, then filter out the odd numbers.


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


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


Take a list of integers; reverse the order, then extend to length 3 using zeros, then count the elements.


Take a list of integers; reverse, then pad to 3, then how many items remain.


Take a list of integers; flip the list around, then extend to length 3 using zeros, then tell me the length.


Take a list of integers; flip the order around, then pad to 3, then return the length.


Take a list of integers; put the elements backwards, then extend to length 3 using zeros, then count them.


Take a list of integers; reverse that for me, then pad to 3, then what's the count.


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


Take a list of integers; reverse the order, then pad with zeros to at least three elements, then return how many remain.


Take a list of integers; drop the leading negative values, then remove both ends, then put the elements backwards.


Take a list of integers; cut the leading negatives, then trim the edges, then reverse that for me.


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


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


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


Take a list of integers; strip the front negatives, then keep only the middle part, 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 = r[1:-1]
    r = list(reversed(r))
    return r


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


Take a list of integers; take values while they are positive, then increase every value by 10, then give the number of evens.


Take a list of integers; take positive values then stop, then add 10 to each item, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then shift each up by ten, then how many are even.


Take a list of integers; stop at first non positive, then increase all numbers by 10, then get the total number of even values in the list.


Take a list of integers; take while greater than zero, then add 10 to everything, then give me the count of even values.


Take a list of integers; take values while positive, then give everything a boost of 10, then I need to know how many of these are even.


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


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


Take a list of integers; square each, then flip the sign of each, then drop the odd numbers.


Take a list of integers; each value squared, then turn positives to negatives and vice versa, then filter out the odd numbers.


Take a list of integers; multiply each value by itself, then flip the sign of each, then drop the odd numbers.


Take a list of integers; square them all, then turn positives to negatives and vice versa, then filter out the odd numbers.


Take a list of integers; raise each to the power of two, then flip the sign of each, then drop the odd numbers.


Take a list of integers; I need each number multiplied by itself, then turn positives to negatives and vice versa, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = [x * x 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; square each, then negate each, then keep the even numbers.


Take a list of integers; sort by absolute value, then skip negatives at the start, then true if already sorted smallest to largest.


Take a list of integers; rearrange by distance from zero, then remove all negatives at the front, then does this list go in ascending order.


Take a list of integers; arrange by magnitude ignoring sign, then remove the initial run of negative numbers, then check if the list is in ascending order.


Take a list of integers; put them in order by magnitude, then strip the front negatives, then is the list sorted.


Take a list of integers; arrange in order of absolute value, then remove leading negative numbers, then is it sorted.


Take a list of integers; sort by distance from zero, then drop negatives from start, then check if values are in increasing order.


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


Take a list of integers; sort by absolute value, then drop the leading negative values, then return whether the list is sorted ascending.


Take a list of integers; reverse the order, then multiply each value by itself, then arrange in decreasing order.


Take a list of integers; reverse, then square them all, then arrange in descending order.


Take a list of integers; flip the list around, then raise each to the power of two, then reverse sort.


Take a list of integers; flip the order around, then I need each number multiplied by itself, then sort largest to smallest.


Take a list of integers; put the elements backwards, then square all of them, then sort by descending values.


Take a list of integers; reverse that for me, then multiply each element by itself, then sort from highest to lowest.


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


Take a list of integers; reverse the order, then square each, then sort descending.


Take a list of integers; square each, then multiply each by two, then find the max, defaulting to 0.


Take a list of integers; each value squared, then double each item in the list, then Give me the maximum, but 0 if there are no items.


Take a list of integers; multiply each value by itself, then multiply each by two, then What's the highest number in the list.


Take a list of integers; square them all, then double each item in the list, then Return the greatest value or default to 0.


Take a list of integers; raise each to the power of two, then multiply each by two, then Find the largest element, defaulting to zero.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then give the largest value (0 if none).


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


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


Take a list of integers; cap each value at 10, then increase every value by 10, then arrange by magnitude ignoring sign.


Take a list of integers; clip values at 10, then add 10 to each item, then put them in order by magnitude.


Take a list of integers; cap each value at 10, then shift each up by ten, then arrange in order of absolute value.


Take a list of integers; clip values at 10, then increase all numbers by 10, then sort by distance from zero.


Take a list of integers; cap each value at 10, then add 10 to everything, then order by how far from zero.


Take a list of integers; clip values at 10, then give everything a boost of 10, then order by distance from zero.


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


Take a list of integers; cap each value at 10, then add ten to each, then sort by absolute value.


Take a list of integers; negate each, then order by distance from zero, then count the elements.


Take a list of integers; reverse the signs of everything, then sort based on absolute value, then how many items remain.


Take a list of integers; negate each, then organize by magnitude, then tell me the length.


Take a list of integers; reverse the signs of everything, then arrange by absolute value ascending, then return the length.


Take a list of integers; negate each, then sort from smallest to largest absolute value, then count them.


Take a list of integers; reverse the signs of everything, then sort by absolute value, then what's the count.


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


Take a list of integers; negate each, then sort by absolute value, then return how many remain.


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then reduce each by one.


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then Remove one from each value.


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


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


Take a list of integers; if empty, use a single zero, then sort smallest to largest, then stop at the first non-positive value.


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


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


Take a list of integers; when the list is empty, substitute a zero value, then Sort lowest to highest, then take positive values then stop.


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


Take a list of integers; zero it out if it's empty, then sort ascending, then stop at first non positive.


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


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


Take a list of integers; add ten to each, then sort largest to smallest, then strip the signs.


Take a list of integers; bump everything up by 10, then sort by descending values, then take abs of each.


Take a list of integers; increase every value by 10, then sort from highest to lowest, then get the absolute value of everything.


Take a list of integers; add 10 to each item, then sort descending, then apply absolute value to the whole list.


Take a list of integers; shift each up by ten, then sort largest first, then make them all positive.


Take a list of integers; increase all numbers by 10, then sort in descending order, then make every value non-negative.


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


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


Take a list of integers; add ten to each, then sort smallest to largest, then arrange in decreasing order.


Take a list of integers; bump everything up by 10, then Ascending sort, then arrange in descending order.


Take a list of integers; increase every value by 10, then Sort this ascending, then reverse sort.


Take a list of integers; add 10 to each item, then Sort lowest to highest, then sort largest to smallest.


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then sort by descending values.


Take a list of integers; increase all numbers by 10, then sort ascending, then sort from highest to lowest.


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


Take a list of integers; add ten to each, then sort ascending, then sort descending.


Take a list of strings; trim whitespace from each, then order the strings A to Z, then count characters across all strings.


Take a list of strings; strip whitespace from every element, then make it alphabetical, then character count.


Take a list of strings; remove surrounding whitespace, then order the strings A to Z, then count all the characters.


Take a list of strings; trim the whitespace off everything, then make it alphabetical, then total number of characters.


Take a list of strings; strip spaces from all strings, then order the strings A to Z, then what's the total character count.


Take a list of strings; strip all the strings, then make it alphabetical, then add up the lengths.


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


Take a list of strings; trim whitespace from each, then sort alphabetically, then return the total number of characters.


Take a list of people records (name, age); extract the ages, then flip the sign of each, then make each twice as big.


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, then multiply each by 2.


Take a list of people records (name, age); pluck the age field from each record, then flip the sign of each, then make each twice as big.


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, then multiply each by 2.


Take a list of people records (name, age); keep just each person's age, then flip the sign of each, then make each twice as big.


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then multiply each by 2.


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


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


Take a list of integers; drop the zeros, then take the first 3 elements, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then remove everything after the third, then any even.


Take a list of integers; drop the zeros, then truncate to three items, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then show the first three, then any even.


Take a list of integers; drop the zeros, then take the first three, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then keep first 3, then any even.


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


Take a list of integers; drop the zeros, then keep only the first three, then return whether any value is even.


Take a list of integers; keep the negative numbers, then keep only odd values, then arrange by magnitude ignoring sign.


Take a list of integers; extract negatives, then eliminate the even numbers, then put them in order by magnitude.


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


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


Take a list of integers; keep the negative numbers, then keep only odd values, then order by how far from zero.


Take a list of integers; extract negatives, then eliminate the even numbers, then order by distance from zero.


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


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


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


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


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


Take a list of integers; extract negatives, then cut off the first and last, then delete everything starting with the first zero.


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


Take a list of integers; extract negatives, then keep only the middle part, then up to but not including the first zero.


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


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


Take a list of integers; negate each, then keep only odd values, then replace an empty list with one zero.


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


Take a list of integers; negate each, then keep only odd values, then use zero if the list is empty.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then default to zero when empty.


Take a list of integers; negate each, then keep only odd values, then if there's nothing, put in a zero.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then if no items, add a zero.


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


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


Take a list of integers; sort ascending, then order by distance from zero, then true if any value equals zero.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then check for zero.


Take a list of integers; arrange in increasing order, then organize by magnitude, then true if any value equals zero.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then check for zero.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then true if any value equals zero.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then check for zero.


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


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


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


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then show only the last three.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then remove all but the last three.


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then take the final 3 elements.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then drop everything except the final three.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then give me the last three elements.


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


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


Take a list of integers; square each, then remove repeated values, then find the min, defaulting to 0.


Take a list of integers; each value squared, then unique values preserving order, then minimum value, zero otherwise.


Take a list of integers; multiply each value by itself, then remove repeated values, then get the minimum value or zero if empty.


Take a list of integers; square them all, then unique values preserving order, then give me the min or 0.


Take a list of integers; raise each to the power of two, then remove repeated values, then return the smallest number, defaulting to 0.


Take a list of integers; I need each number multiplied by itself, then unique values preserving order, then return smallest or zero if empty.


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


Take a list of integers; square each, then drop duplicates keeping first occurrence, then return the minimum (0 if empty).


Take a list of integers; drop the zeros, then keep values divisible by 3, then truncate to three items.


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


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


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then keep first 3.


Take a list of integers; drop the zeros, then keep only multiples of three, then truncate to first three.


Take a list of integers; keep only nonzero elements, then multiples of three only, then first three.


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


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


Take a list of integers; keep the odd numbers, then keep values divisible by 3, then skip the first one.


Take a list of integers; odd numbers only, then keep items where x mod 3 equals zero, then Discard the first element.


Take a list of integers; keep the odd numbers, then drop anything not divisible by three, then skip the first one.


Take a list of integers; odd numbers only, then filter out everything except multiples of three, then Discard the first element.


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


Take a list of integers; odd numbers only, then multiples of three only, then Discard the first element.


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


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


Take a list of integers; add ten to each, then flip the list around, then reduce each by one.


Take a list of integers; bump everything up by 10, then flip the order around, then Subtract 1 from all.


Take a list of integers; increase every value by 10, then put the elements backwards, then Subtract one from each.


Take a list of integers; add 10 to each item, then reverse that for me, then Drop each by one.


Take a list of integers; shift each up by ten, then flip it backwards, then Decrease all values by one.


Take a list of integers; increase all numbers by 10, then make it backwards, then Remove one from each value.


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


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


Take a list of people records (name, age); extract the ages, then keep only odd values, then drop non-positive values.


Take a list of people records (name, age); show me all ages, then eliminate the even numbers, then drop the negative numbers.


Take a list of people records (name, age); pluck the age field from each record, then keep only odd values, then filter out the negative ones.


Take a list of people records (name, age); get the age field, then eliminate the even numbers, then remove all negative values.


Take a list of people records (name, age); keep just each person's age, then keep only odd values, then keep positive values only.


Take a list of people records (name, age); extract age values, then eliminate the even numbers, then keep values above zero.


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


Take a list of people records (name, age); extract the ages, then keep the odd numbers, then keep the positive numbers.


Take a list of integers; keep the positive numbers, then make every value non-negative, then bump each up by one.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then increment each item.


Take a list of integers; drop non-positive values, then take absolute values, then bump each up by one.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then increment each item.


Take a list of integers; filter out the negative ones, then abs each element, then bump each up by one.


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


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


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


Take a list of integers; double each, then remove both ends, then count the elements.


Take a list of integers; times two for each item, then trim the edges, then how many items remain.


Take a list of integers; double each, then trim one element off each end, then tell me the length.


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


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


Take a list of integers; times two for each item, then keep only the middle part, then what's the count.


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


Take a list of integers; double each, then drop the first and last elements, then return how many remain.


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


Take a list of integers; drop duplicates but keep the first one, then Remove head, then keep the leading run of positive numbers.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then keep going while positive.


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


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


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


Take a list of integers; drop the first and last elements, then cut the list at the first zero, then put the elements backwards.


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then reverse that for me.


Take a list of integers; remove both ends, then take values up to (excluding) the first zero, then flip it backwards.


Take a list of integers; trim the edges, then keep the part before the first 0, then make it backwards.


Take a list of integers; trim one element off each end, then truncate at the first zero, then reverse the list.


Take a list of integers; cut off the first and last, then delete everything starting with the first zero, then invert the sequence.


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


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


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


Take a list of integers; make each one bigger, then filter for positive numbers, then strip out the evens.


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


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


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


Take a list of integers; make each one bigger, then keep the positive numbers, then strip out the evens.


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


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


Take a list of integers; keep the positive numbers, then remove all zero values, then truncate to three items.


Take a list of integers; get rid of anything that's not positive, then exclude zeros, then show the first three.


Take a list of integers; drop non-positive values, then remove all zero values, then take the first three.


Take a list of integers; drop the negative numbers, then exclude zeros, then keep first 3.


Take a list of integers; filter out the negative ones, then remove all zero values, then truncate to first three.


Take a list of integers; remove all negative values, then exclude zeros, then first three.


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


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


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


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


Take a list of integers; keep the odd numbers, then raise each to the power of two, then keep only multiples of three.


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


Take a list of integers; keep the odd numbers, then square all of them, then filter for numbers divisible by three.


Take a list of integers; odd numbers only, then multiply each element by itself, then give me only the values divisible by three.


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


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


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


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


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then how many are even.


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


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then give me the count of even values.


Take a list of integers; extract negatives, then don't let anything exceed 10, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then keep values divisible by 3, then find the max, defaulting to 0.


Take a list of integers; Sort it from low to high, then keep items where x mod 3 equals zero, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange in increasing order, then drop anything not divisible by three, then What's the highest number in the list.


Take a list of integers; Organize these ascending, then filter out everything except multiples of three, then Return the greatest value or default to 0.


Take a list of integers; Sort in ascending order, then keep only multiples of three, then Find the largest element, defaulting to zero.


Take a list of integers; I need this sorted ascending, then multiples of three only, then give the largest value (0 if none).


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


Take a list of integers; sort ascending, then keep multiples of three, then return the maximum (0 if empty).


Take a list of integers; if empty, use a single zero, then keep only odd values, then skip the first one.


Take a list of integers; if blank use 0, then eliminate the even numbers, then Discard the first element.


Take a list of integers; default to [0] when there is nothing, then keep only odd values, then skip the first one.


Take a list of integers; when the list is empty, substitute a zero value, then eliminate the even numbers, then Discard the first element.


Take a list of integers; replace an empty list with one zero, then keep only odd values, then skip the first one.


Take a list of integers; zero it out if it's empty, then eliminate the even numbers, then Discard the first element.


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


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


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


Take a list of people records (name, age); show me all ages, then remove everything after the third, then drop all positive numbers.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items, then drop non-negative values.


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


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


Take a list of people records (name, age); extract age values, then keep first 3, then drop all positive numbers.


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


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


Take a list of integers; drop the first and last elements, then keep values below zero, then arrange in increasing order.


Take a list of integers; take out the first and last items, then get the negative numbers, then Organize these ascending.


Take a list of integers; remove both ends, then keep values below zero, then Sort in ascending order.


Take a list of integers; trim the edges, then get the negative numbers, then I need this sorted ascending.


Take a list of integers; trim one element off each end, then keep values below zero, then Put these in ascending order.


Take a list of integers; cut off the first and last, then get the negative numbers, then sort smallest to largest.


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


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


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


Take a list of integers; keep the final three items, then absolute value for all items, then zero it out if it's empty.


Take a list of integers; take the last three, then take absolute values, then use zero if the list is empty.


Take a list of integers; trim to the last three, then turn negatives into positives, then default to zero when empty.


Take a list of integers; last three only, then abs each element, then if there's nothing, put in a zero.


Take a list of integers; truncate to the last three items, then take the absolute value of each, then if no items, add a zero.


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


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


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


Take a list of integers; each value squared, then Remove head, then find how many values are divisible by two.


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


Take a list of integers; square them all, then Remove head, then get the total number of even values in the list.


Take a list of integers; raise each to the power of two, then remove the first item, then give me the count of even values.


Take a list of integers; I need each number multiplied by itself, then Remove head, then I need to know how many of these are even.


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


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


Take a list of integers; add ten to each, then decrement each value, then stop at the first non-positive value.


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


Take a list of integers; increase every value by 10, then reduce each by one, then take values while they are positive.


Take a list of integers; add 10 to each item, then Subtract 1 from all, then take positive values then stop.


Take a list of integers; shift each up by ten, then Subtract one from each, then keep going while positive.


Take a list of integers; increase all numbers by 10, then Drop each by one, then stop at first non positive.


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


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


Take a list of integers; keep the positive numbers, then default to [0] when there is nothing, then strip the signs.


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


Take a list of integers; drop non-positive values, then replace an empty list with one zero, then get the absolute value of everything.


Take a list of integers; drop the negative numbers, then zero it out if it's empty, then apply absolute value to the whole list.


Take a list of integers; filter out the negative ones, then use zero if the list is empty, then make them all positive.


Take a list of integers; remove all negative values, then default to zero when empty, then make every value non-negative.


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


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


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


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort ascending, then cut the list at the first zero, then multiply each by -1.


Take a list of integers; Sort it from low to high, then cut off after the first zero appears, then negate.


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


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


Take a list of integers; Sort in ascending order, then truncate at the first zero, then multiply each by -1.


Take a list of integers; I need this sorted ascending, then delete everything starting with the first zero, then negate.


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


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


Take a list of integers; keep the negative numbers, then remove both ends, then multiply each by -1.


Take a list of integers; extract negatives, then trim the edges, then negate.


Take a list of integers; keep the negative numbers, then trim one element off each end, then multiply each by -1.


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


Take a list of integers; keep the negative numbers, then remove the first and last elements, then multiply each by -1.


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


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


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


Take a list of integers; keep multiples of three, then remove the first item, then give the earliest even value or zero.


Take a list of integers; get rid of non-multiples of three, then Remove head, then fetch the first even element, default to 0.


Take a list of integers; keep values divisible by 3, then remove the first item, then give the earliest even value or zero.


Take a list of integers; keep items where x mod 3 equals zero, then Remove head, then fetch the first even element, default to 0.


Take a list of integers; drop anything not divisible by three, then remove the first item, then give the earliest even value or zero.


Take a list of integers; filter out everything except multiples of three, then Remove head, then fetch the first even element, default to 0.


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


Take a list of integers; keep multiples of three, then drop the first element, then return the first even value (0 if none).


Take a list of integers; take the absolute value of each, then keep values divisible by 3, then true if already sorted smallest to largest.


Take a list of integers; convert to absolute value, then keep items where x mod 3 equals zero, then does this list go in ascending order.


Take a list of integers; strip the signs, then drop anything not divisible by three, then check if the list is in ascending order.


Take a list of integers; take abs of each, then filter out everything except multiples of three, then is the list sorted.


Take a list of integers; get the absolute value of everything, then keep only multiples of three, then is it sorted.


Take a list of integers; apply absolute value to the whole list, then multiples of three only, then check if values are in increasing order.


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


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


Take a list of integers; cap each value at 10, then keep the leading run of positive numbers, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then take values while they are positive, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then take positive values then stop, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then keep going while positive, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then stop at first non positive, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then take while greater than zero, then fetch the first even element, default to 0.


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


Take a list of integers; cap each value at 10, then take values while they are positive, then return the first even value (0 if none).


Take a list of integers; keep the negative numbers, then remove the first item, then give the earliest even value or zero.


Take a list of integers; extract negatives, then Remove head, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop the zeros, then sort smallest to largest, then drop non-positive values.


Take a list of integers; keep only nonzero elements, then Ascending sort, then drop the negative numbers.


Take a list of integers; drop the zeros, then Sort this ascending, then filter out the negative ones.


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then remove all negative values.


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then keep positive values only.


Take a list of integers; keep only nonzero elements, then sort ascending, then keep values above zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the leading run of positive numbers, then raise each to the power of two.


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then I need each number multiplied by itself.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then square all of them.


Take a list of integers; drop duplicates but keep the first one, then keep going while positive, then multiply each element by itself.


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then make each one squared.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then square each value in the list.


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


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


Take a list of integers; reverse the order, then multiply each by two, then true if at least one even value.


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


Take a list of integers; flip the list around, then multiply each by two, then true if at least one even value.


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


Take a list of integers; put the elements backwards, then multiply each by two, then true if at least one even value.


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


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


Take a list of integers; reverse the order, then double each, then return whether any value is even.


Take a list of integers; subtract one from each, then remove repeated values, then find the min, defaulting to 0.


Take a list of integers; Decrement all items, then unique values preserving order, then minimum value, zero otherwise.


Take a list of integers; decrement each value, then remove repeated values, then get the minimum value or zero if empty.


Take a list of integers; Lower each number by one, then unique values preserving order, then give me the min or 0.


Take a list of integers; reduce each by one, then remove repeated values, then return the smallest number, defaulting to 0.


Take a list of integers; Subtract 1 from all, then unique values preserving order, then return smallest or zero if empty.


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


Take a list of integers; subtract one from each, then drop duplicates keeping first occurrence, then return the minimum (0 if empty).


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


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


Take a list of integers; take the first 3 elements, then trim one element off each end, then take values while they are positive.


Take a list of integers; remove everything after the third, then cut off the first and last, then take positive values then stop.


Take a list of integers; truncate to three items, then remove the first and last elements, then keep going while positive.


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


def solve(xs):
    r = list(xs)
    r = r[:3]
    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 only the first three, then drop the first and last elements, then take values while they are positive.


Take a list of integers; drop the zeros, then sort smallest to largest, then count the elements.


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


Take a list of integers; drop the zeros, then Sort this ascending, then tell me the length.


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


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then count them.


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


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


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


Take a list of integers; drop the first and last elements, then keep the leading run of positive numbers, then skip the first one.


Take a list of integers; take out the first and last items, then take values while they are positive, then Discard the first element.


Take a list of integers; remove both ends, then take positive values then stop, then skip the first one.


Take a list of integers; trim the edges, then keep going while positive, then Discard the first element.


Take a list of integers; trim one element off each end, then stop at first non positive, then skip the first one.


Take a list of integers; cut off the first and last, then take while greater than zero, then Discard the first element.


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


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


Take a list of integers; drop the first element, then increment each value, then put the elements backwards.


Take a list of integers; Take everything except the first, then plus one for all, then reverse that for me.


Take a list of integers; drop the first element, then increment each value, then flip it backwards.


Take a list of integers; Take everything except the first, then plus one for all, then make it backwards.


Take a list of integers; drop the first element, then increment each value, then reverse the list.


Take a list of integers; Take everything except the first, then plus one for all, then invert the sequence.


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


Take a list of integers; drop the first element, then add one to each, then reverse the order.


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


Take a list of integers; times two for each item, then square them all, then Organize these ascending.


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


Take a list of integers; times two for each item, then I need each number multiplied by itself, then I need this sorted ascending.


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


Take a list of integers; times two for each item, then multiply each element by itself, then sort smallest to largest.


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


Take a list of integers; double each, then square each, then sort ascending.


Take a list of integers; if empty, use a single zero, then increase every value by 10, then count the elements.


Take a list of integers; if blank use 0, then add 10 to each item, then how many items remain.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then tell me the length.


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


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then count them.


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; drop duplicates keeping first occurrence, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; drop duplicates but keep the first one, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; drop duplicates keeping first occurrence, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; drop duplicates but keep the first one, then sort ascending, then drop anything 5 or below.


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


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


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


Take a list of integers; each value squared, then take values while they are positive, then check for zero.


Take a list of integers; multiply each value by itself, then take positive values then stop, then true if any value equals zero.


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


Take a list of integers; raise each to the power of two, then stop at first non positive, then true if any value equals zero.


Take a list of integers; I need each number multiplied by itself, then take while greater than zero, then check for zero.


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


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


Take a list of people records (name, age); extract the names, then add '#' to the start of each string, then reduce each string to its first character.


Take a list of people records (name, age); Give me the names, then make each one start with a hash, then take first char drop blanks.


Take a list of people records (name, age); pluck the name field from each record, then add '#' to the start of each string, then keep first letters only.


Take a list of people records (name, age); Grab the names, then make each one start with a hash, then first letter from each item that isn't empty.


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


Take a list of people records (name, age); List the names, then make each one start with a hash, then isolate the first character per entry.


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


Take a list of people records (name, age); extract the names, then prefix each with a hash, then keep the first character of each (dropping empties).


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then give the earliest even value or zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then double each, then return the first even value (0 if none).


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


Take a list of integers; extract negatives, then don't let anything exceed 10, then put them in order by magnitude.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then arrange in order of absolute value.


Take a list of integers; extract negatives, then don't let anything exceed 10, then sort by distance from zero.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then order by how far from zero.


Take a list of integers; extract negatives, then don't let anything exceed 10, then order by distance from zero.


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


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


Take a list of strings; trim whitespace from each, then convert each to lower case, then deduplicate the strings.


Take a list of strings; strip whitespace from every element, then lowercase each one, then filter out duplicate strings retain first.


Take a list of strings; remove surrounding whitespace, then convert each to lower case, then strip duplicates preserve order.


Take a list of strings; trim the whitespace off everything, then lowercase each one, then remove repeated strings.


Take a list of strings; strip spaces from all strings, then convert each to lower case, then keep unique strings first appearance.


Take a list of strings; strip all the strings, then lowercase each one, then eliminate repeated strings preserve first occurrence.


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


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


Take a list of integers; square each, then increase every value by 10, then arrange in increasing order.


Take a list of integers; each value squared, then add 10 to each item, then Organize these ascending.


Take a list of integers; multiply each value by itself, then shift each up by ten, then Sort in ascending order.


Take a list of integers; square them all, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; raise each to the power of two, then add 10 to everything, then Put these in ascending order.


Take a list of integers; I need each number multiplied by itself, then give everything a boost of 10, then sort smallest to largest.


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


Take a list of integers; square each, then add ten to each, then sort ascending.


Take a list of integers; subtract one from each, then remove the first item, then truncate to the last three items.


Take a list of integers; Decrement all items, then Remove head, then show only the last three.


Take a list of integers; decrement each value, then remove the first item, then remove all but the last three.


Take a list of integers; Lower each number by one, then Remove head, then take the final 3 elements.


Take a list of integers; reduce each by one, then remove the first item, then drop everything except the final three.


Take a list of integers; Subtract 1 from all, then Remove head, then give me the last three elements.


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


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


Take a list of integers; drop the leading negative values, then extend to length 3 using zeros, then skip the first one.


Take a list of integers; cut the leading negatives, then pad to 3, then Discard the first element.


Take a list of integers; skip negatives at the start, then extend to length 3 using zeros, then skip the first one.


Take a list of integers; remove all negatives at the front, then pad to 3, then Discard the first element.


Take a list of integers; remove the initial run of negative numbers, then extend to length 3 using zeros, then skip the first one.


Take a list of integers; strip the front negatives, then pad to 3, then Discard the first element.


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


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


Take a list of integers; if empty, use a single zero, then keep values above zero, then remove the initial run of negative numbers.


Take a list of integers; if blank use 0, then filter for positive numbers, then strip the front negatives.


Take a list of integers; default to [0] when there is nothing, then keep only positive numbers, then remove leading negative numbers.


Take a list of integers; when the list is empty, substitute a zero value, then keep the positives, then drop negatives from start.


Take a list of integers; replace an empty list with one zero, then remove negatives, then strip negative values from the start.


Take a list of integers; zero it out if it's empty, then keep the positive numbers, then remove negatives before the first non-negative.


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


Take a list of integers; if empty, use a single zero, then keep the positive numbers, then drop the leading negative values.


Take a list of integers; keep values greater than five, then flip the list around, then drop the odd numbers.


Take a list of integers; filter out values less than or equal to 5, then flip the order around, then filter out the odd numbers.


Take a list of integers; keep only numbers above 5, then put the elements backwards, then drop the odd numbers.


Take a list of integers; exclude values of 5 and below, then reverse that for me, then filter out the odd numbers.


Take a list of integers; remove anything 5 or less, then flip it backwards, then drop the odd numbers.


Take a list of integers; filter to keep only values above 5, then make it backwards, then filter out the odd numbers.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then show only the last three.


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


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then take the final 3 elements.


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


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then give me the last three elements.


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


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


Take a list of integers; drop the zeros, then order by distance from zero, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then sort based on absolute value, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; keep only nonzero elements, then arrange by absolute value ascending, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the zeros, then sort from smallest to largest absolute value, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; sort by absolute value, then remove repeated values, then find the max, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then unique values preserving order, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange by magnitude ignoring sign, then remove repeated values, then What's the highest number in the list.


Take a list of integers; put them in order by magnitude, then unique values preserving order, then Return the greatest value or default to 0.


Take a list of integers; arrange in order of absolute value, then remove repeated values, then Find the largest element, defaulting to zero.


Take a list of integers; sort by distance from zero, then unique values preserving order, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = list(dict.fromkeys(r))
    return max(r) if r else 0


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


Take a list of integers; subtract one from each, then drop anything 5 or below, then ensure at least three items by appending zeros.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then ensure minimum length of three by adding zeros to the end.