Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then exclude values of 5 and below.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then remove anything 5 or less.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then filter to keep only values above 5.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then get rid of values that aren't greater than five.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then drop anything 5 or below.


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


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


Take a list of integers; keep the odd numbers, then keep values above zero, then arrange in increasing order.


Take a list of integers; odd numbers only, then filter for positive numbers, then Organize these ascending.


Take a list of integers; keep the odd numbers, then keep only positive numbers, then Sort in ascending order.


Take a list of integers; odd numbers only, then keep the positives, then I need this sorted ascending.


Take a list of integers; keep the odd numbers, then remove negatives, then Put these in ascending order.


Take a list of integers; odd numbers only, then keep the positive numbers, then sort smallest to largest.


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


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


Take a list of integers; keep only the first three, then keep the leading run of positive numbers, then find the min, defaulting to 0.


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


Take a list of integers; take the first 3 elements, then take positive values then stop, then get the minimum value or zero if empty.


Take a list of integers; remove everything after the third, then keep going while positive, then give me the min or 0.


Take a list of integers; truncate to three items, then stop at first non positive, then return the smallest number, defaulting to 0.


Take a list of integers; show the first three, then take while greater than zero, then return smallest or zero if empty.


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


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


Take a list of integers; keep only the first three, then drop anything 5 or below, then find the min, defaulting to 0.


Take a list of integers; keep the first 3 items, then keep only numbers greater than 5, then minimum value, zero otherwise.


Take a list of integers; take the first 3 elements, then filter for numbers above 5, then get the minimum value or zero if empty.


Take a list of integers; remove everything after the third, then give me values where x is greater than 5, then give me the min or 0.


Take a list of integers; truncate to three items, then show me only the values that are bigger than five, then return the smallest number, defaulting to 0.


Take a list of integers; show the first three, then keep values greater than five, then return smallest or zero if empty.


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


Take a list of integers; keep only the first three, then keep values greater than five, then return the minimum (0 if empty).


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


Take a list of integers; rearrange by distance from zero, then double each item in the list, then arrange in descending order.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then reverse sort.


Take a list of integers; put them in order by magnitude, then double each item in the list, then sort largest to smallest.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then sort by descending values.


Take a list of integers; sort by distance from zero, then double each item in the list, then sort from highest to lowest.


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


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


Take a list of people records (name, age); extract the ages, then sort largest to smallest, then reduce each by one.


Take a list of people records (name, age); show me all ages, then sort by descending values, then Subtract 1 from all.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest, then Subtract one from each.


Take a list of people records (name, age); get the age field, then sort descending, then Drop each by one.


Take a list of people records (name, age); keep just each person's age, then sort largest first, then Decrease all values by one.


Take a list of people records (name, age); extract age values, then sort in descending order, then Remove one from each value.


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


Take a list of people records (name, age); extract the ages, then sort descending, then subtract one from each.


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


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


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


Take a list of integers; flip the order around, then give me values where x is greater than 5, then confirm all values are positive.


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


Take a list of integers; reverse that for me, then keep values greater than five, then check if every number is above zero.


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


Take a list of integers; reverse the order, then keep values greater than five, then return whether all values are positive.


Take a list of integers; drop the first element, then keep values above zero, then true if any value equals zero.


Take a list of integers; Take everything except the first, then filter for positive numbers, then check for zero.


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


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


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


Take a list of integers; Take everything except the first, then keep the positive numbers, then check for zero.


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


Take a list of integers; drop the first element, then keep the positive numbers, then return whether the list contains a zero.


Take a list of integers; keep values greater than five, then cut the list at the first zero, then give back the total.


Take a list of integers; filter out values less than or equal to 5, then cut off after the first zero appears, then sum r.


Take a list of integers; keep only numbers above 5, then take values up to (excluding) the first zero, then add them up.


Take a list of integers; exclude values of 5 and below, then keep the part before the first 0, then calculate the sum of all elements.


Take a list of integers; remove anything 5 or less, then truncate at the first zero, then what's the total.


Take a list of integers; filter to keep only values above 5, then delete everything starting with the first zero, then what do they add up to.


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


Take a list of integers; keep values greater than five, then keep everything before the first zero, then return their sum.


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


Take a list of integers; each value squared, then remove all negatives at the front, then how many items remain.


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


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


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


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then what's the count.


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


Take a list of integers; square each, then drop the leading negative values, then return how many remain.


Take a list of integers; sort ascending, then remove repeated values, then drop the odd numbers.


Take a list of integers; Sort it from low to high, then unique values preserving order, then filter out the odd numbers.


Take a list of integers; arrange in increasing order, then remove repeated values, then drop the odd numbers.


Take a list of integers; Organize these ascending, then unique values preserving order, then filter out the odd numbers.


Take a list of integers; Sort in ascending order, then remove repeated values, then drop the odd numbers.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then filter out the odd numbers.


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


Take a list of integers; sort ascending, then drop duplicates keeping first occurrence, then keep the even numbers.


Take a list of integers; drop the leading negative values, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; cut the leading negatives, then take values while they are positive, then take abs of each.


Take a list of integers; skip negatives at the start, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; remove all negatives at the front, then keep going while positive, then apply absolute value to the whole list.


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


Take a list of integers; strip the front negatives, then take while greater than zero, then make every value non-negative.


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


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


Take a list of integers; drop the first and last elements, then sort largest to smallest, then true if already sorted smallest to largest.


Take a list of integers; take out the first and last items, then sort by descending values, then does this list go in ascending order.


Take a list of integers; remove both ends, then sort from highest to lowest, then check if the list is in ascending order.


Take a list of integers; trim the edges, then sort descending, then is the list sorted.


Take a list of integers; trim one element off each end, then sort largest first, then is it sorted.


Take a list of integers; cut off the first and last, then sort in descending order, then check if values are in increasing order.


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


Take a list of integers; drop the first and last elements, then sort descending, then return whether the list is sorted ascending.


Take a list of integers; pad with zeros to at least three elements, then keep values above zero, then drop anything not divisible by three.


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


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


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


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


Take a list of integers; add zeros until the list has at least three values, then keep the positive numbers, then give me only the values divisible by three.


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


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


Take a list of integers; drop the first and last elements, then increase every value by 10, then drop anything not divisible by three.


Take a list of integers; take out the first and last items, then add 10 to each item, then filter out everything except multiples of three.


Take a list of integers; remove both ends, then shift each up by ten, then keep only multiples of three.


Take a list of integers; trim the edges, then increase all numbers by 10, then multiples of three only.


Take a list of integers; trim one element off each end, then add 10 to everything, then filter for numbers divisible by three.


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


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


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


Take a list of integers; keep values greater than five, then sort largest to smallest, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then sort descending, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then sort largest first, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then sort in descending order, then sort smallest to largest.


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


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


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


Take a list of integers; each value squared, then get the negative numbers, then strip out the evens.


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


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


Take a list of integers; raise each to the power of two, then keep values below zero, then drop the even numbers.


Take a list of integers; I need each number multiplied by itself, then get the negative numbers, then strip out the evens.


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


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


Take a list of integers; if empty, use a single zero, then increment each value, then keep only numbers above 5.


Take a list of integers; if blank use 0, then plus one for all, then exclude values of 5 and below.


Take a list of integers; default to [0] when there is nothing, then increment each value, then remove anything 5 or less.


Take a list of integers; when the list is empty, substitute a zero value, then plus one for all, then filter to keep only values above 5.


Take a list of integers; replace an empty list with one zero, then increment each value, then get rid of values that aren't greater than five.


Take a list of integers; zero it out if it's empty, then plus one for all, then drop anything 5 or below.


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


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


Take a list of integers; cap each value at 10, then multiply each by two, then true only if all are positive.


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


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


Take a list of integers; clip values at 10, then double each item in the list, then confirm all values are positive.


Take a list of integers; cap each value at 10, then multiply each by two, then all positive.


Take a list of integers; clip values at 10, then double each item in the list, then check if every number is above zero.


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


Take a list of integers; cap each value at 10, then double each, then return whether all values are positive.


Take a list of integers; keep the positive numbers, then flip the list around, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then flip the order around, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then put the elements backwards, then add 10 to everything.


Take a list of integers; drop the negative numbers, then reverse that for me, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then flip it backwards, then increment each by ten.


Take a list of integers; remove all negative values, then make it backwards, then add a constant 10 to each.


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


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


Take a list of integers; sort by absolute value, then increment each value, then true if already sorted smallest to largest.


Take a list of integers; rearrange by distance from zero, then plus one for all, then does this list go in ascending order.


Take a list of integers; arrange by magnitude ignoring sign, then increment each value, then check if the list is in ascending order.


Take a list of integers; put them in order by magnitude, then plus one for all, then is the list sorted.


Take a list of integers; arrange in order of absolute value, then increment each value, then is it sorted.


Take a list of integers; sort by distance from zero, then plus one for all, then check if values are in increasing order.


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


Take a list of integers; sort by absolute value, then add one to each, then return whether the list is sorted ascending.


Take a list of integers; cap each value at 10, then increment each value, then drop non-negative values.


Take a list of integers; clip values at 10, then plus one for all, then drop all positive numbers.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove both ends, then put the elements backwards.


Take a list of integers; add zeros until the list has at least three values, then trim the edges, then reverse that for me.


Take a list of integers; pad with zeros to at least three elements, then trim one element off each end, then flip it backwards.


Take a list of integers; add zeros until the list has at least three values, then cut off the first and last, then make it backwards.


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


Take a list of integers; add zeros until the list has at least three values, then keep only the middle part, then invert the sequence.


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


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


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


Take a list of integers; make each one bigger, then don't let anything exceed 10, then Subtract 1 from all.


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


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


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


Take a list of integers; make each one bigger, then don't let anything exceed 10, then Remove one from each value.


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


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


Take a list of integers; sort descending, then keep only odd values, then true if already sorted smallest to largest.


Take a list of integers; sort largest first, then eliminate the even numbers, then does this list go in ascending order.


Take a list of integers; sort in descending order, then keep only odd values, then check if the list is in ascending order.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then is the list sorted.


Take a list of integers; sort z to a, then keep only odd values, then is it sorted.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then check if values are in increasing order.


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


Take a list of integers; sort descending, then keep the odd numbers, then return whether the list is sorted ascending.


Take a list of integers; negate each, then take the final 3 elements, then true if every value is unique.


Take a list of integers; reverse the signs of everything, then drop everything except the final three, then check for duplicates in the values.


Take a list of integers; negate each, then give me the last three elements, then do all values appear only once.


Take a list of integers; reverse the signs of everything, then keep only the last three, then check that there are no duplicates.


Take a list of integers; negate each, then keep the final three items, then are the values all unique.


Take a list of integers; reverse the signs of everything, then take the last three, then check if all values are unique.


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


Take a list of integers; negate each, then keep only the last three, then return whether all values are distinct.


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


Take a list of integers; sort largest first, then exclude zeros, then Subtract 1 from all.


Take a list of integers; sort in descending order, then remove all zero values, then Subtract one from each.


Take a list of integers; sort from greatest to least, then exclude zeros, then Drop each by one.


Take a list of integers; sort z to a, then remove all zero values, then Decrease all values by one.


Take a list of integers; arrange in decreasing order, then exclude zeros, then Remove one from each value.


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


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


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


Take a list of integers; keep the final three items, then get the negative numbers, then remove repeats.


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


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


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


Take a list of integers; truncate to the last three items, then get the negative numbers, then remove repeats.


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


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


Take a list of strings; sort alphabetically, then remove repeated strings, then find how long the longest string is.


Take a list of strings; arrange alphabetically, then keep unique strings first appearance, then give the length of the longest string in the list.


Take a list of strings; sort alphabetically, then eliminate repeated strings preserve first occurrence, then get me the longest string's length.


Take a list of strings; arrange alphabetically, then drop duplicate strings keeping the first, then give the maximum string length.


Take a list of strings; sort alphabetically, then dedupe, then max length of all strings.


Take a list of strings; arrange alphabetically, then remove duplicate strings keep first, then what's the max string length.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = list(dict.fromkeys(r))
    return max((len(s) for s in r), default=0)


Take a list of strings; sort alphabetically, then drop duplicate strings keeping the first, then return the length of the longest string (0 if none).


Take a list of integers; negate each, then keep values below zero, then find the min, defaulting to 0.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then minimum value, zero otherwise.


Take a list of integers; negate each, then keep values below zero, then get the minimum value or zero if empty.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then give me the min or 0.


Take a list of integers; negate each, then keep values below zero, then return the smallest number, defaulting to 0.


Take a list of integers; reverse the signs of everything, then get the negative numbers, then return smallest or zero if empty.


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


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


Take a list of integers; keep multiples of three, then make every value non-negative, then true if at least one even value.


Take a list of integers; get rid of non-multiples of three, then absolute value for all items, then any even.


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


Take a list of integers; keep items where x mod 3 equals zero, then turn negatives into positives, then any even.


Take a list of integers; drop anything not divisible by three, then abs each element, then true if at least one even value.


Take a list of integers; filter out everything except multiples of three, then take the absolute value of each, then any even.


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


Take a list of integers; keep multiples of three, then take the absolute value of each, then return whether any value is even.


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then arrange by magnitude ignoring sign.


Take a list of people records (name, age); show me all ages, then drop everything except the final three, then put them in order by magnitude.


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then arrange in order of absolute value.


Take a list of people records (name, age); get the age field, then keep only the last three, then sort by distance from zero.


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then order by how far from zero.


Take a list of people records (name, age); extract age values, then take the last three, then order by distance from zero.


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


Take a list of people records (name, age); extract the ages, then keep only the last three, then sort by absolute value.


Take a list of integers; keep the even numbers, then increase every value by 10, then drop non-positive values.


Take a list of integers; keep evens, then add 10 to each item, then drop the negative numbers.


Take a list of integers; keep the even numbers, then shift each up by ten, then filter out the negative ones.


Take a list of integers; keep evens, then increase all numbers by 10, then remove all negative values.


Take a list of integers; keep the even numbers, then add 10 to everything, then keep positive values only.


Take a list of integers; keep evens, then give everything a boost of 10, then keep values above zero.


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


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


Take a list of integers; drop the leading negative values, then multiply each by two, then reduce each by one.


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


Take a list of integers; skip negatives at the start, then multiply each by two, then Subtract one from each.


Take a list of integers; remove all negatives at the front, then double each item in the list, then Drop each by one.


Take a list of integers; remove the initial run of negative numbers, then multiply each by two, then Decrease all values by one.


Take a list of integers; strip the front negatives, then double each item in the list, then Remove one from each value.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove both ends, then truncate to three items.


Take a list of integers; add zeros until the list has at least three values, then trim the edges, then show the first three.


Take a list of integers; pad with zeros to at least three elements, then trim one element off each end, then take the first three.


Take a list of integers; add zeros until the list has at least three values, then cut off the first and last, then keep first 3.


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


Take a list of integers; add zeros until the list has at least three values, then keep only the middle part, then first three.


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


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


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


Take a list of integers; each value squared, then double each item in the list, then reverse that for me.


Take a list of integers; multiply each value by itself, then multiply each by two, then flip it backwards.


Take a list of integers; square them all, then double each item in the list, then make it backwards.


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


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then invert the sequence.


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


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


Take a list of integers; keep only the first three, then remove all zero values, then make each twice as big.


Take a list of integers; keep the first 3 items, then exclude zeros, then multiply each by 2.


Take a list of integers; take the first 3 elements, then remove all zero values, then make each twice as big.


Take a list of integers; remove everything after the third, then exclude zeros, then multiply each by 2.


Take a list of integers; truncate to three items, then remove all zero values, then make each twice as big.


Take a list of integers; show the first three, then exclude zeros, then multiply each by 2.


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


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


Take a list of integers; subtract one from each, then keep only even values, then give back the total.


Take a list of integers; Decrement all items, then extract all even numbers, then sum r.


Take a list of integers; decrement each value, then keep only even values, then add them up.


Take a list of integers; Lower each number by one, then extract all even numbers, then calculate the sum of all elements.


Take a list of integers; reduce each by one, then keep only even values, then what's the total.


Take a list of integers; Subtract 1 from all, then extract all even numbers, then what do they add up to.


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


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


Take a list of integers; keep values greater than five, then sort largest to smallest, then strip the signs.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values, then take abs of each.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then get the absolute value of everything.


Take a list of integers; exclude values of 5 and below, then sort descending, then apply absolute value to the whole list.


Take a list of integers; remove anything 5 or less, then sort largest first, then make them all positive.


Take a list of integers; filter to keep only values above 5, then sort in descending order, then make every value non-negative.


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


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


Take a list of integers; sort ascending, then sort largest to smallest, then true if any value equals zero.


Take a list of integers; Sort it from low to high, then sort by descending values, then check for zero.


Take a list of integers; arrange in increasing order, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; Organize these ascending, then sort descending, then check for zero.


Take a list of integers; Sort in ascending order, then sort largest first, then true if any value equals zero.


Take a list of integers; I need this sorted ascending, then sort in descending order, then check for zero.


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


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


Take a list of integers; take values while they are positive, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; take positive values then stop, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep going while positive, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; stop at first non positive, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take while greater than zero, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; take values while positive, then Remove head, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; double each, then cut the list at the first zero, then arrange by magnitude ignoring sign.


Take a list of integers; times two for each item, then cut off after the first zero appears, then put them in order by magnitude.


Take a list of integers; double each, then take values up to (excluding) the first zero, then arrange in order of absolute value.


Take a list of integers; times two for each item, then keep the part before the first 0, then sort by distance from zero.


Take a list of integers; double each, then truncate at the first zero, then order by how far from zero.


Take a list of integers; times two for each item, then delete everything starting with the first zero, then order by distance from zero.


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


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


Take a list of integers; if empty, use a single zero, then remove repeated values, then true if already sorted smallest to largest.


Take a list of integers; if blank use 0, then unique values preserving order, then does this list go in ascending order.


Take a list of integers; default to [0] when there is nothing, then remove repeated values, then check if the list is in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then unique values preserving order, then is the list sorted.


Take a list of integers; replace an empty list with one zero, then remove repeated values, then is it sorted.


Take a list of integers; zero it out if it's empty, then unique values preserving order, then check if values are in increasing order.


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


Take a list of integers; if empty, use a single zero, then drop duplicates keeping first occurrence, then return whether the list is sorted ascending.


Take a list of integers; keep only the first three, then make every value non-negative, then find the min, defaulting to 0.


Take a list of integers; keep the first 3 items, then absolute value for all items, then minimum value, zero otherwise.


Take a list of integers; take the first 3 elements, then take absolute values, then get the minimum value or zero if empty.


Take a list of integers; remove everything after the third, then turn negatives into positives, then give me the min or 0.


Take a list of integers; truncate to three items, then abs each element, then return the smallest number, defaulting to 0.


Take a list of integers; show the first three, then take the absolute value of each, then return smallest or zero if empty.


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


Take a list of integers; keep only the first three, then take the absolute value of each, then return the minimum (0 if empty).


Take a list of integers; sort by absolute value, then keep values below zero, then true if any value equals zero.


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


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then true if any value equals zero.


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


Take a list of integers; arrange in order of absolute value, then keep values below zero, then true if any value equals zero.


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


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


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


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


Take a list of integers; odd numbers only, then sort by descending values, then show the first three.


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


Take a list of integers; odd numbers only, then sort descending, then keep first 3.


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


Take a list of integers; odd numbers only, then sort in descending order, then first three.


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


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


Take a list of integers; cap each value at 10, then flip the list around, then drop non-negative values.


Take a list of integers; clip values at 10, then flip the order around, then drop all positive numbers.


Take a list of integers; cap each value at 10, then put the elements backwards, then drop non-negative values.


Take a list of integers; clip values at 10, then reverse that for me, then drop all positive numbers.


Take a list of integers; cap each value at 10, then flip it backwards, then drop non-negative values.


Take a list of integers; clip values at 10, then make it backwards, then drop all positive numbers.


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


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


Take a list of integers; sort by absolute value, then make every value non-negative, then multiply each by -1.


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


Take a list of integers; arrange by magnitude ignoring sign, then take absolute values, then multiply each by -1.


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


Take a list of integers; arrange in order of absolute value, then abs each element, then multiply each by -1.


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


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


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


Take a list of integers; add ten to each, then make every value non-negative, then remove the initial run of negative numbers.


Take a list of integers; bump everything up by 10, then absolute value for all items, then strip the front negatives.


Take a list of integers; increase every value by 10, then take absolute values, then remove leading negative numbers.


Take a list of integers; add 10 to each item, then turn negatives into positives, then drop negatives from start.


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


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


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


Take a list of integers; add ten to each, then take the absolute value of each, then drop the leading negative values.


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


Take a list of integers; clip values at 10, then square them all, then keep the leading run of positive numbers.


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


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


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


Take a list of integers; clip values at 10, then multiply each element by itself, then stop at first non positive.


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


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


Take a list of integers; sort descending, then keep the leading run of positive numbers, then drop non-positive values.


Take a list of integers; sort largest first, then take values while they are positive, then drop the negative numbers.


Take a list of integers; sort in descending order, then take positive values then stop, then filter out the negative ones.


Take a list of integers; sort from greatest to least, then keep going while positive, then remove all negative values.


Take a list of integers; sort z to a, then stop at first non positive, then keep positive values only.


Take a list of integers; arrange in decreasing order, then take while greater than zero, then keep values above zero.


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


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


Take a list of integers; keep the negative numbers, then order by distance from zero, then give back the total.


Take a list of integers; extract negatives, then sort based on absolute value, then sum r.


Take a list of integers; keep the negative numbers, then organize by magnitude, then add them up.


Take a list of integers; extract negatives, then arrange by absolute value ascending, then calculate the sum of all elements.


Take a list of integers; keep the negative numbers, then sort from smallest to largest absolute value, then what's the total.


Take a list of integers; extract negatives, then sort by absolute value, then what do they add up to.


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


Take a list of integers; keep the negative numbers, then sort by absolute value, then return their sum.


Take a list of integers; sort descending, then keep only even values, then truncate to three items.


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


Take a list of integers; sort in descending order, then keep only even values, then take the first three.


Take a list of integers; sort from greatest to least, then extract all even numbers, then keep first 3.


Take a list of integers; sort z to a, then keep only even values, then truncate to first three.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then first three.


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


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


Take a list of integers; reverse the order, then cut the list at the first zero, then keep only non-zero numbers.


Take a list of integers; reverse, then cut off after the first zero appears, then strip the zeros.


Take a list of integers; flip the list around, then take values up to (excluding) the first zero, then keep only non-zero numbers.


Take a list of integers; flip the order around, then keep the part before the first 0, then strip the zeros.


Take a list of integers; put the elements backwards, then truncate at the first zero, then keep only non-zero numbers.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then strip the zeros.


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


Take a list of integers; reverse the order, then keep everything before the first zero, then drop the zeros.


Take a list of people records (name, age); extract the ages, then remove repeated values, then remove the initial run of negative numbers.


Take a list of people records (name, age); show me all ages, then unique values preserving order, then strip the front negatives.


Take a list of people records (name, age); pluck the age field from each record, then remove repeated values, then remove leading negative numbers.


Take a list of people records (name, age); get the age field, then unique values preserving order, then drop negatives from start.


Take a list of people records (name, age); keep just each person's age, then remove repeated values, then strip negative values from the start.


Take a list of people records (name, age); extract age values, then unique values preserving order, then remove negatives before the first non-negative.


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


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


Take a list of strings; sort alphabetically, then take each string's first letter, then prepend a hash mark to each.


Take a list of strings; arrange alphabetically, then give me the first letter of everything, then prefix all with #.


Take a list of strings; sort alphabetically, then reduce each string to its first character, then prepend a hash mark to each.


Take a list of strings; arrange alphabetically, then take first char drop blanks, then prefix all with #.


Take a list of strings; sort alphabetically, then keep first letters only, then prepend a hash mark to each.


Take a list of strings; arrange alphabetically, then first letter from each item that isn't empty, then prefix all with #.


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


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


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


Take a list of integers; odd numbers only, then filter for positive numbers, then does this list go in ascending order.


Take a list of integers; keep the odd numbers, then keep only positive numbers, then check if the list is in ascending order.


Take a list of integers; odd numbers only, then keep the positives, then is the list sorted.


Take a list of integers; keep the odd numbers, then remove negatives, then is it sorted.


Take a list of integers; odd numbers only, then keep the positive numbers, then check if values are in increasing order.


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


Take a list of integers; keep the odd numbers, then keep the positive numbers, then return whether the list is sorted ascending.


Take a list of integers; add one to each, then flip the list around, then raise each to the power of two.


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


Take a list of integers; add one to each, then put the elements backwards, then square all of them.


Take a list of integers; make each one bigger, then reverse that for me, then multiply each element by itself.


Take a list of integers; add one to each, then flip it backwards, then make each one squared.


Take a list of integers; make each one bigger, then make it backwards, then square each value in the list.


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


Take a list of integers; add one to each, then reverse the order, then square each.


Take a list of integers; take values while they are positive, then keep only odd values, then find the min, defaulting to 0.


Take a list of integers; take positive values then stop, then eliminate the even numbers, then minimum value, zero otherwise.


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


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


Take a list of integers; take while greater than zero, then keep only odd values, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then eliminate the even numbers, then return smallest or zero if empty.


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


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


Take a list of integers; cap each value at 10, then keep only odd values, then take values up to (excluding) the first zero.


Take a list of integers; clip values at 10, then eliminate the even numbers, then keep the part before the first 0.


Take a list of integers; cap each value at 10, then keep only odd values, then truncate at the first zero.


Take a list of integers; clip values at 10, then eliminate the even numbers, then delete everything starting with the first zero.


Take a list of integers; cap each value at 10, then keep only odd values, then remove from the first zero onwards.


Take a list of integers; clip values at 10, then eliminate the even numbers, then up to but not including the first zero.


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


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


Take a list of integers; keep only the last three, then default to [0] when there is nothing, then true if already sorted smallest to largest.


Take a list of integers; keep the final three items, then when the list is empty, substitute a zero value, then does this list go in ascending order.


Take a list of integers; take the last three, then replace an empty list with one zero, then check if the list is in ascending order.


Take a list of integers; trim to the last three, then zero it out if it's empty, then is the list sorted.


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


Take a list of integers; truncate to the last three items, then default to zero when empty, then check if values are in increasing order.


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


Take a list of integers; keep only the last three, then if empty, use a single zero, then return whether the list is sorted ascending.


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then check for zero.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then zero it out if it's empty, then check for zero.


Take a list of integers; drop the zeros, then use zero if the list is empty, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then check for zero.


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


Take a list of integers; drop the zeros, then if empty, use a single zero, then return whether the list contains a zero.


Take a list of integers; take values while they are positive, then remove the first item, then shift each up by ten.


Take a list of integers; take positive values then stop, then Remove head, then increase all numbers by 10.


Take a list of integers; keep going while positive, then remove the first item, then add 10 to everything.


Take a list of integers; stop at first non positive, then Remove head, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then remove the first item, then increment each by ten.


Take a list of integers; take values while positive, then Remove head, then add a constant 10 to each.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then give the number of evens.


Take a list of integers; Sort it from low to high, then pad to 3, then find how many values are divisible by two.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then how many are even.


Take a list of integers; Organize these ascending, then pad to 3, then get the total number of even values in the list.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then give me the count of even values.


Take a list of integers; I need this sorted ascending, then pad to 3, then I need to know how many of these are even.


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


Take a list of integers; sort ascending, then pad with zeros to at least three elements, then return how many values are even.


Take a list of integers; add one to each, then drop anything 5 or below, then skip the first one.


Take a list of integers; make each one bigger, then keep only numbers greater than 5, then Discard the first element.


Take a list of integers; add one to each, then filter for numbers above 5, then skip the first one.


Take a list of integers; make each one bigger, then give me values where x is greater than 5, then Discard the first element.


Take a list of integers; add one to each, then show me only the values that are bigger than five, then skip the first one.


Take a list of integers; make each one bigger, then keep values greater than five, then Discard the first element.


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


Take a list of integers; add one to each, then keep values greater than five, then drop the first element.


Take a list of integers; keep only the last three, then keep the leading run of positive numbers, then trim one element off each end.


Take a list of integers; keep the final three items, then take values while they are positive, then cut off the first and last.


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


Take a list of integers; trim to the last three, then keep going while positive, then keep only the middle part.


Take a list of integers; last three only, then stop at first non positive, then drop first and last.


Take a list of integers; truncate to the last three items, then take while greater than zero, then eliminate the outermost elements.


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


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


Take a list of integers; cap each value at 10, then cut the list at the first zero, then strip the signs.


Take a list of integers; clip values at 10, then cut off after the first zero appears, then take abs of each.


Take a list of integers; cap each value at 10, then take values up to (excluding) the first zero, then get the absolute value of everything.


Take a list of integers; clip values at 10, then keep the part before the first 0, then apply absolute value to the whole list.


Take a list of integers; cap each value at 10, then truncate at the first zero, then make them all positive.


Take a list of integers; clip values at 10, then delete everything starting with the first zero, then make every value non-negative.


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
    r = [abs(x) for x in r]
    return r


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


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


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


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


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


Take a list of integers; put the elements backwards, then truncate at the first zero, then ensure at least three items by appending zeros.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then limit every value to 10.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then maximum of 10 for all.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then limit every value to 10.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then maximum of 10 for all.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then limit every value to 10.


Take a list of integers; sort by distance from zero, then get the negative numbers, then maximum of 10 for all.


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


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


Take a list of integers; keep everything before the first zero, then increase every value by 10, then arrange in increasing order.


Take a list of integers; take only what comes before the initial zero, then add 10 to each item, then Organize these ascending.


Take a list of integers; cut the list at the first zero, then shift each up by ten, then Sort in ascending order.


Take a list of integers; cut off after the first zero appears, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; take values up to (excluding) the first zero, then add 10 to everything, then Put these in ascending order.


Take a list of integers; keep the part before the first 0, then give everything a boost of 10, then sort smallest to largest.


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


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


Take a list of integers; drop the leading negative values, then keep values above zero, then true only if all are positive.


Take a list of integers; cut the leading negatives, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; skip negatives at the start, then keep only positive numbers, then check if every value is positive.


Take a list of integers; remove all negatives at the front, then keep the positives, then confirm all values are positive.


Take a list of integers; remove the initial run of negative numbers, then remove negatives, then all positive.


Take a list of integers; strip the front negatives, then keep the positive numbers, then check if every number is above zero.


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


Take a list of integers; drop the leading negative values, then keep the positive numbers, then return whether all values are positive.


Take a list of integers; keep the odd numbers, then decrement each value, then keep only numbers above 5.


Take a list of integers; odd numbers only, then Lower each number by one, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then reduce each by one, then remove anything 5 or less.


Take a list of integers; odd numbers only, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; keep the odd numbers, then Subtract one from each, then get rid of values that aren't greater than five.


Take a list of integers; odd numbers only, then Drop each by one, then drop anything 5 or below.


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


Take a list of integers; keep the odd numbers, then subtract one from each, then keep values greater than five.


Take a list of integers; keep values greater than five, then keep values divisible by 3, then count the elements.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then how many items remain.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then tell me the length.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then return the length.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then count them.


Take a list of integers; filter to keep only values above 5, then multiples of three only, then what's the count.


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


Take a list of integers; keep values greater than five, then keep multiples of three, then return how many remain.


Take a list of integers; reverse the order, then clamp each to at most ten, then arrange in decreasing order.


Take a list of integers; reverse, then don't let anything exceed 10, then arrange in descending order.


Take a list of integers; flip the list around, then clamp each to at most ten, then reverse sort.


Take a list of integers; flip the order around, then don't let anything exceed 10, then sort largest to smallest.


Take a list of integers; put the elements backwards, then clamp each to at most ten, then sort by descending values.


Take a list of integers; reverse that for me, then don't let anything exceed 10, then sort from highest to lowest.


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


Take a list of integers; reverse the order, then cap each value at 10, then sort descending.


Take a list of integers; drop the leading negative values, then flip the sign of each, then drop the even numbers.


Take a list of integers; cut the leading negatives, then turn positives to negatives and vice versa, then strip out the evens.


Take a list of integers; skip negatives at the start, then flip the sign of each, then drop the even numbers.


Take a list of integers; remove all negatives at the front, then turn positives to negatives and vice versa, then strip out the evens.


Take a list of integers; remove the initial run of negative numbers, then flip the sign of each, then drop the even numbers.


Take a list of integers; strip the front negatives, then turn positives to negatives and vice versa, then strip out the evens.


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


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


Take a list of integers; drop the zeros, then remove both ends, then drop the odd numbers.


Take a list of integers; keep only nonzero elements, then trim the edges, then filter out the odd numbers.


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


Take a list of integers; keep only nonzero elements, then cut off the first and last, then filter out the odd numbers.


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


Take a list of integers; keep only nonzero elements, then keep only the middle part, then filter out the odd numbers.


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


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


Take a list of integers; keep only the last three, then keep values above zero, then raise each to the power of two.


Take a list of integers; keep the final three items, then filter for positive numbers, then I need each number multiplied by itself.


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


Take a list of integers; trim to the last three, then keep the positives, then multiply each element by itself.


Take a list of integers; last three only, then remove negatives, then make each one squared.


Take a list of integers; truncate to the last three items, then keep the positive numbers, then square each value in the list.


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


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


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


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


Take a list of integers; remove both ends, then take absolute values, then deduplicate the list.


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


Take a list of integers; trim one element off each end, then abs each element, then deduplicate the list.


Take a list of integers; cut off the first and last, then take the absolute value of each, then remove repeats.


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


Take a list of integers; drop the first and last elements, then take the absolute value of each, then drop duplicates keeping first occurrence.


Take a list of integers; keep the even numbers, then sort largest to smallest, then count the elements.


Take a list of integers; keep evens, then sort by descending values, then how many items remain.


Take a list of integers; keep the even numbers, then sort from highest to lowest, then tell me the length.


Take a list of integers; keep evens, then sort descending, then return the length.


Take a list of integers; keep the even numbers, then sort largest first, then count them.


Take a list of integers; keep evens, then sort in descending order, then what's the count.


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


Take a list of integers; keep the even numbers, then sort descending, then return how many remain.


Take a list of integers; sort descending, then flip the list around, then give the earliest even value or zero.


Take a list of integers; sort largest first, then flip the order around, then fetch the first even element, default to 0.


Take a list of integers; sort in descending order, then put the elements backwards, then give the earliest even value or zero.


Take a list of integers; sort from greatest to least, then reverse that for me, then fetch the first even element, default to 0.


Take a list of integers; sort z to a, then flip it backwards, then give the earliest even value or zero.


Take a list of integers; arrange in decreasing order, then make it backwards, then fetch the first even element, default to 0.


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


Take a list of integers; sort descending, then reverse the order, then return the first even value (0 if none).


Take a list of integers; take values while they are positive, then take the first 3 elements, then drop the even numbers.


Take a list of integers; take positive values then stop, then remove everything after the third, then strip out the evens.


Take a list of integers; keep going while positive, then truncate to three items, then drop the even numbers.


Take a list of integers; stop at first non positive, then show the first three, then strip out the evens.


Take a list of integers; take while greater than zero, then take the first three, then drop the even numbers.


Take a list of integers; take values while positive, then keep first 3, then strip out the evens.


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


Take a list of integers; take values while they are positive, then keep only the first three, then keep the odd numbers.


Take a list of integers; take values while they are positive, then skip negatives at the start, then true only if all are positive.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then do all of these have positive values.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then check if every value is positive.


Take a list of integers; stop at first non positive, then strip the front negatives, then confirm all values are positive.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then all positive.


Take a list of integers; take values while positive, then drop negatives from start, then check if every number is above zero.


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


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


Take a list of integers; drop the first element, then increase every value by 10, then put the elements backwards.


Take a list of integers; Take everything except the first, then add 10 to each item, then reverse that for me.


Take a list of integers; drop the first element, then shift each up by ten, then flip it backwards.


Take a list of integers; Take everything except the first, then increase all numbers by 10, then make it backwards.


Take a list of integers; drop the first element, then add 10 to everything, then reverse the list.


Take a list of integers; Take everything except the first, then give everything a boost of 10, then invert the sequence.


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


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


Take a list of integers; drop the zeros, then flip the list around, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then flip the order around, then arrange in descending order.


Take a list of integers; drop the zeros, then put the elements backwards, then reverse sort.


Take a list of integers; keep only nonzero elements, then reverse that for me, then sort largest to smallest.


Take a list of integers; drop the zeros, then flip it backwards, then sort by descending values.


Take a list of integers; keep only nonzero elements, then make it backwards, then sort from highest to lowest.


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


Take a list of integers; drop the zeros, then reverse the order, then sort descending.


Take a list of integers; drop the first element, then drop anything 5 or below, then drop the even numbers.


Take a list of integers; Take everything except the first, then keep only numbers greater than 5, then strip out the evens.


Take a list of integers; drop the first element, then filter for numbers above 5, then drop the even numbers.


Take a list of integers; Take everything except the first, then give me values where x is greater than 5, then strip out the evens.


Take a list of integers; drop the first element, then show me only the values that are bigger than five, then drop the even numbers.


Take a list of integers; Take everything except the first, then keep values greater than five, then strip out the evens.


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


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


Take a list of integers; keep only the first three, then sort smallest to largest, then give the number of evens.


Take a list of integers; keep the first 3 items, then Ascending sort, then find how many values are divisible by two.


Take a list of integers; take the first 3 elements, then Sort this ascending, then how many are even.


Take a list of integers; remove everything after the third, then Sort lowest to highest, then get the total number of even values in the list.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then give me the count of even values.


Take a list of integers; show the first three, then sort ascending, then I need to know how many of these are even.


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


Take a list of integers; keep only the first three, then sort ascending, then return how many values are even.


Take a list of integers; cap each value at 10, then take the final 3 elements, then keep only numbers above 5.


Take a list of integers; clip values at 10, then drop everything except the final three, then exclude values of 5 and below.


Take a list of integers; cap each value at 10, then give me the last three elements, then remove anything 5 or less.


Take a list of integers; clip values at 10, then keep only the last three, then filter to keep only values above 5.


Take a list of integers; cap each value at 10, then keep the final three items, then get rid of values that aren't greater than five.


Take a list of integers; clip values at 10, then take the last three, then drop anything 5 or below.


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


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


Take a list of integers; reverse the order, then flip the sign of each, then ensure at least three items by appending zeros.


Take a list of integers; reverse, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; flip the order around, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; reverse that for me, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; cap each value at 10, then multiply each value by itself, then truncate to three items.


Take a list of integers; clip values at 10, then square them all, then show the first three.


Take a list of integers; cap each value at 10, then raise each to the power of two, then take the first three.


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


Take a list of integers; cap each value at 10, then square all of them, then truncate to first three.


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


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


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


Take a list of integers; drop the zeros, then multiply each by two, then give back the product of all values.


Take a list of integers; keep only nonzero elements, then double each item in the list, then product of the list.


Take a list of integers; drop the zeros, then multiply each by two, then what's the product.


Take a list of integers; keep only nonzero elements, then double each item in the list, then what do they multiply to.


Take a list of integers; drop the zeros, then multiply each by two, then give me their product.


Take a list of integers; keep only nonzero elements, then double each item in the list, then multiply them all together.


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


Take a list of integers; drop the zeros, then double each, then return their product.


Take a list of integers; keep multiples of three, then flip the sign of each, then arrange in increasing order.


Take a list of integers; get rid of non-multiples of three, then turn positives to negatives and vice versa, then Organize these ascending.


Take a list of integers; keep values divisible by 3, then flip the sign of each, then Sort in ascending order.


Take a list of integers; keep items where x mod 3 equals zero, then turn positives to negatives and vice versa, then I need this sorted ascending.


Take a list of integers; drop anything not divisible by three, then flip the sign of each, then Put these in ascending order.


Take a list of integers; filter out everything except multiples of three, then turn positives to negatives and vice versa, 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]
    r = sorted(r)
    return r


Take a list of integers; keep multiples of three, then negate each, then sort ascending.


Take a list of integers; take the absolute value of each, then take the first 3 elements, then stop at the first non-positive value.


Take a list of integers; convert to absolute value, then remove everything after the third, then keep the leading run of positive numbers.


Take a list of integers; strip the signs, then truncate to three items, then take values while they are positive.


Take a list of integers; take abs of each, then show the first three, then take positive values then stop.


Take a list of integers; get the absolute value of everything, then take the first three, then keep going while positive.


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


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = r[:3]
    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 only the first three, then take values while they are positive.


Take a list of integers; pad with zeros to at least three elements, then default to [0] when there is nothing, then drop the odd numbers.


Take a list of integers; add zeros until the list has at least three values, then when the list is empty, substitute a zero value, then filter out the odd numbers.


Take a list of integers; pad with zeros to at least three elements, then replace an empty list with one zero, then drop the odd numbers.


Take a list of integers; add zeros until the list has at least three values, then zero it out if it's empty, then filter out the odd numbers.


Take a list of integers; pad with zeros to at least three elements, then use zero if the list is empty, then drop the odd numbers.


Take a list of integers; add zeros until the list has at least three values, then default to zero when empty, then filter out the odd numbers.


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


Take a list of integers; pad with zeros to at least three elements, then if empty, use a single zero, then keep the even numbers.


Take a list of integers; keep multiples of three, then sort largest to smallest, then find the min, defaulting to 0.


Take a list of integers; get rid of non-multiples of three, then sort by descending values, then minimum value, zero otherwise.


Take a list of integers; keep values divisible by 3, then sort from highest to lowest, then get the minimum value or zero if empty.


Take a list of integers; keep items where x mod 3 equals zero, then sort descending, then give me the min or 0.


Take a list of integers; drop anything not divisible by three, then sort largest first, then return the smallest number, defaulting to 0.


Take a list of integers; filter out everything except multiples of three, then sort in descending order, then return smallest or zero if empty.


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


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


Take a list of integers; keep the positive numbers, then increase every value by 10, then skip the first one.


Take a list of integers; get rid of anything that's not positive, then add 10 to each item, then Discard the first element.


Take a list of integers; drop non-positive values, then shift each up by ten, then skip the first one.


Take a list of integers; drop the negative numbers, then increase all numbers by 10, then Discard the first element.


Take a list of integers; filter out the negative ones, then add 10 to everything, then skip the first one.


Take a list of integers; remove all negative values, then give everything a boost of 10, then Discard the first element.


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


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


Take a list of strings; prefix each with a hash, then strip spaces around each string, then reduce each string to its first character.


Take a list of strings; add # to the start of each string, then remove leading and trailing spaces, then take first char drop blanks.


Take a list of strings; prefix each with a hash, then remove whitespace from each item, then keep first letters only.


Take a list of strings; add # to the start of each string, then clean whitespace from each entry, then first letter from each item that isn't empty.


Take a list of strings; prefix each with a hash, then trim each string, then grab the first char from each.


Take a list of strings; add # to the start of each string, then trim whitespace from each, then isolate the first character per entry.


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


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


Take a list of integers; double each, then take the final 3 elements, then stop at the first non-positive value.


Take a list of integers; times two for each item, then drop everything except the final three, then keep the leading run of positive numbers.


Take a list of integers; double each, then give me the last three elements, then take values while they are positive.


Take a list of integers; times two for each item, then keep only the last three, then take positive values then stop.


Take a list of integers; double each, then keep the final three items, then keep going while positive.


Take a list of integers; times two for each item, then take the last three, then stop at first non positive.


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


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


Take a list of integers; drop the zeros, then take the final 3 elements, then true if every value is unique.


Take a list of integers; keep only nonzero elements, then drop everything except the final three, then check for duplicates in the values.


Take a list of integers; drop the zeros, then give me the last three elements, then do all values appear only once.


Take a list of integers; keep only nonzero elements, then keep only the last three, then check that there are no duplicates.


Take a list of integers; drop the zeros, then keep the final three items, then are the values all unique.


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


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


Take a list of integers; drop the zeros, then keep only the last three, then return whether all values are distinct.


Take a list of integers; keep only the last three, then default to [0] when there is nothing, then multiply each by -1.


Take a list of integers; keep the final three items, then when the list is empty, substitute a zero value, then negate.


Take a list of integers; take the last three, then replace an empty list with one zero, then multiply each by -1.


Take a list of integers; trim to the last three, then zero it out if it's empty, then negate.


Take a list of integers; last three only, then use zero if the list is empty, then multiply each by -1.


Take a list of integers; truncate to the last three items, then default to zero when empty, then negate.


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


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


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


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


Take a list of integers; remove both ends, then keep only odd values, then keep only multiples of three.


Take a list of integers; trim the edges, then eliminate the even numbers, then multiples of three only.


Take a list of integers; trim one element off each end, then keep only odd values, then filter for numbers divisible by three.


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


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


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


Take a list of integers; reverse the order, then remove both ends, then multiply each by -1.


Take a list of integers; reverse, then trim the edges, then negate.


Take a list of integers; flip the list around, then trim one element off each end, then multiply each by -1.


Take a list of integers; flip the order around, then cut off the first and last, then negate.


Take a list of integers; put the elements backwards, then remove the first and last elements, then multiply each by -1.


Take a list of integers; reverse that for me, then keep only the middle part, then negate.


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


Take a list of integers; reverse the order, then drop the first and last elements, then negate each.


Take a list of integers; keep the odd numbers, then keep only even values, then make each twice as big.


Take a list of integers; odd numbers only, then extract all even numbers, then multiply each by 2.


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


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


Take a list of integers; subtract one from each, then take the final 3 elements, then ensure at least three items by appending zeros.


Take a list of integers; Decrement all items, then drop everything except the final three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; decrement each value, then give me the last three elements, then ensure at least three items by appending zeros.


Take a list of integers; Lower each number by one, then keep only the last three, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; Subtract 1 from all, then take the last three, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep multiples of three, then increment each value, then trim one element off each end.


Take a list of integers; get rid of non-multiples of three, then plus one for all, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then increment each value, then remove the first and last elements.


Take a list of integers; keep items where x mod 3 equals zero, then plus one for all, then keep only the middle part.


Take a list of integers; drop anything not divisible by three, then increment each value, then drop first and last.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then eliminate the outermost elements.


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