Take a list of integers; Organize these ascending, then sort descending, then multiply each element by itself.


Take a list of integers; Sort in ascending order, then sort largest first, then make each one squared.


Take a list of integers; I need this sorted ascending, then sort in descending order, then square each value in the list.


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


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


Take a list of integers; subtract one from each, then keep values above zero, then skip the first one.


Take a list of integers; Decrement all items, then filter for positive numbers, then Discard the first element.


Take a list of integers; decrement each value, then keep only positive numbers, then skip the first one.


Take a list of integers; Lower each number by one, then keep the positives, then Discard the first element.


Take a list of integers; reduce each by one, then remove negatives, then skip the first one.


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then Discard the first element.


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


Take a list of integers; subtract one from each, then keep the positive numbers, then drop the first element.


Take a list of integers; keep the negative numbers, then flip the sign of each, then keep only non-zero numbers.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then strip the zeros.


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


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


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then true only if all are positive.


Take a list of integers; extract negatives, then pad to 3, then do all of these have positive values.


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then check if every value is positive.


Take a list of integers; extract negatives, then pad to 3, then confirm all values are positive.


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then all positive.


Take a list of integers; extract negatives, then pad to 3, then check if every number is above 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
    return all(x > 0 for x in r)


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


Take a list of integers; cap each value at 10, then remove the first item, then shift each up by ten.


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


Take a list of integers; cap each value at 10, then remove the first item, then add 10 to everything.


Take a list of integers; clip values at 10, then Remove head, then give everything a boost of 10.


Take a list of integers; cap each value at 10, then remove the first item, then increment each by ten.


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


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


Take a list of integers; cap each value at 10, then drop the first element, then add ten to each.


Take a list of integers; cap each value at 10, then decrement each value, then true if any value equals zero.


Take a list of integers; clip values at 10, then Lower each number by one, then check for zero.


Take a list of integers; cap each value at 10, then reduce each by one, then true if any value equals zero.


Take a list of integers; clip values at 10, then Subtract 1 from all, then check for zero.


Take a list of integers; cap each value at 10, then Subtract one from each, then true if any value equals zero.


Take a list of integers; clip values at 10, then Drop each by one, then check for zero.


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


Take a list of integers; cap each value at 10, then subtract one from each, then return whether the list contains a zero.


Take a list of strings; lowercase each string, then convert each to upper case, then arrange in lexicographic order.


Take a list of strings; change to lowercase, then change all strings to uppercase, then sort by letter.


Take a list of strings; lowercase each string, then make every string uppercase, then arrange in lexicographic order.


Take a list of strings; change to lowercase, then uppercase each one, then sort by letter.


Take a list of strings; lowercase each string, then make all the strings uppercase, then arrange in lexicographic order.


Take a list of strings; change to lowercase, then convert all strings to uppercase letters, then sort by letter.


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


Take a list of strings; lowercase each string, then uppercase each string, then sort alphabetically.


Take a list of integers; negate each, then keep values above zero, then trim one element off each end.


Take a list of integers; reverse the signs of everything, then filter for positive numbers, then cut off the first and last.


Take a list of integers; negate each, then keep only positive numbers, then remove the first and last elements.


Take a list of integers; reverse the signs of everything, then keep the positives, then keep only the middle part.


Take a list of integers; negate each, then remove negatives, then drop first and last.


Take a list of integers; reverse the signs of everything, then keep the positive numbers, then eliminate the outermost elements.


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


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


Take a list of integers; add ten to each, then flip the sign of each, then skip the first one.


Take a list of integers; bump everything up by 10, then turn positives to negatives and vice versa, then Discard the first element.


Take a list of integers; increase every value by 10, then flip the sign of each, then skip the first one.


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


Take a list of integers; shift each up by ten, then flip the sign of each, then skip the first one.


Take a list of integers; increase all numbers by 10, then turn positives to negatives and vice versa, then Discard the first element.


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


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


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


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


Take a list of integers; keep the odd numbers, then replace an empty list with one zero, then reverse sort.


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


Take a list of integers; keep the odd numbers, then use zero if the list is empty, then sort by descending values.


Take a list of integers; odd numbers only, then default to zero when empty, then sort from highest to lowest.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the final three items, then square them all, then filter out the odd numbers.


Take a list of integers; take the last three, then raise each to the power of two, then drop the odd numbers.


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


Take a list of integers; last three only, then square all of them, then drop the odd numbers.


Take a list of integers; truncate to the last three items, then multiply each element by itself, then filter out the odd numbers.


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


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


Take a list of integers; keep everything before the first zero, then skip negatives at the start, then stop at the first non-positive value.


Take a list of integers; take only what comes before the initial zero, then remove all negatives at the front, then keep the leading run of positive numbers.


Take a list of integers; cut the list at the first zero, then remove the initial run of negative numbers, then take values while they are positive.


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


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


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then reverse that for me.


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


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then make it backwards.


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


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then invert the sequence.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then arrange in increasing order.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then Organize these ascending.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then Sort in ascending order.


Take a list of people records (name, age); get the age field, then extract all even numbers, then I need this sorted ascending.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then Put these in ascending order.


Take a list of people records (name, age); extract age values, then extract all even numbers, then sort smallest to largest.


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


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


Take a list of strings; drop empty strings, then add '#' to the start of each string, then arrange by string length ascending.


Take a list of strings; get rid of blanks, then make each one start with a hash, then length sort.


Take a list of strings; remove blanks, then add '#' to the start of each string, then sort by length shortest first.


Take a list of strings; eliminate empty string values, then make each one start with a hash, then organize by string length least to greatest.


Take a list of strings; filter out blank strings, then add '#' to the start of each string, then shortest strings first.


Take a list of strings; remove strings that are empty, then make each one start with a hash, then i want them ordered by how short they are.


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


Take a list of strings; drop empty strings, then prefix each with a hash, then sort by length, shortest first.


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


Take a list of integers; take out the first and last items, then extract all even numbers, then strip out the evens.


Take a list of integers; remove both ends, then keep only even values, then drop the even numbers.


Take a list of integers; trim the edges, then extract all even numbers, then strip out the evens.


Take a list of integers; trim one element off each end, then keep only even values, then drop the even numbers.


Take a list of integers; cut off the first and last, then extract all even numbers, then strip out the evens.


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


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


Take a list of integers; keep multiples of three, then increment each value, then give back the total.


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


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


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


Take a list of integers; drop anything not divisible by three, then increment each value, then what's the total.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then what do they add up to.


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


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


Take a list of integers; drop the leading negative values, then remove all zero values, then trim one element off each end.


Take a list of integers; cut the leading negatives, then exclude zeros, then cut off the first and last.


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


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


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


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


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


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


Take a list of integers; square each, then flip the sign of each, then limit every value to 10.


Take a list of integers; each value squared, then turn positives to negatives and vice versa, then maximum of 10 for all.


Take a list of integers; multiply each value by itself, then flip the sign of each, then limit every value to 10.


Take a list of integers; square them all, then turn positives to negatives and vice versa, then maximum of 10 for all.


Take a list of integers; raise each to the power of two, then flip the sign of each, then limit every value to 10.


Take a list of integers; I need each number multiplied by itself, then turn positives to negatives and vice versa, then maximum of 10 for all.


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


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


Take a list of integers; pad with zeros to at least three elements, then make every value non-negative, then drop anything not divisible by three.


Take a list of integers; add zeros until the list has at least three values, then absolute value for all items, then filter out everything except multiples of three.


Take a list of integers; pad with zeros to at least three elements, then take absolute values, then keep only multiples of three.


Take a list of integers; add zeros until the list has at least three values, then turn negatives into positives, then multiples of three only.


Take a list of integers; pad with zeros to at least three elements, then abs each element, then filter for numbers divisible by three.


Take a list of integers; add zeros until the list has at least three values, then take the absolute value of each, then give me only the values divisible by three.


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


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


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


Take a list of integers; Decrement all items, then get the negative numbers, then cut off the first and last.


Take a list of integers; decrement each value, then keep values below zero, then remove the first and last elements.


Take a list of integers; Lower each number by one, then get the negative numbers, then keep only the middle part.


Take a list of integers; reduce each by one, then keep values below zero, then drop first and last.


Take a list of integers; Subtract 1 from all, then get the negative numbers, then eliminate the outermost elements.


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


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


Take a list of integers; keep only the last three, then keep values below zero, then drop anything not divisible by three.


Take a list of integers; keep the final three items, then get the negative numbers, then filter out everything except multiples of three.


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


Take a list of integers; trim to the last three, then get the negative numbers, then multiples of three only.


Take a list of integers; last three only, then keep values below zero, then filter for numbers divisible by three.


Take a list of integers; truncate to the last three items, then get the negative numbers, then give me only the values divisible by three.


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


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


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


Take a list of integers; extract negatives, then eliminate the even numbers, then find how many values are divisible by two.


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


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


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


Take a list of integers; extract negatives, then eliminate the even numbers, then I need to know how many of these are even.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then multiply each by -1.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then negate.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then multiply each by -1.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then negate.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then multiply each by -1.


Take a list of integers; sort by distance from zero, then get the negative numbers, then negate.


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


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


Take a list of integers; keep only the last three, then default to [0] when there is nothing, then true only if all are positive.


Take a list of integers; keep the final three items, then when the list is empty, substitute a zero value, then do all of these have positive values.


Take a list of integers; take the last three, then replace an empty list with one zero, then check if every value is positive.


Take a list of integers; trim to the last three, then zero it out if it's empty, then confirm all values are positive.


Take a list of integers; last three only, then use zero if the list is empty, then all positive.


Take a list of integers; truncate to the last three items, then default to zero when empty, then check if every number is above zero.


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


Take a list of integers; keep only the last three, then if empty, use a single zero, then return whether all values are positive.


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


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


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


Take a list of integers; exclude values of 5 and below, then reverse that for me, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then flip it backwards, then drop first and last.


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


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


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


Take a list of integers; drop the first element, then flip the list around, then remove the initial run of negative numbers.


Take a list of integers; Take everything except the first, then flip the order around, then strip the front negatives.


Take a list of integers; drop the first element, then put the elements backwards, then remove leading negative numbers.


Take a list of integers; Take everything except the first, then reverse that for me, then drop negatives from start.


Take a list of integers; drop the first element, then flip it backwards, then strip negative values from the start.


Take a list of integers; Take everything except the first, then make it backwards, then remove negatives before the first non-negative.


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


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


Take a list of integers; sort by absolute value, then multiply each value by itself, then true only if all are positive.


Take a list of integers; rearrange by distance from zero, then square them all, then do all of these have positive values.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then check if every value is positive.


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


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


Take a list of integers; sort by distance from zero, then multiply each element by itself, then check if every number is above zero.


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


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


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


Take a list of integers; times two for each item, then keep only numbers greater than 5, then do all of these have positive values.


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


Take a list of integers; times two for each item, then give me values where x is greater than 5, then confirm all values are positive.


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


Take a list of integers; times two for each item, then keep values greater than five, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [x * 2 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; double each, then keep values greater than five, then return whether all values are positive.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then make each twice as big.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then multiply each by 2.


Take a list of integers; drop the zeros, then take positive values then stop, then make each twice as big.


Take a list of integers; keep only nonzero elements, then keep going while positive, then multiply each by 2.


Take a list of integers; drop the zeros, then stop at first non positive, then make each twice as big.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then multiply each by 2.


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


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


Take a list of integers; negate each, then drop anything 5 or below, then true if already sorted smallest to largest.


Take a list of integers; reverse the signs of everything, then keep only numbers greater than 5, then does this list go in ascending order.


Take a list of integers; negate each, then filter for numbers above 5, then check if the list is in ascending order.


Take a list of integers; reverse the signs of everything, then give me values where x is greater than 5, then is the list sorted.


Take a list of integers; negate each, then show me only the values that are bigger than five, then is it sorted.


Take a list of integers; reverse the signs of everything, then keep values greater than five, then check if values are in increasing order.


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


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


Take a list of integers; drop the first element, then flip the sign of each, then true if at least one even value.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then any even.


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


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


Take a list of integers; keep the odd numbers, then cut the list at the first zero, then drop non-positive values.


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


Take a list of integers; keep the odd numbers, then take values up to (excluding) the first zero, then filter out the negative ones.


Take a list of integers; odd numbers only, then keep the part before the first 0, then remove all negative values.


Take a list of integers; keep the odd numbers, then truncate at the first zero, then keep positive values only.


Take a list of integers; odd numbers only, then delete everything starting with the first zero, then keep values above zero.


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


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


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


Take a list of people records (name, age); show me all ages, then get the negative numbers, then filter out the odd numbers.


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


Take a list of people records (name, age); get the age field, then get the negative numbers, then filter out the odd numbers.


Take a list of people records (name, age); keep just each person's age, then keep values below zero, then drop the odd numbers.


Take a list of people records (name, age); extract age values, then get the negative numbers, then filter out the odd numbers.


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


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


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


Take a list of integers; take out the first and last items, then double each item in the list, then drop all positive numbers.


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


Take a list of integers; trim the edges, then double each item in the list, then drop all positive numbers.


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


Take a list of integers; cut off the first and last, then double each item in the list, then drop all positive numbers.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = [x * 2 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 double each, then keep the negative numbers.


Take a list of strings; drop duplicate strings keeping the first, then keep only strings of length 3 or more, then true if a blank string is present.


Take a list of strings; dedupe, then get rid of short ones, then check for empty strings in the list.


Take a list of strings; remove duplicate strings keep first, then remove strings with less than three characters, then check if there's an empty string.


Take a list of strings; remove repeating strings first one stays, then remove all strings under three characters in length, then does the collection contain an empty string value somewhere.


Take a list of strings; delete duplicate strings keep the first one, then filter out short strings under three chars, then whether any element is blank.


Take a list of strings; deduplicate the strings, then drop strings shorter than three characters, then check for an empty string.


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


Take a list of strings; drop duplicate strings keeping the first, then drop strings shorter than three characters, then return whether any string is empty.


Take a list of strings; drop strings shorter than three characters, then strip spaces around each string, then prepend a hash mark to each.


Take a list of strings; eliminate strings below length three, then remove leading and trailing spaces, then prefix all with #.


Take a list of strings; remove short strings (under 3 chars), then remove whitespace from each item, then prepend a hash mark to each.


Take a list of strings; only keep strings with three or more characters, then clean whitespace from each entry, then prefix all with #.


Take a list of strings; keep only strings that are at least three characters long, then trim each string, then prepend a hash mark to each.


Take a list of strings; filter strings shorter than 3 chars, then trim whitespace from each, then prefix all with #.


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


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


Take a list of integers; square each, then flip the list around, then keep only numbers above 5.


Take a list of integers; each value squared, then flip the order around, then exclude values of 5 and below.


Take a list of integers; multiply each value by itself, then put the elements backwards, then remove anything 5 or less.


Take a list of integers; square them all, then reverse that for me, then filter to keep only values above 5.


Take a list of integers; raise each to the power of two, then flip it backwards, then get rid of values that aren't greater than five.


Take a list of integers; I need each number multiplied by itself, then make it backwards, then drop anything 5 or below.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then take values up to (excluding) the first zero.


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


Take a list of integers; keep the even numbers, then filter for numbers above 5, then truncate at the first zero.


Take a list of integers; keep evens, then give me values where x is greater than 5, then delete everything starting with the first zero.


Take a list of integers; keep the even numbers, then show me only the values that are bigger than five, then remove from the first zero onwards.


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


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 0]
    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; keep the even numbers, then keep values greater than five, then keep everything before the first zero.


Take a list of integers; cap each value at 10, then keep values below zero, then reduce each by one.


Take a list of integers; clip values at 10, then get the negative numbers, then Subtract 1 from all.


Take a list of integers; cap each value at 10, then keep values below zero, then Subtract one from each.


Take a list of integers; clip values at 10, then get the negative numbers, then Drop each by one.


Take a list of integers; cap each value at 10, then keep values below zero, then Decrease all values by one.


Take a list of integers; clip values at 10, then get the negative numbers, then Remove one from each value.


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


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


Take a list of integers; sort descending, then keep values below zero, then bump each up by one.


Take a list of integers; sort largest first, then get the negative numbers, then increment each item.


Take a list of integers; sort in descending order, then keep values below zero, then bump each up by one.


Take a list of integers; sort from greatest to least, then get the negative numbers, then increment each item.


Take a list of integers; sort z to a, then keep values below zero, then bump each up by one.


Take a list of integers; arrange in decreasing order, then get the negative numbers, then increment each item.


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


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


Take a list of integers; add ten to each, then flip the list around, then make each twice as big.


Take a list of integers; bump everything up by 10, then flip the order around, then multiply each by 2.


Take a list of integers; increase every value by 10, then put the elements backwards, then make each twice as big.


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


Take a list of integers; shift each up by ten, then flip it backwards, then make each twice as big.


Take a list of integers; increase all numbers by 10, then make it backwards, then multiply each by 2.


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


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


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


Take a list of integers; times two for each item, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; double each, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; times two for each item, then arrange by absolute value ascending, then fetch the first even element, default to 0.


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


Take a list of integers; times two for each item, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop the first element, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; Take everything except the first, then when the list is empty, substitute a zero value, then increment each item.


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


Take a list of integers; Take everything except the first, then zero it out if it's empty, then increment each item.


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


Take a list of integers; Take everything except the first, then default to zero when empty, then increment each item.


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


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


Take a list of integers; drop the first element, then increase every value by 10, then bump each up by one.


Take a list of integers; Take everything except the first, then add 10 to each item, then increment each item.


Take a list of integers; drop the first element, then shift each up by ten, then bump each up by one.


Take a list of integers; Take everything except the first, then increase all numbers by 10, then increment each item.


Take a list of integers; drop the first element, then add 10 to everything, then bump each up by one.


Take a list of integers; Take everything except the first, then give everything a boost of 10, then increment each item.


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


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


Take a list of people records (name, age); extract the ages, then keep values below zero, then deduplicate the list.


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


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


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


Take a list of people records (name, age); keep just each person's age, then keep values below zero, then deduplicate the list.


Take a list of people records (name, age); extract age values, then get the negative numbers, then remove repeats.


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


Take a list of people records (name, age); extract the ages, then keep the negative numbers, then drop duplicates keeping first occurrence.


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


Take a list of integers; Decrement all items, then exclude zeros, then find how many values are divisible by two.


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


Take a list of integers; Lower each number by one, then exclude zeros, then get the total number of even values in the list.


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


Take a list of integers; Subtract 1 from all, then exclude zeros, then I need to know how many of these are even.


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


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


Take a list of integers; add one to each, then take the first 3 elements, then deduplicate the list.


Take a list of integers; make each one bigger, then remove everything after the third, then remove repeats.


Take a list of integers; add one to each, then truncate to three items, then deduplicate the list.


Take a list of integers; make each one bigger, then show the first three, then remove repeats.


Take a list of integers; add one to each, then take the first three, then deduplicate the list.


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


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


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


Take a list of integers; double each, then cut the list at the first zero, then stop at the first non-positive value.


Take a list of integers; times two for each item, then cut off after the first zero appears, then keep the leading run of positive numbers.


Take a list of integers; double each, then take values up to (excluding) the first zero, then take values while they are positive.


Take a list of integers; times two for each item, then keep the part before the first 0, then take positive values then stop.


Take a list of integers; double each, then truncate at the first zero, then keep going while positive.


Take a list of integers; times two for each item, then delete everything starting with the first zero, then stop at first non positive.


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


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


Take a list of integers; reverse the order, then take the first 3 elements, then strip the signs.


Take a list of integers; reverse, then remove everything after the third, then take abs of each.


Take a list of integers; flip the list around, then truncate to three items, then get the absolute value of everything.


Take a list of integers; flip the order around, then show the first three, then apply absolute value to the whole list.


Take a list of integers; put the elements backwards, then take the first three, then make them all positive.


Take a list of integers; reverse that for me, then keep first 3, then make every value non-negative.


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


Take a list of integers; reverse the order, then keep only the first three, then take the absolute value of each.


Take a list of integers; add one to each, then decrement each value, then give back the product of all values.


Take a list of integers; make each one bigger, then Lower each number by one, then product of the list.


Take a list of integers; add one to each, then reduce each by one, then what's the product.


Take a list of integers; make each one bigger, then Subtract 1 from all, then what do they multiply to.


Take a list of integers; add one to each, then Subtract one from each, then give me their product.


Take a list of integers; make each one bigger, then Drop each by one, then multiply them all together.


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


Take a list of integers; add one to each, then subtract one from each, then return their product.


Take a list of integers; pad with zeros to at least three elements, then sort largest to smallest, then arrange in increasing order.


Take a list of integers; add zeros until the list has at least three values, then sort by descending values, then Organize these ascending.


Take a list of integers; pad with zeros to at least three elements, then sort from highest to lowest, then Sort in ascending order.


Take a list of integers; add zeros until the list has at least three values, then sort descending, then I need this sorted ascending.


Take a list of integers; pad with zeros to at least three elements, then sort largest first, then Put these in ascending order.


Take a list of integers; add zeros until the list has at least three values, then sort in descending order, then sort smallest to largest.


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


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


Take a list of integers; take the absolute value of each, then keep the leading run of positive numbers, then arrange in increasing order.


Take a list of integers; convert to absolute value, then take values while they are positive, then Organize these ascending.


Take a list of integers; strip the signs, then take positive values then stop, then Sort in ascending order.


Take a list of integers; take abs of each, then keep going while positive, then I need this sorted ascending.


Take a list of integers; get the absolute value of everything, then stop at first non positive, then Put these in ascending order.


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


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


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


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


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


Take a list of integers; keep values divisible by 3, then trim one element off each end, then give the earliest even value or zero.


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


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


Take a list of integers; filter out everything except multiples of three, then keep only the middle part, then fetch the first even element, default to 0.


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


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


Take a list of integers; add one to each, then keep values below zero, then shift each up by ten.


Take a list of integers; make each one bigger, then get the negative numbers, then increase all numbers by 10.


Take a list of integers; add one to each, then keep values below zero, then add 10 to everything.


Take a list of integers; make each one bigger, then get the negative numbers, then give everything a boost of 10.


Take a list of integers; add one to each, then keep values below zero, then increment each by ten.


Take a list of integers; make each one bigger, then get the negative numbers, then add a constant 10 to each.


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


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


Take a list of integers; keep values greater than five, then keep only even values, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then extract all even numbers, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then keep only even values, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then extract all even numbers, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then keep only even values, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then extract all even numbers, then sort smallest to largest.


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


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


Take a list of integers; keep the negative numbers, then flip the sign of each, then take values up to (excluding) the first zero.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then keep the part before the first 0.


Take a list of integers; keep the negative numbers, then flip the sign of each, then truncate at the first zero.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then delete everything starting with the first zero.


Take a list of integers; keep the negative numbers, then flip the sign of each, then remove from the first zero onwards.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then up to but not including the first zero.


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


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


Take a list of integers; double each, then keep only odd values, then give the earliest even value or zero.


Take a list of integers; times two for each item, then eliminate the even numbers, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep the odd numbers, then multiply each value by itself, then drop non-positive values.


Take a list of integers; odd numbers only, then square them all, then drop the negative numbers.


Take a list of integers; keep the odd numbers, then raise each to the power of two, then filter out the negative ones.


Take a list of integers; odd numbers only, then I need each number multiplied by itself, then remove all negative values.


Take a list of integers; keep the odd numbers, then square all of them, then keep positive values only.


Take a list of integers; odd numbers only, then multiply each element by itself, then keep values above zero.


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


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


Take a list of integers; add ten to each, then keep only even values, then give the number of evens.


Take a list of integers; bump everything up by 10, then extract all even numbers, then find how many values are divisible by two.


Take a list of integers; increase every value by 10, then keep only even values, then how many are even.


Take a list of integers; add 10 to each item, then extract all even numbers, then get the total number of even values in the list.


Take a list of integers; shift each up by ten, then keep only even values, then give me the count of even values.


Take a list of integers; increase all numbers by 10, then extract all even numbers, then I need to know how many of these are even.


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


Take a list of integers; add ten to each, then keep the even numbers, then return how many values are even.


Take a list of integers; cap each value at 10, then take the final 3 elements, then drop the even numbers.


Take a list of integers; clip values at 10, then drop everything except the final three, then strip out the evens.


Take a list of integers; cap each value at 10, then give me the last three elements, then drop the even numbers.


Take a list of integers; clip values at 10, then keep only the last three, then strip out the evens.


Take a list of integers; cap each value at 10, then keep the final three items, then drop the even numbers.


Take a list of integers; clip values at 10, then take the last three, then strip out the evens.


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


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


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


Take a list of integers; take only what comes before the initial zero, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; cut off after the first zero appears, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take values up to (excluding) the first zero, then remove repeated values, then ensure at least three items by appending zeros.


Take a list of integers; keep the part before the first 0, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take values while they are positive, then cut the list at the first zero, then bump each up by one.


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


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


Take a list of integers; stop at first non positive, then keep the part before the first 0, then increment each item.


Take a list of integers; take while greater than zero, then truncate at the first zero, then bump each up by one.


Take a list of integers; take values while positive, then delete everything starting with the first zero, then increment each item.


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


Take a list of integers; take values while they are positive, then keep everything before the first zero, then add one to each.


Take a list of integers; add ten to each, then keep the leading run of positive numbers, then drop non-positive values.


Take a list of integers; bump everything up by 10, then take values while they are positive, then drop the negative numbers.


Take a list of integers; increase every value by 10, then take positive values then stop, then filter out the negative ones.


Take a list of integers; add 10 to each item, then keep going while positive, then remove all negative values.


Take a list of integers; shift each up by ten, then stop at first non positive, then keep positive values only.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then keep values above zero.


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


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


Take a list of integers; keep multiples of three, then drop anything 5 or below, then drop non-negative values.


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


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then drop non-negative values.


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


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then drop non-negative values.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then drop all positive numbers.


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


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


Take a list of integers; sort by absolute value, then cut the list at the first zero, then bump each up by one.


Take a list of integers; rearrange by distance from zero, then cut off after the first zero appears, then increment each item.


Take a list of integers; arrange by magnitude ignoring sign, then take values up to (excluding) the first zero, then bump each up by one.


Take a list of integers; put them in order by magnitude, then keep the part before the first 0, then increment each item.


Take a list of integers; arrange in order of absolute value, then truncate at the first zero, then bump each up by one.


Take a list of integers; sort by distance from zero, then delete everything starting with the first zero, then increment each item.


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


Take a list of integers; sort by absolute value, then keep everything before the first zero, then add one to each.


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


Take a list of integers; sort largest first, then take values while they are positive, then check for zero.


Take a list of integers; sort in descending order, then take positive values then stop, then true if any value equals zero.


Take a list of integers; sort from greatest to least, then keep going while positive, then check for zero.


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


Take a list of integers; arrange in decreasing order, then take while greater than zero, then check for zero.


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


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


Take a list of integers; cap each value at 10, then skip negatives at the start, then truncate to three items.


Take a list of integers; clip values at 10, then remove all negatives at the front, then show the first three.


Take a list of integers; cap each value at 10, then remove the initial run of negative numbers, then take the first three.


Take a list of integers; clip values at 10, then strip the front negatives, then keep first 3.


Take a list of integers; cap each value at 10, then remove leading negative numbers, then truncate to first three.


Take a list of integers; clip values at 10, then drop negatives from start, then first three.


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


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


Take a list of integers; negate each, then keep values below zero, then stop at the first non-positive value.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then keep the leading run of positive numbers.


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


Take a list of integers; reverse the signs of everything, then get the negative numbers, then take positive values then stop.


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


Take a list of integers; reverse the signs of everything, then get the negative numbers, then stop at first non positive.


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


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


Take a list of integers; convert to absolute value, then square them all, then filter out the odd numbers.


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


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


Take a list of integers; get the absolute value of everything, then square all of them, then drop the odd numbers.


Take a list of integers; apply absolute value to the whole list, then multiply each element by itself, then filter out the odd numbers.


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


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


Take a list of integers; keep the positive numbers, then decrement each value, then make each twice as big.


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


Take a list of integers; drop non-positive values, then reduce each by one, then make each twice as big.


Take a list of integers; drop the negative numbers, then Subtract 1 from all, then multiply each by 2.


Take a list of integers; filter out the negative ones, then Subtract one from each, then make each twice as big.


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


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


Take a list of integers; keep the positive numbers, then subtract one from each, then double each.


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


Take a list of integers; take positive values then stop, then plus one for all, then strip out the evens.


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


Take a list of integers; stop at first non positive, then plus one for all, then strip out the evens.


Take a list of integers; take while greater than zero, then increment each value, then drop the even numbers.


Take a list of integers; take values while positive, then plus one for all, then strip out the evens.


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


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


Take a list of integers; keep the negative numbers, then increment each value, then drop non-positive values.


Take a list of integers; extract negatives, then plus one for all, then drop the negative numbers.


Take a list of integers; keep the negative numbers, then increment each value, then filter out the negative ones.


Take a list of integers; extract negatives, then plus one for all, then remove all negative values.


Take a list of integers; keep the negative numbers, then increment each value, then keep positive values only.


Take a list of integers; extract negatives, then plus one for all, then keep values above zero.


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


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


Take a list of integers; keep only the last three, then increment each value, then reduce each by one.


Take a list of integers; keep the final three items, then plus one for all, then Subtract 1 from all.


Take a list of integers; take the last three, then increment each value, then Subtract one from each.


Take a list of integers; trim to the last three, then plus one for all, then Drop each by one.


Take a list of integers; last three only, then increment each value, then Decrease all values by one.


Take a list of integers; truncate to the last three items, then plus one for all, then Remove one from each value.


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


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


Take a list of integers; drop the first element, then keep only even values, then put the elements backwards.


Take a list of integers; Take everything except the first, then extract all even numbers, then reverse that for me.


Take a list of integers; drop the first element, then keep only even values, then flip it backwards.


Take a list of integers; Take everything except the first, then extract all even numbers, then make it backwards.


Take a list of integers; drop the first element, then keep only even values, then reverse the list.


Take a list of integers; Take everything except the first, then extract all even numbers, then invert the sequence.


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


Take a list of integers; drop the first element, then keep the even numbers, then reverse the order.


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then limit every value to 10.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then maximum of 10 for all.


Take a list of integers; strip the signs, then filter for numbers above 5, then limit every value to 10.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then maximum of 10 for all.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then limit every value to 10.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then maximum of 10 for all.


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


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


Take a list of integers; sort descending, then keep the leading run of positive numbers, then arrange in increasing order.


Take a list of integers; sort largest first, then take values while they are positive, then Organize these ascending.


Take a list of integers; sort in descending order, then take positive values then stop, then Sort in ascending order.


Take a list of integers; sort from greatest to least, then keep going while positive, then I need this sorted ascending.


Take a list of integers; sort z to a, then stop at first non positive, then Put these in ascending order.


Take a list of integers; arrange in decreasing order, then take while greater than zero, then sort smallest to largest.


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


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


Take a list of strings; keep the first character of each (dropping empties), then convert each to lower case, then remove surrounding whitespace.


Take a list of strings; extract initial letters, then lowercase each one, then trim the whitespace off everything.


Take a list of strings; take each string's first letter, then convert each to lower case, then strip spaces from all strings.


Take a list of strings; give me the first letter of everything, then lowercase each one, then strip all the strings.


Take a list of strings; reduce each string to its first character, then convert each to lower case, then clean up whitespace in the list.


Take a list of strings; take first char drop blanks, then lowercase each one, then strip spaces around each string.


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


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


Take a list of integers; keep values greater than five, then flip the sign of each, then strip the signs.


Take a list of integers; filter out values less than or equal to 5, then turn positives to negatives and vice versa, then take abs of each.


Take a list of integers; keep only numbers above 5, then flip the sign of each, then get the absolute value of everything.


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then apply absolute value to the whole list.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then make them all positive.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then make every value non-negative.


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


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


Take a list of integers; square each, then skip negatives at the start, then deduplicate the list.


Take a list of integers; each value squared, then remove all negatives at the front, then remove repeats.


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


Take a list of integers; square them all, then strip the front negatives, then remove repeats.


Take a list of integers; raise each to the power of two, then remove leading negative numbers, then deduplicate the list.


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then remove repeats.


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 = list(dict.fromkeys(r))
    return r


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


Take a list of strings; trim whitespace from each, then keep only strings of length 3 or more, then return the number of strings.


Take a list of strings; strip whitespace from every element, then get rid of short ones, then count the strings.


Take a list of strings; remove surrounding whitespace, then remove strings with less than three characters, then return how many strings remain.


Take a list of strings; trim the whitespace off everything, then remove all strings under three characters in length, then give me the total number of strings.


Take a list of strings; strip spaces from all strings, then filter out short strings under three chars, then tell me how many strings we have.


Take a list of strings; strip all the strings, then drop strings shorter than three characters, then what's the string count.


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


Take a list of strings; trim whitespace from each, then drop strings shorter than three characters, then return how many strings remain.


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


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


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then remove anything 5 or less.


Take a list of integers; square them all, then sort descending, then filter to keep only values above 5.


Take a list of integers; raise each to the power of two, then sort largest first, then get rid of values that aren't greater than five.


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


def solve(xs):
    r = list(xs)
    r = [x * x 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; square each, then sort descending, then keep values greater than five.


Take a list of strings; keep the first character of each (dropping empties), then order the strings A to Z, then make every string uppercase.


Take a list of strings; extract initial letters, then make it alphabetical, then uppercase each one.


Take a list of strings; take each string's first letter, then order the strings A to Z, then make all the strings uppercase.


Take a list of strings; give me the first letter of everything, then make it alphabetical, then convert all strings to uppercase letters.


Take a list of strings; reduce each string to its first character, then order the strings A to Z, then convert to uppercase.


Take a list of strings; take first char drop blanks, then make it alphabetical, then i need these in uppercase.


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


Take a list of strings; keep the first character of each (dropping empties), then sort alphabetically, then uppercase each string.


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


Take a list of integers; clip values at 10, then add 10 to each item, then does this list go in ascending order.


Take a list of integers; cap each value at 10, then shift each up by ten, then check if the list is in ascending order.


Take a list of integers; clip values at 10, then increase all numbers by 10, then is the list sorted.


Take a list of integers; cap each value at 10, then add 10 to everything, then is it sorted.


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


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


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


Take a list of integers; keep only the last three, then increase every value by 10, then keep only non-zero numbers.


Take a list of integers; keep the final three items, then add 10 to each item, then strip the zeros.


Take a list of integers; take the last three, then shift each up by ten, then keep only non-zero numbers.


Take a list of integers; trim to the last three, then increase all numbers by 10, then strip the zeros.


Take a list of integers; last three only, then add 10 to everything, then keep only non-zero numbers.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then strip the zeros.


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


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


Take a list of integers; drop the first and last elements, then keep values above zero, then shift each up by ten.


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


Take a list of integers; remove both ends, then keep only positive numbers, then add 10 to everything.


Take a list of integers; trim the edges, then keep the positives, then give everything a boost of 10.


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


Take a list of integers; cut off the first and last, then keep the positive numbers, then add a constant 10 to each.


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


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


Take a list of strings; sort by length, shortest first, then take each string's first letter, then deduplicate the strings.


Take a list of strings; sort ascending by length, then give me the first letter of everything, then filter out duplicate strings retain first.


Take a list of strings; order strings from shortest to longest, then reduce each string to its first character, then strip duplicates preserve order.


Take a list of strings; shortest to longest, then take first char drop blanks, then remove repeated strings.


Take a list of strings; arrange by string length ascending, then keep first letters only, then keep unique strings first appearance.


Take a list of strings; length sort, then first letter from each item that isn't empty, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; sort by length, shortest first, then keep the first character of each (dropping empties), then drop duplicate strings keeping the first.


Take a list of strings; trim whitespace from each, then order strings from shortest to longest, then find how long the longest string is.


Take a list of strings; strip whitespace from every element, then shortest to longest, then give the length of the longest string in the list.


Take a list of strings; remove surrounding whitespace, then arrange by string length ascending, then get me the longest string's length.


Take a list of strings; trim the whitespace off everything, then length sort, then give the maximum string length.


Take a list of strings; strip spaces from all strings, then sort by length shortest first, then max length of all strings.


Take a list of strings; strip all the strings, then organize by string length least to greatest, then what's the max string length.


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


Take a list of strings; trim whitespace from each, then sort by length, shortest first, then return the length of the longest string (0 if none).


Take a list of integers; sort descending, then order by distance from zero, then remove the initial run of negative numbers.


Take a list of integers; sort largest first, then sort based on absolute value, then strip the front negatives.


Take a list of integers; sort in descending order, then organize by magnitude, then remove leading negative numbers.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending, then drop negatives from start.


Take a list of integers; sort z to a, then sort from smallest to largest absolute value, then strip negative values from the start.


Take a list of integers; arrange in decreasing order, then sort by absolute value, then remove negatives before the first non-negative.


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


Take a list of integers; subtract one from each, then flip the list around, then make each twice as big.


Take a list of integers; Decrement all items, then flip the order around, then multiply each by 2.


Take a list of integers; decrement each value, then put the elements backwards, then make each twice as big.


Take a list of integers; Lower each number by one, then reverse that for me, then multiply each by 2.


Take a list of integers; reduce each by one, then flip it backwards, then make each twice as big.


Take a list of integers; Subtract 1 from all, then make it backwards, then multiply each by 2.


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


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


Take a list of integers; sort ascending, then order by distance from zero, then drop non-positive values.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then drop the negative numbers.


Take a list of integers; arrange in increasing order, then organize by magnitude, then filter out the negative ones.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then remove all negative values.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then keep positive values only.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then keep values above zero.


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


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


Take a list of integers; drop the first and last elements, then remove all zero values, then find the min, defaulting to 0.


Take a list of integers; take out the first and last items, then exclude zeros, then minimum value, zero otherwise.


Take a list of integers; remove both ends, then remove all zero values, then get the minimum value or zero if empty.


Take a list of integers; trim the edges, then exclude zeros, then give me the min or 0.


Take a list of integers; trim one element off each end, then remove all zero values, then return the smallest number, defaulting to 0.


Take a list of integers; cut off the first and last, then exclude zeros, then return smallest or zero if empty.


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


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


Take a list of integers; keep the negative numbers, then skip negatives at the start, then skip the first one.


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


Take a list of integers; keep the negative numbers, then remove the initial run of negative numbers, then skip the first one.


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


Take a list of integers; keep the negative numbers, then remove leading negative numbers, then skip the first one.


Take a list of integers; extract negatives, then drop negatives from start, then Discard the first element.


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


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


Take a list of integers; double each, then remove the first item, then drop the odd numbers.


Take a list of integers; times two for each item, then Remove head, then filter out the odd numbers.


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


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


Take a list of integers; negate each, then make every value non-negative, then stop at the first non-positive value.


Take a list of integers; reverse the signs of everything, then absolute value for all items, then keep the leading run of positive numbers.


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


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then take positive values then stop.


Take a list of integers; negate each, then abs each element, then keep going while positive.


Take a list of integers; reverse the signs of everything, then take the absolute value of each, then stop at first non positive.


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


Take a list of integers; negate each, then take the absolute value of each, then take values while they are positive.


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


Take a list of integers; take positive values then stop, then add 10 to each item, then negate.


Take a list of integers; keep going while positive, then shift each up by ten, then multiply each by -1.


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


Take a list of integers; take while greater than zero, then add 10 to everything, then multiply each by -1.


Take a list of integers; take values while positive, then give everything a boost of 10, then negate.


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


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


Take a list of integers; add one to each, then keep values below zero, then skip the first one.


Take a list of integers; make each one bigger, then get the negative numbers, then Discard the first element.


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


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


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


Take a list of integers; Sort it from low to high, then double each item in the list, then strip the zeros.


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


Take a list of integers; Organize these ascending, then double each item in the list, then strip the zeros.


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


Take a list of integers; I need this sorted ascending, then double each item in the list, then strip the zeros.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then true if every value is unique.


Take a list of integers; keep evens, then keep only numbers greater than 5, then check for duplicates in the values.


Take a list of integers; keep the even numbers, then filter for numbers above 5, then do all values appear only once.


Take a list of integers; keep evens, then give me values where x is greater than 5, then check that there are no duplicates.


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


Take a list of integers; keep evens, then keep values greater than five, then check if all values are unique.


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


Take a list of integers; keep the even numbers, then keep values greater than five, then return whether all values are distinct.


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then arrange in decreasing order.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then arrange in descending order.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then reverse sort.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then sort largest to smallest.


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


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then sort from highest to lowest.


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


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


Take a list of integers; sort ascending, then default to [0] when there is nothing, then keep only non-zero numbers.


Take a list of integers; Sort it from low to high, then when the list is empty, substitute a zero value, then strip the zeros.


Take a list of integers; arrange in increasing order, then replace an empty list with one zero, then keep only non-zero numbers.


Take a list of integers; Organize these ascending, then zero it out if it's empty, then strip the zeros.


Take a list of integers; Sort in ascending order, then use zero if the list is empty, then keep only non-zero numbers.


Take a list of integers; I need this sorted ascending, then default to zero when empty, then strip the zeros.


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


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


Take a list of integers; keep values greater than five, then flip the list around, then truncate to three items.


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


Take a list of integers; keep only numbers above 5, then put the elements backwards, then take the first three.


Take a list of integers; exclude values of 5 and below, then reverse that for me, then keep first 3.


Take a list of integers; remove anything 5 or less, then flip it backwards, then truncate to first three.


Take a list of integers; filter to keep only values above 5, then make it backwards, then first three.


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