Take a list of integers; keep everything before the first zero, then sort by absolute value, then pad with zeros to at least three elements.


Take a list of integers; keep multiples of three, then increase every value by 10, then make each twice as big.


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


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


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


Take a list of integers; drop anything not divisible by three, then add 10 to everything, then make each twice as big.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; drop duplicates but keep the first one, then square them all, then Organize these ascending.


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then Sort in ascending order.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then I need this sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then Put these in ascending order.


Take a list of integers; drop duplicates but keep the first one, then multiply each element by itself, then sort smallest to largest.


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


Take a list of integers; drop duplicates keeping first occurrence, then square each, then sort ascending.


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then trim one element off each end.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then cut off the first and last.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then remove the first and last elements.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then keep only the middle part.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then drop first and last.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then eliminate the outermost elements.


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


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


Take a list of integers; keep multiples of three, then increment each value, then give the earliest even value or zero.


Take a list of integers; get rid of non-multiples of three, then plus one for all, then fetch the first even element, default to 0.


Take a list of integers; keep values divisible by 3, then increment each value, then give the earliest even value or zero.


Take a list of integers; keep items where x mod 3 equals zero, then plus one for all, then fetch the first even element, default to 0.


Take a list of integers; drop anything not divisible by three, then increment each value, then give the earliest even value or zero.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then fetch the first even element, default to 0.


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


Take a list of integers; keep multiples of three, then add one to each, then return the first even value (0 if none).


Take a list of integers; keep only the last three, then decrement each value, then trim one element off each end.


Take a list of integers; keep the final three items, then Lower each number by one, then cut off the first and last.


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


Take a list of integers; trim to the last three, then Subtract 1 from all, then keep only the middle part.


Take a list of integers; last three only, then Subtract one from each, then drop first and last.


Take a list of integers; truncate to the last three items, then Drop each by one, then eliminate the outermost elements.


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


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


Take a list of integers; keep the odd numbers, then keep values below zero, then multiply each by -1.


Take a list of integers; odd numbers only, then get the negative numbers, then negate.


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


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


Take a list of people records (name, age); extract the ages, then decrement each value, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then Lower each number by one, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); get the age field, then Subtract 1 from all, then ensure minimum length of three by adding zeros to the end.


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


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


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


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


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


Take a list of integers; rearrange by distance from zero, then square them all, then arrange in descending order.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then reverse sort.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then sort largest to smallest.


Take a list of integers; arrange in order of absolute value, then square all of them, then sort by descending values.


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


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


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


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


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, then maximum of 10 for all.


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


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, then maximum of 10 for all.


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


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then maximum of 10 for all.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [-x 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 negate each, then cap each value at 10.


Take a list of integers; keep values greater than five, then sort largest to smallest, then give the number of evens.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values, then find how many values are divisible by two.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then how many are even.


Take a list of integers; exclude values of 5 and below, then sort descending, then get the total number of even values in the list.


Take a list of integers; remove anything 5 or less, then sort largest first, then give me the count of even values.


Take a list of integers; filter to keep only values above 5, then sort in descending order, then I need to know how many of these are even.


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


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


Take a list of integers; pad with zeros to at least three elements, then skip negatives at the start, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then remove all negatives at the front, then multiply each by 2.


Take a list of integers; pad with zeros to at least three elements, then remove the initial run of negative numbers, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then strip the front negatives, then multiply each by 2.


Take a list of integers; pad with zeros to at least three elements, then remove leading negative numbers, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then drop negatives from start, then multiply each by 2.


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


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


Take a list of integers; square each, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of integers; each value squared, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; multiply each value by itself, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; square them all, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; raise each to the power of two, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; I need each number multiplied by itself, then keep values greater than five, then if no items, add a zero.


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


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


Take a list of integers; add one to each, then take the final 3 elements, then drop the odd numbers.


Take a list of integers; make each one bigger, then drop everything except the final three, then filter out the odd numbers.


Take a list of integers; add one to each, then give me the last three elements, then drop the odd numbers.


Take a list of integers; make each one bigger, then keep only the last three, then filter out the odd numbers.


Take a list of integers; add one to each, then keep the final three items, then drop the odd numbers.


Take a list of integers; make each one bigger, then take the last three, then filter out the odd numbers.


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


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


Take a list of people records (name, age); extract the ages, then take the first 3 elements, then count the elements.


Take a list of people records (name, age); show me all ages, then remove everything after the third, then how many items remain.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items, then tell me the length.


Take a list of people records (name, age); get the age field, then show the first three, then return the length.


Take a list of people records (name, age); keep just each person's age, then take the first three, then count them.


Take a list of people records (name, age); extract age values, then keep first 3, then what's the count.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r[:3]
    return len(r)


Take a list of people records (name, age); extract the ages, then keep only the first three, then return how many remain.


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


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


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


Take a list of integers; flip the order around, then don't let anything exceed 10, then strip out the evens.


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


Take a list of integers; reverse that for me, then don't let anything exceed 10, then strip out the evens.


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


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


Take a list of integers; keep everything before the first zero, then take the first 3 elements, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then remove everything after the third, then minimum value, zero otherwise.


Take a list of integers; cut the list at the first zero, then truncate to three items, then get the minimum value or zero if empty.


Take a list of integers; cut off after the first zero appears, then show the first three, then give me the min or 0.


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


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


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


Take a list of integers; keep everything before the first zero, then keep only the first three, then return the minimum (0 if empty).


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


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


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


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


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


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


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


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


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


Take a list of integers; Take everything except the first, then Lower each number by one, then strip out the evens.


Take a list of integers; drop the first element, then reduce each by one, then drop the even numbers.


Take a list of integers; Take everything except the first, then Subtract 1 from all, then strip out the evens.


Take a list of integers; drop the first element, then Subtract one from each, then drop the even numbers.


Take a list of integers; Take everything except the first, then Drop each by one, then strip out the evens.


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


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


Take a list of integers; keep only the last three, then cut the list at the first zero, then trim one element off each end.


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


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


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


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


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


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


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


Take a list of integers; add one to each, then cut the list at the first zero, then drop anything not divisible by three.


Take a list of integers; make each one bigger, then cut off after the first zero appears, then filter out everything except multiples of three.


Take a list of integers; add one to each, then take values up to (excluding) the first zero, then keep only multiples of three.


Take a list of integers; make each one bigger, then keep the part before the first 0, then multiples of three only.


Take a list of integers; add one to each, then truncate at the first zero, then filter for numbers divisible by three.


Take a list of integers; make each one bigger, then delete everything starting with the first zero, then give me only the values divisible by three.


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


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


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


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


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


Take a list of integers; flip the order around, then double each item in the list, then confirm all values are positive.


Take a list of integers; put the elements backwards, then multiply each by two, then all positive.


Take a list of integers; reverse that for me, then double each item in the list, then check if every number is above zero.


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


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


Take a list of integers; reverse the order, then remove the first item, then deduplicate the list.


Take a list of integers; reverse, then Remove head, then remove repeats.


Take a list of integers; flip the list around, then remove the first item, then deduplicate the list.


Take a list of integers; flip the order around, then Remove head, then remove repeats.


Take a list of integers; put the elements backwards, then remove the first item, then deduplicate the list.


Take a list of integers; reverse that for me, then Remove head, then remove repeats.


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


Take a list of integers; reverse the order, then drop the first element, then drop duplicates keeping first occurrence.


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


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


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


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


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


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


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


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


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


Take a list of integers; make each one bigger, then add 10 to each item, then product of the list.


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


Take a list of integers; make each one bigger, then increase all numbers by 10, then what do they multiply to.


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


Take a list of integers; make each one bigger, then give everything a boost of 10, then multiply them all together.


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


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


Take a list of people records (name, age); extract the names, then strip spaces around each string, then make every string lowercase.


Take a list of people records (name, age); Give me the names, then remove leading and trailing spaces, then make it all lowercase.


Take a list of people records (name, age); pluck the name field from each record, then remove whitespace from each item, then make every string lowercase.


Take a list of people records (name, age); Grab the names, then clean whitespace from each entry, then make it all lowercase.


Take a list of people records (name, age); keep just each person's name, then trim each string, then make every string lowercase.


Take a list of people records (name, age); List the names, then trim whitespace from each, then make it all lowercase.


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


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


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


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


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


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then drop anything 5 or below, then drop non-positive values.


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


Take a list of people records (name, age); pluck the age field from each record, then filter for numbers above 5, then filter out the negative ones.


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


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 keep positive values only.


Take a list of people records (name, age); extract age values, then keep values greater than five, then keep values above zero.


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


Take a list of people records (name, age); extract the ages, then keep values greater than five, then keep the positive numbers.


Take a list of integers; subtract one from each, then keep values below zero, then drop the even numbers.


Take a list of integers; Decrement all items, then get the negative numbers, then strip out the evens.


Take a list of integers; decrement each value, then keep values below zero, then drop the even numbers.


Take a list of integers; Lower each number by one, then get the negative numbers, then strip out the evens.


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


Take a list of integers; Subtract 1 from all, then get the negative numbers, then strip out the evens.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then true if already sorted smallest to largest.


Take a list of integers; Sort it from low to high, then pad to 3, then does this list go in ascending order.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then check if the list is in ascending order.


Take a list of integers; Organize these ascending, then pad to 3, then is the list sorted.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then is it sorted.


Take a list of integers; I need this sorted ascending, then pad to 3, then check if values are in increasing order.


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


Take a list of integers; sort ascending, then pad with zeros to at least three elements, then return whether the list is sorted ascending.


Take a list of integers; negate each, then take the first 3 elements, then find the max, defaulting to 0.


Take a list of integers; reverse the signs of everything, then remove everything after the third, then Give me the maximum, but 0 if there are no items.


Take a list of integers; negate each, then truncate to three items, then What's the highest number in the list.


Take a list of integers; reverse the signs of everything, then show the first three, then Return the greatest value or default to 0.


Take a list of integers; negate each, then take the first three, then Find the largest element, defaulting to zero.


Take a list of integers; reverse the signs of everything, then keep first 3, then give the largest value (0 if none).


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


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


Take a list of integers; drop the zeros, then take the final 3 elements, then true if already sorted smallest to largest.


Take a list of integers; keep only nonzero elements, then drop everything except the final three, then does this list go in ascending order.


Take a list of integers; drop the zeros, then give me the last three elements, then check if the list is in ascending order.


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


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


Take a list of integers; keep only nonzero elements, then take the last three, then check if values are in increasing order.


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


Take a list of integers; drop the zeros, then keep only the last three, then return whether the list is sorted ascending.


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


Take a list of integers; Sort it from low to high, then keep items where x mod 3 equals zero, then increase all numbers by 10.


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


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


Take a list of integers; Sort in ascending order, then keep only multiples of three, then increment each by ten.


Take a list of integers; I need this sorted ascending, then multiples of three only, then add a constant 10 to each.


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


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


Take a list of integers; keep the positive numbers, then multiply each by two, then arrange in decreasing order.


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then arrange in descending order.


Take a list of integers; drop non-positive values, then multiply each by two, then reverse sort.


Take a list of integers; drop the negative numbers, then double each item in the list, then sort largest to smallest.


Take a list of integers; filter out the negative ones, then multiply each by two, then sort by descending values.


Take a list of integers; remove all negative values, then double each item in the list, then sort from highest to lowest.


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


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


Take a list of integers; keep the positive numbers, then decrement each value, then limit every value to 10.


Take a list of integers; get rid of anything that's not positive, then Lower each number by one, then maximum of 10 for all.


Take a list of integers; drop non-positive values, then reduce each by one, then limit every value to 10.


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


Take a list of integers; filter out the negative ones, then Subtract one from each, then limit every value to 10.


Take a list of integers; remove all negative values, 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; keep the positive numbers, then subtract one from each, then cap each value at 10.


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


Take a list of integers; times two for each item, then absolute value for all items, then drop the negative numbers.


Take a list of integers; double each, then take absolute values, then filter out the negative ones.


Take a list of integers; times two for each item, then turn negatives into positives, then remove all negative values.


Take a list of integers; double each, then abs each element, then keep positive values only.


Take a list of integers; times two for each item, then take the absolute value of each, then keep values above zero.


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


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


Take a list of integers; keep the even numbers, then remove the first item, then drop the even numbers.


Take a list of integers; keep evens, then Remove head, then strip out the evens.


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


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


Take a list of people records (name, age); extract the ages, then drop anything 5 or below, then true if at least one even value.


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


Take a list of people records (name, age); pluck the age field from each record, then filter for numbers above 5, then true if at least one even value.


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


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 true if at least one even value.


Take a list of people records (name, age); extract age values, then keep values greater than five, then any even.


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


Take a list of people records (name, age); extract the ages, then keep values greater than five, then return whether any value is even.


Take a list of integers; keep everything before the first zero, then decrement each value, then give the earliest even value or zero.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then fetch the first even element, default to 0.


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


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then fetch the first even element, default to 0.


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


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


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


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


Take a list of integers; keep only the first three, then increase every value by 10, then true only if all are positive.


Take a list of integers; keep the first 3 items, then add 10 to each item, then do all of these have positive values.


Take a list of integers; take the first 3 elements, then shift each up by ten, then check if every value is positive.


Take a list of integers; remove everything after the third, then increase all numbers by 10, then confirm all values are positive.


Take a list of integers; truncate to three items, then add 10 to everything, then all positive.


Take a list of integers; show the first three, then give everything a boost of 10, then check if every number is above zero.


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


Take a list of integers; keep only the first three, then add ten to each, then return whether all values are positive.


Take a list of integers; square each, then keep values above zero, then find the max, defaulting to 0.


Take a list of integers; each value squared, then filter for positive numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; multiply each value by itself, then keep only positive numbers, then What's the highest number in the list.


Take a list of integers; square them all, then keep the positives, then Return the greatest value or default to 0.


Take a list of integers; raise each to the power of two, then remove negatives, then Find the largest element, defaulting to zero.


Take a list of integers; I need each number multiplied by itself, then keep the positive numbers, then give the largest value (0 if none).


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


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


Take a list of integers; if empty, use a single zero, then increase every value by 10, then truncate to three items.


Take a list of integers; if blank use 0, then add 10 to each item, then show the first three.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then take the first three.


Take a list of integers; when the list is empty, substitute a zero value, then increase all numbers by 10, then keep first 3.


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then truncate to first three.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then first three.


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


Take a list of integers; if empty, use a single zero, then add ten to each, then keep only the first three.


Take a list of integers; sort by absolute value, then flip the list around, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then flip the order around, then check for duplicates in the values.


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards, then do all values appear only once.


Take a list of integers; put them in order by magnitude, then reverse that for me, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then flip it backwards, then are the values all unique.


Take a list of integers; sort by distance from zero, then make it backwards, then check if all values are unique.


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


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


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


Take a list of integers; clip values at 10, then cut off after the first zero appears, then fetch the first even element, default to 0.


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


Take a list of integers; clip values at 10, then keep the part before the first 0, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then truncate at the first zero, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then delete everything starting with the first zero, then fetch the first even element, default to 0.


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


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


Take a list of strings; uppercase each string, then convert each to lower case, then find how long the longest string is.


Take a list of strings; make it all caps, then lowercase each one, then give the length of the longest string in the list.


Take a list of strings; convert each to upper case, then convert each to lower case, then get me the longest string's length.


Take a list of strings; change all strings to uppercase, then lowercase each one, then give the maximum string length.


Take a list of strings; make every string uppercase, then convert each to lower case, then max length of all strings.


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


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


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


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


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then keep the part before the first 0.


Take a list of integers; arrange in increasing order, then flip the sign of each, then truncate at the first zero.


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


Take a list of integers; Sort in ascending order, then flip the sign of each, then remove from the first zero onwards.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then up to but not including the first zero.


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


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


Take a list of integers; sort descending, then keep only even values, then give back the product of all values.


Take a list of integers; sort largest first, then extract all even numbers, then product of the list.


Take a list of integers; sort in descending order, then keep only even values, then what's the product.


Take a list of integers; sort from greatest to least, then extract all even numbers, then what do they multiply to.


Take a list of integers; sort z to a, then keep only even values, then give me their product.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then multiply them all together.


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


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


Take a list of integers; keep only the last three, then flip the list around, then shift each up by ten.


Take a list of integers; keep the final three items, then flip the order around, then increase all numbers by 10.


Take a list of integers; take the last three, then put the elements backwards, then add 10 to everything.


Take a list of integers; trim to the last three, then reverse that for me, then give everything a boost of 10.


Take a list of integers; last three only, then flip it backwards, then increment each by ten.


Take a list of integers; truncate to the last three items, then make it backwards, then add a constant 10 to each.


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


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


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


Take a list of integers; times two for each item, then extract all even numbers, then negate.


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


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


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


Take a list of integers; reverse the signs of everything, then absolute value for all items, then drop the negative numbers.


Take a list of integers; negate each, then take absolute values, then filter out the negative ones.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then remove all negative values.


Take a list of integers; negate each, then abs each element, then keep positive values only.


Take a list of integers; reverse the signs of everything, then take the absolute value of each, then keep values above zero.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the even numbers, then sort smallest to largest, then stop at the first non-positive value.


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


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


Take a list of integers; keep evens, then Sort lowest to highest, then take positive values then stop.


Take a list of integers; keep the even numbers, then Arrange from smallest to largest, then keep going while positive.


Take a list of integers; keep evens, then sort ascending, then stop at first non positive.


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


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


Take a list of integers; negate each, then sort smallest to largest, then true if already sorted smallest to largest.


Take a list of integers; reverse the signs of everything, then Ascending sort, then does this list go in ascending order.


Take a list of integers; negate each, then Sort this ascending, then check if the list is in ascending order.


Take a list of integers; reverse the signs of everything, then Sort lowest to highest, then is the list sorted.


Take a list of integers; negate each, then Arrange from smallest to largest, then is it sorted.


Take a list of integers; reverse the signs of everything, then sort ascending, then check if values are in increasing order.


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


Take a list of integers; negate each, then sort ascending, then return whether the list is sorted ascending.


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


Take a list of integers; filter out values less than or equal to 5, then turn positives to negatives and vice versa, then I need each number multiplied by itself.


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


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then multiply each element by itself.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then make each one squared.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then square each value in the list.


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


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


Take a list of people records (name, age); extract the ages, then remove both ends, then truncate to the last three items.


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


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


Take a list of people records (name, age); get the age field, then cut off the first and last, then take the final 3 elements.


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


Take a list of people records (name, age); extract age values, then keep only the middle part, then give me the last three elements.


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


Take a list of people records (name, age); extract the ages, then drop the first and last elements, then keep only the last three.


Take a list of integers; pad with zeros to at least three elements, then cut the list at the first zero, then true if at least one even value.


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


Take a list of integers; pad with zeros to at least three elements, then take values up to (excluding) the first zero, then true if at least one even value.


Take a list of integers; add zeros until the list has at least three values, then keep the part before the first 0, then any even.


Take a list of integers; pad with zeros to at least three elements, then truncate at the first zero, then true if at least one even value.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep everything before the first zero, then return whether any value is even.


Take a list of integers; reverse the order, then flip the sign of each, then give the number of evens.


Take a list of integers; reverse, then turn positives to negatives and vice versa, then find how many values are divisible by two.


Take a list of integers; flip the list around, then flip the sign of each, then how many are even.


Take a list of integers; flip the order around, then turn positives to negatives and vice versa, then get the total number of even values in the list.


Take a list of integers; put the elements backwards, then flip the sign of each, then give me the count of even values.


Take a list of integers; reverse that for me, then turn positives to negatives and vice versa, then I need to know how many of these are even.


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


Take a list of integers; reverse the order, then negate each, then return how many values are even.


Take a list of integers; drop the first element, then default to [0] when there is nothing, then keep only numbers above 5.


Take a list of integers; Take everything except the first, then when the list is empty, substitute a zero value, then exclude values of 5 and below.


Take a list of integers; drop the first element, then replace an empty list with one zero, then remove anything 5 or less.


Take a list of integers; Take everything except the first, then zero it out if it's empty, then filter to keep only values above 5.


Take a list of integers; drop the first element, then use zero if the list is empty, then get rid of values that aren't greater than five.


Take a list of integers; Take everything except the first, then default to zero when empty, then drop anything 5 or below.


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


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


Take a list of integers; sort ascending, then keep only even values, then give the earliest even value or zero.


Take a list of integers; Sort it from low to high, then extract all even numbers, then fetch the first even element, default to 0.


Take a list of integers; arrange in increasing order, then keep only even values, then give the earliest even value or zero.


Take a list of integers; Organize these ascending, then extract all even numbers, then fetch the first even element, default to 0.


Take a list of integers; Sort in ascending order, then keep only even values, then give the earliest even value or zero.


Take a list of integers; I need this sorted ascending, then extract all even numbers, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop the zeros, then multiply each value by itself, then true if already sorted smallest to largest.


Take a list of integers; keep only nonzero elements, then square them all, then does this list go in ascending order.


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


Take a list of integers; keep only nonzero elements, then I need each number multiplied by itself, then is the list sorted.


Take a list of integers; drop the zeros, then square all of them, then is it sorted.


Take a list of integers; keep only nonzero elements, then multiply each element by itself, then check if values are in increasing order.


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


Take a list of integers; drop the zeros, then square each, then return whether the list is sorted ascending.


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


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then zero it out if it's empty.


Take a list of integers; drop the zeros, then take values up to (excluding) the first zero, then use zero if the list is empty.


Take a list of integers; keep only nonzero elements, then keep the part before the first 0, then default to zero when empty.


Take a list of integers; drop the zeros, then truncate at the first zero, then if there's nothing, put in a zero.


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then if no items, add a zero.


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


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


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


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


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


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


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


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


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r[1:]
    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 drop the first element, then keep everything before the first zero.


Take a list of integers; subtract one from each, then flip the list around, then keep only non-zero numbers.


Take a list of integers; Decrement all items, then flip the order around, then strip the zeros.


Take a list of integers; decrement each value, then put the elements backwards, then keep only non-zero numbers.


Take a list of integers; Lower each number by one, then reverse that for me, then strip the zeros.


Take a list of integers; reduce each by one, then flip it backwards, then keep only non-zero numbers.


Take a list of integers; Subtract 1 from all, then make it backwards, then strip the zeros.


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


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


Take a list of integers; drop the first element, then cut the list at the first zero, then arrange in increasing order.


Take a list of integers; Take everything except the first, then cut off after the first zero appears, then Organize these ascending.


Take a list of integers; drop the first element, then take values up to (excluding) the first zero, then Sort in ascending order.


Take a list of integers; Take everything except the first, then keep the part before the first 0, then I need this sorted ascending.


Take a list of integers; drop the first element, then truncate at the first zero, then Put these in ascending order.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then sort smallest to largest.


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


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


Take a list of integers; keep values greater than five, then increase every value by 10, then remove the initial run of negative numbers.


Take a list of integers; filter out values less than or equal to 5, then add 10 to each item, then strip the front negatives.


Take a list of integers; keep only numbers above 5, then shift each up by ten, then remove leading negative numbers.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then drop negatives from start.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then strip negative values from the start.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep multiples of three, then multiply each by two, then replace an empty list with one zero.


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then zero it out if it's empty.


Take a list of integers; keep values divisible by 3, then multiply each by two, then use zero if the list is empty.


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


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


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then if no items, add a zero.


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


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


Take a list of integers; if empty, use a single zero, then remove the first item, then multiply each by -1.


Take a list of integers; if blank use 0, then Remove head, then negate.


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


Take a list of integers; when the list is empty, substitute a zero value, then Remove head, then negate.


Take a list of integers; replace an empty list with one zero, then remove the first item, then multiply each by -1.


Take a list of integers; zero it out if it's empty, then Remove head, then negate.


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


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then raise each to the power of two.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then I need each number multiplied by itself.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then square all of them.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then multiply each element by itself.


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


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


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


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


Take a list of integers; take the absolute value of each, then keep only odd values, then stop at the first non-positive value.


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


Take a list of integers; strip the signs, then keep only odd values, then take values while they are positive.


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


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


Take a list of integers; apply absolute value to the whole list, then eliminate the even numbers, then stop at first non positive.


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


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


Take a list of integers; reverse the order, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of integers; reverse, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; flip the list around, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; flip the order around, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; put the elements backwards, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; reverse that for me, then keep values greater than five, then if no items, add a zero.


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


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


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


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


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


Take a list of people records (name, age); get the age field, then keep the positives, then Discard the first element.


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


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


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


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


Take a list of integers; add ten to each, then skip negatives at the start, then drop non-negative values.


Take a list of integers; bump everything up by 10, then remove all negatives at the front, then drop all positive numbers.


Take a list of integers; increase every value by 10, then remove the initial run of negative numbers, then drop non-negative values.


Take a list of integers; add 10 to each item, then strip the front negatives, then drop all positive numbers.


Take a list of integers; shift each up by ten, then remove leading negative numbers, then drop non-negative values.


Take a list of integers; increase all numbers by 10, then drop negatives from start, then drop all positive numbers.


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


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


Take a list of integers; add one to each, then extend to length 3 using zeros, then true if already sorted smallest to largest.


Take a list of integers; make each one bigger, then pad to 3, then does this list go in ascending order.


Take a list of integers; add one to each, then extend to length 3 using zeros, then check if the list is in ascending order.


Take a list of integers; make each one bigger, then pad to 3, then is the list sorted.


Take a list of integers; add one to each, then extend to length 3 using zeros, then is it sorted.


Take a list of integers; make each one bigger, then pad to 3, then check if values are in increasing order.


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


Take a list of integers; add one to each, then pad with zeros to at least three elements, then return whether the list is sorted ascending.


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


Take a list of integers; take out the first and last items, then turn positives to negatives and vice versa, then any even.


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


Take a list of integers; trim the edges, then turn positives to negatives and vice versa, then any even.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then take values up to (excluding) the first zero.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then keep the part before the first 0.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then truncate at the first zero.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then delete everything starting with the first zero.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then remove from the first zero onwards.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then up to but not including the first zero.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    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; drop duplicates keeping first occurrence, then double each, then keep everything before the first zero.


Take a list of integers; keep the positive numbers, then keep values divisible by 3, then trim one element off each end.


Take a list of integers; get rid of anything that's not positive, then keep items where x mod 3 equals zero, then cut off the first and last.


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


Take a list of integers; drop the negative numbers, then filter out everything except multiples of three, then keep only the middle part.


Take a list of integers; filter out the negative ones, then keep only multiples of three, then drop first and last.


Take a list of integers; remove all negative values, then multiples of three only, then eliminate the outermost elements.


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


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


Take a list of integers; sort by absolute value, then skip negatives at the start, then multiply each by -1.


Take a list of integers; rearrange by distance from zero, then remove all negatives at the front, then negate.


Take a list of integers; arrange by magnitude ignoring sign, then remove the initial run of negative numbers, then multiply each by -1.


Take a list of integers; put them in order by magnitude, then strip the front negatives, then negate.


Take a list of integers; arrange in order of absolute value, then remove leading negative numbers, then multiply each by -1.


Take a list of integers; sort by distance from zero, then drop negatives from start, then negate.


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


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


Take a list of integers; keep everything before the first zero, then clamp each to at most ten, then drop the even numbers.


Take a list of integers; take only what comes before the initial zero, then don't let anything exceed 10, then strip out the evens.


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


Take a list of integers; cut off after the first zero appears, then don't let anything exceed 10, then strip out the evens.


Take a list of integers; take values up to (excluding) the first zero, then clamp each to at most ten, then drop the even numbers.


Take a list of integers; keep the part before the first 0, then don't let anything exceed 10, then strip out the evens.


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


Take a list of integers; keep everything before the first zero, then cap each value at 10, then keep the odd numbers.


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


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


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


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


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


Take a list of integers; keep only nonzero elements, then keep first 3, then eliminate the outermost elements.


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


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


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


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


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


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


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


Take a list of integers; reverse that for me, then keep first 3, then eliminate the outermost elements.


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


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


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


Take a list of integers; extract negatives, then trim the edges, then keep the leading run of positive numbers.


Take a list of integers; keep the negative numbers, then trim one element off each end, then take values while they are positive.


Take a list of integers; extract negatives, then cut off the first and last, then take positive values then stop.


Take a list of integers; keep the negative numbers, then remove the first and last elements, then keep going while positive.


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


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then stop at the first non-positive value.


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


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then take values while they are positive.


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


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


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


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then take values while they are positive.


Take a list of integers; drop the leading negative values, then keep values above zero, then truncate to the last three items.


Take a list of integers; cut the leading negatives, then filter for positive numbers, then show only the last three.


Take a list of integers; skip negatives at the start, then keep only positive numbers, then remove all but the last three.


Take a list of integers; remove all negatives at the front, then keep the positives, then take the final 3 elements.


Take a list of integers; remove the initial run of negative numbers, then remove negatives, then drop everything except the final three.


Take a list of integers; strip the front negatives, then keep the positive numbers, then give me the last three elements.


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


Take a list of integers; drop the leading negative values, then keep the positive numbers, then keep only the last three.


Take a list of integers; keep values greater than five, then keep values divisible by 3, then arrange in decreasing order.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then arrange in descending order.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then reverse sort.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then sort largest to smallest.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then sort by descending values.


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


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


Take a list of integers; keep values greater than five, then keep multiples of three, then sort descending.


Take a list of integers; keep the positive numbers, then order by distance from zero, then true if any value equals zero.


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


Take a list of integers; drop non-positive values, then organize by magnitude, then true if any value equals zero.


Take a list of integers; drop the negative numbers, then arrange by absolute value ascending, then check for zero.


Take a list of integers; filter out the negative ones, then sort from smallest to largest absolute value, then true if any value equals zero.


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


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


Take a list of integers; keep the positive numbers, then sort by absolute value, then return whether the list contains a zero.


Take a list of integers; take values while they are positive, then keep only odd values, then give back the total.


Take a list of integers; take positive values then stop, then eliminate the even numbers, then sum r.


Take a list of integers; keep going while positive, then keep only odd values, then add them up.


Take a list of integers; stop at first non positive, then eliminate the even numbers, then calculate the sum of all elements.


Take a list of integers; take while greater than zero, then keep only odd values, then what's the total.


Take a list of integers; take values while positive, then eliminate the even numbers, then what do they add up to.


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


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


Take a list of people records (name, age); extract the ages, then remove all zero values, then find the min, defaulting to 0.


Take a list of people records (name, age); show me all ages, then exclude zeros, then minimum value, zero otherwise.


Take a list of people records (name, age); pluck the age field from each record, then remove all zero values, then get the minimum value or zero if empty.


Take a list of people records (name, age); get the age field, then exclude zeros, then give me the min or 0.


Take a list of people records (name, age); keep just each person's age, then remove all zero values, then return the smallest number, defaulting to 0.


Take a list of people records (name, age); extract age values, then exclude zeros, then return smallest or zero if empty.


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


Take a list of people records (name, age); extract the ages, then drop the zeros, then return the minimum (0 if empty).


Take a list of integers; pad with zeros to at least three elements, then cut the list at the first zero, then count the elements.


Take a list of integers; add zeros until the list has at least three values, then cut off after the first zero appears, then how many items remain.


Take a list of integers; pad with zeros to at least three elements, then take values up to (excluding) the first zero, then tell me the length.


Take a list of integers; add zeros until the list has at least three values, then keep the part before the first 0, then return the length.


Take a list of integers; pad with zeros to at least three elements, then truncate at the first zero, then count them.


Take a list of integers; add zeros until the list has at least three values, then delete everything starting with the first zero, then what's the count.


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


Take a list of integers; pad with zeros to at least three elements, then keep everything before the first zero, then return how many remain.


Take a list of integers; if empty, use a single zero, then multiply each by two, then drop non-negative values.


Take a list of integers; if blank use 0, then double each item in the list, then drop all positive numbers.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then drop non-negative values.


Take a list of integers; when the list is empty, substitute a zero value, then double each item in the list, then drop all positive numbers.


Take a list of integers; replace an empty list with one zero, then multiply each by two, then drop non-negative values.


Take a list of integers; zero it out if it's empty, then double each item in the list, then drop all positive numbers.


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


Take a list of integers; if empty, use a single zero, then double each, then keep the negative numbers.


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


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


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


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


Take a list of integers; sort z to a, then add 10 to everything, then drop the even numbers.


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


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


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


Take a list of strings; drop duplicate strings keeping the first, then add '#' to the start of each string, then true if a blank string is present.


Take a list of strings; dedupe, then make each one start with a hash, then check for empty strings in the list.


Take a list of strings; remove duplicate strings keep first, then add '#' to the start of each string, then check if there's an empty string.


Take a list of strings; remove repeating strings first one stays, then make each one start with a hash, then does the collection contain an empty string value somewhere.


Take a list of strings; delete duplicate strings keep the first one, then add '#' to the start of each string, then whether any element is blank.


Take a list of strings; deduplicate the strings, then make each one start with a hash, then check for an empty string.


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


Take a list of strings; drop duplicate strings keeping the first, then prefix each with a hash, then return whether any string is empty.


Take a list of integers; keep the positive numbers, then keep only odd values, then count the elements.


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then how many items remain.


Take a list of integers; drop non-positive values, then keep only odd values, then tell me the length.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then return the length.


Take a list of integers; filter out the negative ones, then keep only odd values, then count them.


Take a list of integers; remove all negative values, then eliminate the even numbers, then what's the count.


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


Take a list of integers; keep the positive numbers, then keep the odd numbers, then return how many remain.


Take a list of integers; negate each, then take the first 3 elements, then drop non-negative values.


Take a list of integers; reverse the signs of everything, then remove everything after the third, then drop all positive numbers.


Take a list of integers; negate each, then truncate to three items, then drop non-negative values.


Take a list of integers; reverse the signs of everything, then show the first three, then drop all positive numbers.


Take a list of integers; negate each, then take the first three, then drop non-negative values.


Take a list of integers; reverse the signs of everything, then keep first 3, then drop all positive numbers.


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


Take a list of integers; negate each, then keep only the first three, then keep the negative numbers.


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


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


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


Take a list of integers; remove everything after the third, then pad to 3, then increment each item.


Take a list of integers; truncate to three items, then extend to length 3 using zeros, then bump each up by one.


Take a list of integers; show the first three, then pad to 3, then increment each item.


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


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


Take a list of integers; keep the negative numbers, then keep values above zero, then give back the product of all values.


Take a list of integers; extract negatives, then filter for positive numbers, then product of the list.


Take a list of integers; keep the negative numbers, then keep only positive numbers, then what's the product.


Take a list of integers; extract negatives, then keep the positives, then what do they multiply to.


Take a list of integers; keep the negative numbers, then remove negatives, then give me their product.


Take a list of integers; extract negatives, then keep the positive numbers, then multiply them all together.


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


Take a list of integers; keep the negative numbers, then keep the positive numbers, then return their product.


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


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


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


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


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


Take a list of integers; keep evens, 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 even numbers, then keep the positive numbers, then keep values greater than five.


Take a list of integers; if empty, use a single zero, then flip the list around, then find the max, defaulting to 0.


Take a list of integers; if blank use 0, then flip the order around, 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 put the elements backwards, then What's the highest number in the list.


Take a list of integers; when the list is empty, substitute a zero value, then reverse that for me, then Return the greatest value or default to 0.


Take a list of integers; replace an empty list with one zero, then flip it backwards, then Find the largest element, defaulting to zero.


Take a list of integers; zero it out if it's empty, then make it backwards, then give the largest value (0 if none).


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


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


Take a list of integers; square each, then remove the first item, then true only if all are positive.


Take a list of integers; each value squared, then Remove head, then do all of these have positive values.


Take a list of integers; multiply each value by itself, then remove the first item, then check if every value is positive.


Take a list of integers; square them all, then Remove head, then confirm all values are positive.


Take a list of integers; raise each to the power of two, then remove the first item, then all positive.


Take a list of integers; I need each number multiplied by itself, then Remove head, then check if every number is above zero.


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


Take a list of integers; square each, then drop the first element, then return whether all values are positive.


Take a list of integers; keep multiples of three, then keep values below zero, then arrange in increasing order.


Take a list of integers; get rid of non-multiples of three, then get the negative numbers, then Organize these ascending.


Take a list of integers; keep values divisible by 3, then keep values below zero, then Sort in ascending order.


Take a list of integers; keep items where x mod 3 equals zero, then get the negative numbers, then I need this sorted ascending.


Take a list of integers; drop anything not divisible by three, then keep values below zero, then Put these in ascending order.


Take a list of integers; filter out everything except multiples of three, then get the negative numbers, then sort smallest to largest.


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


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


Take a list of integers; take the absolute value of each, then keep the leading run of positive numbers, then drop the even numbers.


Take a list of integers; convert to absolute value, then take values while they are positive, then strip out the evens.


Take a list of integers; strip the signs, then take positive values then stop, then drop the even numbers.


Take a list of integers; take abs of each, then keep going while positive, then strip out the evens.


Take a list of integers; get the absolute value of everything, then stop at first non positive, then drop the even numbers.


Take a list of integers; apply absolute value to the whole list, then take while greater than zero, then strip out the evens.


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


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


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


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


Take a list of integers; remove both ends, then keep only even values, then check if every value is positive.


Take a list of integers; trim the edges, then extract all even numbers, then confirm all values are positive.


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


Take a list of integers; cut off the first and last, then extract all even numbers, 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 % 2 == 0]
    return all(x > 0 for x in r)


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then flip the sign of each, then truncate to three items.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then show the first three.


Take a list of integers; drop the zeros, then flip the sign of each, then take the first three.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then keep first 3.


Take a list of integers; drop the zeros, then flip the sign of each, then truncate to first three.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then first three.


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


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


Take a list of integers; double each, then keep the leading run of positive numbers, then arrange in decreasing order.


Take a list of integers; times two for each item, then take values while they are positive, then arrange in descending order.


Take a list of integers; double each, then take positive values then stop, then reverse sort.