Take a list of strings; sort ascending by length, then make it alphabetical, then filter out duplicate strings retain first.


Take a list of strings; order strings from shortest to longest, then order the strings A to Z, then strip duplicates preserve order.


Take a list of strings; shortest to longest, then make it alphabetical, then remove repeated strings.


Take a list of strings; arrange by string length ascending, then order the strings A to Z, then keep unique strings first appearance.


Take a list of strings; length sort, then make it alphabetical, then eliminate repeated strings preserve first occurrence.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=len)
    r = sorted(r)
    r = list(dict.fromkeys(r))
    return r


Take a list of strings; sort by length, shortest first, then sort alphabetically, then drop duplicate strings keeping the first.


Take a list of integers; drop duplicates keeping first occurrence, then take the final 3 elements, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then drop everything except the final three, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then give me the last three elements, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then keep only the last three, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then keep the final three items, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then take the last three, then strip out the evens.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the even numbers, then remove all zero values, then multiply each by -1.


Take a list of integers; keep evens, then exclude zeros, then negate.


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


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


Take a list of integers; double each, then remove all zero values, then arrange in increasing order.


Take a list of integers; times two for each item, then exclude zeros, then Organize these ascending.


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


Take a list of integers; times two for each item, then exclude zeros, then I need this sorted ascending.


Take a list of integers; double each, then remove all zero values, then Put these in ascending order.


Take a list of integers; times two for each item, then exclude zeros, then sort smallest to largest.


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


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


Take a list of integers; sort by absolute value, then multiply each by two, then find the max, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then double each item in the list, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then What's the highest number in the list.


Take a list of integers; put them in order by magnitude, then double each item in the list, then Return the greatest value or default to 0.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then Find the largest element, defaulting to zero.


Take a list of integers; sort by distance from zero, then double each item in the list, then give the largest value (0 if none).


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


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


Take a list of integers; drop duplicates keeping first occurrence, then decrement each value, then arrange by magnitude ignoring sign.


Take a list of integers; drop duplicates but keep the first one, then Lower each number by one, then put them in order by magnitude.


Take a list of integers; drop duplicates keeping first occurrence, then reduce each by one, then arrange in order of absolute value.


Take a list of integers; drop duplicates but keep the first one, then Subtract 1 from all, then sort by distance from zero.


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each, then order by how far from zero.


Take a list of integers; drop duplicates but keep the first one, then Drop each by one, then order by distance from zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then subtract one from each, then sort by absolute value.


Take a list of integers; take the absolute value of each, then clamp each to at most ten, then true if every value is unique.


Take a list of integers; convert to absolute value, then don't let anything exceed 10, then check for duplicates in the values.


Take a list of integers; strip the signs, then clamp each to at most ten, then do all values appear only once.


Take a list of integers; take abs of each, then don't let anything exceed 10, then check that there are no duplicates.


Take a list of integers; get the absolute value of everything, then clamp each to at most ten, then are the values all unique.


Take a list of integers; apply absolute value to the whole list, then don't let anything exceed 10, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = [min(x, 10) for x in r]
    return len(r) == len(set(r))


Take a list of integers; take the absolute value of each, then cap each value at 10, then return whether all values are distinct.


Take a list of integers; keep the positive numbers, then remove the first item, then true if already sorted smallest to largest.


Take a list of integers; get rid of anything that's not positive, then Remove head, then does this list go in ascending order.


Take a list of integers; drop non-positive values, then remove the first item, then check if the list is in ascending order.


Take a list of integers; drop the negative numbers, then Remove head, then is the list sorted.


Take a list of integers; filter out the negative ones, then remove the first item, then is it sorted.


Take a list of integers; remove all negative values, then Remove head, then check if values are in increasing order.


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


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


Take a list of integers; double each, then skip negatives at the start, then arrange by magnitude ignoring sign.


Take a list of integers; times two for each item, then remove all negatives at the front, then put them in order by magnitude.


Take a list of integers; double each, then remove the initial run of negative numbers, then arrange in order of absolute value.


Take a list of integers; times two for each item, then strip the front negatives, then sort by distance from zero.


Take a list of integers; double each, then remove leading negative numbers, then order by how far from zero.


Take a list of integers; times two for each item, then drop negatives from start, then order by distance from zero.


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


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


Take a list of integers; drop the first element, then skip negatives at the start, then multiply each by -1.


Take a list of integers; Take everything except the first, then remove all negatives at the front, then negate.


Take a list of integers; drop the first element, then remove the initial run of negative numbers, then multiply each by -1.


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


Take a list of integers; drop the first element, then remove leading negative numbers, then multiply each by -1.


Take a list of integers; Take everything except the first, then drop negatives from start, then negate.


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


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


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


Take a list of integers; take out the first and last items, then remove everything after the third, then show only the last three.


Take a list of integers; remove both ends, then truncate to three items, then remove all but the last three.


Take a list of integers; trim the edges, then show the first three, then take the final 3 elements.


Take a list of integers; trim one element off each end, then take the first three, then drop everything except the final three.


Take a list of integers; cut off the first and last, then keep first 3, then give me the last three elements.


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


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


Take a list of integers; sort ascending, then remove both ends, then bump each up by one.


Take a list of integers; Sort it from low to high, then trim the edges, then increment each item.


Take a list of integers; arrange in increasing order, then trim one element off each end, then bump each up by one.


Take a list of integers; Organize these ascending, then cut off the first and last, then increment each item.


Take a list of integers; Sort in ascending order, then remove the first and last elements, then bump each up by one.


Take a list of integers; I need this sorted ascending, then keep only the middle part, then increment each item.


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


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


Take a list of integers; double each, then remove both ends, then give the earliest even value or zero.


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


Take a list of integers; double each, then trim one element off each end, then give the earliest even value or zero.


Take a list of integers; times two for each item, then cut off the first and last, then fetch the first even element, default to 0.


Take a list of integers; double each, then remove the first and last elements, then give the earliest even value or zero.


Take a list of integers; times two for each item, then keep only the middle part, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep the even numbers, then default to [0] when there is nothing, then truncate to the last three items.


Take a list of integers; keep evens, then when the list is empty, substitute a zero value, then show only the last three.


Take a list of integers; keep the even numbers, then replace an empty list with one zero, then remove all but the last three.


Take a list of integers; keep evens, then zero it out if it's empty, then take the final 3 elements.


Take a list of integers; keep the even numbers, then use zero if the list is empty, then drop everything except the final three.


Take a list of integers; keep evens, then default to zero when empty, then give me the last three elements.


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


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


Take a list of integers; take the absolute value of each, then take the first 3 elements, then count the elements.


Take a list of integers; convert to absolute value, then remove everything after the third, then how many items remain.


Take a list of integers; strip the signs, then truncate to three items, then tell me the length.


Take a list of integers; take abs of each, then show the first three, then return the length.


Take a list of integers; get the absolute value of everything, then take the first three, then count them.


Take a list of integers; apply absolute value to the whole list, then keep first 3, then what's the count.


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


Take a list of integers; take the absolute value of each, then keep only the first three, then return how many remain.


Take a list of integers; subtract one from each, then take the final 3 elements, then arrange in increasing order.


Take a list of integers; Decrement all items, then drop everything except the final three, then Organize these ascending.


Take a list of integers; decrement each value, then give me the last three elements, then Sort in ascending order.


Take a list of integers; Lower each number by one, then keep only the last three, then I need this sorted ascending.


Take a list of integers; reduce each by one, then keep the final three items, then Put these in ascending order.


Take a list of integers; Subtract 1 from all, then take the last three, then sort smallest to largest.


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


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


Take a list of integers; square each, then remove repeated values, then true if any value equals zero.


Take a list of integers; each value squared, then unique values preserving order, then check for zero.


Take a list of integers; multiply each value by itself, then remove repeated values, then true if any value equals zero.


Take a list of integers; square them all, then unique values preserving order, then check for zero.


Take a list of integers; raise each to the power of two, then remove repeated values, then true if any value equals zero.


Take a list of integers; I need each number multiplied by itself, then unique values preserving order, then check for zero.


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


Take a list of integers; square each, then drop duplicates keeping first occurrence, then return whether the list contains a zero.


Take a list of integers; keep only the last three, then remove both ends, then ensure at least three items by appending zeros.


Take a list of integers; keep the final three items, then trim the edges, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the last three, then trim one element off each end, then ensure at least three items by appending zeros.


Take a list of integers; trim to the last three, then cut off the first and last, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; last three only, then remove the first and last elements, then ensure at least three items by appending zeros.


Take a list of integers; truncate to the last three items, then keep only the middle part, then ensure minimum length of three by adding zeros to the end.


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


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


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


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


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


Take a list of integers; Lower each number by one, then keep only the last three, then check that there are no duplicates.


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


Take a list of integers; Subtract 1 from all, then take the last three, then check if all values are unique.


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


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


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the zeros, then take positive values then stop, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then keep going while positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the zeros, then stop at first non positive, then ensure at least three items by appending zeros.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; keep only the first three, then sort largest to smallest, then arrange by magnitude ignoring sign.


Take a list of integers; keep the first 3 items, then sort by descending values, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then arrange in order of absolute value.


Take a list of integers; remove everything after the third, then sort descending, then sort by distance from zero.


Take a list of integers; truncate to three items, then sort largest first, then order by how far from zero.


Take a list of integers; show the first three, then sort in descending order, then order by distance from zero.


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


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


Take a list of integers; keep the negative numbers, then make every value non-negative, then raise each to the power of two.


Take a list of integers; extract negatives, then absolute value for all items, then I need each number multiplied by itself.


Take a list of integers; keep the negative numbers, then take absolute values, then square all of them.


Take a list of integers; extract negatives, then turn negatives into positives, then multiply each element by itself.


Take a list of integers; keep the negative numbers, then abs each element, then make each one squared.


Take a list of integers; extract negatives, then take the absolute value of each, then square each value in the list.


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


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


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


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


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


Take a list of integers; trim to the last three, then strip the front negatives, then keep first 3.


Take a list of integers; last three only, then remove leading negative numbers, then truncate to first three.


Take a list of integers; truncate to the last three items, then drop negatives from start, then first three.


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


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


Take a list of integers; drop the first and last elements, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; take out the first and last items, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove both ends, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; trim the edges, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; trim one element off each end, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; cut off the first and last, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; add ten to each, then take the final 3 elements, then make each twice as big.


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


Take a list of integers; increase every value by 10, then give me the last three elements, then make each twice as big.


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


Take a list of integers; shift each up by ten, then keep the final three items, then make each twice as big.


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


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


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


Take a list of integers; negate each, then increment each value, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then plus one for all, then filter out the odd numbers.


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


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


Take a list of integers; reverse the order, then take the final 3 elements, then truncate to three items.


Take a list of integers; reverse, then drop everything except the final three, then show the first three.


Take a list of integers; flip the list around, then give me the last three elements, then take the first three.


Take a list of integers; flip the order around, then keep only the last three, then keep first 3.


Take a list of integers; put the elements backwards, then keep the final three items, then truncate to first three.


Take a list of integers; reverse that for me, then take the last three, then first three.


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


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


Take a list of integers; keep everything before the first zero, then skip negatives at the start, then true if every value is unique.


Take a list of integers; take only what comes before the initial zero, then remove all negatives at the front, then check for duplicates in the values.


Take a list of integers; cut the list at the first zero, then remove the initial run of negative numbers, then do all values appear only once.


Take a list of integers; cut off after the first zero appears, then strip the front negatives, then check that there are no duplicates.


Take a list of integers; take values up to (excluding) the first zero, then remove leading negative numbers, then are the values all unique.


Take a list of integers; keep the part before the first 0, then drop negatives from start, then check if all values are unique.


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


Take a list of integers; keep everything before the first zero, then drop the leading negative values, then return whether all values are distinct.


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


Take a list of integers; rearrange by distance from zero, then unique values preserving order, then check for zero.


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


Take a list of integers; put them in order by magnitude, then unique values preserving order, then check for zero.


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


Take a list of integers; sort by distance from zero, then unique values preserving order, then check for zero.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = list(dict.fromkeys(r))
    return 0 in r


Take a list of integers; sort by absolute value, then drop duplicates keeping first occurrence, then return whether the list contains a zero.


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


Take a list of integers; times two for each item, then remove everything after the third, then drop the negative numbers.


Take a list of integers; double each, then truncate to three items, then filter out the negative ones.


Take a list of integers; times two for each item, then show the first three, then remove all negative values.


Take a list of integers; double each, then take the first three, then keep positive values only.


Take a list of integers; times two for each item, then keep first 3, then keep values above zero.


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


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


Take a list of integers; keep only the last three, then skip negatives at the start, then put the elements backwards.


Take a list of integers; keep the final three items, then remove all negatives at the front, then reverse that for me.


Take a list of integers; take the last three, then remove the initial run of negative numbers, then flip it backwards.


Take a list of integers; trim to the last three, then strip the front negatives, then make it backwards.


Take a list of integers; last three only, then remove leading negative numbers, then reverse the list.


Take a list of integers; truncate to the last three items, then drop negatives from start, then invert the sequence.


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


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


Take a list of integers; subtract one from each, then drop anything 5 or below, then give the earliest even value or zero.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then fetch the first even element, default to 0.


Take a list of integers; decrement each value, then filter for numbers above 5, then give the earliest even value or zero.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then fetch the first even element, default to 0.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then give the earliest even value or zero.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then fetch the first even element, default to 0.


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


Take a list of integers; subtract one from each, then keep values greater than five, then return the first even value (0 if none).


Take a list of integers; negate each, then flip the list around, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then flip the order around, then filter out the odd numbers.


Take a list of integers; negate each, then put the elements backwards, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then reverse that for me, then filter out the odd numbers.


Take a list of integers; negate each, then flip it backwards, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then make it backwards, then filter out the odd numbers.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then true if at least one even value.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then any even.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the even numbers, then return whether any value is even.


Take a list of integers; drop duplicates keeping first occurrence, then default to [0] when there is nothing, then give back the product of all values.


Take a list of integers; drop duplicates but keep the first one, then when the list is empty, substitute a zero value, then product of the list.


Take a list of integers; drop duplicates keeping first occurrence, then replace an empty list with one zero, then what's the product.


Take a list of integers; drop duplicates but keep the first one, then zero it out if it's empty, then what do they multiply to.


Take a list of integers; drop duplicates keeping first occurrence, then use zero if the list is empty, then give me their product.


Take a list of integers; drop duplicates but keep the first one, then default to zero when empty, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = r if r else [0]
    return __import__('math').prod(r)


Take a list of integers; drop duplicates keeping first occurrence, then if empty, use a single zero, then return their product.


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then deduplicate the list.


Take a list of integers; clip values at 10, then pad to 3, then remove repeats.


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


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


Take a list of integers; keep multiples of three, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; get rid of non-multiples of three, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep values divisible by 3, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; keep items where x mod 3 equals zero, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop anything not divisible by three, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; filter out everything except multiples of three, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then ensure at least three items by appending zeros.


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


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then pad with zeros to at least three elements.


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


Take a list of integers; odd numbers only, then keep items where x mod 3 equals zero, then cut off the first and last.


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


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


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


Take a list of integers; odd numbers only, then multiples of three only, then eliminate the outermost elements.


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


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


Take a list of integers; keep only the last three, then keep only odd values, then put the elements backwards.


Take a list of integers; keep the final three items, then eliminate the even numbers, then reverse that for me.


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


Take a list of integers; trim to the last three, then eliminate the even numbers, then make it backwards.


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


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


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


Take a list of integers; keep only the last three, then keep the odd numbers, then reverse the order.


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then stop at the first non-positive value.


Take a list of integers; if blank use 0, then remove everything after the third, then keep the leading run of positive numbers.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then take values while they are positive.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then take positive values then stop.


Take a list of integers; replace an empty list with one zero, then take the first three, then keep going while positive.


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


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    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; if empty, use a single zero, then keep only the first three, then take values while they are positive.


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


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


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


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


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


Take a list of integers; reverse the signs of everything, then keep values greater than five, then if no items, add a zero.


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


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


Take a list of integers; double each, then order by distance from zero, then drop anything not divisible by three.


Take a list of integers; times two for each item, then sort based on absolute value, then filter out everything except multiples of three.


Take a list of integers; double each, then organize by magnitude, then keep only multiples of three.


Take a list of integers; times two for each item, then arrange by absolute value ascending, then multiples of three only.


Take a list of integers; double each, then sort from smallest to largest absolute value, then filter for numbers divisible by three.


Take a list of integers; times two for each item, then sort by absolute value, then give me only the values divisible by three.


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


Take a list of integers; double each, then sort by absolute value, then keep multiples of three.


Take a list of integers; keep values greater than five, then clamp each to at most ten, then true only if all are positive.


Take a list of integers; filter out values less than or equal to 5, then don't let anything exceed 10, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then clamp each to at most ten, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then don't let anything exceed 10, then confirm all values are positive.


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


Take a list of integers; filter to keep only values above 5, then don't let anything exceed 10, then check if every number is above zero.


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


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


Take a list of integers; drop the zeros, then increase every value by 10, then truncate to three items.


Take a list of integers; keep only nonzero elements, then add 10 to each item, then show the first three.


Take a list of integers; drop the zeros, then shift each up by ten, then take the first three.


Take a list of integers; keep only nonzero elements, then increase all numbers by 10, then keep first 3.


Take a list of integers; drop the zeros, then add 10 to everything, then truncate to first three.


Take a list of integers; keep only nonzero elements, then give everything a boost of 10, then first three.


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


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


Take a list of integers; reverse the order, then default to [0] when there is nothing, then arrange in increasing order.


Take a list of integers; reverse, then when the list is empty, substitute a zero value, then Organize these ascending.


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


Take a list of integers; flip the order around, then zero it out if it's empty, then I need this sorted ascending.


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


Take a list of integers; reverse that for me, then default to zero when empty, then sort smallest to largest.


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


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


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


Take a list of integers; each value squared, then take values while they are positive, then Organize these ascending.


Take a list of integers; multiply each value by itself, then take positive values then stop, then Sort in ascending order.


Take a list of integers; square them all, then keep going while positive, then I need this sorted ascending.


Take a list of integers; raise each to the power of two, then stop at first non positive, then Put these in ascending order.


Take a list of integers; I need each number multiplied by itself, then take while greater than zero, then sort smallest to largest.


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


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


Take a list of integers; add ten to each, then make every value non-negative, then find the min, defaulting to 0.


Take a list of integers; bump everything up by 10, then absolute value for all items, then minimum value, zero otherwise.


Take a list of integers; increase every value by 10, then take absolute values, then get the minimum value or zero if empty.


Take a list of integers; add 10 to each item, then turn negatives into positives, then give me the min or 0.


Take a list of integers; shift each up by ten, then abs each element, then return the smallest number, defaulting to 0.


Take a list of integers; increase all numbers by 10, then take the absolute value of each, then return smallest or zero if empty.


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


Take a list of integers; add ten to each, then take the absolute value of each, then return the minimum (0 if empty).


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


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then Discard the first element.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then skip the first one.


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


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then skip the first one.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then Discard the first element.


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


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


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


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


Take a list of integers; sort in descending order, then keep only even values, then drop the even numbers.


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


Take a list of integers; sort z to a, then keep only even values, then drop the even numbers.


Take a list of integers; arrange in decreasing order, then extract all even numbers, then strip out the evens.


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


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


Take a list of integers; cap each value at 10, then make every value non-negative, then true if already sorted smallest to largest.


Take a list of integers; clip values at 10, then absolute value for all items, then does this list go in ascending order.


Take a list of integers; cap each value at 10, then take absolute values, then check if the list is in ascending order.


Take a list of integers; clip values at 10, then turn negatives into positives, then is the list sorted.


Take a list of integers; cap each value at 10, then abs each element, then is it sorted.


Take a list of integers; clip values at 10, then take the absolute value of each, then check if values are in increasing order.


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


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


Take a list of integers; add one to each, then increase every value by 10, then keep only numbers above 5.


Take a list of integers; make each one bigger, then add 10 to each item, then exclude values of 5 and below.


Take a list of integers; add one to each, then shift each up by ten, then remove anything 5 or less.


Take a list of integers; make each one bigger, then increase all numbers by 10, then filter to keep only values above 5.


Take a list of integers; add one to each, then add 10 to everything, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then give everything a boost of 10, then drop anything 5 or below.


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


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


Take a list of integers; double each, then default to [0] when there is nothing, then arrange in increasing order.


Take a list of integers; times two for each item, then when the list is empty, substitute a zero value, then Organize these ascending.


Take a list of integers; double each, then replace an empty list with one zero, then Sort in ascending order.


Take a list of integers; times two for each item, then zero it out if it's empty, then I need this sorted ascending.


Take a list of integers; double each, then use zero if the list is empty, then Put these in ascending order.


Take a list of integers; times two for each item, then default to zero when empty, then sort smallest to largest.


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


Take a list of integers; double each, then if empty, use a single zero, then sort ascending.


Take a list of integers; subtract one from each, then sort largest to smallest, then keep only non-zero numbers.


Take a list of integers; Decrement all items, then sort by descending values, then strip the zeros.


Take a list of integers; decrement each value, then sort from highest to lowest, then keep only non-zero numbers.


Take a list of integers; Lower each number by one, then sort descending, then strip the zeros.


Take a list of integers; reduce each by one, then sort largest first, then keep only non-zero numbers.


Take a list of integers; Subtract 1 from all, then sort in descending order, then strip the zeros.


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


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


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


Take a list of integers; cut the leading negatives, then exclude zeros, then any even.


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


Take a list of integers; remove all negatives at the front, then exclude zeros, then any even.


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


Take a list of integers; strip the front negatives, then exclude zeros, then any even.


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


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


Take a list of integers; keep the even numbers, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; keep evens, then cut off after the first zero appears, then show only the last three.


Take a list of integers; keep the even numbers, then take values up to (excluding) the first zero, then remove all but the last three.


Take a list of integers; keep evens, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; keep the even numbers, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; keep evens, then delete everything starting with the first zero, then give me the last three elements.


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


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


Take a list of integers; sort by absolute value, then drop anything 5 or below, then ensure at least three items by appending zeros.


Take a list of integers; rearrange by distance from zero, then keep only numbers greater than 5, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange by magnitude ignoring sign, then filter for numbers above 5, then ensure at least three items by appending zeros.


Take a list of integers; put them in order by magnitude, then give me values where x is greater than 5, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in order of absolute value, then show me only the values that are bigger than five, then ensure at least three items by appending zeros.


Take a list of integers; sort by distance from zero, then keep values greater than five, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; sort by absolute value, then keep values greater than five, then pad with zeros to at least three elements.


Take a list of integers; reverse the order, then remove all zero values, then true if already sorted smallest to largest.


Take a list of integers; reverse, then exclude zeros, then does this list go in ascending order.


Take a list of integers; flip the list around, then remove all zero values, then check if the list is in ascending order.


Take a list of integers; flip the order around, then exclude zeros, then is the list sorted.


Take a list of integers; put the elements backwards, then remove all zero values, then is it sorted.


Take a list of integers; reverse that for me, then exclude zeros, then check if values are in increasing order.


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


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


Take a list of integers; sort descending, then decrement each value, then arrange in increasing order.


Take a list of integers; sort largest first, then Lower each number by one, then Organize these ascending.


Take a list of integers; sort in descending order, then reduce each by one, then Sort in ascending order.


Take a list of integers; sort from greatest to least, then Subtract 1 from all, then I need this sorted ascending.


Take a list of integers; sort z to a, then Subtract one from each, then Put these in ascending order.


Take a list of integers; arrange in decreasing order, then Drop each by one, then sort smallest to largest.


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


Take a list of integers; sort descending, then subtract one from each, then sort ascending.


Take a list of integers; take the absolute value of each, then take the first 3 elements, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then remove everything after the third, then put them in order by magnitude.


Take a list of integers; strip the signs, then truncate to three items, then arrange in order of absolute value.


Take a list of integers; take abs of each, then show the first three, then sort by distance from zero.


Take a list of integers; get the absolute value of everything, then take the first three, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then keep first 3, then order by distance from zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then reduce each by one.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then Subtract 1 from all.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then Subtract one from each.


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then Decrease all values by one.


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


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


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


Take a list of integers; take values while they are positive, then take the first 3 elements, then true only if all are positive.


Take a list of integers; take positive values then stop, then remove everything after the third, then do all of these have positive values.


Take a list of integers; keep going while positive, then truncate to three items, then check if every value is positive.


Take a list of integers; stop at first non positive, then show the first three, then confirm all values are positive.


Take a list of integers; take while greater than zero, then take the first three, then all positive.


Take a list of integers; take values while positive, then keep first 3, 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[:3]
    return all(x > 0 for x in r)


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


Take a list of integers; subtract one from each, then increment each value, then replace an empty list with one zero.


Take a list of integers; Decrement all items, then plus one for all, then zero it out if it's empty.


Take a list of integers; decrement each value, then increment each value, then use zero if the list is empty.


Take a list of integers; Lower each number by one, then plus one for all, then default to zero when empty.


Take a list of integers; reduce each by one, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; Subtract 1 from all, then plus one for all, then if no items, add a zero.


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


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


Take a list of integers; keep the negative numbers, then keep the leading run of positive numbers, then shift each up by ten.


Take a list of integers; extract negatives, then take values while they are positive, then increase all numbers by 10.


Take a list of integers; keep the negative numbers, then take positive values then stop, then add 10 to everything.


Take a list of integers; extract negatives, then keep going while positive, then give everything a boost of 10.


Take a list of integers; keep the negative numbers, then stop at first non positive, then increment each by ten.


Take a list of integers; extract negatives, then take while greater than zero, then add a constant 10 to each.


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


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


Take a list of integers; keep values greater than five, then keep values above zero, then make each twice as big.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then multiply each by 2.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then make each twice as big.


Take a list of integers; exclude values of 5 and below, then keep the positives, then multiply each by 2.


Take a list of integers; remove anything 5 or less, then remove negatives, then make each twice as big.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers, then multiply each by 2.


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


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


Take a list of integers; keep only the first three, then remove the first item, then keep only non-zero numbers.


Take a list of integers; keep the first 3 items, then Remove head, then strip the zeros.


Take a list of integers; take the first 3 elements, then remove the first item, then keep only non-zero numbers.


Take a list of integers; remove everything after the third, then Remove head, then strip the zeros.


Take a list of integers; truncate to three items, then remove the first item, then keep only non-zero numbers.


Take a list of integers; show the first three, then Remove head, then strip the zeros.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep the leading run of positive numbers, then find the max, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then Give me the maximum, but 0 if there are no items.


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


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then Return the greatest value or default to 0.


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then Find the largest element, defaulting to zero.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then give the largest value (0 if none).


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


Take a list of integers; pad with zeros to at least three elements, then take values while they are positive, then return the maximum (0 if empty).


Take a list of integers; drop the leading negative values, then remove the first item, then arrange in decreasing order.


Take a list of integers; cut the leading negatives, then Remove head, then arrange in descending order.


Take a list of integers; skip negatives at the start, then remove the first item, then reverse sort.


Take a list of integers; remove all negatives at the front, then Remove head, then sort largest to smallest.


Take a list of integers; remove the initial run of negative numbers, then remove the first item, then sort by descending values.


Take a list of integers; strip the front negatives, then Remove head, then sort from highest to lowest.


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


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


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


Take a list of integers; take positive values then stop, then Lower each number by one, then filter out the odd numbers.


Take a list of integers; keep going while positive, then reduce each by one, then drop the odd numbers.


Take a list of integers; stop at first non positive, then Subtract 1 from all, then filter out the odd numbers.


Take a list of integers; take while greater than zero, then Subtract one from each, then drop the odd numbers.


Take a list of integers; take values while positive, then Drop each by one, then filter out the odd numbers.


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


Take a list of integers; take values while they are positive, then subtract one from each, then keep the even numbers.


Take a list of integers; square each, then drop anything 5 or below, then give the number of evens.


Take a list of integers; each value squared, then keep only numbers greater than 5, then find how many values are divisible by two.


Take a list of integers; multiply each value by itself, then filter for numbers above 5, then how many are even.


Take a list of integers; square them all, then give me values where x is greater than 5, then get the total number of even values in the list.


Take a list of integers; raise each to the power of two, then show me only the values that are bigger than five, then give me the count of even values.


Take a list of integers; I need each number multiplied by itself, then keep values greater than five, then I need to know how many of these are even.


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


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


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


Take a list of integers; each value squared, then sort by descending values, then check for zero.


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; square them all, then sort descending, then check for zero.


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


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then check for zero.


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


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


Take a list of integers; double each, then remove repeated values, then find the max, defaulting to 0.


Take a list of integers; times two for each item, then unique values preserving order, then Give me the maximum, but 0 if there are no items.


Take a list of integers; double each, then remove repeated values, then What's the highest number in the list.


Take a list of integers; times two for each item, then unique values preserving order, then Return the greatest value or default to 0.


Take a list of integers; double each, then remove repeated values, then Find the largest element, defaulting to zero.


Take a list of integers; times two for each item, then unique values preserving order, then give the largest value (0 if none).


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


Take a list of integers; double each, then drop duplicates keeping first occurrence, then return the maximum (0 if empty).


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


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


Take a list of integers; increase every value by 10, then take positive values then stop, then drop non-negative values.


Take a list of integers; add 10 to each item, then keep going while positive, then drop all positive numbers.


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


Take a list of integers; increase all numbers by 10, then take while greater than zero, then drop all positive numbers.


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


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


Take a list of integers; sort descending, then remove both ends, then drop the even numbers.


Take a list of integers; sort largest first, then trim the edges, then strip out the evens.


Take a list of integers; sort in descending order, then trim one element off each end, then drop the even numbers.


Take a list of integers; sort from greatest to least, then cut off the first and last, then strip out the evens.


Take a list of integers; sort z to a, then remove the first and last elements, then drop the even numbers.


Take a list of integers; arrange in decreasing order, then keep only the middle part, then strip out the evens.


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


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


Take a list of integers; keep the odd numbers, then flip the sign of each, then arrange by magnitude ignoring sign.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then put them in order by magnitude.


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


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


Take a list of integers; keep the odd numbers, then flip the sign of each, then order by how far from zero.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then order by distance from zero.


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


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


Take a list of integers; keep everything before the first zero, then remove the first item, then find the max, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then Remove head, then Give me the maximum, but 0 if there are no items.


Take a list of integers; cut the list at the first zero, then remove the first item, then What's the highest number in the list.


Take a list of integers; cut off after the first zero appears, then Remove head, then Return the greatest value or default to 0.


Take a list of integers; take values up to (excluding) the first zero, then remove the first item, then Find the largest element, defaulting to zero.


Take a list of integers; keep the part before the first 0, then Remove head, then give the largest value (0 if none).


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


Take a list of integers; keep everything before the first zero, then drop the first element, then return the maximum (0 if empty).


Take a list of integers; pad with zeros to at least three elements, then multiply each value by itself, then count the elements.


Take a list of integers; add zeros until the list has at least three values, then square them all, then how many items remain.


Take a list of integers; pad with zeros to at least three elements, then raise each to the power of two, then tell me the length.


Take a list of integers; add zeros until the list has at least three values, then I need each number multiplied by itself, then return the length.


Take a list of integers; pad with zeros to at least three elements, then square all of them, then count them.


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then what's the count.


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


Take a list of integers; pad with zeros to at least three elements, then square each, then return how many remain.


Take a list of integers; take values while they are positive, then increment each value, then true if any value equals zero.


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


Take a list of integers; keep going while positive, then increment each value, then true if any value equals zero.


Take a list of integers; stop at first non positive, then plus one for all, then check for zero.


Take a list of integers; take while greater than zero, then increment each value, then true if any value equals zero.


Take a list of integers; take values while positive, then plus one for all, then check for zero.


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


Take a list of integers; take values while they are positive, then add one to each, then return whether the list contains a zero.


Take a list of integers; add one to each, then flip the list around, then true if every value is unique.


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


Take a list of integers; add one to each, then put the elements backwards, then do all values appear only once.


Take a list of integers; make each one bigger, then reverse that for me, then check that there are no duplicates.


Take a list of integers; add one to each, then flip it backwards, then are the values all unique.


Take a list of integers; make each one bigger, then make it backwards, then check if all values are unique.


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


Take a list of integers; add one to each, then reverse the order, then return whether all values are distinct.


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


Take a list of integers; convert to absolute value, then take values while they are positive, then maximum of 10 for all.


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


Take a list of integers; take abs of each, then keep going while positive, then maximum of 10 for all.


Take a list of integers; get the absolute value of everything, then stop at first non positive, then limit every value to 10.


Take a list of integers; apply absolute value to the whole list, then take while greater than zero, then maximum of 10 for all.


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


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


Take a list of integers; negate each, then make every value non-negative, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then absolute value for all items, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; negate each, then take absolute values, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; negate each, then abs each element, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then take the absolute value of each, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take the absolute value of each, then order by distance from zero, then drop anything not divisible by three.


Take a list of integers; convert to absolute value, then sort based on absolute value, then filter out everything except multiples of three.


Take a list of integers; strip the signs, then organize by magnitude, then keep only multiples of three.


Take a list of integers; take abs of each, then arrange by absolute value ascending, then multiples of three only.


Take a list of integers; get the absolute value of everything, then sort from smallest to largest absolute value, then filter for numbers divisible by three.


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


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


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


Take a list of integers; negate each, then multiply each by two, then find the max, defaulting to 0.


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


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


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


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


Take a list of integers; reverse the signs of everything, then double each item in the list, then give the largest value (0 if none).


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


Take a list of integers; negate each, then double each, then return the maximum (0 if empty).


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


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


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


Take a list of integers; stop at first non positive, then keep the part before the first 0, then strip the zeros.


Take a list of integers; take while greater than zero, then truncate at the first zero, then keep only non-zero numbers.


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


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


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


Take a list of integers; take values while they are positive, then decrement each value, then skip the first one.


Take a list of integers; take positive values then stop, then Lower each number by one, then Discard the first element.


Take a list of integers; keep going while positive, then reduce each by one, then skip the first one.


Take a list of integers; stop at first non positive, then Subtract 1 from all, then Discard the first element.


Take a list of integers; take while greater than zero, then Subtract one from each, then skip the first one.


Take a list of integers; take values while positive, then Drop each by one, then Discard the first element.


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


Take a list of integers; take values while they are positive, then subtract one from each, then drop the first element.


Take a list of integers; drop the zeros, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; keep only nonzero elements, then square them all, then Organize these ascending.


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


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


Take a list of integers; drop the zeros, then square all of them, then Put these in ascending order.


Take a list of integers; keep only nonzero elements, then multiply each element by itself, then sort smallest to largest.


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


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


Take a list of integers; negate each, then increment each value, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then plus one for all, then strip out the evens.


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


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


Take a list of integers; keep only the last three, then keep values above zero, then limit every value to 10.


Take a list of integers; keep the final three items, then filter for positive numbers, then maximum of 10 for all.


Take a list of integers; take the last three, then keep only positive numbers, then limit every value to 10.


Take a list of integers; trim to the last three, then keep the positives, then maximum of 10 for all.


Take a list of integers; last three only, then remove negatives, then limit every value to 10.


Take a list of integers; truncate to the last three items, then keep the positive numbers, then maximum of 10 for all.


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


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


Take a list of integers; keep the even numbers, then decrement each value, then drop anything not divisible by three.


Take a list of integers; keep evens, then Lower each number by one, then filter out everything except multiples of three.


Take a list of integers; keep the even numbers, then reduce each by one, then keep only multiples of three.


Take a list of integers; keep evens, then Subtract 1 from all, then multiples of three only.


Take a list of integers; keep the even numbers, then Subtract one from each, then filter for numbers divisible by three.


Take a list of integers; keep evens, then Drop each by one, then give me only the values divisible by three.


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 % 3 == 0]
    return r


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


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


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


Take a list of integers; keep the even numbers, then take positive values then stop, then filter out the negative ones.


Take a list of integers; keep evens, then keep going while positive, then remove all negative values.


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


Take a list of integers; keep evens, then take while greater than zero, then keep values above zero.


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


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


Take a list of integers; keep multiples of three, then increment each value, then shift each up by ten.


Take a list of integers; get rid of non-multiples of three, then plus one for all, then increase all numbers by 10.


Take a list of integers; keep values divisible by 3, then increment each value, then add 10 to everything.


Take a list of integers; keep items where x mod 3 equals zero, then plus one for all, then give everything a boost of 10.


Take a list of integers; drop anything not divisible by three, then increment each value, then increment each by ten.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then add a constant 10 to each.


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


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


Take a list of integers; pad with zeros to at least three elements, then multiply each value by itself, then trim one element off each end.


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


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


Take a list of integers; add zeros until the list has at least three values, then I need each number multiplied by itself, then keep only the middle part.


Take a list of integers; pad with zeros to at least three elements, then square all of them, then drop first and last.


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then eliminate the outermost elements.


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


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


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


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


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


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


Take a list of integers; keep the odd numbers, then remove leading negative numbers, then if there's nothing, put in a zero.


Take a list of integers; odd numbers only, then drop negatives from start, then if no items, add a zero.


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


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


Take a list of integers; keep values greater than five, then remove both ends, then true if every value is unique.


Take a list of integers; filter out values less than or equal to 5, then trim the edges, then check for duplicates in the values.


Take a list of integers; keep only numbers above 5, then trim one element off each end, then do all values appear only once.


Take a list of integers; exclude values of 5 and below, then cut off the first and last, then check that there are no duplicates.


Take a list of integers; remove anything 5 or less, then remove the first and last elements, then are the values all unique.


Take a list of integers; filter to keep only values above 5, then keep only the middle part, then check if all values are unique.


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


Take a list of integers; keep values greater than five, then drop the first and last elements, then return whether all values are distinct.


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


Take a list of integers; bump everything up by 10, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; increase every value by 10, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; add 10 to each item, then zero it out if it's empty, then increment each item.


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


Take a list of integers; increase all numbers by 10, then default to zero when empty, then increment each item.


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


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


Take a list of integers; take values while they are positive, then remove both ends, then give the earliest even value or zero.


Take a list of integers; take positive values then stop, then trim the edges, then fetch the first even element, default to 0.


Take a list of integers; keep going while positive, then trim one element off each end, then give the earliest even value or zero.


Take a list of integers; stop at first non positive, then cut off the first and last, then fetch the first even element, default to 0.


Take a list of integers; take while greater than zero, then remove the first and last elements, then give the earliest even value or zero.


Take a list of integers; take values while positive, then keep only the middle part, then fetch the first even element, default to 0.


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


Take a list of integers; take values while they are positive, then drop the first and last elements, then return the first even value (0 if none).


Take a list of integers; drop the leading negative values, then order by distance from zero, then take values up to (excluding) the first zero.


Take a list of integers; cut the leading negatives, then sort based on absolute value, then keep the part before the first 0.


Take a list of integers; skip negatives at the start, then organize by magnitude, then truncate at the first zero.


Take a list of integers; remove all negatives at the front, then arrange by absolute value ascending, then delete everything starting with the first zero.


Take a list of integers; remove the initial run of negative numbers, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; strip the front negatives, then sort by absolute value, then up to but not including the first zero.


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


Take a list of integers; drop the leading negative values, then sort by absolute value, then keep everything before the first zero.


Take a list of integers; cap each value at 10, then keep values divisible by 3, then drop non-negative values.


Take a list of integers; clip values at 10, then keep items where x mod 3 equals zero, then drop all positive numbers.


Take a list of integers; cap each value at 10, then drop anything not divisible by three, then drop non-negative values.


Take a list of integers; clip values at 10, then filter out everything except multiples of three, then drop all positive numbers.


Take a list of integers; cap each value at 10, then keep only multiples of three, then drop non-negative values.


Take a list of integers; clip values at 10, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then drop anything 5 or below, then give back the total.


Take a list of integers; drop duplicates but keep the first one, then keep only numbers greater than 5, then sum r.


Take a list of integers; drop duplicates keeping first occurrence, then filter for numbers above 5, then add them up.


Take a list of integers; drop duplicates but keep the first one, then give me values where x is greater than 5, then calculate the sum of all elements.


Take a list of integers; drop duplicates keeping first occurrence, then show me only the values that are bigger than five, then what's the total.


Take a list of integers; drop duplicates but keep the first one, then keep values greater than five, then what do they add up to.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values greater than five, then return their sum.


Take a list of integers; add ten to each, then keep values above zero, then give back the product of all values.


Take a list of integers; bump everything up by 10, then filter for positive numbers, then product of the list.


Take a list of integers; increase every value by 10, then keep only positive numbers, then what's the product.


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


Take a list of integers; shift each up by ten, then remove negatives, then give me their product.


Take a list of integers; increase all numbers by 10, then keep the positive numbers, then multiply them all together.


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


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


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


Take a list of integers; get rid of non-multiples of three, then turn positives to negatives and vice versa, then fetch the first even element, default to 0.


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


Take a list of integers; keep items where x mod 3 equals zero, then turn positives to negatives and vice versa, then fetch the first even element, default to 0.


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


Take a list of integers; filter out everything except multiples of three, then turn positives to negatives and vice versa, then fetch the first even element, default to 0.


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


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


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


Take a list of integers; get rid of non-multiples of three, then Ascending sort, then check for zero.


Take a list of integers; keep values divisible by 3, then Sort this ascending, then true if any value equals zero.


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


Take a list of integers; drop anything not divisible by three, then Arrange from smallest to largest, then true if any value equals zero.


Take a list of integers; filter out everything except multiples of three, then sort ascending, then check for zero.


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


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


Take a list of integers; keep the negative numbers, then take the final 3 elements, then give the earliest even value or zero.


Take a list of integers; extract negatives, then drop everything except the final three, then fetch the first even element, default to 0.


Take a list of integers; keep the negative numbers, then give me the last three elements, then give the earliest even value or zero.


Take a list of integers; extract negatives, then keep only the last three, then fetch the first even element, default to 0.


Take a list of integers; keep the negative numbers, then keep the final three items, then give the earliest even value or zero.


Take a list of integers; extract negatives, then take the last three, then fetch the first even element, default to 0.


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