Take a list of integers; double each, then negate each, then drop duplicates keeping first occurrence.


Take a list of integers; take the absolute value of each, then order by distance from zero, then truncate to the last three items.


Take a list of integers; convert to absolute value, then sort based on absolute value, then show only the last three.


Take a list of integers; strip the signs, then organize by magnitude, then remove all but the last three.


Take a list of integers; take abs of each, then arrange by absolute value ascending, then take the final 3 elements.


Take a list of integers; get the absolute value of everything, then sort from smallest to largest absolute value, then drop everything except the final three.


Take a list of integers; apply absolute value to the whole list, then sort by absolute value, then give me the last three elements.


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


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


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


Take a list of integers; make each one bigger, then Ascending sort, then increase all numbers by 10.


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


Take a list of integers; make each one bigger, then Sort lowest to highest, then give everything a boost of 10.


Take a list of integers; add one to each, then Arrange from smallest to largest, then increment each by ten.


Take a list of integers; make each one bigger, then sort ascending, then add a constant 10 to each.


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


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


Take a list of people records (name, age); extract the ages, then drop anything 5 or below, then shift each up by ten.


Take a list of people records (name, age); show me all ages, then keep only numbers greater than 5, then increase all numbers by 10.


Take a list of people records (name, age); pluck the age field from each record, then filter for numbers above 5, then add 10 to everything.


Take a list of people records (name, age); get the age field, then give me values where x is greater than 5, then give everything a boost of 10.


Take a list of people records (name, age); keep just each person's age, then show me only the values that are bigger than five, then increment each by ten.


Take a list of people records (name, age); extract age values, then keep values greater than five, then add a constant 10 to each.


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


Take a list of people records (name, age); extract the ages, then keep values greater than five, then add ten to each.


Take a list of integers; keep values greater than five, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; filter out values less than or equal to 5, then pad to 3, then drop all positive numbers.


Take a list of integers; keep only numbers above 5, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; exclude values of 5 and below, then pad to 3, then drop all positive numbers.


Take a list of integers; remove anything 5 or less, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; filter to keep only values above 5, then pad to 3, then drop all positive numbers.


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


Take a list of integers; keep values greater than five, then pad with zeros to at least three elements, then keep the negative numbers.


Take a list of integers; sort by absolute value, then take the first 3 elements, then truncate to the last three items.


Take a list of integers; rearrange by distance from zero, then remove everything after the third, then show only the last three.


Take a list of integers; arrange by magnitude ignoring sign, then truncate to three items, then remove all but the last three.


Take a list of integers; put them in order by magnitude, then show the first three, then take the final 3 elements.


Take a list of integers; arrange in order of absolute value, then take the first three, then drop everything except the final three.


Take a list of integers; sort by distance from zero, then keep first 3, then give me the last three elements.


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


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


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


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


Take a list of strings; remove blanks, then remove strings with less than three characters, then keep first letters only.


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


Take a list of strings; filter out blank strings, then filter out short strings under three chars, then grab the first char from each.


Take a list of strings; remove strings that are empty, then drop strings shorter than three characters, then isolate the first character per entry.


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


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


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


Take a list of integers; take out the first and last items, then double each item in the list, then strip the front negatives.


Take a list of integers; remove both ends, then multiply each by two, then remove leading negative numbers.


Take a list of integers; trim the edges, then double each item in the list, then drop negatives from start.


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


Take a list of integers; cut off the first and last, then double each item in the list, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep only the last three, then decrement each value, then keep only non-zero numbers.


Take a list of integers; keep the final three items, then Lower each number by one, then strip the zeros.


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


Take a list of integers; trim to the last three, then Subtract 1 from all, then strip the zeros.


Take a list of integers; last three only, then Subtract one from each, then keep only non-zero numbers.


Take a list of integers; truncate to the last three items, then Drop each by one, then strip the zeros.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    r = [x - 1 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 subtract one from each, then drop the zeros.


Take a list of integers; keep values greater than five, then order by distance from zero, then true if at least one even value.


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value, then any even.


Take a list of integers; keep only numbers above 5, then organize by magnitude, then true if at least one even value.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending, then any even.


Take a list of integers; remove anything 5 or less, then sort from smallest to largest absolute value, then true if at least one even value.


Take a list of integers; filter to keep only values above 5, then sort by absolute value, then any even.


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


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


Take a list of integers; sort ascending, then flip the list around, then replace an empty list with one zero.


Take a list of integers; Sort it from low to high, then flip the order around, then zero it out if it's empty.


Take a list of integers; arrange in increasing order, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; Organize these ascending, then reverse that for me, then default to zero when empty.


Take a list of integers; Sort in ascending order, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; I need this sorted ascending, then make it backwards, then if no items, add a zero.


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


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


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


Take a list of integers; keep the first 3 items, then when the list is empty, substitute a zero value, then find how many values are divisible by two.


Take a list of integers; take the first 3 elements, then replace an empty list with one zero, then how many are even.


Take a list of integers; remove everything after the third, then zero it out if it's empty, then get the total number of even values in the list.


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


Take a list of integers; show the first three, then default to zero when empty, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then find the min, defaulting to 0.


Take a list of integers; Sort it from low to high, then pad to 3, then minimum value, zero otherwise.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then get the minimum value or zero if empty.


Take a list of integers; Organize these ascending, then pad to 3, then give me the min or 0.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then return the smallest number, defaulting to 0.


Take a list of integers; I need this sorted ascending, then pad to 3, then return smallest or zero if empty.


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


Take a list of integers; sort ascending, then pad with zeros to at least three elements, then return the minimum (0 if empty).


Take a list of integers; sort ascending, then remove all zero values, then shift each up by ten.


Take a list of integers; Sort it from low to high, then exclude zeros, then increase all numbers by 10.


Take a list of integers; arrange in increasing order, then remove all zero values, then add 10 to everything.


Take a list of integers; Organize these ascending, then exclude zeros, then give everything a boost of 10.


Take a list of integers; Sort in ascending order, then remove all zero values, then increment each by ten.


Take a list of integers; I need this sorted ascending, then exclude zeros, then add a constant 10 to each.


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


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


Take a list of integers; drop the leading negative values, then increment each value, then make each twice as big.


Take a list of integers; cut the leading negatives, then plus one for all, then multiply each by 2.


Take a list of integers; skip negatives at the start, then increment each value, then make each twice as big.


Take a list of integers; remove all negatives at the front, then plus one for all, then multiply each by 2.


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


Take a list of integers; strip the front negatives, then plus one for all, then multiply each by 2.


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 * 2 for x in r]
    return r


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


Take a list of integers; keep values greater than five, then keep values above zero, then replace an empty list with one zero.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then zero it out if it's empty.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then use zero if the list is empty.


Take a list of integers; exclude values of 5 and below, then keep the positives, then default to zero when empty.


Take a list of integers; remove anything 5 or less, then remove negatives, then if there's nothing, put in a zero.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers, then if no items, add a zero.


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


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


Take a list of integers; subtract one from each, then increment each value, then strip the signs.


Take a list of integers; Decrement all items, then plus one for all, then take abs of each.


Take a list of integers; decrement each value, then increment each value, then get the absolute value of everything.


Take a list of integers; Lower each number by one, then plus one for all, then apply absolute value to the whole list.


Take a list of integers; reduce each by one, then increment each value, then make them all positive.


Take a list of integers; Subtract 1 from all, then plus one for all, then make every value non-negative.


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


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


Take a list of integers; double each, then remove repeated values, then true only if all are positive.


Take a list of integers; times two for each item, then unique values preserving order, then do all of these have positive values.


Take a list of integers; double each, then remove repeated values, then check if every value is positive.


Take a list of integers; times two for each item, then unique values preserving order, then confirm all values are positive.


Take a list of integers; double each, then remove repeated values, then all positive.


Take a list of integers; times two for each item, then unique values preserving order, then check if every number is above zero.


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


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


Take a list of integers; keep multiples of three, then keep values above zero, then replace an empty list with one zero.


Take a list of integers; get rid of non-multiples of three, then filter for positive numbers, then zero it out if it's empty.


Take a list of integers; keep values divisible by 3, then keep only positive numbers, then use zero if the list is empty.


Take a list of integers; keep items where x mod 3 equals zero, then keep the positives, then default to zero when empty.


Take a list of integers; drop anything not divisible by three, then remove negatives, then if there's nothing, put in a zero.


Take a list of integers; filter out everything except multiples of three, then keep the positive numbers, then if no items, add a zero.


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


Take a list of integers; keep multiples of three, then keep the positive numbers, then if empty, use a single zero.


Take a list of integers; keep values greater than five, then decrement each value, then true only if all are positive.


Take a list of integers; filter out values less than or equal to 5, then Lower each number by one, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then reduce each by one, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then Subtract 1 from all, then confirm all values are positive.


Take a list of integers; remove anything 5 or less, then Subtract one from each, then all positive.


Take a list of integers; filter to keep only values above 5, then Drop each by one, then check if every number is above zero.


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


Take a list of integers; keep values greater than five, then subtract one from each, then return whether all values are positive.


Take a list of integers; subtract one from each, then keep values below zero, then limit every value to 10.


Take a list of integers; Decrement all items, then get the negative numbers, then maximum of 10 for all.


Take a list of integers; decrement each value, then keep values below zero, then limit every value to 10.


Take a list of integers; Lower each number by one, then get the negative numbers, then maximum of 10 for all.


Take a list of integers; reduce each by one, then keep values below zero, then limit every value to 10.


Take a list of integers; Subtract 1 from all, then get the negative numbers, then maximum of 10 for all.


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


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


Take a list of integers; drop the first element, then order by distance from zero, then drop non-negative values.


Take a list of integers; Take everything except the first, then sort based on absolute value, then drop all positive numbers.


Take a list of integers; drop the first element, then organize by magnitude, then drop non-negative values.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then drop all positive numbers.


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


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


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


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


Take a list of integers; double each, then default to [0] when there is nothing, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then when the list is empty, substitute a zero value, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; double each, then replace an empty list with one zero, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then zero it out if it's empty, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; double each, then use zero if the list is empty, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then default to zero when empty, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; double each, then if empty, use a single zero, then pad with zeros to at least three elements.


Take a list of integers; keep the positive numbers, then take the final 3 elements, then raise each to the power of two.


Take a list of integers; get rid of anything that's not positive, then drop everything except the final three, then I need each number multiplied by itself.


Take a list of integers; drop non-positive values, then give me the last three elements, then square all of them.


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


Take a list of integers; filter out the negative ones, then keep the final three items, then make each one squared.


Take a list of integers; remove all negative values, then take the last three, then square each value in the list.


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


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


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


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then any even.


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


Take a list of integers; cap each value at 10, then negate each, then return whether any value is even.


Take a list of integers; sort descending, then keep only even values, then strip the signs.


Take a list of integers; sort largest first, then extract all even numbers, then take abs of each.


Take a list of integers; sort in descending order, then keep only even values, then get the absolute value of everything.


Take a list of integers; sort from greatest to least, then extract all even numbers, then apply absolute value to the whole list.


Take a list of integers; sort z to a, then keep only even values, then make them all positive.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then make every value non-negative.


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


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


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


Take a list of integers; reverse the signs of everything, then filter for positive numbers, then strip out the evens.


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


Take a list of integers; reverse the signs of everything, then keep the positives, then strip out the evens.


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


Take a list of integers; reverse the signs of everything, then keep the positive numbers, then strip out the evens.


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


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


Take a list of integers; keep values greater than five, then multiply each by two, then stop at the first non-positive value.


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


Take a list of integers; keep only numbers above 5, then multiply each by two, then take values while they are positive.


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


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


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


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


Take a list of integers; keep values greater than five, then double each, then take values while they are positive.


Take a list of people records (name, age); extract the ages, then decrement each value, then limit every value to 10.


Take a list of people records (name, age); show me all ages, then Lower each number by one, then maximum of 10 for all.


Take a list of people records (name, age); pluck the age field from each record, then reduce each by one, then limit every value to 10.


Take a list of people records (name, age); get the age field, then Subtract 1 from all, then maximum of 10 for all.


Take a list of people records (name, age); keep just each person's age, then Subtract one from each, then limit every value to 10.


Take a list of people records (name, age); extract age values, then Drop each by one, then maximum of 10 for all.


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


Take a list of people records (name, age); extract the ages, then subtract one from each, then cap each value at 10.


Take a list of integers; drop the first and last elements, then take the first 3 elements, then true only if all are positive.


Take a list of integers; take out the first and last items, then remove everything after the third, then do all of these have positive values.


Take a list of integers; remove both ends, then truncate to three items, then check if every value is positive.


Take a list of integers; trim the edges, then show the first three, then confirm all values are positive.


Take a list of integers; trim one element off each end, then take the first three, then all positive.


Take a list of integers; cut off the first and last, then keep first 3, then check if every number is above zero.


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


Take a list of integers; drop the first and last elements, then keep only the first three, then return whether all values are positive.


Take a list of integers; take values while they are positive, then keep only even values, then keep only numbers above 5.


Take a list of integers; take positive values then stop, then extract all even numbers, then exclude values of 5 and below.


Take a list of integers; keep going while positive, then keep only even values, then remove anything 5 or less.


Take a list of integers; stop at first non positive, then extract all even numbers, then filter to keep only values above 5.


Take a list of integers; take while greater than zero, then keep only even values, then get rid of values that aren't greater than five.


Take a list of integers; take values while positive, then extract all even numbers, then drop anything 5 or below.


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


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


Take a list of integers; negate each, then keep values divisible by 3, then replace an empty list with one zero.


Take a list of integers; reverse the signs of everything, then keep items where x mod 3 equals zero, then zero it out if it's empty.


Take a list of integers; negate each, then drop anything not divisible by three, then use zero if the list is empty.


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


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


Take a list of integers; reverse the signs of everything, then multiples of three only, then if no items, add a zero.


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


Take a list of integers; negate each, then keep multiples of three, then if empty, use a single zero.


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


Take a list of integers; cut the leading negatives, then when the list is empty, substitute a zero value, then filter out the odd numbers.


Take a list of integers; skip negatives at the start, then replace an empty list with one zero, then drop the odd numbers.


Take a list of integers; remove all negatives at the front, then zero it out if it's empty, then filter out the odd numbers.


Take a list of integers; remove the initial run of negative numbers, then use zero if the list is empty, then drop the odd numbers.


Take a list of integers; strip the front negatives, then default to zero when empty, then filter out the odd numbers.


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


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


Take a list of integers; subtract one from each, then sort smallest to largest, then skip the first one.


Take a list of integers; Decrement all items, then Ascending sort, then Discard the first element.


Take a list of integers; decrement each value, then Sort this ascending, then skip the first one.


Take a list of integers; Lower each number by one, then Sort lowest to highest, then Discard the first element.


Take a list of integers; reduce each by one, then Arrange from smallest to largest, then skip the first one.


Take a list of integers; Subtract 1 from all, then sort ascending, then Discard the first element.


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


Take a list of integers; subtract one from each, then sort ascending, then drop the first element.


Take a list of integers; keep only the last three, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; keep the final three items, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; take the last three, then filter for numbers above 5, then arrange in order of absolute value.


Take a list of integers; trim to the last three, then give me values where x is greater than 5, then sort by distance from zero.


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


Take a list of integers; truncate to the last three items, then keep values greater than five, then order by distance from zero.


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


Take a list of integers; keep only the last three, then keep values greater than five, then sort by absolute value.


Take a list of integers; add one to each, then sort largest to smallest, then find the min, defaulting to 0.


Take a list of integers; make each one bigger, then sort by descending values, then minimum value, zero otherwise.


Take a list of integers; add one to each, then sort from highest to lowest, then get the minimum value or zero if empty.


Take a list of integers; make each one bigger, then sort descending, then give me the min or 0.


Take a list of integers; add one to each, then sort largest first, then return the smallest number, defaulting to 0.


Take a list of integers; make each one bigger, then sort in descending order, then return smallest or zero if empty.


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


Take a list of integers; add one to each, then sort descending, then return the minimum (0 if empty).


Take a list of integers; keep the odd numbers, then take the final 3 elements, then keep only numbers above 5.


Take a list of integers; odd numbers only, then drop everything except the final three, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then give me the last three elements, then remove anything 5 or less.


Take a list of integers; odd numbers only, then keep only the last three, then filter to keep only values above 5.


Take a list of integers; keep the odd numbers, then keep the final three items, then get rid of values that aren't greater than five.


Take a list of integers; odd numbers only, then take the last three, then drop anything 5 or below.


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


Take a list of integers; keep the odd numbers, then keep only the last three, then keep values greater than five.


Take a list of integers; subtract one from each, then multiply each by two, then drop the odd numbers.


Take a list of integers; Decrement all items, then double each item in the list, then filter out the odd numbers.


Take a list of integers; decrement each value, then multiply each by two, then drop the odd numbers.


Take a list of integers; Lower each number by one, then double each item in the list, then filter out the odd numbers.


Take a list of integers; reduce each by one, then multiply each by two, then drop the odd numbers.


Take a list of integers; Subtract 1 from all, then double each item in the list, then filter out the odd numbers.


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


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


Take a list of integers; drop the zeros, then increase every value by 10, then give the number of evens.


Take a list of integers; keep only nonzero elements, then add 10 to each item, then find how many values are divisible by two.


Take a list of integers; drop the zeros, then shift each up by ten, then how many are even.


Take a list of integers; keep only nonzero elements, then increase all numbers by 10, then get the total number of even values in the list.


Take a list of integers; drop the zeros, then add 10 to everything, then give me the count of even values.


Take a list of integers; keep only nonzero elements, then give everything a boost of 10, then I need to know how many of these are even.


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


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


Take a list of integers; double each, then keep values below zero, then reduce each by one.


Take a list of integers; times two for each item, then get the negative numbers, then Subtract 1 from all.


Take a list of integers; double each, then keep values below zero, then Subtract one from each.


Take a list of integers; times two for each item, then get the negative numbers, then Drop each by one.


Take a list of integers; double each, then keep values below zero, then Decrease all values by one.


Take a list of integers; times two for each item, then get the negative numbers, then Remove one from each value.


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


Take a list of integers; if empty, use a single zero, then multiply each value by itself, then bump each up by one.


Take a list of integers; if blank use 0, then square them all, then increment each item.


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


Take a list of integers; when the list is empty, substitute a zero value, then I need each number multiplied by itself, then increment each item.


Take a list of integers; replace an empty list with one zero, then square all of them, then bump each up by one.


Take a list of integers; zero it out if it's empty, then multiply each element by itself, then increment each item.


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


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


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


Take a list of integers; convert to absolute value, then add 10 to each item, then multiply each by 2.


Take a list of integers; strip the signs, then shift each up by ten, then make each twice as big.


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


Take a list of integers; get the absolute value of everything, then add 10 to everything, then make each twice as big.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then multiply each by 2.


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


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


Take a list of people records (name, age); extract the ages, then increase every value by 10, then truncate to the last three items.


Take a list of people records (name, age); show me all ages, then add 10 to each item, then show only the last three.


Take a list of people records (name, age); pluck the age field from each record, then shift each up by ten, then remove all but the last three.


Take a list of people records (name, age); get the age field, then increase all numbers by 10, then take the final 3 elements.


Take a list of people records (name, age); keep just each person's age, then add 10 to everything, then drop everything except the final three.


Take a list of people records (name, age); extract age values, then give everything a boost of 10, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [x + 10 for x in r]
    r = r[-3:]
    return r


Take a list of people records (name, age); extract the ages, then add ten to each, then keep only the last three.


Take a list of people records (name, age); extract the ages, then increase every value by 10, then keep only numbers above 5.


Take a list of people records (name, age); show me all ages, then add 10 to each item, then exclude values of 5 and below.


Take a list of people records (name, age); pluck the age field from each record, then shift each up by ten, then remove anything 5 or less.


Take a list of people records (name, age); get the age field, then increase all numbers by 10, then filter to keep only values above 5.


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


Take a list of people records (name, age); extract age values, then give everything a boost of 10, then drop anything 5 or below.


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


Take a list of people records (name, age); extract the ages, then add ten to each, then keep values greater than five.


Take a list of strings; trim whitespace from each, then remove repeated strings, then make every string uppercase.


Take a list of strings; strip whitespace from every element, then keep unique strings first appearance, then uppercase each one.


Take a list of strings; remove surrounding whitespace, then eliminate repeated strings preserve first occurrence, then make all the strings uppercase.


Take a list of strings; trim the whitespace off everything, then drop duplicate strings keeping the first, then convert all strings to uppercase letters.


Take a list of strings; strip spaces from all strings, then dedupe, then convert to uppercase.


Take a list of strings; strip all the strings, then remove duplicate strings keep first, then i need these in uppercase.


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


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


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


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


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


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


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


Take a list of integers; Subtract 1 from all, then default to zero when empty, then what's the count.


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


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


Take a list of integers; sort descending, then take the final 3 elements, then bump each up by one.


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


Take a list of integers; sort in descending order, then give me the last three elements, then bump each up by one.


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


Take a list of integers; sort z to a, then keep the final three items, then bump each up by one.


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


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


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


Take a list of integers; take the absolute value of each, then keep values above zero, then remove the initial run of negative numbers.


Take a list of integers; convert to absolute value, then filter for positive numbers, then strip the front negatives.


Take a list of integers; strip the signs, then keep only positive numbers, then remove leading negative numbers.


Take a list of integers; take abs of each, then keep the positives, then drop negatives from start.


Take a list of integers; get the absolute value of everything, then remove negatives, then strip negative values from the start.


Take a list of integers; apply absolute value to the whole list, then keep the positive numbers, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [abs(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; take the absolute value of each, then keep the positive numbers, then drop the leading negative values.


Take a list of integers; if empty, use a single zero, then remove repeated values, then give the number of evens.


Take a list of integers; if blank use 0, then unique values preserving order, then find how many values are divisible by two.


Take a list of integers; default to [0] when there is nothing, then remove repeated values, then how many are even.


Take a list of integers; when the list is empty, substitute a zero value, then unique values preserving order, then get the total number of even values in the list.


Take a list of integers; replace an empty list with one zero, then remove repeated values, then give me the count of even values.


Take a list of integers; zero it out if it's empty, then unique values preserving order, then I need to know how many of these are even.


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


Take a list of integers; if empty, use a single zero, then drop duplicates keeping first occurrence, then return how many values are even.


Take a list of integers; keep only the first three, then order by distance from zero, then raise each to the power of two.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then I need each number multiplied by itself.


Take a list of integers; take the first 3 elements, then organize by magnitude, then square all of them.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then multiply each element by itself.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then make each one squared.


Take a list of integers; show the first three, then sort by absolute value, then square each value in the list.


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


Take a list of integers; keep only the first three, then sort by absolute value, then square each.


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


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


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


Take a list of integers; Take everything except the first, then exclude zeros, then keep only the middle part.


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


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


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


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


Take a list of integers; take values while they are positive, then remove all zero values, then find the max, defaulting to 0.


Take a list of integers; take positive values then stop, then exclude zeros, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep going while positive, then remove all zero values, then What's the highest number in the list.


Take a list of integers; stop at first non positive, then exclude zeros, then Return the greatest value or default to 0.


Take a list of integers; take while greater than zero, then remove all zero values, then Find the largest element, defaulting to zero.


Take a list of integers; take values while positive, then exclude zeros, then give the largest value (0 if none).


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


Take a list of integers; take values while they are positive, then drop the zeros, then return the maximum (0 if empty).


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


Take a list of integers; keep the first 3 items, then sort by descending values, then check for zero.


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


Take a list of integers; remove everything after the third, then sort descending, then check for zero.


Take a list of integers; truncate to three items, then sort largest first, then true if any value equals zero.


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


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


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


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


Take a list of integers; each value squared, then plus one for all, then keep the leading run of positive numbers.


Take a list of integers; multiply each value by itself, then increment each value, then take values while they are positive.


Take a list of integers; square them all, then plus one for all, then take positive values then stop.


Take a list of integers; raise each to the power of two, then increment each value, then keep going while positive.


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


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


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


Take a list of integers; sort ascending, then remove repeated values, then limit every value to 10.


Take a list of integers; Sort it from low to high, then unique values preserving order, then maximum of 10 for all.


Take a list of integers; arrange in increasing order, then remove repeated values, then limit every value to 10.


Take a list of integers; Organize these ascending, then unique values preserving order, then maximum of 10 for all.


Take a list of integers; Sort in ascending order, then remove repeated values, then limit every value to 10.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then maximum of 10 for all.


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


Take a list of integers; sort ascending, then drop duplicates keeping first occurrence, then cap each value at 10.


Take a list of integers; keep the odd numbers, then keep values above zero, then keep only numbers above 5.


Take a list of integers; odd numbers only, then filter for positive numbers, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then keep only positive numbers, then remove anything 5 or less.


Take a list of integers; odd numbers only, then keep the positives, then filter to keep only values above 5.


Take a list of integers; keep the odd numbers, then remove negatives, then get rid of values that aren't greater than five.


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


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


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


Take a list of integers; pad with zeros to at least three elements, then keep the leading run of positive numbers, then give back the product of all values.


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then product of the list.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then what's the product.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then what do they multiply to.


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then give me their product.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then multiply them all together.


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


Take a list of integers; pad with zeros to at least three elements, then take values while they are positive, then return their product.


Take a list of integers; double each, then cut the list at the first zero, then true if already sorted smallest to largest.


Take a list of integers; times two for each item, then cut off after the first zero appears, then does this list go in ascending order.


Take a list of integers; double each, then take values up to (excluding) the first zero, then check if the list is in ascending order.


Take a list of integers; times two for each item, then keep the part before the first 0, then is the list sorted.


Take a list of integers; double each, then truncate at the first zero, then is it sorted.


Take a list of integers; times two for each item, then delete everything starting with the first zero, then check if values are in increasing order.


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


Take a list of integers; double each, then keep everything before the first zero, then return whether the list is sorted ascending.


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


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


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


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


Take a list of integers; cap each value at 10, then remove all zero values, then make each one squared.


Take a list of integers; clip values at 10, then exclude zeros, then square each value in the list.


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 * x for x in r]
    return r


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


Take a list of integers; drop the zeros, then skip negatives at the start, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then check for zero.


Take a list of integers; drop the zeros, then remove the initial run of negative numbers, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then strip the front negatives, then check for zero.


Take a list of integers; drop the zeros, then remove leading negative numbers, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then drop negatives from start, then check for zero.


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


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


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


Take a list of integers; take out the first and last items, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; remove both ends, then truncate to three items, then how many are even.


Take a list of integers; trim the edges, then show the first three, then get the total number of even values in the list.


Take a list of integers; trim one element off each end, then take the first three, then give me the count of even values.


Take a list of integers; cut off the first and last, then keep first 3, then I need to know how many of these are even.


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


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


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


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


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


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


Take a list of integers; add one to each, then remove leading negative numbers, then drop everything except the final three.


Take a list of integers; make each one bigger, then drop negatives from start, then give me the last three elements.


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


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


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


Take a list of integers; take out the first and last items, then absolute value for all items, then drop the negative numbers.


Take a list of integers; remove both ends, then take absolute values, then filter out the negative ones.


Take a list of integers; trim the edges, then turn negatives into positives, then remove all negative values.


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


Take a list of integers; cut off the first and last, then take the absolute value of each, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = [abs(x) 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 take the absolute value of each, then keep the positive numbers.


Take a list of strings; prefix each with a hash, then take each string's first letter, then remove short strings (under 3 chars).


Take a list of strings; add # to the start of each string, then give me the first letter of everything, then only keep strings with three or more characters.


Take a list of strings; prefix each with a hash, then reduce each string to its first character, then keep only strings that are at least three characters long.


Take a list of strings; add # to the start of each string, then take first char drop blanks, then filter strings shorter than 3 chars.


Take a list of strings; prefix each with a hash, then keep first letters only, then drop anything shorter than three characters.


Take a list of strings; add # to the start of each string, then first letter from each item that isn't empty, then keep only strings of length 3 or more.


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


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


Take a list of integers; keep values greater than five, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; filter out values less than or equal to 5, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; keep only numbers above 5, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; exclude values of 5 and below, then zero it out if it's empty, then increment each item.


Take a list of integers; remove anything 5 or less, then use zero if the list is empty, then bump each up by one.


Take a list of integers; filter to keep only values above 5, then default to zero when empty, then increment each item.


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


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


Take a list of integers; keep the positive numbers, then keep values below zero, then true if at least one even value.


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


Take a list of integers; drop non-positive values, then keep values below zero, then true if at least one even value.


Take a list of integers; drop the negative numbers, then get the negative numbers, then any even.


Take a list of integers; filter out the negative ones, then keep values below zero, then true if at least one even value.


Take a list of integers; remove all negative values, then get the negative numbers, then any even.


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


Take a list of integers; keep the positive numbers, then keep the negative numbers, then return whether any value is even.


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


Take a list of strings; change to lowercase, then get rid of short ones, then take first char drop blanks.


Take a list of strings; lowercase each string, then remove strings with less than three characters, then keep first letters only.


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


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


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


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


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


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


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


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


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


Take a list of integers; put the elements backwards, then square all of them, then filter for numbers divisible by three.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the positive numbers, then increase every value by 10, then arrange in increasing order.


Take a list of integers; get rid of anything that's not positive, then add 10 to each item, then Organize these ascending.


Take a list of integers; drop non-positive values, then shift each up by ten, then Sort in ascending order.


Take a list of integers; drop the negative numbers, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; filter out the negative ones, then add 10 to everything, then Put these in ascending order.


Take a list of integers; remove all negative values, then give everything a boost of 10, then sort smallest to largest.


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


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


Take a list of integers; drop the leading negative values, then keep the leading run of positive numbers, then true if every value is unique.


Take a list of integers; cut the leading negatives, then take values while they are positive, then check for duplicates in the values.


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


Take a list of integers; remove all negatives at the front, then keep going while positive, then check that there are no duplicates.


Take a list of integers; remove the initial run of negative numbers, then stop at first non positive, then are the values all unique.


Take a list of integers; strip the front negatives, then take while greater than zero, then check if all values are unique.


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


Take a list of integers; drop the leading negative values, then take values while they are positive, then return whether all values are distinct.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then true if already sorted smallest to largest.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then does this list go in ascending order.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then check if the list is in ascending order.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then is the list sorted.


Take a list of integers; drop duplicates keeping first occurrence, then clamp each to at most ten, then is it sorted.


Take a list of integers; drop duplicates but keep the first one, then don't let anything exceed 10, then check if values are in increasing order.


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


Take a list of integers; drop duplicates keeping first occurrence, then cap each value at 10, then return whether the list is sorted ascending.


Take a list of integers; sort ascending, then remove both ends, then arrange by magnitude ignoring sign.


Take a list of integers; Sort it from low to high, then trim the edges, then put them in order by magnitude.


Take a list of integers; arrange in increasing order, then trim one element off each end, then arrange in order of absolute value.


Take a list of integers; Organize these ascending, then cut off the first and last, then sort by distance from zero.


Take a list of integers; Sort in ascending order, then remove the first and last elements, then order by how far from zero.


Take a list of integers; I need this sorted ascending, then keep only the middle part, then order by distance from zero.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; add one to each, then remove repeated values, then drop the odd numbers.


Take a list of integers; make each one bigger, then unique values preserving order, then filter out the odd numbers.


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


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


Take a list of integers; keep only the first three, then multiply each value by itself, then true if any value equals zero.


Take a list of integers; keep the first 3 items, then square them all, then check for zero.


Take a list of integers; take the first 3 elements, then raise each to the power of two, then true if any value equals zero.


Take a list of integers; remove everything after the third, then I need each number multiplied by itself, then check for zero.


Take a list of integers; truncate to three items, then square all of them, then true if any value equals zero.


Take a list of integers; show the first three, then multiply each element by itself, then check for zero.


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


Take a list of integers; keep only the first three, then square each, then return whether the list contains a zero.


Take a list of integers; keep only the first three, then skip negatives at the start, then truncate to the last three items.


Take a list of integers; keep the first 3 items, then remove all negatives at the front, then show only the last three.


Take a list of integers; take the first 3 elements, then remove the initial run of negative numbers, then remove all but the last three.


Take a list of integers; remove everything after the third, then strip the front negatives, then take the final 3 elements.


Take a list of integers; truncate to three items, then remove leading negative numbers, then drop everything except the final three.


Take a list of integers; show the first three, then drop negatives from start, then give me the last three elements.


def solve(xs):
    r = list(xs)
    r = r[:3]
    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; keep only the first three, then drop the leading negative values, then keep only the last three.


Take a list of integers; double each, then skip negatives at the start, then give back the total.


Take a list of integers; times two for each item, then remove all negatives at the front, then sum r.


Take a list of integers; double each, then remove the initial run of negative numbers, then add them up.


Take a list of integers; times two for each item, then strip the front negatives, then calculate the sum of all elements.


Take a list of integers; double each, then remove leading negative numbers, then what's the total.


Take a list of integers; times two for each item, then drop negatives from start, then what do they add up to.


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


Take a list of integers; double each, then drop the leading negative values, then return their sum.


Take a list of integers; keep multiples of three, then default to [0] when there is nothing, then find the max, defaulting to 0.


Take a list of integers; get rid of non-multiples of three, then when the list is empty, substitute a zero value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep values divisible by 3, then replace an empty list with one zero, then What's the highest number in the list.


Take a list of integers; keep items where x mod 3 equals zero, then zero it out if it's empty, then Return the greatest value or default to 0.


Take a list of integers; drop anything not divisible by three, then use zero if the list is empty, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, then default to zero when empty, then give the largest value (0 if none).


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


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


Take a list of integers; keep everything before the first zero, then make every value non-negative, then give back the total.


Take a list of integers; take only what comes before the initial zero, then absolute value for all items, then sum r.


Take a list of integers; cut the list at the first zero, then take absolute values, then add them up.


Take a list of integers; cut off after the first zero appears, then turn negatives into positives, then calculate the sum of all elements.


Take a list of integers; take values up to (excluding) the first zero, then abs each element, then what's the total.


Take a list of integers; keep the part before the first 0, then take the absolute value of each, then what do they add up to.


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


Take a list of integers; keep everything before the first zero, then take the absolute value of each, then return their sum.


Take a list of integers; add ten to each, then order by distance from zero, then limit every value to 10.


Take a list of integers; bump everything up by 10, then sort based on absolute value, then maximum of 10 for all.


Take a list of integers; increase every value by 10, then organize by magnitude, then limit every value to 10.


Take a list of integers; add 10 to each item, then arrange by absolute value ascending, then maximum of 10 for all.


Take a list of integers; shift each up by ten, then sort from smallest to largest absolute value, then limit every value to 10.


Take a list of integers; increase all numbers by 10, then sort by absolute value, then maximum of 10 for all.


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


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


Take a list of integers; if empty, use a single zero, then clamp each to at most ten, then find the max, defaulting to 0.


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


Take a list of integers; default to [0] when there is nothing, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; when the list is empty, substitute a zero value, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; replace an empty list with one zero, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; zero it out if it's empty, then don't let anything exceed 10, then give the largest value (0 if none).


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


Take a list of integers; if empty, use a single zero, then cap each value at 10, then return the maximum (0 if empty).


Take a list of integers; drop the leading negative values, then keep the leading run of positive numbers, then raise each to the power of two.


Take a list of integers; cut the leading negatives, then take values while they are positive, then I need each number multiplied by itself.


Take a list of integers; skip negatives at the start, then take positive values then stop, then square all of them.


Take a list of integers; remove all negatives at the front, then keep going while positive, then multiply each element by itself.


Take a list of integers; remove the initial run of negative numbers, then stop at first non positive, then make each one squared.


Take a list of integers; strip the front negatives, then take while greater than zero, then square each value in the list.


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


Take a list of integers; drop the leading negative values, then take values while they are positive, then square each.


Take a list of integers; add ten to each, then take the final 3 elements, then give back the product of all values.


Take a list of integers; bump everything up by 10, then drop everything except the final three, then product of the list.


Take a list of integers; increase every value by 10, then give me the last three elements, then what's the product.


Take a list of integers; add 10 to each item, then keep only the last three, then what do they multiply to.


Take a list of integers; shift each up by ten, then keep the final three items, then give me their product.


Take a list of integers; increase all numbers by 10, then take the last three, then multiply them all together.


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


Take a list of integers; add ten to each, then keep only the last three, then return their product.


Take a list of integers; subtract one from each, then multiply each value by itself, then true if already sorted smallest to largest.


Take a list of integers; Decrement all items, then square them all, then does this list go in ascending order.


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


Take a list of integers; Lower each number by one, then I need each number multiplied by itself, then is the list sorted.


Take a list of integers; reduce each by one, then square all of them, then is it sorted.


Take a list of integers; Subtract 1 from all, then multiply each element by itself, then check if values are in increasing order.


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


Take a list of integers; subtract one from each, then square each, then return whether the list is sorted ascending.


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


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then Discard the first element.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then Discard the first element.


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


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then Discard the first element.


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


Take a list of integers; pad with zeros to at least three elements, then take values while they are positive, then drop the first element.


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


Take a list of integers; times two for each item, then plus one for all, then sum r.


Take a list of integers; double each, then increment each value, then add them up.


Take a list of integers; times two for each item, then plus one for all, then calculate the sum of all elements.


Take a list of integers; double each, then increment each value, then what's the total.


Take a list of integers; times two for each item, then plus one for all, then what do they add up to.


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


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


Take a list of integers; drop the first and last elements, then skip negatives at the start, then raise each to the power of two.


Take a list of integers; take out the first and last items, then remove all negatives at the front, then I need each number multiplied by itself.


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


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


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


Take a list of integers; cut off the first and last, then drop negatives from start, then square each value in the list.


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


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


Take a list of integers; drop the leading negative values, then keep values below zero, then true if at least one even value.


Take a list of integers; cut the leading negatives, then get the negative numbers, then any even.


Take a list of integers; skip negatives at the start, then keep values below zero, then true if at least one even value.


Take a list of integers; remove all negatives at the front, then get the negative numbers, then any even.


Take a list of integers; remove the initial run of negative numbers, then keep values below zero, then true if at least one even value.


Take a list of integers; strip the front negatives, then get the negative numbers, then any even.


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


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


Take a list of integers; drop the first and last elements, then remove all zero values, then true only if all are positive.


Take a list of integers; take out the first and last items, then exclude zeros, then do all of these have positive values.


Take a list of integers; remove both ends, then remove all zero values, then check if every value is positive.


Take a list of integers; trim the edges, then exclude zeros, then confirm all values are positive.


Take a list of integers; trim one element off each end, then remove all zero values, then all positive.


Take a list of integers; cut off the first and last, then exclude zeros, then check if every number is above zero.


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


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


Take a list of integers; square each, then multiply each by two, then true only if all are positive.


Take a list of integers; each value squared, then double each item in the list, then do all of these have positive values.


Take a list of integers; multiply each value by itself, then multiply each by two, then check if every value is positive.


Take a list of integers; square them all, then double each item in the list, then confirm all values are positive.


Take a list of integers; raise each to the power of two, then multiply each by two, then all positive.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then check if every number is above zero.


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


Take a list of integers; square each, then double each, then return whether all values are positive.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then count the elements.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then how many items remain.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then tell me the length.


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


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then count them.


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


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


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


Take a list of integers; if empty, use a single zero, then multiply each by two, then take values up to (excluding) the first zero.


Take a list of integers; if blank use 0, then double each item in the list, then keep the part before the first 0.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then truncate at the first zero.


Take a list of integers; when the list is empty, substitute a zero value, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; replace an empty list with one zero, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; zero it out if it's empty, then double each item in the list, then up to but not including the first zero.


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


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


Take a list of people records (name, age); extract the ages, then keep values below zero, then take values up to (excluding) the first zero.


Take a list of people records (name, age); show me all ages, then get the negative numbers, then keep the part before the first 0.


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


Take a list of people records (name, age); get the age field, then get the negative numbers, then delete everything starting with the first zero.


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


Take a list of people records (name, age); extract age values, then get the negative numbers, then up to but not including the first zero.


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


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


Take a list of integers; keep the even numbers, then take the final 3 elements, then skip the first one.


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


Take a list of integers; keep the even numbers, then give me the last three elements, then skip the first one.


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


Take a list of integers; keep the even numbers, then keep the final three items, then skip the first one.


Take a list of integers; keep evens, then take the last three, then Discard the first element.


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


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


Take a list of integers; sort ascending, then remove repeated values, then ensure at least three items by appending zeros.


Take a list of integers; Sort it from low to high, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in increasing order, then remove repeated values, then ensure at least three items by appending zeros.


Take a list of integers; Organize these ascending, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; Sort in ascending order, then remove repeated values, then ensure at least three items by appending zeros.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


def solve(xs):
    r = list(xs)
    r = sorted(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; sort ascending, then drop duplicates keeping first occurrence, then pad with zeros to at least three elements.


Take a list of integers; add one to each, then flip the list around, then true if any value equals zero.


Take a list of integers; make each one bigger, then flip the order around, then check for zero.


Take a list of integers; add one to each, then put the elements backwards, then true if any value equals zero.


Take a list of integers; make each one bigger, then reverse that for me, then check for zero.


Take a list of integers; add one to each, then flip it backwards, then true if any value equals zero.


Take a list of integers; make each one bigger, then make it backwards, then check for zero.


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


Take a list of integers; add one to each, then reverse the order, then return whether the list contains a zero.


Take a list of integers; drop the first and last elements, then extend to length 3 using zeros, then remove the initial run of negative numbers.


Take a list of integers; take out the first and last items, then pad to 3, then strip the front negatives.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then remove leading negative numbers.


Take a list of integers; trim the edges, then pad to 3, then drop negatives from start.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then strip negative values from the start.


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


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


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


Take a list of integers; add one to each, then remove the first item, then find the max, defaulting to 0.


Take a list of integers; make each one bigger, then Remove head, then Give me the maximum, but 0 if there are no items.


Take a list of integers; add one to each, then remove the first item, then What's the highest number in the list.


Take a list of integers; make each one bigger, then Remove head, then Return the greatest value or default to 0.


Take a list of integers; add one to each, then remove the first item, then Find the largest element, defaulting to zero.


Take a list of integers; make each one bigger, then Remove head, then give the largest value (0 if none).


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


Take a list of integers; add one to each, then drop the first element, then return the maximum (0 if empty).


Take a list of integers; reverse the order, then keep the leading run of positive numbers, then limit every value to 10.


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


Take a list of integers; flip the list around, then take positive values then stop, then limit every value to 10.


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


Take a list of integers; put the elements backwards, then stop at first non positive, then limit every value to 10.


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


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


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


Take a list of integers; drop the zeros, then drop anything 5 or below, then drop non-positive values.


Take a list of integers; keep only nonzero elements, then keep only numbers greater than 5, then drop the negative numbers.


Take a list of integers; drop the zeros, then filter for numbers above 5, then filter out the negative ones.


Take a list of integers; keep only nonzero elements, then give me values where x is greater than 5, then remove all negative values.


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


Take a list of integers; keep only nonzero elements, then keep values greater than five, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x != 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; drop the zeros, then keep values greater than five, then keep the positive numbers.


Take a list of integers; drop the zeros, then decrement each value, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then Lower each number by one, then maximum of 10 for all.


Take a list of integers; drop the zeros, then reduce each by one, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then Subtract 1 from all, then maximum of 10 for all.


Take a list of integers; drop the zeros, then Subtract one from each, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then Drop each by one, then maximum of 10 for all.


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


Take a list of integers; drop the zeros, then subtract one from each, then cap each value at 10.


Take a list of integers; keep only the last three, then keep only odd values, then truncate to three items.


Take a list of integers; keep the final three items, then eliminate the even numbers, then show the first three.


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


Take a list of integers; trim to the last three, then eliminate the even numbers, then keep first 3.


Take a list of integers; last three only, then keep only odd values, then truncate to first three.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then bump each up by one.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then increment each item.


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