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


Take a list of integers; sort descending, then take the final 3 elements.


Take a list of integers; sort largest first, then drop everything except the final three.


Take a list of integers; sort in descending order, then give me the last three elements.


Take a list of integers; sort from greatest to least, then keep only the last three.


Take a list of integers; sort z to a, then keep the final three items.


Take a list of integers; arrange in decreasing order, then take the last three.


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


Take a list of integers; sort descending, then keep only the last three.


Take a list of integers; sort by absolute value, then check that there are no duplicates.


Take a list of integers; rearrange by distance from zero, then are the values all unique.


Take a list of integers; arrange by magnitude ignoring sign, then check if all values are unique.


Take a list of integers; put them in order by magnitude, then return whether all values are distinct.


Take a list of integers; arrange in order of absolute value, then tell me if values are distinct.


Take a list of integers; sort by distance from zero, then are all values distinct.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    return len(r) == len(set(r))


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


Take a list of integers; if empty, use a single zero, then find the first even number, defaulting to 0.


Take a list of integers; if blank use 0, then first even value zero if not found.


Take a list of integers; default to [0] when there is nothing, then find the first even number, defaulting to 0.


Take a list of integers; when the list is empty, substitute a zero value, then first even value zero if not found.


Take a list of integers; replace an empty list with one zero, then find the first even number, defaulting to 0.


Take a list of integers; zero it out if it's empty, then first even value zero if not found.


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below.


Take a list of integers; if blank use 0, then keep only numbers greater than 5.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5.


Take a list of integers; when the list is empty, substitute a zero value, then give me values where x is greater than 5.


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five.


Take a list of integers; zero it out if it's empty, then keep values greater than five.


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


Take a list of integers; if empty, use a single zero, then keep values greater than five.


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


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


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


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


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


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


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


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


Take a list of integers; double each, then count the even numbers.


Take a list of integers; times two for each item, then what's the even count.


Take a list of integers; double each, then give the number of evens.


Take a list of integers; times two for each item, then find how many values are divisible by two.


Take a list of integers; double each, then how many are even.


Take a list of integers; times two for each item, then get the total number of even values in the list.


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


Take a list of integers; double each, then return how many values are even.


Take a list of integers; negate each, then check if zero appears.


Take a list of integers; reverse the signs of everything, then find out whether there's a zero in here.


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


Take a list of integers; negate each, then return whether the list contains a zero.


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


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


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


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


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


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


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


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


Take a list of integers; drop the leading negative values, then count the even numbers.


Take a list of integers; cut the leading negatives, then what's the even count.


Take a list of integers; skip negatives at the start, then give the number of evens.


Take a list of integers; remove all negatives at the front, then find how many values are divisible by two.


Take a list of integers; remove the initial run of negative numbers, then how many are even.


Take a list of integers; strip the front negatives, then get the total number of even values in the list.


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


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


Take a list of strings; trim whitespace from each, then sum the lengths of all strings.


Take a list of strings; strip whitespace from every element, then sum up all the characters across everything and tell me what you get.


Take a list of strings; remove surrounding whitespace, then count characters across all strings.


Take a list of strings; trim the whitespace off everything, then character count.


Take a list of strings; strip spaces from all strings, then count all the characters.


Take a list of strings; strip all the strings, then total number of characters.


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


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


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


Take a list of integers; get rid of anything that's not positive, then take values while they are positive.


Take a list of integers; drop non-positive values, then take positive values then stop.


Take a list of integers; drop the negative numbers, then keep going while positive.


Take a list of integers; filter out the negative ones, then stop at first non positive.


Take a list of integers; remove all negative values, then take while greater than zero.


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


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


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


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


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


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


Take a list of integers; cap each value at 10, then multiply each value by itself.


Take a list of integers; clip values at 10, then square them all.


Take a list of integers; cap each value at 10, then raise each to the power of two.


Take a list of integers; clip values at 10, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then square all of them.


Take a list of integers; clip values at 10, then multiply each element by itself.


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


Take a list of integers; cap each value at 10, then square each.


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


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


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


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


Take a list of integers; drop the first element, then check if there is an even number.


Take a list of integers; Take everything except the first, then find out whether any value is divisible by 2.


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


Take a list of integers; drop the first element, then return whether any value is even.


Take a list of integers; drop the first and last elements, then take the final 3 elements.


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


Take a list of integers; remove both ends, then give me the last three elements.


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


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


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


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


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


Take a list of strings; prefix each with a hash, then sum the lengths of all strings.


Take a list of strings; add # to the start of each string, then sum up all the characters across everything and tell me what you get.


Take a list of strings; prefix each with a hash, then count characters across all strings.


Take a list of strings; add # to the start of each string, then character count.


Take a list of strings; prefix each with a hash, then count all the characters.


Take a list of strings; add # to the start of each string, then total number of characters.


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


Take a list of strings; prefix each with a hash, then return the total number of characters.


Take a list of integers; drop the first and last elements, then flip the list around.


Take a list of integers; take out the first and last items, then flip the order around.


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


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


Take a list of integers; trim one element off each end, then flip it backwards.


Take a list of integers; cut off the first and last, then make it backwards.


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


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


Take a list of integers; take values while they are positive, then flip the list around.


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


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


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


Take a list of integers; take while greater than zero, then flip it backwards.


Take a list of integers; take values while positive, then make it backwards.


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


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


Take a list of integers; keep multiples of three, then sort smallest to largest.


Take a list of integers; get rid of non-multiples of three, then Ascending sort.


Take a list of integers; keep values divisible by 3, then Sort this ascending.


Take a list of integers; keep items where x mod 3 equals zero, then Sort lowest to highest.


Take a list of integers; drop anything not divisible by three, then Arrange from smallest to largest.


Take a list of integers; filter out everything except multiples of three, then sort ascending.


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


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


Take a list of people records (name, age); extract the ages, then sort largest to smallest.


Take a list of people records (name, age); show me all ages, then sort by descending values.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest.


Take a list of people records (name, age); get the age field, then sort descending.


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


Take a list of people records (name, age); extract age values, then sort in descending order.


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


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


Take a list of integers; keep the positive numbers, then remove both ends.


Take a list of integers; get rid of anything that's not positive, then trim the edges.


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


Take a list of integers; drop the negative numbers, then cut off the first and last.


Take a list of integers; filter out the negative ones, then remove the first and last elements.


Take a list of integers; remove all negative values, then keep only the middle part.


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


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


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


Take a list of integers; odd numbers only, then absolute value for all items.


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


Take a list of integers; odd numbers only, then turn negatives into positives.


Take a list of integers; keep the odd numbers, then abs each element.


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


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


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


Take a list of integers; sort ascending, then cut the list at the first zero.


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


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


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


Take a list of integers; Sort in ascending order, then truncate at the first zero.


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


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


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


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


Take a list of integers; convert to absolute value, then give me a yes or no if the list is sorted.


Take a list of integers; strip the signs, then is this list sorted.


Take a list of integers; take abs of each, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; get the absolute value of everything, then tell me if it's sorted ascending.


Take a list of integers; apply absolute value to the whole list, then return whether the list is sorted ascending.


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


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


Take a list of integers; sort ascending, then multiply them all together.


Take a list of integers; Sort it from low to high, then multiply them all.


Take a list of integers; arrange in increasing order, then multiply all the numbers together.


Take a list of integers; Organize these ascending, then get the product.


Take a list of integers; Sort in ascending order, then find the product of these.


Take a list of integers; I need this sorted ascending, then return their product.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    return __import__('math').prod(r)


Take a list of integers; sort ascending, then return their product.


Take a list of integers; drop the first element, then remove all zero values.


Take a list of integers; Take everything except the first, then exclude zeros.


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


Take a list of integers; drop the first element, then drop the zeros.


Take a list of integers; drop the zeros, then take the final 3 elements.


Take a list of integers; keep only nonzero elements, then drop everything except the final three.


Take a list of integers; drop the zeros, then give me the last three elements.


Take a list of integers; keep only nonzero elements, then keep only the last three.


Take a list of integers; drop the zeros, then keep the final three items.


Take a list of integers; keep only nonzero elements, then take the last three.


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


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


Take a list of integers; drop the leading negative values, then increase every value by 10.


Take a list of integers; cut the leading negatives, then add 10 to each item.


Take a list of integers; skip negatives at the start, then shift each up by ten.


Take a list of integers; remove all negatives at the front, then increase all numbers by 10.


Take a list of integers; remove the initial run of negative numbers, then add 10 to everything.


Take a list of integers; strip the front negatives, then give everything a boost of 10.


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 r


Take a list of integers; drop the leading negative values, then add ten to each.


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


Take a list of integers; convert to absolute value, then eliminate the even numbers.


Take a list of integers; strip the signs, then keep only odd values.


Take a list of integers; take abs of each, then eliminate the even numbers.


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


Take a list of integers; apply absolute value to the whole list, then eliminate the even numbers.


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


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


Take a list of integers; add ten to each, then multiply each by two.


Take a list of integers; bump everything up by 10, then double each item in the list.


Take a list of integers; increase every value by 10, then multiply each by two.


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


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


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


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


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


Take a list of integers; keep the negative numbers, then check if values are in increasing order.


Take a list of integers; extract negatives, then give me a yes or no if the list is sorted.


Take a list of integers; keep the negative numbers, then is this list sorted.


Take a list of integers; extract negatives, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; keep the negative numbers, then tell me if it's sorted ascending.


Take a list of integers; extract negatives, then return whether the list is sorted ascending.


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


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


Take a list of strings; trim whitespace from each, then take each string's first letter.


Take a list of strings; strip whitespace from every element, then give me the first letter of everything.


Take a list of strings; remove surrounding whitespace, then reduce each string to its first character.


Take a list of strings; trim the whitespace off everything, then take first char drop blanks.


Take a list of strings; strip spaces from all strings, then keep first letters only.


Take a list of strings; strip all the strings, then first letter from each item that isn't empty.


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


Take a list of strings; trim whitespace from each, then keep the first character of each (dropping empties).


Take a list of strings; lowercase each string, then give back the lengthiest string.


Take a list of strings; change to lowercase, then Longest string please.


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


Take a list of strings; lowercase each string, then return the longest string (empty if none).


Take a list of integers; drop the leading negative values, then remove all zero values.


Take a list of integers; cut the leading negatives, then exclude zeros.


Take a list of integers; skip negatives at the start, then remove all zero values.


Take a list of integers; remove all negatives at the front, then exclude zeros.


Take a list of integers; remove the initial run of negative numbers, then remove all zero values.


Take a list of integers; strip the front negatives, then exclude zeros.


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


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


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


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


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


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


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


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


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 r


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


Take a list of integers; pad with zeros to at least three elements, then check if every number is above zero.


Take a list of integers; add zeros until the list has at least three values, then verify that all values exceed zero.


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


Take a list of integers; add zeros until the list has at least three values, then are they all above zero.


Take a list of integers; pad with zeros to at least three elements, then tell me if all numbers are greater than zero.


Take a list of integers; add zeros until the list has at least three values, then return whether all values are positive.


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


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


Take a list of integers; sort descending, then remove both ends.


Take a list of integers; sort largest first, then trim the edges.


Take a list of integers; sort in descending order, then trim one element off each end.


Take a list of integers; sort from greatest to least, then cut off the first and last.


Take a list of integers; sort z to a, then remove the first and last elements.


Take a list of integers; arrange in decreasing order, then keep only the middle part.


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


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


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


Take a list of integers; extract negatives, then keep only numbers greater than 5.


Take a list of integers; keep the negative numbers, then filter for numbers above 5.


Take a list of integers; extract negatives, then give me values where x is greater than 5.


Take a list of integers; keep the negative numbers, then show me only the values that are bigger than five.


Take a list of integers; extract negatives, then keep values greater than five.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; sort descending, then remove repeated values.


Take a list of integers; sort largest first, then unique values preserving order.


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


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


Take a list of integers; sort z to a, then remove repeated values.


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


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


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


Take a list of integers; add ten to each, then decrement each value.


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then give the largest value (0 if none).


Take a list of integers; keep only nonzero elements, then The biggest one, or 0 if it's empty.


Take a list of integers; drop the zeros, then Get the maximum value, or zero if there's nothing.


Take a list of integers; keep only nonzero elements, then What's the max here.


Take a list of integers; drop the zeros, then Return the max or 0 if empty.


Take a list of integers; keep only nonzero elements, then return the maximum (0 if empty).


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


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


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


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


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


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


Take a list of integers; negate each, then keep the final three items.


Take a list of integers; reverse the signs of everything, then take the last three.


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


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


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


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


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


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


Take a list of integers; take while greater than zero, then keep only multiples of three.


Take a list of integers; take values while positive, then multiples of three only.


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


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


Take a list of strings; sort by length, shortest first, then sum the lengths of all strings.


Take a list of strings; sort ascending by length, then sum up all the characters across everything and tell me what you get.


Take a list of strings; order strings from shortest to longest, then count characters across all strings.


Take a list of strings; shortest to longest, then character count.


Take a list of strings; arrange by string length ascending, then count all the characters.


Take a list of strings; length sort, then total number of characters.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=len)
    return sum(len(s) for s in r)


Take a list of strings; sort by length, shortest first, then return the total number of characters.


Take a list of integers; subtract one from each, then take the first 3 elements.


Take a list of integers; Decrement all items, then remove everything after the third.


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


Take a list of integers; Lower each number by one, then show the first three.


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


Take a list of integers; Subtract 1 from all, then keep first 3.


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


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


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


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


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


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


Take a list of integers; drop the zeros, then give the smallest value (0 if none).


Take a list of integers; keep only nonzero elements, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; drop the zeros, then find the min, defaulting to 0.


Take a list of integers; keep only nonzero elements, then minimum value, zero otherwise.


Take a list of integers; drop the zeros, then get the minimum value or zero if empty.


Take a list of integers; keep only nonzero elements, then give me the min or 0.


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


Take a list of integers; drop the zeros, then return the minimum (0 if empty).


Take a list of integers; cap each value at 10, then add them all up.


Take a list of integers; clip values at 10, then add all those together.


Take a list of integers; cap each value at 10, then give back the total.


Take a list of integers; clip values at 10, then sum r.


Take a list of integers; cap each value at 10, then add them up.


Take a list of integers; clip values at 10, then calculate the sum of all elements.


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


Take a list of integers; cap each value at 10, then return their sum.


Take a list of integers; double each, then flip the sign of each.


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


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


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


Take a list of integers; keep the odd numbers, then remove both ends.


Take a list of integers; odd numbers only, then trim the edges.


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


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


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


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


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


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


Take a list of integers; take the absolute value of each, then check if there is an even number.


Take a list of integers; convert to absolute value, then find out whether any value is divisible by 2.


Take a list of integers; strip the signs, then check if there is an even number.


Take a list of integers; take abs of each, then find out whether any value is divisible by 2.


Take a list of integers; get the absolute value of everything, then check if there is an even number.


Take a list of integers; apply absolute value to the whole list, then find out whether any value is divisible by 2.


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


Take a list of integers; take the absolute value of each, then return whether any value is even.


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


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then order by distance from zero.


Take a list of integers; keep only nonzero elements, then sort based on absolute value.


Take a list of integers; drop the zeros, then organize by magnitude.


Take a list of integers; keep only nonzero elements, then arrange by absolute value ascending.


Take a list of integers; drop the zeros, then sort from smallest to largest absolute value.


Take a list of integers; keep only nonzero elements, then sort by absolute value.


def solve(xs):
    r = list(xs)
    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 sort by absolute value.


Take a list of integers; reverse the order, then give the largest value (0 if none).


Take a list of integers; reverse, then The biggest one, or 0 if it's empty.


Take a list of integers; flip the list around, then Get the maximum value, or zero if there's nothing.


Take a list of integers; flip the order around, then What's the max here.


Take a list of integers; put the elements backwards, then Return the max or 0 if empty.


Take a list of integers; reverse that for me, then return the maximum (0 if empty).


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    return max(r) if r else 0


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


Take a list of integers; keep multiples of three, then increment each value.


Take a list of integers; get rid of non-multiples of three, then plus one for all.


Take a list of integers; keep values divisible by 3, then increment each value.


Take a list of integers; keep items where x mod 3 equals zero, then plus one for all.


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


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


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


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


Take a list of integers; subtract one from each, then default to [0] when there is nothing.


Take a list of integers; Decrement all items, then when the list is empty, substitute a zero value.


Take a list of integers; decrement each value, then replace an empty list with one zero.


Take a list of integers; Lower each number by one, then zero it out if it's empty.


Take a list of integers; reduce each by one, then use zero if the list is empty.


Take a list of integers; Subtract 1 from all, then default to zero when empty.


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


Take a list of integers; subtract one from each, then if empty, use a single zero.


Take a list of integers; sort by absolute value, then give the smallest value (0 if none).


Take a list of integers; rearrange by distance from zero, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; arrange by magnitude ignoring sign, then find the min, defaulting to 0.


Take a list of integers; put them in order by magnitude, then minimum value, zero otherwise.


Take a list of integers; arrange in order of absolute value, then get the minimum value or zero if empty.


Take a list of integers; sort by distance from zero, then give me the min or 0.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    return min(r) if r else 0


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


Take a list of integers; add one to each, then skip negatives at the start.


Take a list of integers; make each one bigger, then remove all negatives at the front.


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


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


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


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


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


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


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


Take a list of integers; keep the final three items, then Remove head.


Take a list of integers; take the last three, then remove the first item.


Take a list of integers; trim to the last three, then Remove head.


Take a list of integers; last three only, then remove the first item.


Take a list of integers; truncate to the last three items, then Remove head.


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


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


Take a list of integers; sort descending, then increase every value by 10.


Take a list of integers; sort largest first, then add 10 to each item.


Take a list of integers; sort in descending order, then shift each up by ten.


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


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


Take a list of integers; arrange in decreasing order, then give everything a boost of 10.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; negate each, then keep values divisible by 3.


Take a list of integers; reverse the signs of everything, then keep items where x mod 3 equals zero.


Take a list of integers; negate each, then drop anything not divisible by three.


Take a list of integers; reverse the signs of everything, then filter out everything except multiples of three.


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


Take a list of integers; reverse the signs of everything, then multiples of three only.


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


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


Take a list of integers; add one to each, then keep values divisible by 3.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero.


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


Take a list of integers; make each one bigger, then filter out everything except multiples of three.


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


Take a list of integers; make each one bigger, then multiples of three only.


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


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


Take a list of integers; keep only the first three, then remove both ends.


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


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


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


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


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


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


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


Take a list of integers; sort descending, then count the even numbers.


Take a list of integers; sort largest first, then what's the even count.


Take a list of integers; sort in descending order, then give the number of evens.


Take a list of integers; sort from greatest to least, then find how many values are divisible by two.


Take a list of integers; sort z to a, then how many are even.


Take a list of integers; arrange in decreasing order, then get the total number of even values in the list.


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


Take a list of integers; sort descending, then return how many values are even.


Take a list of integers; drop the zeros, then keep values above zero.


Take a list of integers; keep only nonzero elements, then filter for positive numbers.


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


Take a list of integers; keep only nonzero elements, then keep the positives.


Take a list of integers; drop the zeros, then remove negatives.


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


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


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


Take a list of people records (name, age); extract the names, then give the maximum string length.


Take a list of people records (name, age); Give me the names, then max length of all strings.


Take a list of people records (name, age); pluck the name field from each record, then what's the max string length.


Take a list of people records (name, age); Grab the names, then return the length of the longest string (0 if none).


Take a list of people records (name, age); keep just each person's name, then how long is the longest string.


Take a list of people records (name, age); List the names, then find the longest string length.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    return max((len(s) for s in r), default=0)


Take a list of people records (name, age); extract the names, then return the length of the longest string (0 if none).


Take a list of strings; sort alphabetically, then add '#' to the start of each string.


Take a list of strings; arrange alphabetically, then make each one start with a hash.


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


Take a list of strings; sort alphabetically, then prefix each with a hash.


Take a list of integers; keep everything before the first zero, then check if there is an even number.


Take a list of integers; take only what comes before the initial zero, then find out whether any value is divisible by 2.


Take a list of integers; cut the list at the first zero, then check if there is an even number.


Take a list of integers; cut off after the first zero appears, then find out whether any value is divisible by 2.


Take a list of integers; take values up to (excluding) the first zero, then check if there is an even number.


Take a list of integers; keep the part before the first 0, then find out whether any value is divisible by 2.


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


Take a list of integers; keep everything before the first zero, then return whether any value is even.


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


Take a list of integers; take out the first and last items, then eliminate the even numbers.


Take a list of integers; remove both ends, then keep only odd values.


Take a list of integers; trim the edges, then eliminate the even numbers.


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


Take a list of integers; cut off the first and last, then eliminate the even numbers.


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


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


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


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


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


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


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


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


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 r


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


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


Take a list of integers; keep evens, then keep items where x mod 3 equals zero.


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


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


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


Take a list of integers; keep evens, then multiples of three only.


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]
    return r


Take a list of integers; keep the even numbers, then keep multiples of three.


Take a list of integers; keep multiples of three, then check if there is an even number.


Take a list of integers; get rid of non-multiples of three, then find out whether any value is divisible by 2.


Take a list of integers; keep values divisible by 3, then check if there is an even number.


Take a list of integers; keep items where x mod 3 equals zero, then find out whether any value is divisible by 2.


Take a list of integers; drop anything not divisible by three, then check if there is an even number.


Take a list of integers; filter out everything except multiples of three, then find out whether any value is divisible by 2.


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


Take a list of integers; keep multiples of three, then return whether any value is even.


Take a list of integers; keep only the last three, then return the length.


Take a list of integers; keep the final three items, then count them.


Take a list of integers; take the last three, then what's the count.


Take a list of integers; trim to the last three, then return how many remain.


Take a list of integers; last three only, then what's left.


Take a list of integers; truncate to the last three items, then how many are left.


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


Take a list of integers; keep only the last three, then return how many remain.


Take a list of integers; pad with zeros to at least three elements, then count the even numbers.


Take a list of integers; add zeros until the list has at least three values, then what's the even count.


Take a list of integers; pad with zeros to at least three elements, then give the number of evens.


Take a list of integers; add zeros until the list has at least three values, then find how many values are divisible by two.


Take a list of integers; pad with zeros to at least three elements, then how many are even.


Take a list of integers; add zeros until the list has at least three values, then get the total number of even values in the list.


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


Take a list of integers; pad with zeros to at least three elements, then return how many values are even.


Take a list of strings; prefix each with a hash, then remove repeated strings.


Take a list of strings; add # to the start of each string, then keep unique strings first appearance.


Take a list of strings; prefix each with a hash, then eliminate repeated strings preserve first occurrence.


Take a list of strings; add # to the start of each string, then drop duplicate strings keeping the first.


Take a list of strings; prefix each with a hash, then dedupe.


Take a list of strings; add # to the start of each string, then remove duplicate strings keep first.


def solve(xs):
    r = list(xs)
    r = ['#' + s for s in r]
    r = list(dict.fromkeys(r))
    return r


Take a list of strings; prefix each with a hash, then drop duplicate strings keeping the first.


Take a list of integers; take values while they are positive, then check if zero appears.


Take a list of integers; take positive values then stop, then find out whether there's a zero in here.


Take a list of integers; keep going while positive, then check if zero appears.


Take a list of integers; stop at first non positive, then find out whether there's a zero in here.


Take a list of integers; take while greater than zero, then check if zero appears.


Take a list of integers; take values while positive, then find out whether there's a zero in here.


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


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


Take a list of integers; drop the first element, then take the final 3 elements.


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


Take a list of integers; drop the first element, then give me the last three elements.


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


Take a list of integers; drop the first element, then keep the final three items.


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


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


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


Take a list of integers; take the absolute value of each, then multiply them all together.


Take a list of integers; convert to absolute value, then multiply them all.


Take a list of integers; strip the signs, then multiply all the numbers together.


Take a list of integers; take abs of each, then get the product.


Take a list of integers; get the absolute value of everything, then find the product of these.


Take a list of integers; apply absolute value to the whole list, then return their product.


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


Take a list of integers; take the absolute value of each, then return their product.


Take a list of integers; keep multiples of three, then increase every value by 10.


Take a list of integers; get rid of non-multiples of three, then add 10 to each item.


Take a list of integers; keep values divisible by 3, then shift each up by ten.


Take a list of integers; keep items where x mod 3 equals zero, then increase all numbers by 10.


Take a list of integers; drop anything not divisible by three, then add 10 to everything.


Take a list of integers; filter out everything except multiples of three, then give everything a boost of 10.


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


Take a list of integers; keep multiples of three, then add ten to each.


Take a list of integers; keep only the last three, then keep only even values.


Take a list of integers; keep the final three items, then extract all even numbers.


Take a list of integers; take the last three, then keep only even values.


Take a list of integers; trim to the last three, then extract all even numbers.


Take a list of integers; last three only, then keep only even values.


Take a list of integers; truncate to the last three items, then extract all even numbers.


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


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


Take a list of integers; sort descending, then take the first 3 elements.


Take a list of integers; sort largest first, then remove everything after the third.


Take a list of integers; sort in descending order, then truncate to three items.


Take a list of integers; sort from greatest to least, then show the first three.


Take a list of integers; sort z to a, then take the first three.


Take a list of integers; arrange in decreasing order, then keep first 3.


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


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


Take a list of integers; sort by absolute value, then return the length.


Take a list of integers; rearrange by distance from zero, then count them.


Take a list of integers; arrange by magnitude ignoring sign, then what's the count.


Take a list of integers; put them in order by magnitude, then return how many remain.


Take a list of integers; arrange in order of absolute value, then what's left.


Take a list of integers; sort by distance from zero, then how many are left.


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


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


Take a list of integers; reverse the order, then keep the leading run of positive numbers.


Take a list of integers; reverse, then take values while they are positive.


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


Take a list of integers; flip the order around, then keep going while positive.


Take a list of integers; put the elements backwards, then stop at first non positive.


Take a list of integers; reverse that for me, then take while greater than zero.


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


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


Take a list of integers; take values while they are positive, then order by distance from zero.


Take a list of integers; take positive values then stop, then sort based on absolute value.


Take a list of integers; keep going while positive, then organize by magnitude.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value.


Take a list of integers; take values while positive, then sort by absolute value.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then skip negatives at the start.


Take a list of integers; drop duplicates but keep the first one, then remove all negatives at the front.


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


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


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


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


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)):]
    return r


Take a list of integers; drop duplicates keeping first occurrence, then drop the leading negative values.


Take a list of integers; subtract one from each, then add them all up.


Take a list of integers; Decrement all items, then add all those together.


Take a list of integers; decrement each value, then give back the total.


Take a list of integers; Lower each number by one, then sum r.


Take a list of integers; reduce each by one, then add them up.


Take a list of integers; Subtract 1 from all, then calculate the sum of all elements.


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


Take a list of integers; subtract one from each, then return their sum.


Take a list of integers; square each, then sort largest to smallest.


Take a list of integers; each value squared, then sort by descending values.


Take a list of integers; multiply each value by itself, then sort from highest to lowest.


Take a list of integers; square them all, then sort descending.


Take a list of integers; raise each to the power of two, then sort largest first.


Take a list of integers; I need each number multiplied by itself, then sort in descending order.


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


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


Take a list of strings; keep the first character of each (dropping empties), then strip spaces around each string.


Take a list of strings; extract initial letters, then remove leading and trailing spaces.


Take a list of strings; take each string's first letter, then remove whitespace from each item.


Take a list of strings; give me the first letter of everything, then clean whitespace from each entry.


Take a list of strings; reduce each string to its first character, then trim each string.


Take a list of strings; take first char drop blanks, then trim whitespace from each.


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


Take a list of strings; keep the first character of each (dropping empties), then trim whitespace from each.


Take a list of integers; drop the leading negative values, then find the first even number, defaulting to 0.


Take a list of integers; cut the leading negatives, then first even value zero if not found.


Take a list of integers; skip negatives at the start, then find the first even number, defaulting to 0.


Take a list of integers; remove all negatives at the front, then first even value zero if not found.


Take a list of integers; remove the initial run of negative numbers, then find the first even number, defaulting to 0.


Take a list of integers; strip the front negatives, then first even value zero if not found.


def solve(xs):
    r = list(xs)
    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; drop the leading negative values, then return the first even value (0 if none).


Take a list of integers; reverse the order, then check that there are no duplicates.


Take a list of integers; reverse, then are the values all unique.


Take a list of integers; flip the list around, then check if all values are unique.


Take a list of integers; flip the order around, then return whether all values are distinct.


Take a list of integers; put the elements backwards, then tell me if values are distinct.


Take a list of integers; reverse that for me, then are all values distinct.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    return len(r) == len(set(r))


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


Take a list of strings; drop strings shorter than three characters, then convert each to upper case.


Take a list of strings; eliminate strings below length three, then change all strings to uppercase.


Take a list of strings; remove short strings (under 3 chars), then make every string uppercase.


Take a list of strings; only keep strings with three or more characters, then uppercase each one.


Take a list of strings; keep only strings that are at least three characters long, then make all the strings uppercase.


Take a list of strings; filter strings shorter than 3 chars, then convert all strings to uppercase letters.


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


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


Take a list of integers; keep the odd numbers, then find the first even number, defaulting to 0.


Take a list of integers; odd numbers only, then first even value zero if not found.


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


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


Take a list of integers; drop the first element, then take the first 3 elements.


Take a list of integers; Take everything except the first, then remove everything after the third.


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


Take a list of integers; Take everything except the first, then show the first three.


Take a list of integers; drop the first element, then take the first three.


Take a list of integers; Take everything except the first, then keep first 3.


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


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


Take a list of strings; keep the first character of each (dropping empties), then sum the lengths of all strings.


Take a list of strings; extract initial letters, then sum up all the characters across everything and tell me what you get.


Take a list of strings; take each string's first letter, then count characters across all strings.


Take a list of strings; give me the first letter of everything, then character count.


Take a list of strings; reduce each string to its first character, then count all the characters.


Take a list of strings; take first char drop blanks, then total number of characters.


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


Take a list of strings; keep the first character of each (dropping empties), then return the total number of characters.


Take a list of integers; keep everything before the first zero, then find the first even number, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then first even value zero if not found.


Take a list of integers; cut the list at the first zero, then find the first even number, defaulting to 0.


Take a list of integers; cut off after the first zero appears, then first even value zero if not found.


Take a list of integers; take values up to (excluding) the first zero, then find the first even number, defaulting to 0.


Take a list of integers; keep the part before the first 0, then first even value zero if not found.


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


Take a list of integers; keep everything before the first zero, then return the first even value (0 if none).


Take a list of integers; keep multiples of three, then count the even numbers.


Take a list of integers; get rid of non-multiples of three, then what's the even count.


Take a list of integers; keep values divisible by 3, then give the number of evens.


Take a list of integers; keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; drop anything not divisible by three, then how many are even.


Take a list of integers; filter out everything except multiples of three, then get the total number of even values in the list.


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


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


Take a list of integers; keep multiples of three, then skip negatives at the start.


Take a list of integers; get rid of non-multiples of three, then remove all negatives at the front.


Take a list of integers; keep values divisible by 3, then remove the initial run of negative numbers.


Take a list of integers; keep items where x mod 3 equals zero, then strip the front negatives.


Take a list of integers; drop anything not divisible by three, then remove leading negative numbers.


Take a list of integers; filter out everything except multiples of three, then drop negatives from start.


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


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


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


Take a list of strings; change to lowercase, then max length of all strings.


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


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


Take a list of strings; lowercase each string, then how long is the longest string.


Take a list of strings; change to lowercase, then find the longest string length.


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


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


Take a list of strings; prefix each with a hash, then order the strings A to Z.


Take a list of strings; add # to the start of each string, then make it alphabetical.


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


Take a list of strings; prefix each with a hash, then sort alphabetically.


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


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


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


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


Take a list of integers; truncate to three items, then stop at first non positive.


Take a list of integers; show the first three, then take while greater than zero.


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


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


Take a list of integers; keep the even numbers, then check if zero appears.


Take a list of integers; keep evens, then find out whether there's a zero in here.


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


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


Take a list of integers; sort descending, then check if zero appears.


Take a list of integers; sort largest first, then find out whether there's a zero in here.


Take a list of integers; sort in descending order, then check if zero appears.


Take a list of integers; sort from greatest to least, then find out whether there's a zero in here.


Take a list of integers; sort z to a, then check if zero appears.


Take a list of integers; arrange in decreasing order, then find out whether there's a zero in here.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    return 0 in r


Take a list of integers; sort descending, then return whether the list contains a zero.


Take a list of integers; drop duplicates keeping first occurrence, then take the final 3 elements.


Take a list of integers; drop duplicates but keep the first one, then drop everything except the final three.


Take a list of integers; drop duplicates keeping first occurrence, then give me the last three elements.


Take a list of integers; drop duplicates but keep the first one, then keep only the last three.


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


Take a list of integers; drop duplicates but keep the first one, then take the last three.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = r[-3:]
    return r


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


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


Take a list of people records (name, age); show me all ages, then plus one for all.


Take a list of people records (name, age); pluck the age field from each record, then increment each value.


Take a list of people records (name, age); get the age field, then plus one for all.


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


Take a list of people records (name, age); extract age values, then plus one for all.


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


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


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


Take a list of integers; convert to absolute value, then pad to 3.


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


Take a list of integers; take abs of each, then pad to 3.


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


Take a list of integers; apply absolute value to the whole list, then pad to 3.


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


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


Take a list of integers; sort descending, then multiply them all together.


Take a list of integers; sort largest first, then multiply them all.


Take a list of integers; sort in descending order, then multiply all the numbers together.


Take a list of integers; sort from greatest to least, then get the product.


Take a list of integers; sort z to a, then find the product of these.


Take a list of integers; arrange in decreasing order, then return their product.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    return __import__('math').prod(r)


Take a list of integers; sort descending, then return their product.


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


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


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


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


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


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


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros.


Take a list of integers; Sort it from low to high, then pad to 3.


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


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


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the negative numbers, then check if there is an even number.


Take a list of integers; extract negatives, then find out whether any value is divisible by 2.


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


Take a list of integers; keep the negative numbers, then return whether any value is even.


Take a list of people records (name, age); extract the ages, then remove both ends.


Take a list of people records (name, age); show me all ages, then trim the edges.


Take a list of people records (name, age); pluck the age field from each record, then trim one element off each end.


Take a list of people records (name, age); get the age field, then cut off the first and last.


Take a list of people records (name, age); keep just each person's age, then remove the first and last elements.


Take a list of people records (name, age); extract age values, then keep only the middle part.


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


Take a list of people records (name, age); extract the ages, then drop the first and last elements.


Take a list of people records (name, age); extract the ages, then give the largest value (0 if none).


Take a list of people records (name, age); show me all ages, then The biggest one, or 0 if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then Get the maximum value, or zero if there's nothing.


Take a list of people records (name, age); get the age field, then What's the max here.


Take a list of people records (name, age); keep just each person's age, then Return the max or 0 if empty.


Take a list of people records (name, age); extract age values, then return the maximum (0 if empty).


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


Take a list of people records (name, age); extract the ages, then return the maximum (0 if empty).


Take a list of integers; keep only the first three, then remove repeated values, then drop anything not divisible by three.


Take a list of integers; keep the first 3 items, then unique values preserving order, then filter out everything except multiples of three.


Take a list of integers; take the first 3 elements, then remove repeated values, then keep only multiples of three.


Take a list of integers; remove everything after the third, then unique values preserving order, then multiples of three only.


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


Take a list of integers; show the first three, then unique values preserving order, then give me only the values divisible by three.


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


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


Take a list of integers; drop the zeros, then take the first 3 elements, then remove the initial run of negative numbers.


Take a list of integers; keep only nonzero elements, then remove everything after the third, then strip the front negatives.


Take a list of integers; drop the zeros, then truncate to three items, then remove leading negative numbers.


Take a list of integers; keep only nonzero elements, then show the first three, then drop negatives from start.


Take a list of integers; drop the zeros, then take the first three, then strip negative values from the start.


Take a list of integers; keep only nonzero elements, then keep first 3, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; odd numbers only, then don't let anything exceed 10, then Organize these ascending.


Take a list of integers; keep the odd numbers, then clamp each to at most ten, then Sort in ascending order.


Take a list of integers; odd numbers only, then don't let anything exceed 10, then I need this sorted ascending.


Take a list of integers; keep the odd numbers, then clamp each to at most ten, then Put these in ascending order.


Take a list of integers; odd numbers only, then don't let anything exceed 10, then sort smallest to largest.


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


Take a list of integers; keep the odd numbers, then cap each value at 10, then sort ascending.


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


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


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


Take a list of integers; flip the order around, then pad to 3, then take the final 3 elements.


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


Take a list of integers; reverse that for me, then pad to 3, then give me the last three elements.


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


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


Take a list of integers; reverse the order, then cut the list at the first zero, then deduplicate the list.


Take a list of integers; reverse, then cut off after the first zero appears, then remove repeats.


Take a list of integers; flip the list around, then take values up to (excluding) the first zero, then deduplicate the list.


Take a list of integers; flip the order around, then keep the part before the first 0, then remove repeats.


Take a list of integers; put the elements backwards, then truncate at the first zero, then deduplicate the list.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then remove repeats.


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


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


Take a list of integers; drop the first element, then increase every value by 10, then give back the product of all values.


Take a list of integers; Take everything except the first, then add 10 to each item, then product of the list.


Take a list of integers; drop the first element, then shift each up by ten, then what's the product.


Take a list of integers; Take everything except the first, then increase all numbers by 10, then what do they multiply to.


Take a list of integers; drop the first element, then add 10 to everything, then give me their product.


Take a list of integers; Take everything except the first, then give everything a boost of 10, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = r[1:]
    r = [x + 10 for x in r]
    return __import__('math').prod(r)


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


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; keep the part before the first 0, then keep values greater than five, then if no items, add a zero.


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


Take a list of integers; keep everything before the first zero, then keep values greater than five, then if empty, use a single zero.


Take a list of integers; sort descending, then remove both ends, then give back the total.


Take a list of integers; sort largest first, then trim the edges, then sum r.


Take a list of integers; sort in descending order, then trim one element off each end, then add them up.


Take a list of integers; sort from greatest to least, then cut off the first and last, then calculate the sum of all elements.


Take a list of integers; sort z to a, then remove the first and last elements, then what's the total.


Take a list of integers; arrange in decreasing order, then keep only the middle part, then what do they add up to.


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


Take a list of integers; sort descending, then drop the first and last elements, then return their sum.


Take a list of integers; sort by absolute value, then keep values above zero, then find the max, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then filter for positive numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange by magnitude ignoring sign, then keep only positive numbers, then What's the highest number in the list.


Take a list of integers; put them in order by magnitude, then keep the positives, then Return the greatest value or default to 0.


Take a list of integers; arrange in order of absolute value, then remove negatives, then Find the largest element, defaulting to zero.


Take a list of integers; sort by distance from zero, then keep the positive numbers, then give the largest value (0 if none).


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


Take a list of integers; sort by absolute value, then keep the positive numbers, then return the maximum (0 if empty).


Take a list of integers; if empty, use a single zero, then remove both ends, then make each twice as big.


Take a list of integers; if blank use 0, then trim the edges, then multiply each by 2.


Take a list of integers; default to [0] when there is nothing, then trim one element off each end, then make each twice as big.


Take a list of integers; when the list is empty, substitute a zero value, then cut off the first and last, then multiply each by 2.


Take a list of integers; replace an empty list with one zero, then remove the first and last elements, then make each twice as big.


Take a list of integers; zero it out if it's empty, then keep only the middle part, then multiply each by 2.


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


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


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


Take a list of integers; each value squared, then cut off after the first zero appears, then negate.


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


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


Take a list of integers; raise each to the power of two, then truncate at the first zero, then multiply each by -1.


Take a list of integers; I need each number multiplied by itself, then delete everything starting with the first zero, then negate.


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


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


Take a list of integers; drop the zeros, then multiply each by two, then replace an empty list with one zero.


Take a list of integers; keep only nonzero elements, then double each item in the list, then zero it out if it's empty.


Take a list of integers; drop the zeros, then multiply each by two, then use zero if the list is empty.


Take a list of integers; keep only nonzero elements, then double each item in the list, then default to zero when empty.


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


Take a list of integers; keep only nonzero elements, then double each item in the list, then if no items, add a zero.


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


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


Take a list of integers; drop the first and last elements, then take the final 3 elements, then count the elements.


Take a list of integers; take out the first and last items, then drop everything except the final three, then how many items remain.


Take a list of integers; remove both ends, then give me the last three elements, then tell me the length.


Take a list of integers; trim the edges, then keep only the last three, then return the length.


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


Take a list of integers; cut off the first and last, then take the last three, then what's the count.


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


Take a list of integers; drop the first and last elements, then keep only the last three, then return how many remain.


Take a list of integers; drop the zeros, then order by distance from zero, then raise each to the power of two.


Take a list of integers; keep only nonzero elements, then sort based on absolute value, then I need each number multiplied by itself.


Take a list of integers; drop the zeros, then organize by magnitude, then square all of them.


Take a list of integers; keep only nonzero elements, then arrange by absolute value ascending, then multiply each element by itself.


Take a list of integers; drop the zeros, then sort from smallest to largest absolute value, then make each one squared.


Take a list of integers; keep only nonzero elements, then sort by absolute value, then square each value in the list.


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


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


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


Take a list of integers; clip values at 10, then get the negative numbers, then exclude values of 5 and below.


Take a list of integers; cap each value at 10, then keep values below zero, then remove anything 5 or less.


Take a list of integers; clip values at 10, then get the negative numbers, then filter to keep only values above 5.


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


Take a list of integers; clip values at 10, then get the negative numbers, then drop anything 5 or below.


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


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


Take a list of integers; sort by absolute value, then keep values above zero, then count the elements.


Take a list of integers; rearrange by distance from zero, then filter for positive numbers, then how many items remain.


Take a list of integers; arrange by magnitude ignoring sign, then keep only positive numbers, then tell me the length.


Take a list of integers; put them in order by magnitude, then keep the positives, then return the length.


Take a list of integers; arrange in order of absolute value, then remove negatives, then count them.


Take a list of integers; sort by distance from zero, then keep the positive numbers, then what's the count.


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


Take a list of integers; sort by absolute value, then keep the positive numbers, then return how many remain.


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


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


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


Take a list of integers; flip the order around, then keep the positives, then sort largest to smallest.


Take a list of integers; put the elements backwards, then remove negatives, then sort by descending values.


Take a list of integers; reverse that for me, then keep the positive numbers, then sort from highest to lowest.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then arrange in decreasing order.


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then arrange in descending order.


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then reverse sort.


Take a list of integers; drop duplicates but keep the first one, then filter out everything except multiples of three, then sort largest to smallest.


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then sort by descending values.


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


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


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


Take a list of integers; reverse the order, then cut the list at the first zero, then give the number of evens.


Take a list of integers; reverse, then cut off after the first zero appears, then find how many values are divisible by two.


Take a list of integers; flip the list around, then take values up to (excluding) the first zero, then how many are even.


Take a list of integers; flip the order around, then keep the part before the first 0, then get the total number of even values in the list.


Take a list of integers; put the elements backwards, then truncate at the first zero, then give me the count of even values.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then I need to know how many of these are even.


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


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


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


Take a list of integers; clip values at 10, then Remove head, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then remove the first item, then square all of them.


Take a list of integers; clip values at 10, then Remove head, then multiply each element by itself.