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


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


Take a list of integers; drop the first element, then sort smallest to largest, then drop non-negative values.


Take a list of integers; Take everything except the first, then Ascending sort, then drop all positive numbers.


Take a list of integers; drop the first element, then Sort this ascending, then drop non-negative values.


Take a list of integers; Take everything except the first, then Sort lowest to highest, then drop all positive numbers.


Take a list of integers; drop the first element, then Arrange from smallest to largest, then drop non-negative values.


Take a list of integers; Take everything except the first, then sort ascending, then drop all positive numbers.


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


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


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


Take a list of integers; get rid of non-multiples of three, then trim the edges, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep values divisible by 3, then trim one element off each end, then What's the highest number in the list.


Take a list of integers; keep items where x mod 3 equals zero, then cut off the first and last, then Return the greatest value or default to 0.


Take a list of integers; drop anything not divisible by three, then remove the first and last elements, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, 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 % 3 == 0]
    r = r[1:-1]
    return max(r) if r else 0


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


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


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


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


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


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


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


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


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


Take a list of integers; sort by absolute value, then increment each value, then limit every value to 10.


Take a list of integers; rearrange by distance from zero, then plus one for all, then maximum of 10 for all.


Take a list of integers; arrange by magnitude ignoring sign, then increment each value, then limit every value to 10.


Take a list of integers; put them in order by magnitude, then plus one for all, then maximum of 10 for all.


Take a list of integers; arrange in order of absolute value, then increment each value, then limit every value to 10.


Take a list of integers; sort by distance from zero, then plus one for all, then maximum of 10 for all.


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


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


Take a list of strings; sort by length, shortest first, then convert each to upper case, then remove surrounding whitespace.


Take a list of strings; sort ascending by length, then change all strings to uppercase, then trim the whitespace off everything.


Take a list of strings; order strings from shortest to longest, then make every string uppercase, then strip spaces from all strings.


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


Take a list of strings; arrange by string length ascending, then make all the strings uppercase, then clean up whitespace in the list.


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


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


Take a list of strings; sort by length, shortest first, then uppercase each string, then trim whitespace from each.


Take a list of integers; keep the odd numbers, then flip the sign of each, then arrange in decreasing order.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then arrange in descending order.


Take a list of integers; keep the odd numbers, then flip the sign of each, then reverse sort.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then sort largest to smallest.


Take a list of integers; keep the odd numbers, then flip the sign of each, then sort by descending values.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then sort from highest to lowest.


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


Take a list of integers; keep the odd numbers, then negate each, then sort descending.


Take a list of integers; drop the zeros, then clamp each to at most ten, then drop the even numbers.


Take a list of integers; keep only nonzero elements, then don't let anything exceed 10, then strip out the evens.


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


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


Take a list of integers; keep multiples of three, then keep values above zero, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of non-multiples of three, then filter for positive numbers, then put them in order by magnitude.


Take a list of integers; keep values divisible by 3, then keep only positive numbers, then arrange in order of absolute value.


Take a list of integers; keep items where x mod 3 equals zero, then keep the positives, then sort by distance from zero.


Take a list of integers; drop anything not divisible by three, then remove negatives, then order by how far from zero.


Take a list of integers; filter out everything except multiples of three, then keep the positive numbers, then order by distance from zero.


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


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


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


Take a list of integers; take out the first and last items, then Remove head, then filter out everything except multiples of three.


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


Take a list of integers; trim the edges, then Remove head, then multiples of three only.


Take a list of integers; trim one element off each end, then remove the first item, then filter for numbers divisible by three.


Take a list of integers; cut off the first and last, then Remove head, then give me only the values divisible by three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the leading run of positive numbers, then count the elements.


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then how many items remain.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then tell me the length.


Take a list of integers; drop duplicates but keep the first one, then keep going while positive, then return the length.


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then count them.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then what's the count.


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


Take a list of integers; drop duplicates keeping first occurrence, then take values while they are positive, then return how many remain.


Take a list of integers; square each, then make every value non-negative, then drop non-negative values.


Take a list of integers; each value squared, then absolute value for all items, then drop all positive numbers.


Take a list of integers; multiply each value by itself, then take absolute values, then drop non-negative values.


Take a list of integers; square them all, then turn negatives into positives, then drop all positive numbers.


Take a list of integers; raise each to the power of two, then abs each element, then drop non-negative values.


Take a list of integers; I need each number multiplied by itself, then take the absolute value of each, then drop all positive numbers.


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


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


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


Take a list of integers; keep the final three items, then exclude zeros, then sum r.


Take a list of integers; take the last three, then remove all zero values, then add them up.


Take a list of integers; trim to the last three, then exclude zeros, then calculate the sum of all elements.


Take a list of integers; last three only, then remove all zero values, then what's the total.


Take a list of integers; truncate to the last three items, then exclude zeros, then what do they add up to.


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


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


Take a list of integers; add one to each, then extend to length 3 using zeros, then deduplicate the list.


Take a list of integers; make each one bigger, then pad to 3, then remove repeats.


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


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


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


Take a list of integers; cut the leading negatives, then exclude zeros, then check for duplicates in the values.


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


Take a list of integers; remove all negatives at the front, then exclude zeros, then check that there are no duplicates.


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


Take a list of integers; strip the front negatives, then exclude zeros, then check if all values are unique.


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


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


Take a list of integers; reverse the order, then order by distance from zero, then give back the product of all values.


Take a list of integers; reverse, then sort based on absolute value, then product of the list.


Take a list of integers; flip the list around, then organize by magnitude, then what's the product.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then what do they multiply to.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then give me their product.


Take a list of integers; reverse that for me, then sort by absolute value, then multiply them all together.


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


Take a list of integers; reverse the order, then sort by absolute value, then return their product.


Take a list of integers; pad with zeros to at least three elements, then sort smallest to largest, then drop non-positive values.


Take a list of integers; add zeros until the list has at least three values, then Ascending sort, then drop the negative numbers.


Take a list of integers; pad with zeros to at least three elements, then Sort this ascending, then filter out the negative ones.


Take a list of integers; add zeros until the list has at least three values, then Sort lowest to highest, then remove all negative values.


Take a list of integers; pad with zeros to at least three elements, then Arrange from smallest to largest, then keep positive values only.


Take a list of integers; add zeros until the list has at least three values, then sort ascending, then keep values above zero.


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


Take a list of integers; pad with zeros to at least three elements, then sort ascending, then keep the positive numbers.


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then true if already sorted smallest to largest.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then does this list go in ascending order.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then check if the list is in ascending order.


Take a list of people records (name, age); get the age field, then strip the front negatives, then is the list sorted.


Take a list of people records (name, age); keep just each person's age, then remove leading negative numbers, then is it sorted.


Take a list of people records (name, age); extract age values, then drop negatives from start, then check if values are in increasing order.


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


Take a list of people records (name, age); extract the ages, then drop the leading negative values, then return whether the list is sorted ascending.


Take a list of integers; keep only the last three, then multiply each value by itself, then find the max, defaulting to 0.


Take a list of integers; keep the final three items, then square them all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the last three, then raise each to the power of two, then What's the highest number in the list.


Take a list of integers; trim to the last three, then I need each number multiplied by itself, then Return the greatest value or default to 0.


Take a list of integers; last three only, then square all of them, then Find the largest element, defaulting to zero.


Take a list of integers; truncate to the last three items, then multiply each element by itself, then give the largest value (0 if none).


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


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


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then arrange in increasing order.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then Organize these ascending.


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then Sort in ascending order.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then I need this sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then Put these in ascending order.


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


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


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


Take a list of integers; keep the odd numbers, then remove all zero values, then put the elements backwards.


Take a list of integers; odd numbers only, then exclude zeros, then reverse that for me.


Take a list of integers; keep the odd numbers, then remove all zero values, then flip it backwards.


Take a list of integers; odd numbers only, then exclude zeros, then make it backwards.


Take a list of integers; keep the odd numbers, then remove all zero values, then reverse the list.


Take a list of integers; odd numbers only, then exclude zeros, then invert the sequence.


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 = list(reversed(r))
    return r


Take a list of integers; keep the odd numbers, then drop the zeros, then reverse the order.


Take a list of integers; add ten to each, then sort largest to smallest, then keep only numbers above 5.


Take a list of integers; bump everything up by 10, then sort by descending values, then exclude values of 5 and below.


Take a list of integers; increase every value by 10, then sort from highest to lowest, then remove anything 5 or less.


Take a list of integers; add 10 to each item, then sort descending, then filter to keep only values above 5.


Take a list of integers; shift each up by ten, then sort largest first, then get rid of values that aren't greater than five.


Take a list of integers; increase all numbers by 10, then sort in descending order, then drop anything 5 or below.


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


Take a list of integers; add ten to each, then sort descending, then keep values greater than five.


Take a list of integers; keep the odd numbers, then order by distance from zero, then put the elements backwards.


Take a list of integers; odd numbers only, then sort based on absolute value, then reverse that for me.


Take a list of integers; keep the odd numbers, then organize by magnitude, then flip it backwards.


Take a list of integers; odd numbers only, then arrange by absolute value ascending, then make it backwards.


Take a list of integers; keep the odd numbers, then sort from smallest to largest absolute value, then reverse the list.


Take a list of integers; odd numbers only, then sort by absolute value, then invert the sequence.


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


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


Take a list of strings; trim whitespace from each, then add '#' to the start of each string, then count characters across all strings.


Take a list of strings; strip whitespace from every element, then make each one start with a hash, then character count.


Take a list of strings; remove surrounding whitespace, then add '#' to the start of each string, then count all the characters.


Take a list of strings; trim the whitespace off everything, then make each one start with a hash, then total number of characters.


Take a list of strings; strip spaces from all strings, then add '#' to the start of each string, then what's the total character count.


Take a list of strings; strip all the strings, then make each one start with a hash, then add up the lengths.


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


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


Take a list of integers; keep everything before the first zero, then order by distance from zero, then arrange in increasing order.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then Organize these ascending.


Take a list of integers; cut the list at the first zero, then organize by magnitude, then Sort in ascending order.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then I need this sorted ascending.


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then Put these in ascending order.


Take a list of integers; keep the part before the first 0, then sort by absolute value, then sort smallest to largest.


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


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


Take a list of integers; add one to each, then remove all zero values, then arrange in decreasing order.


Take a list of integers; make each one bigger, then exclude zeros, then arrange in descending order.


Take a list of integers; add one to each, then remove all zero values, then reverse sort.


Take a list of integers; make each one bigger, then exclude zeros, then sort largest to smallest.


Take a list of integers; add one to each, then remove all zero values, then sort by descending values.


Take a list of integers; make each one bigger, then exclude zeros, 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 != 0]
    r = sorted(r, reverse=True)
    return r


Take a list of integers; add one to each, then drop the zeros, then sort descending.


Take a list of people records (name, age); extract the ages, then make every value non-negative, then ensure at least three items by appending zeros.


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


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


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


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


Take a list of people records (name, age); extract age values, then take the absolute value of each, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; get rid of anything that's not positive, then sort based on absolute value, then remove repeats.


Take a list of integers; drop non-positive values, then organize by magnitude, then deduplicate the list.


Take a list of integers; drop the negative numbers, then arrange by absolute value ascending, then remove repeats.


Take a list of integers; filter out the negative ones, then sort from smallest to largest absolute value, then deduplicate the list.


Take a list of integers; remove all negative values, then sort by absolute value, then remove repeats.


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


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


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


Take a list of integers; Sort it from low to high, then sort by descending values, then take abs of each.


Take a list of integers; arrange in increasing order, then sort from highest to lowest, then get the absolute value of everything.


Take a list of integers; Organize these ascending, then sort descending, then apply absolute value to the whole list.


Take a list of integers; Sort in ascending order, then sort largest first, then make them all positive.


Take a list of integers; I need this sorted ascending, then sort in descending order, then make every value non-negative.


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


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


Take a list of integers; add ten to each, then keep values below zero, then remove the initial run of negative numbers.


Take a list of integers; bump everything up by 10, then get the negative numbers, then strip the front negatives.


Take a list of integers; increase every value by 10, then keep values below zero, then remove leading negative numbers.


Take a list of integers; add 10 to each item, then get the negative numbers, then drop negatives from start.


Take a list of integers; shift each up by ten, then keep values below zero, then strip negative values from the start.


Take a list of integers; increase all numbers by 10, then get the negative numbers, then remove negatives before the first non-negative.


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


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


Take a list of integers; drop the leading negative values, then multiply each value by itself, then give the earliest even value or zero.


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


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


Take a list of integers; remove all negatives at the front, then I need each number multiplied by itself, then fetch the first even element, default to 0.


Take a list of integers; remove the initial run of negative numbers, then square all of them, then give the earliest even value or zero.


Take a list of integers; strip the front negatives, then multiply each element by itself, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep the positive numbers, then sort smallest to largest, then make each twice as big.


Take a list of integers; get rid of anything that's not positive, then Ascending sort, then multiply each by 2.


Take a list of integers; drop non-positive values, then Sort this ascending, then make each twice as big.


Take a list of integers; drop the negative numbers, then Sort lowest to highest, then multiply each by 2.


Take a list of integers; filter out the negative ones, then Arrange from smallest to largest, then make each twice as big.


Take a list of integers; remove all negative values, then sort ascending, then multiply each by 2.


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


Take a list of integers; keep the positive numbers, then sort ascending, then double each.


Take a list of integers; reverse the order, then keep only even values, then stop at the first non-positive value.


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


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


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then reduce each by one.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then Subtract 1 from all.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then Subtract one from each.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then Drop each by one.


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


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then Remove one from each value.


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


Take a list of integers; drop duplicates keeping first occurrence, then drop the zeros, then subtract one from each.


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then true only if all are positive.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then do all of these have positive values.


Take a list of integers; strip the signs, then filter for numbers above 5, then check if every value is positive.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then confirm all values are positive.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then all positive.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then check if every number is above zero.


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


Take a list of integers; take the absolute value of each, then keep values greater than five, then return whether all values are positive.


Take a list of integers; add one to each, then default to [0] when there is nothing, then count the elements.


Take a list of integers; make each one bigger, then when the list is empty, substitute a zero value, then how many items remain.


Take a list of integers; add one to each, then replace an empty list with one zero, then tell me the length.


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


Take a list of integers; add one to each, then use zero if the list is empty, then count them.


Take a list of integers; make each one bigger, then default to zero when empty, then what's the count.


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


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


Take a list of integers; cap each value at 10, then multiply each value by itself, then true if already sorted smallest to largest.


Take a list of integers; clip values at 10, then square them all, then does this list go in ascending order.


Take a list of integers; cap each value at 10, then raise each to the power of two, then check if the list is in ascending order.


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


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


Take a list of integers; clip values at 10, then multiply each element by itself, then check if values are in increasing order.


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


Take a list of integers; cap each value at 10, then square each, then return whether the list is sorted ascending.


Take a list of integers; keep the even numbers, then sort largest to smallest, then truncate to three items.


Take a list of integers; keep evens, then sort by descending values, then show the first three.


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


Take a list of integers; keep evens, then sort descending, then keep first 3.


Take a list of integers; keep the even numbers, then sort largest first, then truncate to first three.


Take a list of integers; keep evens, then sort in descending order, then first three.


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


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


Take a list of integers; square each, then skip negatives at the start, then ensure at least three items by appending zeros.


Take a list of integers; each value squared, then remove all negatives at the front, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; multiply each value by itself, then remove the initial run of negative numbers, then ensure at least three items by appending zeros.


Take a list of integers; square them all, then strip the front negatives, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; raise each to the power of two, then remove leading negative numbers, then ensure at least three items by appending zeros.


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then ensure minimum length of three by adding zeros to the end.


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)):]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of strings; keep the first character of each (dropping empties), then order the strings A to Z, then find the longest one, defaulting to empty.


Take a list of strings; extract initial letters, then make it alphabetical, then Longest string, or nothing if there isn't one.


Take a list of strings; take each string's first letter, then order the strings A to Z, then find the longest one, defaulting to empty.


Take a list of strings; give me the first letter of everything, then make it alphabetical, then Longest string, or nothing if there isn't one.


Take a list of strings; reduce each string to its first character, then order the strings A to Z, then find the longest one, defaulting to empty.


Take a list of strings; take first char drop blanks, then make it alphabetical, then Longest string, or nothing if there isn't one.


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


Take a list of strings; keep the first character of each (dropping empties), then sort alphabetically, then return the longest string (empty if none).


Take a list of integers; keep everything before the first zero, then keep only even values, then drop non-negative values.


Take a list of integers; take only what comes before the initial zero, then extract all even numbers, then drop all positive numbers.


Take a list of integers; cut the list at the first zero, then keep only even values, then drop non-negative values.


Take a list of integers; cut off after the first zero appears, then extract all even numbers, then drop all positive numbers.


Take a list of integers; take values up to (excluding) the first zero, then keep only even values, then drop non-negative values.


Take a list of integers; keep the part before the first 0, then extract all even numbers, then drop all positive numbers.


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


Take a list of integers; keep everything before the first zero, then keep the even numbers, then keep the negative numbers.


Take a list of strings; prefix each with a hash, then keep only strings of length 3 or more, then remove blanks.


Take a list of strings; add # to the start of each string, then get rid of short ones, then eliminate empty string values.


Take a list of strings; prefix each with a hash, then remove strings with less than three characters, then filter out blank strings.


Take a list of strings; add # to the start of each string, then remove all strings under three characters in length, then remove strings that are empty.


Take a list of strings; prefix each with a hash, then filter out short strings under three chars, then strip out empty strings.


Take a list of strings; add # to the start of each string, then drop strings shorter than three characters, then keep only non-empty strings.


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


Take a list of strings; prefix each with a hash, then drop strings shorter than three characters, then drop empty strings.


Take a list of integers; keep everything before the first zero, then order by distance from zero, then count the elements.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then how many items remain.


Take a list of integers; cut the list at the first zero, then organize by magnitude, then tell me the length.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then return the length.


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then count them.


Take a list of integers; keep the part before the first 0, then sort by absolute value, then what's the count.


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


Take a list of integers; keep everything before the first zero, then sort by absolute value, then return how many remain.


Take a list of integers; keep only the first three, then multiply each by two, then find the max, defaulting to 0.


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


Take a list of integers; take the first 3 elements, then multiply each by two, then What's the highest number in the list.


Take a list of integers; remove everything after the third, then double each item in the list, then Return the greatest value or default to 0.


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


Take a list of integers; show the first three, then double each item in the list, then give the largest value (0 if none).


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


Take a list of integers; keep only the first three, then double each, then return the maximum (0 if empty).


Take a list of integers; sort descending, then remove the first item, then true if at least one even value.


Take a list of integers; sort largest first, then Remove head, then any even.


Take a list of integers; sort in descending order, then remove the first item, then true if at least one even value.


Take a list of integers; sort from greatest to least, then Remove head, then any even.


Take a list of integers; sort z to a, then remove the first item, then true if at least one even value.


Take a list of integers; arrange in decreasing order, then Remove head, then any even.


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


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


Take a list of integers; keep the positive numbers, then keep values divisible by 3, then true if any value equals zero.


Take a list of integers; get rid of anything that's not positive, then keep items where x mod 3 equals zero, then check for zero.


Take a list of integers; drop non-positive values, then drop anything not divisible by three, then true if any value equals zero.


Take a list of integers; drop the negative numbers, then filter out everything except multiples of three, then check for zero.


Take a list of integers; filter out the negative ones, then keep only multiples of three, then true if any value equals zero.


Take a list of integers; remove all negative values, then multiples of three only, 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 % 3 == 0]
    return 0 in r


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


Take a list of integers; add one to each, then sort largest to smallest, then drop the even numbers.


Take a list of integers; make each one bigger, then sort by descending values, then strip out the evens.


Take a list of integers; add one to each, then sort from highest to lowest, then drop the even numbers.


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


Take a list of integers; add one to each, then sort largest first, then drop the even numbers.


Take a list of integers; make each one bigger, then sort in descending order, then strip out the evens.


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


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


Take a list of integers; drop the first and last elements, then increment each value, then shift each up by ten.


Take a list of integers; take out the first and last items, then plus one for all, then increase all numbers by 10.


Take a list of integers; remove both ends, then increment each value, then add 10 to everything.


Take a list of integers; trim the edges, then plus one for all, then give everything a boost of 10.


Take a list of integers; trim one element off each end, then increment each value, then increment each by ten.


Take a list of integers; cut off the first and last, then plus one for all, then add a constant 10 to each.


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


Take a list of integers; drop the first and last elements, then add one to each, then add ten to each.


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


Take a list of integers; keep evens, then exclude zeros, then strip out the evens.


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


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


Take a list of integers; add one to each, then flip the list around, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then flip the order around, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; add one to each, then put the elements backwards, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then reverse that for me, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; add one to each, then flip it backwards, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then make it backwards, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then true if every value is unique.


Take a list of integers; drop duplicates but keep the first one, then plus one for all, then check for duplicates in the values.


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then do all values appear only once.


Take a list of integers; drop duplicates but keep the first one, then plus one for all, then check that there are no duplicates.


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then are the values all unique.


Take a list of integers; drop duplicates but keep the first one, then plus one for all, then check if all values are unique.


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


Take a list of integers; drop duplicates keeping first occurrence, then add one to each, then return whether all values are distinct.


Take a list of integers; drop the first element, then keep values divisible by 3, then take values up to (excluding) the first zero.


Take a list of integers; Take everything except the first, then keep items where x mod 3 equals zero, then keep the part before the first 0.


Take a list of integers; drop the first element, then drop anything not divisible by three, then truncate at the first zero.


Take a list of integers; Take everything except the first, then filter out everything except multiples of three, then delete everything starting with the first zero.


Take a list of integers; drop the first element, then keep only multiples of three, then remove from the first zero onwards.


Take a list of integers; Take everything except the first, then multiples of three only, then up to but not including the first zero.


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


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


Take a list of integers; sort by absolute value, then remove both ends, then give back the total.


Take a list of integers; rearrange by distance from zero, then trim the edges, then sum r.


Take a list of integers; arrange by magnitude ignoring sign, then trim one element off each end, then add them up.


Take a list of integers; put them in order by magnitude, then cut off the first and last, then calculate the sum of all elements.


Take a list of integers; arrange in order of absolute value, then remove the first and last elements, then what's the total.


Take a list of integers; sort by distance from zero, then keep only the middle part, then what do they add up to.


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


Take a list of integers; sort by absolute value, then drop the first and last elements, then return their sum.


Take a list of integers; drop the first element, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then give the earliest even value or zero.


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


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


Take a list of integers; drop the first element, then sort by absolute value, then return the first even value (0 if none).


Take a list of people records (name, age); extract the ages, then order by distance from zero, then count the elements.


Take a list of people records (name, age); show me all ages, then sort based on absolute value, then how many items remain.


Take a list of people records (name, age); pluck the age field from each record, then organize by magnitude, then tell me the length.


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


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


Take a list of people records (name, age); extract age values, then sort by absolute value, then what's the count.


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


Take a list of people records (name, age); extract the ages, then sort by absolute value, then return how many remain.


Take a list of integers; subtract one from each, then make every value non-negative, then put the elements backwards.


Take a list of integers; Decrement all items, then absolute value for all items, then reverse that for me.


Take a list of integers; decrement each value, then take absolute values, then flip it backwards.


Take a list of integers; Lower each number by one, then turn negatives into positives, then make it backwards.


Take a list of integers; reduce each by one, then abs each element, then reverse the list.


Take a list of integers; Subtract 1 from all, then take the absolute value of each, then invert the sequence.


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


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


Take a list of integers; cap each value at 10, then sort smallest to largest, then shift each up by ten.


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


Take a list of integers; cap each value at 10, then Sort this ascending, then add 10 to everything.


Take a list of integers; clip values at 10, then Sort lowest to highest, then give everything a boost of 10.


Take a list of integers; cap each value at 10, then Arrange from smallest to largest, then increment each by ten.


Take a list of integers; clip values at 10, then sort ascending, then add a constant 10 to each.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then truncate to the last three items.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then show only the last three.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then remove all but the last three.


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


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then drop everything except the final three.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then give me the last three elements.


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


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


Take a list of integers; subtract one from each, then multiply each by two, then multiply each by -1.


Take a list of integers; Decrement all items, then double each item in the list, then negate.


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


Take a list of integers; Lower each number by one, then double each item in the list, then negate.


Take a list of integers; reduce each by one, then multiply each by two, then multiply each by -1.


Take a list of integers; Subtract 1 from all, then double each item in the list, then negate.


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


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


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


Take a list of integers; take out the first and last items, then unique values preserving order, then show the first three.


Take a list of integers; remove both ends, then remove repeated values, then take the first three.


Take a list of integers; trim the edges, then unique values preserving order, then keep first 3.


Take a list of integers; trim one element off each end, then remove repeated values, then truncate to first three.


Take a list of integers; cut off the first and last, then unique values preserving order, then first three.


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


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


Take a list of integers; square each, then remove the first item, then multiply each by -1.


Take a list of integers; each value squared, then Remove head, then negate.


Take a list of integers; multiply each value by itself, then remove the first item, then multiply each by -1.


Take a list of integers; square them all, then Remove head, then negate.


Take a list of integers; raise each to the power of two, then remove the first item, then multiply each by -1.


Take a list of integers; I need each number multiplied by itself, then Remove head, then negate.


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


Take a list of integers; square each, then drop the first element, then negate each.


Take a list of integers; sort descending, then multiply each value by itself, then give the number of evens.


Take a list of integers; sort largest first, then square them all, then find how many values are divisible by two.


Take a list of integers; sort in descending order, then raise each to the power of two, then how many are even.


Take a list of integers; sort from greatest to least, then I need each number multiplied by itself, then get the total number of even values in the list.


Take a list of integers; sort z to a, then square all of them, then give me the count of even values.


Take a list of integers; arrange in decreasing order, then multiply each element by itself, then I need to know how many of these are even.


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


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


Take a list of integers; keep only the first three, then multiply each value by itself, then keep only numbers above 5.


Take a list of integers; keep the first 3 items, then square them all, then exclude values of 5 and below.


Take a list of integers; take the first 3 elements, then raise each to the power of two, then remove anything 5 or less.


Take a list of integers; remove everything after the third, then I need each number multiplied by itself, then filter to keep only values above 5.


Take a list of integers; truncate to three items, then square all of them, then get rid of values that aren't greater than five.


Take a list of integers; show the first three, then multiply each element by itself, then drop anything 5 or below.


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


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


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


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


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


Take a list of integers; stop at first non positive, then keep only the last three, then I need this sorted ascending.


Take a list of integers; take while greater than zero, then keep the final three items, then Put these in ascending order.


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


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


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


Take a list of integers; negate each, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; reverse the signs of everything, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; negate each, then filter for numbers above 5, then arrange in order of absolute value.


Take a list of integers; reverse the signs of everything, then give me values where x is greater than 5, then sort by distance from zero.


Take a list of integers; negate each, then show me only the values that are bigger than five, then order by how far from zero.


Take a list of integers; reverse the signs of everything, then keep values greater than five, then order by distance from zero.


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


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


Take a list of integers; keep the even numbers, then keep the leading run of positive numbers, then put the elements backwards.


Take a list of integers; keep evens, then take values while they are positive, then reverse that for me.


Take a list of integers; keep the even numbers, then take positive values then stop, then flip it backwards.


Take a list of integers; keep evens, then keep going while positive, then make it backwards.


Take a list of integers; keep the even numbers, then stop at first non positive, then reverse the list.


Take a list of integers; keep evens, then take while greater than zero, then invert the sequence.


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


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


Take a list of integers; pad with zeros to at least three elements, then cut the list at the first zero, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then cut off after the first zero appears, then multiply each by 2.


Take a list of integers; pad with zeros to at least three elements, then take values up to (excluding) the first zero, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then keep the part before the first 0, then multiply each by 2.


Take a list of integers; pad with zeros to at least three elements, then truncate at the first zero, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then delete everything starting with the first zero, then multiply each by 2.


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


Take a list of integers; pad with zeros to at least three elements, then keep everything before the first zero, then double each.


Take a list of integers; subtract one from each, then drop anything 5 or below, then take values up to (excluding) the first zero.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then keep the part before the first 0.


Take a list of integers; decrement each value, then filter for numbers above 5, then truncate at the first zero.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then delete everything starting with the first zero.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then remove from the first zero onwards.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then up to but not including the first zero.


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


Take a list of integers; subtract one from each, then keep values greater than five, then keep everything before the first zero.


Take a list of integers; sort descending, then take the final 3 elements, then arrange by magnitude ignoring sign.


Take a list of integers; sort largest first, then drop everything except the final three, then put them in order by magnitude.


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then skip negatives at the start, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then remove all negatives at the front, then Discard the first element.


Take a list of integers; pad with zeros to at least three elements, then remove the initial run of negative numbers, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then strip the front negatives, then Discard the first element.


Take a list of integers; pad with zeros to at least three elements, then remove leading negative numbers, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then drop negatives from start, then Discard the first element.


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


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


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


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


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


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


Take a list of integers; drop the first element, then Subtract one from each, then if there's nothing, put in a zero.


Take a list of integers; Take everything except the first, then Drop each by one, then if no items, add a zero.


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


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


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


Take a list of integers; make each one bigger, then trim the edges, then do all of these have positive values.


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


Take a list of integers; make each one bigger, then cut off the first and last, then confirm all values are positive.


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


Take a list of integers; make each one bigger, then keep only the middle part, then check if every number is above zero.


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


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


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


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


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


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


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


Take a list of integers; take values while positive, then multiples of three only, then sort from highest to lowest.


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


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


Take a list of integers; keep the odd numbers, then keep only even values, then find the min, defaulting to 0.


Take a list of integers; odd numbers only, then extract all even numbers, then minimum value, zero otherwise.


Take a list of integers; keep the odd numbers, then keep only even values, then get the minimum value or zero if empty.


Take a list of integers; odd numbers only, then extract all even numbers, then give me the min or 0.


Take a list of integers; keep the odd numbers, then keep only even values, then return the smallest number, defaulting to 0.


Take a list of integers; odd numbers only, then extract all even numbers, then return smallest or zero if empty.


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


Take a list of integers; keep the odd numbers, then keep the even numbers, then return the minimum (0 if empty).


Take a list of integers; drop the leading negative values, then sort largest to smallest, then trim one element off each end.


Take a list of integers; cut the leading negatives, then sort by descending values, then cut off the first and last.


Take a list of integers; skip negatives at the start, then sort from highest to lowest, then remove the first and last elements.


Take a list of integers; remove all negatives at the front, then sort descending, then keep only the middle part.


Take a list of integers; remove the initial run of negative numbers, then sort largest first, then drop first and last.


Take a list of integers; strip the front negatives, then sort in descending order, 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 = sorted(r, reverse=True)
    r = r[1:-1]
    return r


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


Take a list of integers; take values while they are positive, then clamp each to at most ten, then arrange by magnitude ignoring sign.


Take a list of integers; take positive values then stop, then don't let anything exceed 10, then put them in order by magnitude.


Take a list of integers; keep going while positive, then clamp each to at most ten, then arrange in order of absolute value.


Take a list of integers; stop at first non positive, then don't let anything exceed 10, then sort by distance from zero.


Take a list of integers; take while greater than zero, then clamp each to at most ten, then order by how far from zero.


Take a list of integers; take values while positive, then don't let anything exceed 10, then order by distance from zero.


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


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


Take a list of integers; negate each, then keep values below zero, then drop non-positive values.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then drop the negative numbers.


Take a list of integers; negate each, then keep values below zero, then filter out the negative ones.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then remove all negative values.


Take a list of integers; negate each, then keep values below zero, then keep positive values only.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then keep values above zero.


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


Take a list of integers; drop the first element, then clamp each to at most ten, then give back the total.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then sum r.


Take a list of integers; drop the first element, then clamp each to at most ten, then add them up.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then calculate the sum of all elements.


Take a list of integers; drop the first element, then clamp each to at most ten, then what's the total.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then what do they add up to.


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


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


Take a list of integers; take values while they are positive, then cut the list at the first zero, then drop non-negative values.


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


Take a list of integers; keep going while positive, then take values up to (excluding) the first zero, then drop non-negative values.


Take a list of integers; stop at first non positive, then keep the part before the first 0, then drop all positive numbers.


Take a list of integers; take while greater than zero, then truncate at the first zero, then drop non-negative values.


Take a list of integers; take values while positive, then delete everything starting with the first zero, then drop all positive numbers.


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


Take a list of integers; take values while they are positive, then keep everything before the first zero, then keep the negative numbers.


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


Take a list of integers; sort largest first, then unique values preserving order, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then remove repeated values, then take values while they are positive.


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


Take a list of integers; sort z to a, then remove repeated values, then keep going while positive.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then stop at first non positive.


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


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


Take a list of integers; add ten to each, then keep values above zero, then raise each to the power of two.


Take a list of integers; bump everything up by 10, then filter for positive numbers, then I need each number multiplied by itself.


Take a list of integers; increase every value by 10, then keep only positive numbers, then square all of them.


Take a list of integers; add 10 to each item, then keep the positives, then multiply each element by itself.


Take a list of integers; shift each up by ten, then remove negatives, then make each one squared.


Take a list of integers; increase all numbers by 10, then keep the positive numbers, then square each value in the list.


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


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


Take a list of integers; keep only the first three, then sort smallest to largest, then take values up to (excluding) the first zero.


Take a list of integers; keep the first 3 items, then Ascending sort, then keep the part before the first 0.


Take a list of integers; take the first 3 elements, then Sort this ascending, then truncate at the first zero.


Take a list of integers; remove everything after the third, then Sort lowest to highest, then delete everything starting with the first zero.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then remove from the first zero onwards.


Take a list of integers; show the first three, then sort ascending, then up to but not including the first zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then trim one element off each end.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then cut off the first and last.


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then remove the first and last elements.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then keep only the middle part.


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then drop first and last.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then eliminate the outermost elements.


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


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


Take a list of integers; if empty, use a single zero, then increase every value by 10, then reduce each by one.


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


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then Subtract one from each.


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


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then Decrease all values by one.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then Remove one from each value.


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


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


Take a list of strings; trim whitespace from each, then remove repeated strings, then remove short strings (under 3 chars).


Take a list of strings; strip whitespace from every element, then keep unique strings first appearance, then only keep strings with three or more characters.


Take a list of strings; remove surrounding whitespace, then eliminate repeated strings preserve first occurrence, then keep only strings that are at least three characters long.


Take a list of strings; trim the whitespace off everything, then drop duplicate strings keeping the first, then filter strings shorter than 3 chars.


Take a list of strings; strip spaces from all strings, then dedupe, then drop anything shorter than three characters.


Take a list of strings; strip all the strings, then remove duplicate strings keep first, then keep only strings of length 3 or more.


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


Take a list of strings; trim whitespace from each, then drop duplicate strings keeping the first, then drop strings shorter than three characters.


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


Take a list of integers; add zeros until the list has at least three values, then Ascending sort, then strip out the evens.


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


Take a list of integers; add zeros until the list has at least three values, then Sort lowest to highest, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then Arrange from smallest to largest, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then sort ascending, then strip out the evens.


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


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


Take a list of integers; drop the leading negative values, then cut the list at the first zero, then count the elements.


Take a list of integers; cut the leading negatives, then cut off after the first zero appears, then how many items remain.


Take a list of integers; skip negatives at the start, then take values up to (excluding) the first zero, then tell me the length.


Take a list of integers; remove all negatives at the front, then keep the part before the first 0, then return the length.


Take a list of integers; remove the initial run of negative numbers, then truncate at the first zero, then count them.


Take a list of integers; strip the front negatives, then delete everything starting with the first zero, then what's the count.


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


Take a list of integers; drop the leading negative values, then keep everything before the first zero, then return how many remain.


Take a list of integers; take values while they are positive, then flip the sign of each, then drop anything not divisible by three.


Take a list of integers; take positive values then stop, then turn positives to negatives and vice versa, then filter out everything except multiples of three.


Take a list of integers; keep going while positive, then flip the sign of each, then keep only multiples of three.


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


Take a list of integers; take while greater than zero, then flip the sign of each, then filter for numbers divisible by three.


Take a list of integers; take values while positive, then turn positives to negatives and vice versa, then give me only the values divisible by three.


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


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


Take a list of integers; if empty, use a single zero, then skip negatives at the start, then multiply each by -1.


Take a list of integers; if blank use 0, then remove all negatives at the front, then negate.


Take a list of integers; default to [0] when there is nothing, then remove the initial run of negative numbers, then multiply each by -1.


Take a list of integers; when the list is empty, substitute a zero value, then strip the front negatives, then negate.


Take a list of integers; replace an empty list with one zero, then remove leading negative numbers, then multiply each by -1.


Take a list of integers; zero it out if it's empty, then drop negatives from start, then negate.


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


Take a list of integers; if empty, use a single zero, then drop the leading negative values, then negate each.


Take a list of integers; drop the zeros, then keep only even values, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then extract all even numbers, then negate.


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


Take a list of integers; drop the zeros, then keep the even numbers, then negate each.


Take a list of integers; drop the first element, then default to [0] when there is nothing, then take values up to (excluding) the first zero.


Take a list of integers; Take everything except the first, then when the list is empty, substitute a zero value, then keep the part before the first 0.


Take a list of integers; drop the first element, then replace an empty list with one zero, then truncate at the first zero.


Take a list of integers; Take everything except the first, then zero it out if it's empty, then delete everything starting with the first zero.


Take a list of integers; drop the first element, then use zero if the list is empty, then remove from the first zero onwards.


Take a list of integers; Take everything except the first, then default to zero when empty, then up to but not including the first zero.


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


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


Take a list of integers; keep values greater than five, then remove all zero values, then arrange in decreasing order.


Take a list of integers; filter out values less than or equal to 5, then exclude zeros, then arrange in descending order.


Take a list of integers; keep only numbers above 5, then remove all zero values, then reverse sort.


Take a list of integers; exclude values of 5 and below, then exclude zeros, then sort largest to smallest.


Take a list of integers; remove anything 5 or less, then remove all zero values, then sort by descending values.


Take a list of integers; filter to keep only values above 5, then exclude zeros, then sort from highest to lowest.


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


Take a list of integers; keep values greater than five, then drop the zeros, then sort descending.


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


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


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


Take a list of integers; keep evens, then increase all numbers by 10, then calculate the sum of all elements.


Take a list of integers; keep the even numbers, then add 10 to everything, then what's the total.


Take a list of integers; keep evens, then give everything a boost of 10, then what do they add up to.


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


Take a list of integers; keep the even numbers, then add ten to each, then return their sum.


Take a list of integers; reverse the order, then multiply each value by itself, then keep only non-zero numbers.


Take a list of integers; reverse, then square them all, then strip the zeros.


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


Take a list of integers; flip the order around, then I need each number multiplied by itself, then strip the zeros.


Take a list of integers; put the elements backwards, then square all of them, then keep only non-zero numbers.


Take a list of integers; reverse that for me, then multiply each element by itself, then strip the zeros.


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


Take a list of integers; reverse the order, then square each, then drop the zeros.


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


Take a list of integers; keep the first 3 items, then get the negative numbers, then zero it out if it's empty.


Take a list of integers; take the first 3 elements, then keep values below zero, then use zero if the list is empty.


Take a list of integers; remove everything after the third, then get the negative numbers, then default to zero when empty.


Take a list of integers; truncate to three items, then keep values below zero, then if there's nothing, put in a zero.


Take a list of integers; show the first three, then get the negative numbers, then if no items, add a zero.


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


Take a list of integers; keep only the first three, then keep the negative numbers, then if empty, use a single zero.


Take a list of integers; take the absolute value of each, then clamp each to at most ten, then keep only numbers above 5.


Take a list of integers; convert to absolute value, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of integers; strip the signs, then clamp each to at most ten, then remove anything 5 or less.


Take a list of integers; take abs of each, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; get the absolute value of everything, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; apply absolute value to the whole list, then don't let anything exceed 10, then drop anything 5 or below.


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


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


Take a list of integers; drop the first and last elements, then decrement each value, then drop non-negative values.


Take a list of integers; take out the first and last items, then Lower each number by one, then drop all positive numbers.


Take a list of integers; remove both ends, then reduce each by one, then drop non-negative values.


Take a list of integers; trim the edges, then Subtract 1 from all, then drop all positive numbers.


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


Take a list of integers; cut off the first and last, then Drop each by one, then drop all positive numbers.


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


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


Take a list of integers; drop the first and last elements, then keep values below zero, then remove the initial run of negative numbers.


Take a list of integers; take out the first and last items, then get the negative numbers, then strip the front negatives.


Take a list of integers; remove both ends, then keep values below zero, then remove leading negative numbers.


Take a list of integers; trim the edges, then get the negative numbers, then drop negatives from start.


Take a list of integers; trim one element off each end, then keep values below zero, then strip negative values from the start.


Take a list of integers; cut off the first and last, then get the negative numbers, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then bump each up by one.


Take a list of integers; take only what comes before the initial zero, then pad to 3, then increment each item.


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then bump each up by one.


Take a list of integers; cut off after the first zero appears, then pad to 3, then increment each item.


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then bump each up by one.


Take a list of integers; keep the part before the first 0, then pad to 3, then increment each item.


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


Take a list of integers; keep everything before the first zero, then pad with zeros to at least three elements, then add one to each.


Take a list of integers; square each, then drop anything 5 or below, then remove the initial run of negative numbers.


Take a list of integers; each value squared, then keep only numbers greater than 5, then strip the front negatives.


Take a list of integers; multiply each value by itself, then filter for numbers above 5, then remove leading negative numbers.


Take a list of integers; square them all, then give me values where x is greater than 5, then drop negatives from start.


Take a list of integers; raise each to the power of two, then show me only the values that are bigger than five, then strip negative values from the start.


Take a list of integers; I need each number multiplied by itself, then keep values greater than five, then remove negatives before the first non-negative.


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


Take a list of integers; square each, then keep values greater than five, then drop the leading negative values.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then arrange by magnitude ignoring sign.


Take a list of integers; keep only nonzero elements, then pad to 3, then put them in order by magnitude.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then arrange in order of absolute value.


Take a list of integers; keep only nonzero elements, then pad to 3, then sort by distance from zero.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then order by how far from zero.


Take a list of integers; keep only nonzero elements, then pad to 3, then order by distance from zero.


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 = sorted(r, key=abs)
    return r


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the odd numbers, then sort largest to smallest, then reduce each by one.


Take a list of integers; odd numbers only, then sort by descending values, then Subtract 1 from all.


Take a list of integers; keep the odd numbers, then sort from highest to lowest, then Subtract one from each.


Take a list of integers; odd numbers only, then sort descending, then Drop each by one.


Take a list of integers; keep the odd numbers, then sort largest first, then Decrease all values by one.


Take a list of integers; odd numbers only, then sort in descending order, then Remove one from each value.


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


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


Take a list of integers; keep values greater than five, then remove the first item, then raise each to the power of two.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then I need each number multiplied by itself.


Take a list of integers; keep only numbers above 5, then remove the first item, then square all of them.


Take a list of integers; exclude values of 5 and below, then Remove head, then multiply each element by itself.


Take a list of integers; remove anything 5 or less, then remove the first item, then make each one squared.


Take a list of integers; filter to keep only values above 5, then Remove head, then square each value in the list.


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


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


Take a list of integers; keep everything before the first zero, then keep only even values, then remove the initial run of negative numbers.


Take a list of integers; take only what comes before the initial zero, then extract all even numbers, then strip the front negatives.


Take a list of integers; cut the list at the first zero, then keep only even values, then remove leading negative numbers.