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


Take a list of integers; take values while they are positive, then clamp each to at most ten, then keep only non-zero numbers.


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


Take a list of integers; keep going while positive, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; stop at first non positive, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; take while greater than zero, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; take values while positive, then don't let anything exceed 10, then strip the zeros.


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


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


Take a list of integers; drop the leading negative values, then multiply each by two, then trim one element off each end.


Take a list of integers; cut the leading negatives, then double each item in the list, then cut off the first and last.


Take a list of integers; skip negatives at the start, then multiply each by two, then remove the first and last elements.


Take a list of integers; remove all negatives at the front, then double each item in the list, then keep only the middle part.


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


Take a list of integers; strip the front negatives, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; cap each value at 10, then sort largest to smallest, then truncate to the last three items.


Take a list of integers; clip values at 10, then sort by descending values, then show only the last three.


Take a list of integers; cap each value at 10, then sort from highest to lowest, then remove all but the last three.


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


Take a list of integers; cap each value at 10, then sort largest first, then drop everything except the final three.


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


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


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


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


Take a list of integers; take positive values then stop, then remove everything after the third, then minimum value, zero otherwise.


Take a list of integers; keep going while positive, then truncate to three items, then get the minimum value or zero if empty.


Take a list of integers; stop at first non positive, then show the first three, then give me the min or 0.


Take a list of integers; take while greater than zero, then take the first three, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then keep first 3, then return smallest or zero if empty.


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 min(r) if r else 0


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


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


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


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


Take a list of people records (name, age); get the age field, then extract all even numbers, then Discard the first element.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then skip the first one.


Take a list of people records (name, age); extract age values, then extract all even numbers, then Discard the first element.


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


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


Take a list of integers; keep values greater than five, then remove the first item, then drop non-positive values.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then drop the negative numbers.


Take a list of integers; keep only numbers above 5, then remove the first item, then filter out the negative ones.


Take a list of integers; exclude values of 5 and below, then Remove head, then remove all negative values.


Take a list of integers; remove anything 5 or less, then remove the first item, then keep positive values only.


Take a list of integers; filter to keep only values above 5, then Remove head, then keep values above zero.


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


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


Take a list of integers; add one to each, then keep values below zero, then keep only non-zero numbers.


Take a list of integers; make each one bigger, then get the negative numbers, then strip the zeros.


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


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


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


Take a list of integers; odd numbers only, then don't let anything exceed 10, then strip the front negatives.


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


Take a list of integers; odd numbers only, then don't let anything exceed 10, then drop negatives from start.


Take a list of integers; keep the odd numbers, then clamp each to at most ten, then strip negative values from the start.


Take a list of integers; odd numbers only, then don't let anything exceed 10, then remove negatives before the first non-negative.


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 = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    return r


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


Take a list of strings; sort by length, shortest first, then convert each to lower case, then deduplicate the strings.


Take a list of strings; sort ascending by length, then lowercase each one, then filter out duplicate strings retain first.


Take a list of strings; order strings from shortest to longest, then convert each to lower case, then strip duplicates preserve order.


Take a list of strings; shortest to longest, then lowercase each one, then remove repeated strings.


Take a list of strings; arrange by string length ascending, then convert each to lower case, then keep unique strings first appearance.


Take a list of strings; length sort, then lowercase each one, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; sort by length, shortest first, then lowercase each string, then drop duplicate strings keeping the first.


Take a list of integers; keep only the last three, then increase every value by 10, then find the max, defaulting to 0.


Take a list of integers; keep the final three items, then add 10 to each item, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the last three, then shift each up by ten, then What's the highest number in the list.


Take a list of integers; trim to the last three, then increase all numbers by 10, then Return the greatest value or default to 0.


Take a list of integers; last three only, then add 10 to everything, then Find the largest element, defaulting to zero.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then give the largest value (0 if none).


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


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


Take a list of people records (name, age); extract the names, then keep only non-empty strings, then remove surrounding whitespace.


Take a list of people records (name, age); Give me the names, then filter empty strings, then trim the whitespace off everything.


Take a list of people records (name, age); pluck the name field from each record, then remove empty strings from the list, then strip spaces from all strings.


Take a list of people records (name, age); Grab the names, then clean up empty strings, then strip all the strings.


Take a list of people records (name, age); keep just each person's name, then delete empty entries, then clean up whitespace in the list.


Take a list of people records (name, age); List the names, then drop empty strings, then strip spaces around each string.


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


Take a list of people records (name, age); extract the names, then drop empty strings, then trim whitespace from each.


Take a list of integers; take the absolute value of each, then sort smallest to largest, then give the earliest even value or zero.


Take a list of integers; convert to absolute value, then Ascending sort, then fetch the first even element, default to 0.


Take a list of integers; strip the signs, then Sort this ascending, then give the earliest even value or zero.


Take a list of integers; take abs of each, then Sort lowest to highest, then fetch the first even element, default to 0.


Take a list of integers; get the absolute value of everything, then Arrange from smallest to largest, then give the earliest even value or zero.


Take a list of integers; apply absolute value to the whole list, then sort ascending, then fetch the first even element, default to 0.


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


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


Take a list of integers; add one to each, then flip the list around, then replace an empty list with one zero.


Take a list of integers; make each one bigger, then flip the order around, then zero it out if it's empty.


Take a list of integers; add one to each, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; make each one bigger, then reverse that for me, then default to zero when empty.


Take a list of integers; add one to each, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; make each one bigger, then make it backwards, then if no items, add a zero.


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


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then true if at least one even value.


Take a list of people records (name, age); show me all ages, then don't let anything exceed 10, then any even.


Take a list of people records (name, age); pluck the age field from each record, then clamp each to at most ten, then true if at least one even value.


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then any even.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then true if at least one even value.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then any even.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [min(x, 10) for x in r]
    return any(x % 2 == 0 for x in r)


Take a list of people records (name, age); extract the ages, then cap each value at 10, then return whether any value is even.


Take a list of integers; sort by absolute value, then decrement each value, then trim one element off each end.


Take a list of integers; rearrange by distance from zero, then Lower each number by one, then cut off the first and last.


Take a list of integers; arrange by magnitude ignoring sign, then reduce each by one, then remove the first and last elements.


Take a list of integers; put them in order by magnitude, then Subtract 1 from all, then keep only the middle part.


Take a list of integers; arrange in order of absolute value, then Subtract one from each, then drop first and last.


Take a list of integers; sort by distance from zero, then Drop each by one, then eliminate the outermost elements.


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


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


Take a list of integers; keep the even numbers, then remove all zero values, then true if already sorted smallest to largest.


Take a list of integers; keep evens, then exclude zeros, then does this list go in ascending order.


Take a list of integers; keep the even numbers, then remove all zero values, then check if the list is in ascending order.


Take a list of integers; keep evens, then exclude zeros, then is the list sorted.


Take a list of integers; keep the even numbers, then remove all zero values, then is it sorted.


Take a list of integers; keep evens, then exclude zeros, then check if values are in increasing order.


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


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


Take a list of integers; cap each value at 10, then sort largest to smallest, then stop at the first non-positive value.


Take a list of integers; clip values at 10, then sort by descending values, then keep the leading run of positive numbers.


Take a list of integers; cap each value at 10, then sort from highest to lowest, then take values while they are positive.


Take a list of integers; clip values at 10, then sort descending, then take positive values then stop.


Take a list of integers; cap each value at 10, then sort largest first, then keep going while positive.


Take a list of integers; clip values at 10, then sort in descending order, then stop at first non positive.


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


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


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


Take a list of integers; make each one bigger, then don't let anything exceed 10, then increase all numbers by 10.


Take a list of integers; add one to each, then clamp each to at most ten, then add 10 to everything.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then give everything a boost of 10.


Take a list of integers; add one to each, then clamp each to at most ten, then increment each by ten.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then add a constant 10 to each.


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


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


Take a list of integers; add ten to each, then keep only odd values, then multiply each by -1.


Take a list of integers; bump everything up by 10, then eliminate the even numbers, then negate.


Take a list of integers; increase every value by 10, then keep only odd values, then multiply each by -1.


Take a list of integers; add 10 to each item, then eliminate the even numbers, then negate.


Take a list of integers; shift each up by ten, then keep only odd values, then multiply each by -1.


Take a list of integers; increase all numbers by 10, then eliminate the even numbers, then negate.


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


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


Take a list of integers; keep multiples of three, then keep only even values, then true only if all are positive.


Take a list of integers; get rid of non-multiples of three, then extract all even numbers, then do all of these have positive values.


Take a list of integers; keep values divisible by 3, then keep only even values, then check if every value is positive.


Take a list of integers; keep items where x mod 3 equals zero, then extract all even numbers, then confirm all values are positive.


Take a list of integers; drop anything not divisible by three, then keep only even values, then all positive.


Take a list of integers; filter out everything except multiples of three, then extract all even numbers, then check if every number is above zero.


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


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


Take a list of integers; add one to each, then keep only even values, then keep only numbers above 5.


Take a list of integers; make each one bigger, then extract all even numbers, then exclude values of 5 and below.


Take a list of integers; add one to each, then keep only even values, then remove anything 5 or less.


Take a list of integers; make each one bigger, then extract all even numbers, then filter to keep only values above 5.


Take a list of integers; add one to each, then keep only even values, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then extract all even numbers, then drop anything 5 or below.


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


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


Take a list of integers; drop the first element, then sort largest to smallest, then true if any value equals zero.


Take a list of integers; Take everything except the first, then sort by descending values, then check for zero.


Take a list of integers; drop the first element, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; Take everything except the first, then sort descending, then check for zero.


Take a list of integers; drop the first element, then sort largest first, then true if any value equals zero.


Take a list of integers; Take everything except the first, then sort in descending order, then check for zero.


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


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


Take a list of strings; sort by length, shortest first, then keep only strings of length 3 or more, then reduce each string to its first character.


Take a list of strings; sort ascending by length, then get rid of short ones, then take first char drop blanks.


Take a list of strings; order strings from shortest to longest, then remove strings with less than three characters, then keep first letters only.


Take a list of strings; shortest to longest, then remove all strings under three characters in length, then first letter from each item that isn't empty.


Take a list of strings; arrange by string length ascending, then filter out short strings under three chars, then grab the first char from each.


Take a list of strings; length sort, then drop strings shorter than three characters, then isolate the first character per entry.


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


Take a list of strings; sort by length, shortest first, then drop strings shorter than three characters, then keep the first character of each (dropping empties).


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


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


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


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


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


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


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then give back the product of all values.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then product of the list.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then what's the product.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then what do they multiply to.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five, then give me their product.


Take a list of integers; strip the front negatives, then keep values greater than five, then multiply them all together.


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 > 5]
    return __import__('math').prod(r)


Take a list of integers; drop the leading negative values, then keep values greater than five, then return their product.


Take a list of integers; keep only the first three, then keep values above zero, then arrange in decreasing order.


Take a list of integers; keep the first 3 items, then filter for positive numbers, then arrange in descending order.


Take a list of integers; take the first 3 elements, then keep only positive numbers, then reverse sort.


Take a list of integers; remove everything after the third, then keep the positives, then sort largest to smallest.


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


Take a list of integers; show the first three, then keep the positive numbers, then sort from highest to lowest.


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


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


Take a list of integers; double each, then drop anything 5 or below, then deduplicate the list.


Take a list of integers; times two for each item, then keep only numbers greater than 5, then remove repeats.


Take a list of integers; double each, then filter for numbers above 5, then deduplicate the list.


Take a list of integers; times two for each item, then give me values where x is greater than 5, then remove repeats.


Take a list of integers; double each, then show me only the values that are bigger than five, then deduplicate the list.


Take a list of integers; times two for each item, then keep values greater than five, then remove repeats.


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


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


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


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


Take a list of integers; multiply each value by itself, then remove the initial run of negative numbers, then give the earliest even value or zero.


Take a list of integers; square them all, then strip the front negatives, then fetch the first even element, default to 0.


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


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep multiples of three, then keep only odd values, then true if every value is unique.


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then check for duplicates in the values.


Take a list of integers; keep values divisible by 3, then keep only odd values, then do all values appear only once.


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then check that there are no duplicates.


Take a list of integers; drop anything not divisible by three, then keep only odd values, then are the values all unique.


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then check if all values are unique.


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then sort largest first, then give me the count of even values.


Take a list of integers; add zeros until the list has at least three values, then sort in descending order, then I need to know how many of these are even.


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = sorted(r, reverse=True)
    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 sort descending, then return how many values are even.


Take a list of integers; keep only the first three, then take the final 3 elements, then limit every value to 10.


Take a list of integers; keep the first 3 items, then drop everything except the final three, then maximum of 10 for all.


Take a list of integers; take the first 3 elements, then give me the last three elements, then limit every value to 10.


Take a list of integers; remove everything after the third, then keep only the last three, then maximum of 10 for all.


Take a list of integers; truncate to three items, then keep the final three items, then limit every value to 10.


Take a list of integers; show the first three, then take the last three, then maximum of 10 for all.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; cap each value at 10, then order by distance from zero, then trim one element off each end.


Take a list of integers; clip values at 10, then sort based on absolute value, then cut off the first and last.


Take a list of integers; cap each value at 10, then organize by magnitude, then remove the first and last elements.


Take a list of integers; clip values at 10, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; cap each value at 10, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; clip values at 10, then sort by absolute value, then eliminate the outermost elements.


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


Take a list of integers; cap each value at 10, then sort by absolute value, then drop the first and last elements.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then bump each up by one.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then increment each item.


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


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


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


Take a list of integers; convert to absolute value, then unique values preserving order, then arrange in descending order.


Take a list of integers; strip the signs, then remove repeated values, then reverse sort.


Take a list of integers; take abs of each, then unique values preserving order, then sort largest to smallest.


Take a list of integers; get the absolute value of everything, then remove repeated values, then sort by descending values.


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


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


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


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


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


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


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


Take a list of integers; add one to each, then sort largest to smallest, then reduce each by one.


Take a list of integers; make each one bigger, then sort by descending values, then Subtract 1 from all.


Take a list of integers; add one to each, then sort from highest to lowest, then Subtract one from each.


Take a list of integers; make each one bigger, then sort descending, then Drop each by one.


Take a list of integers; add one to each, then sort largest first, then Decrease all values by one.


Take a list of integers; make each one bigger, then sort in descending order, then Remove one from each value.


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


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


Take a list of integers; keep only the first three, then default to [0] when there is nothing, then count the elements.


Take a list of integers; keep the first 3 items, then when the list is empty, substitute a zero value, then how many items remain.


Take a list of integers; take the first 3 elements, then replace an empty list with one zero, then tell me the length.


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


Take a list of integers; truncate to three items, then use zero if the list is empty, then count them.


Take a list of integers; show the first three, then default to zero when empty, then what's the count.


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


Take a list of integers; keep only the first three, then if empty, use a single zero, then return how many remain.


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


Take a list of integers; sort largest first, then remove all negatives at the front, then does this list go in ascending order.


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then check if the list is in ascending order.


Take a list of integers; sort from greatest to least, then strip the front negatives, then is the list sorted.


Take a list of integers; sort z to a, then remove leading negative numbers, then is it sorted.


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


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


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


Take a list of strings; sort alphabetically, then convert each to lower case, then find the longest one, defaulting to empty.


Take a list of strings; arrange alphabetically, then lowercase each one, then Longest string, or nothing if there isn't one.


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


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


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


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


Take a list of integers; cap each value at 10, then give me the last three elements, then What's the highest number in the list.


Take a list of integers; clip values at 10, then keep only the last three, then Return the greatest value or default to 0.


Take a list of integers; cap each value at 10, then keep the final three items, then Find the largest element, defaulting to zero.


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


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


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


Take a list of integers; keep the even numbers, then flip the sign of each, then stop at the first non-positive value.


Take a list of integers; keep evens, then turn positives to negatives and vice versa, then keep the leading run of positive numbers.


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


Take a list of integers; keep evens, then turn positives to negatives and vice versa, then take positive values then stop.


Take a list of integers; keep the even numbers, then flip the sign of each, then keep going while positive.


Take a list of integers; keep evens, then turn positives to negatives and vice versa, then stop at first non positive.


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


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


Take a list of integers; keep everything before the first zero, then remove repeated values, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then unique values preserving order, then minimum value, zero otherwise.


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


Take a list of integers; cut off after the first zero appears, then unique values preserving order, then give me the min or 0.


Take a list of integers; take values up to (excluding) the first zero, then remove repeated values, then return the smallest number, defaulting to 0.


Take a list of integers; keep the part before the first 0, then unique values preserving order, then return smallest or zero if empty.


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


Take a list of integers; keep everything before the first zero, then drop duplicates keeping first occurrence, then return the minimum (0 if empty).


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


Take a list of integers; Take everything except the first, then plus one for all, then strip out the evens.


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


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


Take a list of integers; drop the zeros, then make every value non-negative, then arrange in increasing order.


Take a list of integers; keep only nonzero elements, then absolute value for all items, then Organize these ascending.


Take a list of integers; drop the zeros, then take absolute values, then Sort in ascending order.


Take a list of integers; keep only nonzero elements, then turn negatives into positives, then I need this sorted ascending.


Take a list of integers; drop the zeros, then abs each element, then Put these in ascending order.


Take a list of integers; keep only nonzero elements, then take the absolute value of each, then sort smallest to largest.


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


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


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


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then arrange in descending order.


Take a list of integers; keep values divisible by 3, then keep only odd values, then reverse sort.


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then sort largest to smallest.


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


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then sort from highest to lowest.


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


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


Take a list of integers; sort by absolute value, then sort smallest to largest, then remove the initial run of negative numbers.


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


Take a list of integers; arrange by magnitude ignoring sign, then Sort this ascending, then remove leading negative numbers.


Take a list of integers; put them in order by magnitude, then Sort lowest to highest, then drop negatives from start.


Take a list of integers; arrange in order of absolute value, then Arrange from smallest to largest, then strip negative values from the start.


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


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


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


Take a list of integers; pad with zeros to at least three elements, then sort largest to smallest, then raise each to the power of two.


Take a list of integers; add zeros until the list has at least three values, then sort by descending values, then I need each number multiplied by itself.


Take a list of integers; pad with zeros to at least three elements, then sort from highest to lowest, then square all of them.


Take a list of integers; add zeros until the list has at least three values, then sort descending, then multiply each element by itself.


Take a list of integers; pad with zeros to at least three elements, then sort largest first, then make each one squared.


Take a list of integers; add zeros until the list has at least three values, then sort in descending order, then square each value in the list.


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


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then bump each up by one.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then increment each item.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then bump each up by one.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then increment each item.


Take a list of integers; filter out the negative ones, then truncate at the first zero, then bump each up by one.


Take a list of integers; remove all negative values, then delete everything starting with the first zero, then increment each item.


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


Take a list of integers; keep the positive numbers, then keep everything before the first zero, then add one to each.


Take a list of integers; sort descending, then multiply each by two, then keep only non-zero numbers.


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


Take a list of integers; sort in descending order, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; sort from greatest to least, then double each item in the list, then strip the zeros.


Take a list of integers; sort z to a, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; arrange in decreasing order, then double each item in the list, then strip the zeros.


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


Take a list of integers; sort descending, then double each, then drop the zeros.


Take a list of integers; keep values greater than five, then increment each value, then reduce each by one.


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


Take a list of integers; keep only numbers above 5, then increment each value, then Subtract one from each.


Take a list of integers; exclude values of 5 and below, then plus one for all, then Drop each by one.


Take a list of integers; remove anything 5 or less, then increment each value, then Decrease all values by one.


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


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


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


Take a list of integers; take the absolute value of each, then increase every value by 10, then true if at least one even value.


Take a list of integers; convert to absolute value, then add 10 to each item, then any even.


Take a list of integers; strip the signs, then shift each up by ten, then true if at least one even value.


Take a list of integers; take abs of each, then increase all numbers by 10, then any even.


Take a list of integers; get the absolute value of everything, then add 10 to everything, then true if at least one even value.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then any even.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = [x + 10 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 add ten to each, then return whether any value is even.


Take a list of integers; keep only the first three, then take the final 3 elements, then arrange in decreasing order.


Take a list of integers; keep the first 3 items, then drop everything except the final three, then arrange in descending order.


Take a list of integers; take the first 3 elements, then give me the last three elements, then reverse sort.


Take a list of integers; remove everything after the third, then keep only the last three, then sort largest to smallest.


Take a list of integers; truncate to three items, then keep the final three items, then sort by descending values.


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


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


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


Take a list of integers; cap each value at 10, then sort smallest to largest, then truncate to three items.


Take a list of integers; clip values at 10, then Ascending sort, then show the first three.


Take a list of integers; cap each value at 10, then Sort this ascending, then take the first three.


Take a list of integers; clip values at 10, then Sort lowest to highest, then keep first 3.


Take a list of integers; cap each value at 10, then Arrange from smallest to largest, then truncate to first three.


Take a list of integers; clip values at 10, then sort ascending, then first three.


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


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


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


Take a list of integers; take only what comes before the initial zero, then trim the edges, then keep the leading run of positive numbers.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then keep the final three items, then make each twice as big.


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


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


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


Take a list of integers; take values while they are positive, then increment each value, then raise each to the power of two.


Take a list of integers; take positive values then stop, then plus one for all, then I need each number multiplied by itself.


Take a list of integers; keep going while positive, then increment each value, then square all of them.


Take a list of integers; stop at first non positive, then plus one for all, then multiply each element by itself.


Take a list of integers; take while greater than zero, then increment each value, then make each one squared.


Take a list of integers; take values while positive, then plus one for all, then square each value in the list.


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


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


Take a list of people records (name, age); extract the ages, then remove both ends, then deduplicate the list.


Take a list of people records (name, age); show me all ages, then trim the edges, then remove repeats.


Take a list of people records (name, age); pluck the age field from each record, then trim one element off each end, then deduplicate the list.


Take a list of people records (name, age); get the age field, then cut off the first and last, then remove repeats.


Take a list of people records (name, age); keep just each person's age, then remove the first and last elements, then deduplicate the list.


Take a list of people records (name, age); extract age values, then keep only the middle part, then remove repeats.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r[1:-1]
    r = list(dict.fromkeys(r))
    return r


Take a list of people records (name, age); extract the ages, then drop the first and last elements, then drop duplicates keeping first occurrence.


Take a list of integers; keep the odd numbers, then sort smallest to largest, then give back the product of all values.


Take a list of integers; odd numbers only, then Ascending sort, then product of the list.


Take a list of integers; keep the odd numbers, then Sort this ascending, then what's the product.


Take a list of integers; odd numbers only, then Sort lowest to highest, then what do they multiply to.


Take a list of integers; keep the odd numbers, then Arrange from smallest to largest, then give me their product.


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


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


Take a list of integers; keep the odd numbers, then sort ascending, then return their product.


Take a list of integers; sort by absolute value, then make every value non-negative, then true if at least one even value.


Take a list of integers; rearrange by distance from zero, then absolute value for all items, then any even.


Take a list of integers; arrange by magnitude ignoring sign, then take absolute values, then true if at least one even value.


Take a list of integers; put them in order by magnitude, then turn negatives into positives, then any even.


Take a list of integers; arrange in order of absolute value, then abs each element, then true if at least one even value.


Take a list of integers; sort by distance from zero, then take the absolute value of each, then any even.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; take out the first and last items, then remove all negatives at the front, then multiply each by 2.


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


Take a list of integers; trim the edges, then strip the front negatives, then multiply each by 2.


Take a list of integers; trim one element off each end, then remove leading negative numbers, then make each twice as big.


Take a list of integers; cut off the first and last, then drop negatives from start, then multiply each by 2.


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


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


Take a list of integers; take the absolute value of each, then cut the list at the first zero, then give the earliest even value or zero.


Take a list of integers; convert to absolute value, then cut off after the first zero appears, then fetch the first even element, default to 0.


Take a list of integers; strip the signs, then take values up to (excluding) the first zero, then give the earliest even value or zero.


Take a list of integers; take abs of each, then keep the part before the first 0, then fetch the first even element, default to 0.


Take a list of integers; get the absolute value of everything, then truncate at the first zero, then give the earliest even value or zero.


Take a list of integers; apply absolute value to the whole list, then delete everything starting with the first zero, then fetch the first even element, default to 0.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    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; take the absolute value of each, then keep everything before the first zero, then return the first even value (0 if none).


Take a list of integers; keep everything before the first zero, then make every value non-negative, then find the max, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then absolute value for all items, then Give me the maximum, but 0 if there are no items.


Take a list of integers; cut the list at the first zero, then take absolute values, then What's the highest number in the list.


Take a list of integers; cut off after the first zero appears, then turn negatives into positives, then Return the greatest value or default to 0.


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


Take a list of integers; keep the part before the first 0, then take the absolute value of each, then give the largest value (0 if none).


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


Take a list of integers; keep everything before the first zero, then take the absolute value of each, then return the maximum (0 if empty).


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


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


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


Take a list of integers; odd numbers only, then turn negatives into positives, then calculate the sum of all elements.


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


Take a list of integers; odd numbers only, then take the absolute value of each, then what do they add up to.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then take the first 3 elements, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then remove everything after the third, then negate.


Take a list of integers; drop duplicates keeping first occurrence, then truncate to three items, then multiply each by -1.


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


Take a list of integers; drop duplicates keeping first occurrence, then take the first three, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then keep first 3, then negate.


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


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


Take a list of integers; keep multiples of three, then flip the sign of each, then find the min, defaulting to 0.


Take a list of integers; get rid of non-multiples of three, then turn positives to negatives and vice versa, then minimum value, zero otherwise.


Take a list of integers; keep values divisible by 3, then flip the sign of each, then get the minimum value or zero if empty.


Take a list of integers; keep items where x mod 3 equals zero, then turn positives to negatives and vice versa, then give me the min or 0.


Take a list of integers; drop anything not divisible by three, then flip the sign of each, then return the smallest number, defaulting to 0.


Take a list of integers; filter out everything except multiples of three, then turn positives to negatives and vice versa, then return smallest or zero if empty.


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


Take a list of integers; keep multiples of three, then negate each, then return the minimum (0 if empty).


Take a list of integers; keep the odd numbers, then take the final 3 elements, then arrange by magnitude ignoring sign.


Take a list of integers; odd numbers only, then drop everything except the final three, then put them in order by magnitude.


Take a list of integers; keep the odd numbers, then give me the last three elements, then arrange in order of absolute value.


Take a list of integers; odd numbers only, then keep only the last three, then sort by distance from zero.


Take a list of integers; keep the odd numbers, then keep the final three items, then order by how far from zero.


Take a list of integers; odd numbers only, then take the last three, then order by distance from zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values below zero, then keep only numbers above 5.


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


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


Take a list of integers; drop duplicates but keep the first one, then get the negative numbers, then filter to keep only values above 5.


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


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


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(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; drop duplicates keeping first occurrence, then keep the negative numbers, then keep values greater than five.


Take a list of integers; keep only the last three, then keep values below zero, then reduce each by one.


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


Take a list of integers; take the last three, then keep values below zero, then Subtract one from each.


Take a list of integers; trim to the last three, then get the negative numbers, then Drop each by one.


Take a list of integers; last three only, then keep values below zero, then Decrease all values by one.


Take a list of integers; truncate to the last three items, then get the negative numbers, then Remove one from each value.


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


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


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then strip the signs.


Take a list of integers; keep only nonzero elements, then pad to 3, then take abs of each.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then pad to 3, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then make them all positive.


Take a list of integers; keep only nonzero elements, then pad to 3, then make every value non-negative.


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


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


Take a list of integers; add one to each, then keep only even values, then arrange in decreasing order.


Take a list of integers; make each one bigger, then extract all even numbers, then arrange in descending order.


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


Take a list of integers; make each one bigger, then extract all even numbers, then sort largest to smallest.


Take a list of integers; add one to each, then keep only even values, then sort by descending values.


Take a list of integers; make each one bigger, then extract all even numbers, then sort from highest to lowest.


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


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


Take a list of people records (name, age); extract the ages, then remove the first item, then true only if all are positive.


Take a list of people records (name, age); show me all ages, then Remove head, then do all of these have positive values.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item, then check if every value is positive.


Take a list of people records (name, age); get the age field, then Remove head, then confirm all values are positive.


Take a list of people records (name, age); keep just each person's age, then remove the first item, then all positive.


Take a list of people records (name, age); extract age values, then Remove head, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r[1:]
    return all(x > 0 for x in r)


Take a list of people records (name, age); extract the ages, then drop the first element, then return whether all values are positive.


Take a list of integers; keep multiples of three, then keep values above zero, then skip the first one.


Take a list of integers; get rid of non-multiples of three, then filter for positive numbers, then Discard the first element.


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


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


Take a list of integers; drop anything not divisible by three, then remove negatives, then skip the first one.


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


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


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


Take a list of integers; keep the negative numbers, then remove all zero values, then true if any value equals zero.


Take a list of integers; extract negatives, then exclude zeros, then check for zero.


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


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


Take a list of integers; sort ascending, then make every value non-negative, then true if every value is unique.


Take a list of integers; Sort it from low to high, then absolute value for all items, then check for duplicates in the values.


Take a list of integers; arrange in increasing order, then take absolute values, then do all values appear only once.


Take a list of integers; Organize these ascending, then turn negatives into positives, then check that there are no duplicates.


Take a list of integers; Sort in ascending order, then abs each element, then are the values all unique.


Take a list of integers; I need this sorted ascending, then take the absolute value of each, then check if all values are unique.


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


Take a list of integers; sort ascending, then take the absolute value of each, then return whether all values are distinct.


Take a list of strings; keep the first character of each (dropping empties), then add '#' to the start of each string, then remove short strings (under 3 chars).


Take a list of strings; extract initial letters, then make each one start with a hash, then only keep strings with three or more characters.


Take a list of strings; take each string's first letter, then add '#' to the start of each string, then keep only strings that are at least three characters long.


Take a list of strings; give me the first letter of everything, then make each one start with a hash, then filter strings shorter than 3 chars.


Take a list of strings; reduce each string to its first character, then add '#' to the start of each string, then drop anything shorter than three characters.


Take a list of strings; take first char drop blanks, then make each one start with a hash, then keep only strings of length 3 or more.


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


Take a list of strings; keep the first character of each (dropping empties), then prefix each with a hash, then drop strings shorter than three characters.


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


Take a list of integers; each value squared, then Ascending sort, then arrange in descending order.


Take a list of integers; multiply each value by itself, then Sort this ascending, then reverse sort.


Take a list of integers; square them all, then Sort lowest to highest, then sort largest to smallest.


Take a list of integers; raise each to the power of two, then Arrange from smallest to largest, then sort by descending values.


Take a list of integers; I need each number multiplied by itself, then sort ascending, then sort from highest to lowest.


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


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


Take a list of integers; keep the odd numbers, then remove both ends, then find the max, defaulting to 0.


Take a list of integers; odd numbers only, then trim the edges, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the odd numbers, then trim one element off each end, then What's the highest number in the list.


Take a list of integers; odd numbers only, then cut off the first and last, then Return the greatest value or default to 0.


Take a list of integers; keep the odd numbers, then remove the first and last elements, then Find the largest element, defaulting to zero.


Take a list of integers; odd numbers only, then keep only the middle part, then give the largest value (0 if none).


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


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


Take a list of integers; keep the positive numbers, then keep values below zero, then strip the signs.


Take a list of integers; get rid of anything that's not positive, then get the negative numbers, then take abs of each.


Take a list of integers; drop non-positive values, then keep values below zero, then get the absolute value of everything.


Take a list of integers; drop the negative numbers, then get the negative numbers, then apply absolute value to the whole list.


Take a list of integers; filter out the negative ones, then keep values below zero, then make them all positive.


Take a list of integers; remove all negative values, then get the negative numbers, then make every value non-negative.


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


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


Take a list of integers; keep values greater than five, then increase every value by 10, then reduce each by one.


Take a list of integers; filter out values less than or equal to 5, then add 10 to each item, then Subtract 1 from all.


Take a list of integers; keep only numbers above 5, then shift each up by ten, then Subtract one from each.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then Drop each by one.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then Decrease all values by one.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then Remove one from each value.


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


Take a list of integers; keep values greater than five, then add ten to each, then subtract one from each.


Take a list of integers; keep everything before the first zero, then remove the first item, then arrange by magnitude ignoring sign.


Take a list of integers; take only what comes before the initial zero, then Remove head, then put them in order by magnitude.


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


Take a list of integers; cut off after the first zero appears, then Remove head, then sort by distance from zero.


Take a list of integers; take values up to (excluding) the first zero, then remove the first item, then order by how far from zero.


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


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


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


Take a list of integers; keep multiples of three, then keep only odd values, then true if at least one even value.


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then any even.


Take a list of integers; keep values divisible by 3, then keep only odd values, then true if at least one even value.


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


Take a list of integers; drop anything not divisible by three, then keep only odd values, then true if at least one even value.


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then any even.


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


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


Take a list of integers; keep everything before the first zero, then remove repeated values, then strip the signs.


Take a list of integers; take only what comes before the initial zero, then unique values preserving order, then take abs of each.


Take a list of integers; cut the list at the first zero, then remove repeated values, then get the absolute value of everything.


Take a list of integers; cut off after the first zero appears, then unique values preserving order, then apply absolute value to the whole list.


Take a list of integers; take values up to (excluding) the first zero, then remove repeated values, then make them all positive.


Take a list of integers; keep the part before the first 0, then unique values preserving order, then make every value non-negative.


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


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


Take a list of integers; sort by absolute value, then multiply each value by itself, then stop at the first non-positive value.


Take a list of integers; rearrange by distance from zero, then square them all, then keep the leading run of positive numbers.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then take values while they are positive.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then take positive values then stop.


Take a list of integers; arrange in order of absolute value, then square all of them, then keep going while positive.


Take a list of integers; sort by distance from zero, then multiply each element by itself, then stop at first non positive.


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


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


Take a list of integers; subtract one from each, then drop anything 5 or below, then true if any value equals zero.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then check for zero.


Take a list of integers; decrement each value, then filter for numbers above 5, then true if any value equals zero.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then check for zero.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then true if any value equals zero.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then check for zero.


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


Take a list of integers; subtract one from each, then keep values greater than five, then return whether the list contains a zero.


Take a list of integers; sort ascending, then order by distance from zero, then skip the first one.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then Discard the first element.


Take a list of integers; arrange in increasing order, then organize by magnitude, then skip the first one.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then Discard the first element.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then skip the first one.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then Discard the first element.


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


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


Take a list of integers; keep the negative numbers, then remove both ends, then remove the initial run of negative numbers.


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


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


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


Take a list of integers; keep the negative numbers, then remove the first and last elements, then strip negative values from the start.


Take a list of integers; extract negatives, then keep only the middle part, 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[1:-1]
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    return r


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


Take a list of integers; negate each, then keep the leading run of positive numbers, then reduce each by one.


Take a list of integers; reverse the signs of everything, then take values while they are positive, then Subtract 1 from all.


Take a list of integers; negate each, then take positive values then stop, then Subtract one from each.


Take a list of integers; reverse the signs of everything, then keep going while positive, then Drop each by one.


Take a list of integers; negate each, then stop at first non positive, then Decrease all values by one.


Take a list of integers; reverse the signs of everything, then take while greater than zero, then Remove one from each value.


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


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


Take a list of integers; drop the first and last elements, then take the final 3 elements, then ensure at least three items by appending zeros.


Take a list of integers; take out the first and last items, then drop everything except the final three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove both ends, then give me the last three elements, then ensure at least three items by appending zeros.


Take a list of integers; trim the edges, then keep only the last three, then ensure minimum length of three by adding zeros to the end.


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


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


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


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


Take a list of integers; cap each value at 10, then remove both ends, then find the max, defaulting to 0.


Take a list of integers; clip values at 10, then trim the edges, then Give me the maximum, but 0 if there are no items.


Take a list of integers; cap each value at 10, then trim one element off each end, then What's the highest number in the list.


Take a list of integers; clip values at 10, then cut off the first and last, then Return the greatest value or default to 0.


Take a list of integers; cap each value at 10, then remove the first and last elements, then Find the largest element, defaulting to zero.


Take a list of integers; clip values at 10, then keep only the middle part, then give the largest value (0 if none).


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


Take a list of integers; cap each value at 10, then drop the first and last elements, then return the maximum (0 if empty).


Take a list of integers; keep the even numbers, then keep values below zero, then bump each up by one.


Take a list of integers; keep evens, then get the negative numbers, then increment each item.


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


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


Take a list of integers; double each, then keep values divisible by 3, then put the elements backwards.


Take a list of integers; times two for each item, then keep items where x mod 3 equals zero, then reverse that for me.


Take a list of integers; double each, then drop anything not divisible by three, then flip it backwards.


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


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


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


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


Take a list of integers; double each, then keep multiples of three, then reverse the order.


Take a list of integers; drop the zeros, then increment each value, then stop at the first non-positive value.


Take a list of integers; keep only nonzero elements, then plus one for all, then keep the leading run of positive numbers.


Take a list of integers; drop the zeros, then increment each value, then take values while they are positive.


Take a list of integers; keep only nonzero elements, then plus one for all, then take positive values then stop.


Take a list of integers; drop the zeros, then increment each value, then keep going while positive.


Take a list of integers; keep only nonzero elements, then plus one for all, then stop at first non positive.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then trim one element off each end.


Take a list of integers; keep the final three items, then pad to 3, then cut off the first and last.


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


Take a list of integers; trim to the last three, then pad to 3, then keep only the middle part.


Take a list of integers; last three only, then extend to length 3 using zeros, then drop first and last.


Take a list of integers; truncate to the last three items, then pad to 3, then eliminate the outermost elements.


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


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


Take a list of integers; drop the first and last elements, then multiply each value by itself, then drop the odd numbers.


Take a list of integers; take out the first and last items, then square them all, then filter out the odd numbers.


Take a list of integers; remove both ends, then raise each to the power of two, then drop the odd numbers.


Take a list of integers; trim the edges, then I need each number multiplied by itself, then filter out the odd numbers.


Take a list of integers; trim one element off each end, then square all of them, then drop the odd numbers.


Take a list of integers; cut off the first and last, then multiply each element by itself, then filter out the odd numbers.


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


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


Take a list of integers; keep the even numbers, then clamp each to at most ten, then find the max, defaulting to 0.


Take a list of integers; keep evens, then don't let anything exceed 10, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; keep evens, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; keep evens, then don't let anything exceed 10, then give the largest value (0 if none).


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


Take a list of integers; keep the even numbers, then cap each value at 10, then return the maximum (0 if empty).


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


Take a list of integers; bump everything up by 10, then turn positives to negatives and vice versa, then how many items remain.


Take a list of integers; increase every value by 10, then flip the sign of each, then tell me the length.


Take a list of integers; add 10 to each item, then turn positives to negatives and vice versa, then return the length.


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


Take a list of integers; increase all numbers by 10, then turn positives to negatives and vice versa, then what's the count.


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


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


Take a list of integers; add one to each, then sort largest to smallest, then true only if all are positive.


Take a list of integers; make each one bigger, then sort by descending values, then do all of these have positive values.


Take a list of integers; add one to each, then sort from highest to lowest, then check if every value is positive.


Take a list of integers; make each one bigger, then sort descending, then confirm all values are positive.


Take a list of integers; add one to each, then sort largest first, then all positive.


Take a list of integers; make each one bigger, then sort in descending order, then check if every number is above zero.


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


Take a list of integers; add one to each, then sort descending, then return whether all values are positive.


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


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


Take a list of integers; take the first 3 elements, then take positive values then stop, then true if any value equals zero.


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


Take a list of integers; truncate to three items, then stop at first non positive, then true if any value equals zero.


Take a list of integers; show the first three, then take while greater than zero, then check for 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 0 in r


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


Take a list of integers; drop the leading negative values, then take the final 3 elements, then true if at least one even value.


Take a list of integers; cut the leading negatives, then drop everything except the final three, then any even.


Take a list of integers; skip negatives at the start, then give me the last three elements, then true if at least one even value.


Take a list of integers; remove all negatives at the front, then keep only the last three, then any even.


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


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


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


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


Take a list of integers; subtract one from each, then clamp each to at most ten, then give back the total.


Take a list of integers; Decrement all items, then don't let anything exceed 10, then sum r.


Take a list of integers; decrement each value, then clamp each to at most ten, then add them up.


Take a list of integers; Lower each number by one, then don't let anything exceed 10, then calculate the sum of all elements.


Take a list of integers; reduce each by one, then clamp each to at most ten, then what's the total.


Take a list of integers; Subtract 1 from all, then don't let anything exceed 10, then what do they add up to.


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


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


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


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


Take a list of integers; keep going while positive, then keep values below zero, then deduplicate the list.


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


Take a list of integers; take while greater than zero, then keep values below zero, then deduplicate the list.


Take a list of integers; take values while positive, then get the negative numbers, then remove repeats.


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


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


Take a list of integers; keep multiples of three, then remove repeated values, then give the number of evens.


Take a list of integers; get rid of non-multiples of three, then unique values preserving order, then find how many values are divisible by two.


Take a list of integers; keep values divisible by 3, then remove repeated values, then how many are even.


Take a list of integers; keep items where x mod 3 equals zero, then unique values preserving order, then get the total number of even values in the list.


Take a list of integers; drop anything not divisible by three, then remove repeated values, then give me the count of even values.


Take a list of integers; filter out everything except multiples of three, then unique values preserving order, then I need to know how many of these are even.


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


Take a list of integers; keep multiples of three, then drop duplicates keeping first occurrence, then return how many values are even.


Take a list of integers; keep multiples of three, then remove both ends, then make each twice as big.


Take a list of integers; get rid of non-multiples of three, then trim the edges, then multiply each by 2.


Take a list of integers; keep values divisible by 3, then trim one element off each end, then make each twice as big.


Take a list of integers; keep items where x mod 3 equals zero, then cut off the first and last, then multiply each by 2.