Take a list of integers; get rid of non-multiples of three, then remove all negatives at the front, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep values divisible by 3, then remove the initial run of negative numbers, then What's the highest number in the list.


Take a list of integers; keep items where x mod 3 equals zero, then strip the front negatives, then Return the greatest value or default to 0.


Take a list of integers; drop anything not divisible by three, then remove leading negative numbers, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, then drop negatives from start, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = r[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; keep multiples of three, then drop the leading negative values, then return the maximum (0 if empty).


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


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


Take a list of integers; take the last three, then replace an empty list with one zero, then get the minimum value or zero if empty.


Take a list of integers; trim to the last three, then zero it out if it's empty, then give me the min or 0.


Take a list of integers; last three only, then use zero if the list is empty, then return the smallest number, defaulting to 0.


Take a list of integers; truncate to the last three items, then default to zero when empty, then return smallest or zero if empty.


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


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


Take a list of integers; keep only the first three, then keep values above zero, then arrange by magnitude ignoring sign.


Take a list of integers; keep the first 3 items, then filter for positive numbers, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then keep only positive numbers, then arrange in order of absolute value.


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


Take a list of integers; truncate to three items, then remove negatives, then order by how far from zero.


Take a list of integers; show the first three, then keep the positive numbers, then order by distance from zero.


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


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


Take a list of integers; drop the first element, then take the final 3 elements, then make each twice as big.


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


Take a list of integers; drop the first element, then give me the last three elements, then make each twice as big.


Take a list of integers; Take everything except the first, then keep only the last three, then multiply each by 2.


Take a list of integers; drop the first element, then keep the final three items, then make each twice as big.


Take a list of integers; Take everything except the first, then take the last three, then multiply each by 2.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then take the first 3 elements, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then remove everything after the third, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then truncate to three items, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then show the first three, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then take the first three, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then keep first 3, then drop all positive numbers.


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


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


Take a list of integers; sort by absolute value, then flip the list around, then multiply each by -1.


Take a list of integers; rearrange by distance from zero, then flip the order around, then negate.


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards, then multiply each by -1.


Take a list of integers; put them in order by magnitude, then reverse that for me, then negate.


Take a list of integers; arrange in order of absolute value, then flip it backwards, then multiply each by -1.


Take a list of integers; sort by distance from zero, then make it backwards, then negate.


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


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


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


Take a list of integers; cut the leading negatives, then when the list is empty, substitute a zero value, then check for zero.


Take a list of integers; skip negatives at the start, then replace an empty list with one zero, then true if any value equals zero.


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


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


Take a list of integers; strip the front negatives, then default to zero when empty, 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 = r if r else [0]
    return 0 in r


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


Take a list of integers; pad with zeros to at least three elements, then flip the list around, then remove the initial run of negative numbers.


Take a list of integers; add zeros until the list has at least three values, then flip the order around, then strip the front negatives.


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


Take a list of integers; add zeros until the list has at least three values, then reverse that for me, then drop negatives from start.


Take a list of integers; pad with zeros to at least three elements, then flip it backwards, then strip negative values from the start.


Take a list of integers; add zeros until the list has at least three values, then make it backwards, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; reverse the signs of everything, then Lower each number by one, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; reverse the signs of everything, then Subtract 1 from all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; negate each, then Subtract one from each, then ensure at least three items by appending zeros.


Take a list of integers; reverse the signs of everything, then Drop each by one, 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 = [x - 1 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 subtract one from each, then pad with zeros to at least three elements.


Take a list of strings; drop empty strings, then convert each to upper case, then prepend a hash mark to each.


Take a list of strings; get rid of blanks, then change all strings to uppercase, then prefix all with #.


Take a list of strings; remove blanks, then make every string uppercase, then prepend a hash mark to each.


Take a list of strings; eliminate empty string values, then uppercase each one, then prefix all with #.


Take a list of strings; filter out blank strings, then make all the strings uppercase, then prepend a hash mark to each.


Take a list of strings; remove strings that are empty, then convert all strings to uppercase letters, then prefix all with #.


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


Take a list of strings; drop empty strings, then uppercase each string, then prefix each with a hash.


Take a list of integers; drop the first element, then increment each value, then keep only non-zero numbers.


Take a list of integers; Take everything except the first, then plus one for all, then strip the zeros.


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


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


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


Take a list of integers; keep evens, then trim the edges, then exclude values of 5 and below.


Take a list of integers; keep the even numbers, then trim one element off each end, then remove anything 5 or less.


Take a list of integers; keep evens, then cut off the first and last, then filter to keep only values above 5.


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


Take a list of integers; keep evens, then keep only the middle part, then drop anything 5 or below.


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


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


Take a list of integers; square each, then extend to length 3 using zeros, then arrange by magnitude ignoring sign.


Take a list of integers; each value squared, then pad to 3, then put them in order by magnitude.


Take a list of integers; multiply each value by itself, then extend to length 3 using zeros, then arrange in order of absolute value.


Take a list of integers; square them all, then pad to 3, then sort by distance from zero.


Take a list of integers; raise each to the power of two, then extend to length 3 using zeros, then order by how far from zero.


Take a list of integers; I need each number multiplied by itself, then pad to 3, then order by distance from zero.


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


Take a list of integers; square each, then pad with zeros to at least three elements, then sort by absolute value.


Take a list of integers; if empty, use a single zero, then sort largest to smallest, then skip the first one.


Take a list of integers; if blank use 0, then sort by descending values, then Discard the first element.


Take a list of integers; default to [0] when there is nothing, then sort from highest to lowest, then skip the first one.


Take a list of integers; when the list is empty, substitute a zero value, then sort descending, then Discard the first element.


Take a list of integers; replace an empty list with one zero, then sort largest first, then skip the first one.


Take a list of integers; zero it out if it's empty, then sort in descending order, then Discard the first element.


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


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


Take a list of integers; keep the positive numbers, then take the final 3 elements, then limit every value to 10.


Take a list of integers; get rid of anything that's not positive, then drop everything except the final three, then maximum of 10 for all.


Take a list of integers; drop non-positive values, then give me the last three elements, then limit every value to 10.


Take a list of integers; drop the negative numbers, then keep only the last three, then maximum of 10 for all.


Take a list of integers; filter out the negative ones, then keep the final three items, then limit every value to 10.


Take a list of integers; remove all negative values, then take the last three, then maximum of 10 for all.


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


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


Take a list of integers; keep only the last three, then increase every value by 10, then true if every value is unique.


Take a list of integers; keep the final three items, then add 10 to each item, then check for duplicates in the values.


Take a list of integers; take the last three, then shift each up by ten, then do all values appear only once.


Take a list of integers; trim to the last three, then increase all numbers by 10, then check that there are no duplicates.


Take a list of integers; last three only, then add 10 to everything, then are the values all unique.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then check if all values are unique.


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


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


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


Take a list of integers; keep evens, then Ascending sort, then put them in order by magnitude.


Take a list of integers; keep the even numbers, then Sort this ascending, then arrange in order of absolute value.


Take a list of integers; keep evens, then Sort lowest to highest, then sort by distance from zero.


Take a list of integers; keep the even numbers, then Arrange from smallest to largest, then order by how far from zero.


Take a list of integers; keep evens, then sort ascending, then order by distance from zero.


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


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


Take a list of integers; keep the odd numbers, then skip negatives at the start, then deduplicate the list.


Take a list of integers; odd numbers only, then remove all negatives at the front, then remove repeats.


Take a list of integers; keep the odd numbers, then remove the initial run of negative numbers, then deduplicate the list.


Take a list of integers; odd numbers only, then strip the front negatives, then remove repeats.


Take a list of integers; keep the odd numbers, then remove leading negative numbers, then deduplicate the list.


Take a list of integers; odd numbers only, then drop negatives from start, then remove repeats.


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


Take a list of integers; keep the odd numbers, then drop the leading negative values, then drop duplicates keeping first occurrence.


Take a list of integers; subtract one from each, then take the final 3 elements, then put the elements backwards.


Take a list of integers; Decrement all items, then drop everything except the final three, then reverse that for me.


Take a list of integers; decrement each value, then give me the last three elements, then flip it backwards.


Take a list of integers; Lower each number by one, then keep only the last three, then make it backwards.


Take a list of integers; reduce each by one, then keep the final three items, then reverse the list.


Take a list of integers; Subtract 1 from all, then take the last three, then invert the sequence.


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


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


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


Take a list of integers; sort largest first, then remove everything after the third, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then truncate to three items, then take values while they are positive.


Take a list of integers; sort from greatest to least, then show the first three, then take positive values then stop.


Take a list of integers; sort z to a, then take the first three, then keep going while positive.


Take a list of integers; arrange in decreasing order, then keep first 3, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    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; sort descending, then keep only the first three, then take values while they are positive.


Take a list of integers; subtract one from each, then increase every value by 10, then remove the initial run of negative numbers.


Take a list of integers; Decrement all items, then add 10 to each item, then strip the front negatives.


Take a list of integers; decrement each value, then shift each up by ten, then remove leading negative numbers.


Take a list of integers; Lower each number by one, then increase all numbers by 10, then drop negatives from start.


Take a list of integers; reduce each by one, then add 10 to everything, then strip negative values from the start.


Take a list of integers; Subtract 1 from all, then give everything a boost of 10, then remove negatives before the first non-negative.


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


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


Take a list of integers; drop the first element, then take the first 3 elements, then deduplicate the list.


Take a list of integers; Take everything except the first, then remove everything after the third, then remove repeats.


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


Take a list of integers; Take everything except the first, then show the first three, then remove repeats.


Take a list of integers; drop the first element, then take the first three, then deduplicate the list.


Take a list of integers; Take everything except the first, then keep first 3, then remove repeats.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then take the final 3 elements, then give back the product of all values.


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


Take a list of integers; drop duplicates keeping first occurrence, then give me the last three elements, then what's the product.


Take a list of integers; drop duplicates but keep the first one, then keep only the last three, then what do they multiply to.


Take a list of integers; drop duplicates keeping first occurrence, then keep the final three items, then give me their product.


Take a list of integers; drop duplicates but keep the first one, then take the last three, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = r[-3:]
    return __import__('math').prod(r)


Take a list of integers; drop duplicates keeping first occurrence, then keep only the last three, then return their product.


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


Take a list of integers; Decrement all items, then filter for positive numbers, then filter out the odd numbers.


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


Take a list of integers; Lower each number by one, then keep the positives, then filter out the odd numbers.


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


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then filter out the odd numbers.


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


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


Take a list of integers; add one to each, then keep values divisible by 3, then give the number of evens.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; add one to each, then drop anything not divisible by three, then how many are even.


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; add one to each, then keep only multiples of three, then give me the count of even values.


Take a list of integers; make each one bigger, then multiples of three only, then I need to know how many of these are even.


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


Take a list of integers; add one to each, then keep multiples of three, then return how many values are even.


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; drop non-positive values, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; filter out the negative ones, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; remove all negative values, then don't let anything exceed 10, then strip the zeros.


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


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


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


Take a list of integers; if blank use 0, then sort by descending values, then check for zero.


Take a list of integers; default to [0] when there is nothing, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; when the list is empty, substitute a zero value, then sort descending, then check for zero.


Take a list of integers; replace an empty list with one zero, then sort largest first, then true if any value equals zero.


Take a list of integers; zero it out if it's empty, then sort in descending order, then check for zero.


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


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


Take a list of integers; subtract one from each, then flip the sign of each, then drop the odd numbers.


Take a list of integers; Decrement all items, then turn positives to negatives and vice versa, then filter out the odd numbers.


Take a list of integers; decrement each value, then flip the sign of each, then drop the odd numbers.


Take a list of integers; Lower each number by one, then turn positives to negatives and vice versa, then filter out the odd numbers.


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


Take a list of integers; Subtract 1 from all, then turn positives to negatives and vice versa, then filter out the odd numbers.


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


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


Take a list of integers; sort by absolute value, then multiply each by two, then trim one element off each end.


Take a list of integers; rearrange by distance from zero, then double each item in the list, then cut off the first and last.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then remove the first and last elements.


Take a list of integers; put them in order by magnitude, then double each item in the list, then keep only the middle part.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then drop first and last.


Take a list of integers; sort by distance from zero, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; drop the leading negative values, then make every value non-negative, then truncate to three items.


Take a list of integers; cut the leading negatives, then absolute value for all items, then show the first three.


Take a list of integers; skip negatives at the start, then take absolute values, then take the first three.


Take a list of integers; remove all negatives at the front, then turn negatives into positives, then keep first 3.


Take a list of integers; remove the initial run of negative numbers, then abs each element, then truncate to first three.


Take a list of integers; strip the front negatives, then take the absolute value of each, then first three.


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


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


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


Take a list of integers; take positive values then stop, then extract all even numbers, then strip the zeros.


Take a list of integers; keep going while positive, then keep only even values, then keep only non-zero numbers.


Take a list of integers; stop at first non positive, then extract all even numbers, then strip the zeros.


Take a list of integers; take while greater than zero, then keep only even values, then keep only non-zero numbers.


Take a list of integers; take values while positive, then extract all even numbers, 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 = [x for x in r if x % 2 == 0]
    r = [x for x in r if x != 0]
    return r


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


Take a list of strings; drop duplicate strings keeping the first, then keep only strings of length 3 or more, then arrange in lexicographic order.


Take a list of strings; dedupe, then get rid of short ones, then sort by letter.


Take a list of strings; remove duplicate strings keep first, then remove strings with less than three characters, then arrange in lexicographic order.


Take a list of strings; remove repeating strings first one stays, then remove all strings under three characters in length, then sort by letter.


Take a list of strings; delete duplicate strings keep the first one, then filter out short strings under three chars, then arrange in lexicographic order.


Take a list of strings; deduplicate the strings, then drop strings shorter than three characters, then sort by letter.


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


Take a list of strings; drop duplicate strings keeping the first, then drop strings shorter than three characters, then sort alphabetically.


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then truncate to the last three items.


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


Take a list of integers; drop the zeros, then take positive values then stop, then remove all but the last three.


Take a list of integers; keep only nonzero elements, then keep going while positive, then take the final 3 elements.


Take a list of integers; drop the zeros, then stop at first non positive, then drop everything except the final three.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then give me the last three elements.


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[-3:]
    return r


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


Take a list of integers; keep values greater than five, then remove the first item, then true only if all are positive.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then remove the first item, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then Remove head, then confirm all values are positive.


Take a list of integers; remove anything 5 or less, then remove the first item, then all positive.


Take a list of integers; filter to keep only values above 5, then Remove head, then check if every number is above zero.


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


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


Take a list of integers; add ten to each, then default to [0] when there is nothing, then truncate to three items.


Take a list of integers; bump everything up by 10, then when the list is empty, substitute a zero value, then show the first three.


Take a list of integers; increase every value by 10, then replace an empty list with one zero, then take the first three.


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


Take a list of integers; shift each up by ten, then use zero if the list is empty, then truncate to first three.


Take a list of integers; increase all numbers by 10, then default to zero when empty, then first three.


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


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


Take a list of integers; add ten to each, then clamp each to at most ten, then arrange by magnitude ignoring sign.


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then put them in order by magnitude.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then arrange in order of absolute value.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then sort by distance from zero.


Take a list of integers; shift each up by ten, then clamp each to at most ten, then order by how far from zero.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then order by distance from zero.


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


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


Take a list of integers; take the absolute value of each, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; convert to absolute value, then pad to 3, then maximum of 10 for all.


Take a list of integers; strip the signs, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; take abs of each, then pad to 3, then maximum of 10 for all.


Take a list of integers; get the absolute value of everything, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; apply absolute value to the whole list, then pad to 3, then maximum of 10 for all.


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


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


Take a list of strings; uppercase each string, then convert each to lower case, then remove surrounding whitespace.


Take a list of strings; make it all caps, then lowercase each one, then trim the whitespace off everything.


Take a list of strings; convert each to upper case, then convert each to lower case, then strip spaces from all strings.


Take a list of strings; change all strings to uppercase, then lowercase each one, then strip all the strings.


Take a list of strings; make every string uppercase, then convert each to lower case, then clean up whitespace in the list.


Take a list of strings; uppercase each one, then lowercase each one, then strip spaces around each string.


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


Take a list of strings; uppercase each string, then lowercase each string, then trim whitespace from each.


Take a list of integers; reverse the order, then sort largest to smallest, then drop non-positive values.


Take a list of integers; reverse, then sort by descending values, then drop the negative numbers.


Take a list of integers; flip the list around, then sort from highest to lowest, then filter out the negative ones.


Take a list of integers; flip the order around, then sort descending, then remove all negative values.


Take a list of integers; put the elements backwards, then sort largest first, then keep positive values only.


Take a list of integers; reverse that for me, then sort in descending order, then keep values above zero.


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


Take a list of integers; reverse the order, then sort descending, then keep the positive numbers.


Take a list of integers; take the absolute value of each, then clamp each to at most ten, then remove the initial run of negative numbers.


Take a list of integers; convert to absolute value, then don't let anything exceed 10, then strip the front negatives.


Take a list of integers; strip the signs, then clamp each to at most ten, then remove leading negative numbers.


Take a list of integers; take abs of each, then don't let anything exceed 10, then drop negatives from start.


Take a list of integers; get the absolute value of everything, then clamp each to at most ten, then strip negative values from the start.


Take a list of integers; apply absolute value to the whole list, then don't let anything exceed 10, then remove negatives before the first non-negative.


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


Take a list of integers; take the absolute value of each, then cap each value at 10, then drop the leading negative values.


Take a list of integers; cap each value at 10, then keep only even values, then truncate to three items.


Take a list of integers; clip values at 10, then extract all even numbers, then show the first three.


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


Take a list of integers; clip values at 10, then extract all even numbers, then keep first 3.


Take a list of integers; cap each value at 10, then keep only even values, then truncate to first three.


Take a list of integers; clip values at 10, then extract all even numbers, then first three.


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


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


Take a list of integers; keep the odd numbers, then make every value non-negative, then trim one element off each end.


Take a list of integers; odd numbers only, then absolute value for all items, then cut off the first and last.


Take a list of integers; keep the odd numbers, then take absolute values, then remove the first and last elements.


Take a list of integers; odd numbers only, then turn negatives into positives, then keep only the middle part.


Take a list of integers; keep the odd numbers, then abs each element, then drop first and last.


Take a list of integers; odd numbers only, then take the absolute value of each, then eliminate the outermost elements.


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


Take a list of integers; keep the odd numbers, then take the absolute value of each, then drop the first and last elements.


Take a list of integers; add ten to each, then multiply each value by itself, then drop non-negative values.


Take a list of integers; bump everything up by 10, then square them all, then drop all positive numbers.


Take a list of integers; increase every value by 10, then raise each to the power of two, then drop non-negative values.


Take a list of integers; add 10 to each item, then I need each number multiplied by itself, then drop all positive numbers.


Take a list of integers; shift each up by ten, then square all of them, then drop non-negative values.


Take a list of integers; increase all numbers by 10, then multiply each element by itself, then drop all positive numbers.


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


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


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


Take a list of integers; convert to absolute value, then drop everything except the final three, then product of the list.


Take a list of integers; strip the signs, then give me the last three elements, then what's the product.


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


Take a list of integers; get the absolute value of everything, then keep the final three items, then give me their product.


Take a list of integers; apply absolute value to the whole list, then take the last three, then multiply them all together.


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


Take a list of integers; take the absolute value of each, then keep only the last three, then return their product.


Take a list of integers; keep only the last three, then keep values divisible by 3, then drop non-positive values.


Take a list of integers; keep the final three items, then keep items where x mod 3 equals zero, then drop the negative numbers.


Take a list of integers; take the last three, then drop anything not divisible by three, then filter out the negative ones.


Take a list of integers; trim to the last three, then filter out everything except multiples of three, then remove all negative values.


Take a list of integers; last three only, then keep only multiples of three, then keep positive values only.


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


def solve(xs):
    r = list(xs)
    r = r[-3:]
    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; keep only the last three, then keep multiples of three, then keep the positive numbers.


Take a list of integers; keep the negative numbers, then remove repeated values, then reduce each by one.


Take a list of integers; extract negatives, then unique values preserving order, then Subtract 1 from all.


Take a list of integers; keep the negative numbers, then remove repeated values, then Subtract one from each.


Take a list of integers; extract negatives, then unique values preserving order, then Drop each by one.


Take a list of integers; keep the negative numbers, then remove repeated values, then Decrease all values by one.


Take a list of integers; extract negatives, then unique values preserving order, then Remove one from each value.


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


Take a list of integers; keep the negative numbers, then drop duplicates keeping first occurrence, then subtract one from each.


Take a list of integers; keep only the last three, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of integers; keep the final three items, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the last three, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of integers; trim to the last three, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; last three only, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of integers; truncate to the last three items, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    r = [x * 2 for x in r]
    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 double each, then pad with zeros to at least three elements.


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


Take a list of integers; extract negatives, then extract all even numbers, then any even.


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


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


Take a list of integers; add one to each, then remove both ends, then truncate to the last three items.


Take a list of integers; make each one bigger, then trim the edges, then show only the last three.


Take a list of integers; add one to each, then trim one element off each end, then remove all but the last three.


Take a list of integers; make each one bigger, then cut off the first and last, then take the final 3 elements.


Take a list of integers; add one to each, then remove the first and last elements, then drop everything except the final three.


Take a list of integers; make each one bigger, then keep only the middle part, then give me the last three elements.


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


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


Take a list of integers; subtract one from each, then flip the list around, then remove the initial run of negative numbers.


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


Take a list of integers; decrement each value, then put the elements backwards, then remove leading negative numbers.


Take a list of integers; Lower each number by one, then reverse that for me, then drop negatives from start.


Take a list of integers; reduce each by one, then flip it backwards, then strip negative values from the start.


Take a list of integers; Subtract 1 from all, then make it backwards, then remove negatives before the first non-negative.


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


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


Take a list of integers; double each, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; times two for each item, then Remove head, then minimum value, zero otherwise.


Take a list of integers; double each, then remove the first item, then get the minimum value or zero if empty.


Take a list of integers; times two for each item, then Remove head, then give me the min or 0.


Take a list of integers; double each, then remove the first item, then return the smallest number, defaulting to 0.


Take a list of integers; times two for each item, then Remove head, then return smallest or zero if empty.


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


Take a list of integers; double each, then drop the first element, then return the minimum (0 if empty).


Take a list of integers; keep values greater than five, then increment each value, then truncate to the last three items.


Take a list of integers; filter out values less than or equal to 5, then plus one for all, then show only the last three.


Take a list of integers; keep only numbers above 5, then increment each value, then remove all but the last three.


Take a list of integers; exclude values of 5 and below, then plus one for all, then take the final 3 elements.


Take a list of integers; remove anything 5 or less, then increment each value, then drop everything except the final three.


Take a list of integers; filter to keep only values above 5, then plus one for all, then give me the last three elements.


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


Take a list of integers; keep values greater than five, then add one to each, then keep only the last three.


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


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


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


Take a list of integers; Lower each number by one, then keep the positives, then Return the greatest value or default to 0.


Take a list of integers; reduce each by one, then remove negatives, then Find the largest element, defaulting to zero.


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then give the largest value (0 if none).


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


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


Take a list of integers; cap each value at 10, then sort smallest to largest, then true if at least one even value.


Take a list of integers; clip values at 10, then Ascending sort, then any even.


Take a list of integers; cap each value at 10, then Sort this ascending, then true if at least one even value.


Take a list of integers; clip values at 10, then Sort lowest to highest, then any even.


Take a list of integers; cap each value at 10, then Arrange from smallest to largest, then true if at least one even value.


Take a list of integers; clip values at 10, then sort ascending, then any even.


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


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


Take a list of integers; keep only the last three, then remove all zero values, then stop at the first non-positive value.


Take a list of integers; keep the final three items, then exclude zeros, then keep the leading run of positive numbers.


Take a list of integers; take the last three, then remove all zero values, then take values while they are positive.


Take a list of integers; trim to the last three, then exclude zeros, then take positive values then stop.


Take a list of integers; last three only, then remove all zero values, then keep going while positive.


Take a list of integers; truncate to the last three items, then exclude zeros, then stop at first non positive.


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


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


Take a list of integers; keep the negative numbers, then keep values divisible by 3, then true if any value equals zero.


Take a list of integers; extract negatives, then keep items where x mod 3 equals zero, then check for zero.


Take a list of integers; keep the negative numbers, then drop anything not divisible by three, then true if any value equals zero.


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


Take a list of integers; keep the negative numbers, then keep only multiples of three, then true if any value equals zero.


Take a list of integers; extract negatives, then multiples of three only, then check for zero.


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


Take a list of integers; keep the negative numbers, then keep multiples of three, then return whether the list contains a zero.


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


Take a list of integers; cut the leading negatives, then Remove head, then negate.


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


Take a list of integers; remove all negatives at the front, then Remove head, then negate.


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


Take a list of integers; strip the front negatives, then Remove head, then negate.


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


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


Take a list of integers; drop the first and last elements, then multiply each value by itself, then make each twice as big.


Take a list of integers; take out the first and last items, then square them all, then multiply each by 2.


Take a list of integers; remove both ends, then raise each to the power of two, then make each twice as big.


Take a list of integers; trim the edges, then I need each number multiplied by itself, then multiply each by 2.


Take a list of integers; trim one element off each end, then square all of them, then make each twice as big.


Take a list of integers; cut off the first and last, then multiply each element by itself, then multiply each by 2.


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


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


Take a list of integers; keep the odd numbers, then take the final 3 elements, then take values up to (excluding) the first zero.


Take a list of integers; odd numbers only, then drop everything except the final three, then keep the part before the first 0.


Take a list of integers; keep the odd numbers, then give me the last three elements, then truncate at the first zero.


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


Take a list of integers; keep the odd numbers, then keep the final three items, then remove from the first zero onwards.


Take a list of integers; odd numbers only, then take the last three, then up to but not including the first zero.


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


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


Take a list of integers; drop the first and last elements, then skip negatives at the start, then true only if all are positive.


Take a list of integers; take out the first and last items, then remove all negatives at the front, then do all of these have positive values.


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


Take a list of integers; trim the edges, then strip the front negatives, then confirm all values are positive.


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


Take a list of integers; cut off the first and last, then drop negatives from start, then check if every number is above zero.


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


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


Take a list of integers; square each, then increase every value by 10, then true if every value is unique.


Take a list of integers; each value squared, then add 10 to each item, then check for duplicates in the values.


Take a list of integers; multiply each value by itself, then shift each up by ten, then do all values appear only once.


Take a list of integers; square them all, then increase all numbers by 10, then check that there are no duplicates.


Take a list of integers; raise each to the power of two, then add 10 to everything, then are the values all unique.


Take a list of integers; I need each number multiplied by itself, then give everything a boost of 10, then check if all values are unique.


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


Take a list of integers; square each, then add ten to each, then return whether all values are distinct.


Take a list of integers; sort ascending, then flip the sign of each, then deduplicate the list.


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then remove repeats.


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


Take a list of integers; Organize these ascending, then turn positives to negatives and vice versa, then remove repeats.


Take a list of integers; Sort in ascending order, then flip the sign of each, then deduplicate the list.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then remove repeats.


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


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


Take a list of integers; keep the negative numbers, then keep the leading run of positive numbers, then multiply each by -1.


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


Take a list of integers; keep the negative numbers, then take positive values then stop, then multiply each by -1.


Take a list of integers; extract negatives, then keep going while positive, then negate.


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


Take a list of integers; extract negatives, then take while greater than zero, then negate.


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


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


Take a list of strings; keep the first character of each (dropping empties), then order strings from shortest to longest, then return them as one comma-separated string.


Take a list of strings; extract initial letters, then shortest to longest, then separate by comma.


Take a list of strings; take each string's first letter, then arrange by string length ascending, then join with commas.


Take a list of strings; give me the first letter of everything, then length sort, then comma join.


Take a list of strings; reduce each string to its first character, then sort by length shortest first, then combine using commas.


Take a list of strings; take first char drop blanks, then organize by string length least to greatest, then connect with commas between each item.


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


Take a list of strings; keep the first character of each (dropping empties), then sort by length, shortest first, then join them with commas.


Take a list of integers; sort by absolute value, then multiply each value by itself, then keep only non-zero numbers.


Take a list of integers; rearrange by distance from zero, then square them all, then strip the zeros.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then keep only non-zero numbers.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then strip the zeros.


Take a list of integers; arrange in order of absolute value, then square all of them, then keep only non-zero numbers.


Take a list of integers; sort by distance from zero, then multiply each element by itself, then strip the zeros.


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


Take a list of integers; sort by absolute value, then square each, then drop the zeros.


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


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


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


Take a list of integers; Organize these ascending, then unique values preserving order, then strip out the evens.


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


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


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


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


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


Take a list of integers; take only what comes before the initial zero, then add 10 to each item, then do all of these have positive values.


Take a list of integers; cut the list at the first zero, then shift each up by ten, then check if every value is positive.


Take a list of integers; cut off after the first zero appears, then increase all numbers by 10, then confirm all values are positive.


Take a list of integers; take values up to (excluding) the first zero, then add 10 to everything, then all positive.


Take a list of integers; keep the part before the first 0, then give everything a boost of 10, then check if every number is above zero.


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


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


Take a list of people records (name, age); extract the ages, then sort smallest to largest, then drop anything not divisible by three.


Take a list of people records (name, age); show me all ages, then Ascending sort, then filter out everything except multiples of three.


Take a list of people records (name, age); pluck the age field from each record, then Sort this ascending, then keep only multiples of three.


Take a list of people records (name, age); get the age field, then Sort lowest to highest, then multiples of three only.


Take a list of people records (name, age); keep just each person's age, then Arrange from smallest to largest, then filter for numbers divisible by three.


Take a list of people records (name, age); extract age values, then sort ascending, then give me only the values divisible by three.


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


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


Take a list of integers; drop the leading negative values, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; cut the leading negatives, then unique values preserving order, then strip the zeros.


Take a list of integers; skip negatives at the start, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; remove all negatives at the front, then unique values preserving order, then strip the zeros.


Take a list of integers; remove the initial run of negative numbers, then remove repeated values, then keep only non-zero numbers.


Take a list of integers; strip the front negatives, then unique values preserving order, 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 = list(dict.fromkeys(r))
    r = [x for x in r if x != 0]
    return r


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


Take a list of integers; take values while they are positive, then take the final 3 elements, then give back the total.


Take a list of integers; take positive values then stop, then drop everything except the final three, then sum r.


Take a list of integers; keep going while positive, then give me the last three elements, then add them up.


Take a list of integers; stop at first non positive, then keep only the last three, then calculate the sum of all elements.


Take a list of integers; take while greater than zero, then keep the final three items, then what's the total.


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


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


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


Take a list of integers; sort descending, then keep values below zero, then count the elements.


Take a list of integers; sort largest first, then get the negative numbers, then how many items remain.


Take a list of integers; sort in descending order, then keep values below zero, then tell me the length.


Take a list of integers; sort from greatest to least, then get the negative numbers, then return the length.


Take a list of integers; sort z to a, then keep values below zero, then count them.


Take a list of integers; arrange in decreasing order, then get the negative numbers, then what's the count.


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


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


Take a list of strings; trim whitespace from each, then convert each to lower case, then true if a blank string is present.


Take a list of strings; strip whitespace from every element, then lowercase each one, then check for empty strings in the list.


Take a list of strings; remove surrounding whitespace, then convert each to lower case, then check if there's an empty string.


Take a list of strings; trim the whitespace off everything, then lowercase each one, then does the collection contain an empty string value somewhere.


Take a list of strings; strip spaces from all strings, then convert each to lower case, then whether any element is blank.


Take a list of strings; strip all the strings, then lowercase each one, then check for an empty string.


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


Take a list of strings; trim whitespace from each, then lowercase each string, then return whether any string is empty.


Take a list of integers; add ten to each, then keep only odd values, then arrange in increasing order.


Take a list of integers; bump everything up by 10, then eliminate the even numbers, then Organize these ascending.


Take a list of integers; increase every value by 10, then keep only odd values, then Sort in ascending order.


Take a list of integers; add 10 to each item, then eliminate the even numbers, then I need this sorted ascending.


Take a list of integers; shift each up by ten, then keep only odd values, then Put these in ascending order.


Take a list of integers; increase all numbers by 10, then eliminate the even numbers, then sort smallest to largest.


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


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


Take a list of integers; sort descending, then default to [0] when there is nothing, then take values up to (excluding) the first zero.


Take a list of integers; sort largest first, then when the list is empty, substitute a zero value, then keep the part before the first 0.


Take a list of integers; sort in descending order, then replace an empty list with one zero, then truncate at the first zero.


Take a list of integers; sort from greatest to least, then zero it out if it's empty, then delete everything starting with the first zero.


Take a list of integers; sort z to a, then use zero if the list is empty, then remove from the first zero onwards.


Take a list of integers; arrange in decreasing order, then default to zero when empty, then up to but not including the first zero.


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


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


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


Take a list of integers; sort largest first, then when the list is empty, substitute a zero value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; sort in descending order, then replace an empty list with one zero, then What's the highest number in the list.


Take a list of integers; sort from greatest to least, then zero it out if it's empty, then Return the greatest value or default to 0.


Take a list of integers; sort z to a, then use zero if the list is empty, then Find the largest element, defaulting to zero.


Take a list of integers; arrange in decreasing order, then default to zero when empty, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = r if r else [0]
    return max(r) if r else 0


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


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then true only if all are positive.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then do all of these have positive values.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then check if every value is positive.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then confirm all values are positive.


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


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then check if every number is above zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then give back the product of all values.


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


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then what's the product.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then what do they multiply to.


Take a list of integers; pad with zeros to at least three elements, then multiply each by two, then give me their product.


Take a list of integers; add zeros until the list has at least three values, then double each item in the list, then multiply them all together.


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


Take a list of integers; pad with zeros to at least three elements, then double each, then return their product.


Take a list of integers; reverse the order, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; reverse, then Remove head, then minimum value, zero otherwise.


Take a list of integers; flip the list around, then remove the first item, then get the minimum value or zero if empty.


Take a list of integers; flip the order around, then Remove head, then give me the min or 0.


Take a list of integers; put the elements backwards, then remove the first item, then return the smallest number, defaulting to 0.


Take a list of integers; reverse that for me, then Remove head, then return smallest or zero if empty.


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


Take a list of integers; reverse the order, then drop the first element, then return the minimum (0 if empty).


Take a list of integers; take values while they are positive, then take the first 3 elements, then give the number of evens.


Take a list of integers; take positive values then stop, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then truncate to three items, then how many are even.


Take a list of integers; stop at first non positive, then show the first three, then get the total number of even values in the list.


Take a list of integers; take while greater than zero, then take the first three, then give me the count of even values.


Take a list of integers; take values while positive, then keep first 3, then I need to know how many of these are even.


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 sum(1 for x in r if x % 2 == 0)


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then give the earliest even value or zero.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then fetch the first even element, default to 0.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then give the earliest even value or zero.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then fetch the first even element, default to 0.


Take a list of integers; filter out the negative ones, then truncate at the first zero, then give the earliest even value or zero.


Take a list of integers; remove all negative values, then delete everything starting with the first zero, 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[:r.index(0)] if 0 in r else r
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; keep the positive numbers, then keep everything before the first zero, then return the first even value (0 if none).


Take a list of integers; take the absolute value of each, then keep only even values, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then extract all even numbers, then put them in order by magnitude.


Take a list of integers; strip the signs, then keep only even values, then arrange in order of absolute value.


Take a list of integers; take abs of each, then extract all even numbers, then sort by distance from zero.


Take a list of integers; get the absolute value of everything, then keep only even values, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then extract all even numbers, then order by distance from zero.


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


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


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


Take a list of integers; keep the first 3 items, then remove all negatives at the front, then negate.


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


Take a list of integers; remove everything after the third, then strip the front negatives, then negate.


Take a list of integers; truncate to three items, then remove leading negative numbers, then multiply each by -1.


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


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


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


Take a list of integers; drop the leading negative values, then order by distance from zero, then true if every value is unique.


Take a list of integers; cut the leading negatives, then sort based on absolute value, then check for duplicates in the values.


Take a list of integers; skip negatives at the start, then organize by magnitude, then do all values appear only once.


Take a list of integers; remove all negatives at the front, then arrange by absolute value ascending, then check that there are no duplicates.


Take a list of integers; remove the initial run of negative numbers, then sort from smallest to largest absolute value, then are the values all unique.


Take a list of integers; strip the front negatives, then sort by absolute value, then check if all values are unique.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then give back the total.


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then sum r.


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then add them up.


Take a list of integers; drop duplicates but keep the first one, then filter out everything except multiples of three, then calculate the sum of all elements.


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then what's the total.


Take a list of integers; drop duplicates but keep the first one, then multiples of three only, 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 % 3 == 0]
    return sum(r)


Take a list of integers; drop duplicates keeping first occurrence, then keep multiples of three, then return their sum.


Take a list of integers; keep values greater than five, then sort largest to smallest, then ensure at least three items by appending zeros.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then ensure at least three items by appending zeros.


Take a list of integers; exclude values of 5 and below, then sort descending, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove anything 5 or less, then sort largest first, then ensure at least three items by appending zeros.


Take a list of integers; filter to keep only values above 5, then sort in descending order, 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 > 5]
    r = sorted(r, reverse=True)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; pad with zeros to at least three elements, then take the final 3 elements, then true only if all are positive.


Take a list of integers; add zeros until the list has at least three values, then drop everything except the final three, then do all of these have positive values.


Take a list of integers; pad with zeros to at least three elements, then give me the last three elements, then check if every value is positive.


Take a list of integers; add zeros until the list has at least three values, then keep only the last three, then confirm all values are positive.


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


Take a list of integers; add zeros until the list has at least three values, then take the last three, then check if every number is above zero.


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


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


Take a list of integers; if empty, use a single zero, then increase every value by 10, then give the earliest even value or zero.


Take a list of integers; if blank use 0, then add 10 to each item, then fetch the first even element, default to 0.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then give the earliest even value or zero.


Take a list of integers; when the list is empty, substitute a zero value, then increase all numbers by 10, then fetch the first even element, default to 0.


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then give the earliest even value or zero.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then fetch the first even element, default to 0.


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


Take a list of integers; if empty, use a single zero, then add ten to each, then return the first even value (0 if none).


Take a list of integers; if empty, use a single zero, then take the final 3 elements, then reduce each by one.


Take a list of integers; if blank use 0, then drop everything except the final three, then Subtract 1 from all.


Take a list of integers; default to [0] when there is nothing, then give me the last three elements, then Subtract one from each.


Take a list of integers; when the list is empty, substitute a zero value, then keep only the last three, then Drop each by one.


Take a list of integers; replace an empty list with one zero, then keep the final three items, then Decrease all values by one.


Take a list of integers; zero it out if it's empty, then take the last three, then Remove one from each value.


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


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


Take a list of integers; drop the first element, then flip the sign of each, then stop at the first non-positive value.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then keep the leading run of positive numbers.


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


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then take positive values then stop.


Take a list of integers; drop the first element, then flip the sign of each, then keep going while positive.


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then stop at first non positive.


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


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


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


Take a list of integers; get rid of non-multiples of three, then trim the edges, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then trim one element off each end, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then cut off the first and last, then take positive values then stop.


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


Take a list of integers; filter out everything except multiples of three, then keep only the middle part, then stop at first non positive.


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


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


Take a list of integers; take values while they are positive, then sort smallest to largest, then multiply each by -1.


Take a list of integers; take positive values then stop, then Ascending sort, then negate.


Take a list of integers; keep going while positive, then Sort this ascending, then multiply each by -1.


Take a list of integers; stop at first non positive, then Sort lowest to highest, then negate.


Take a list of integers; take while greater than zero, then Arrange from smallest to largest, then multiply each by -1.


Take a list of integers; take values while positive, then sort ascending, then negate.


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


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


Take a list of integers; keep the negative numbers, then increase every value by 10, then find the max, defaulting to 0.


Take a list of integers; extract negatives, then add 10 to each item, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the negative numbers, then shift each up by ten, then What's the highest number in the list.


Take a list of integers; extract negatives, then increase all numbers by 10, then Return the greatest value or default to 0.


Take a list of integers; keep the negative numbers, then add 10 to everything, then Find the largest element, defaulting to zero.


Take a list of integers; extract negatives, then give everything a boost of 10, then give the largest value (0 if none).


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


Take a list of integers; keep the negative numbers, then add ten to each, then return the maximum (0 if empty).


Take a list of integers; negate each, then cut the list at the first zero, then true if every value is unique.


Take a list of integers; reverse the signs of everything, then cut off after the first zero appears, then check for duplicates in the values.


Take a list of integers; negate each, then take values up to (excluding) the first zero, then do all values appear only once.


Take a list of integers; reverse the signs of everything, then keep the part before the first 0, then check that there are no duplicates.


Take a list of integers; negate each, then truncate at the first zero, then are the values all unique.


Take a list of integers; reverse the signs of everything, then delete everything starting with the first zero, then check if all values are unique.


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


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


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


Take a list of integers; take out the first and last items, then drop everything except the final three, then reverse that for me.


Take a list of integers; remove both ends, then give me the last three elements, then flip it backwards.


Take a list of integers; trim the edges, then keep only the last three, then make it backwards.


Take a list of integers; trim one element off each end, then keep the final three items, then reverse the list.


Take a list of integers; cut off the first and last, then take the last three, then invert the sequence.


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


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


Take a list of integers; keep multiples of three, then increase every value by 10, then ensure at least three items by appending zeros.


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


Take a list of integers; keep values divisible by 3, then shift each up by ten, then ensure at least three items by appending zeros.


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


Take a list of integers; drop anything not divisible by three, then add 10 to everything, then ensure at least three items by appending zeros.


Take a list of integers; filter out everything except multiples of three, then give everything a boost of 10, 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 + 10 for x in r]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


Take a list of integers; keep multiples of three, then add ten to each, then pad with zeros to at least three elements.


Take a list of integers; take the absolute value of each, then multiply each value by itself, then truncate to three items.


Take a list of integers; convert to absolute value, then square them all, then show the first three.


Take a list of integers; strip the signs, then raise each to the power of two, then take the first three.


Take a list of integers; take abs of each, then I need each number multiplied by itself, then keep first 3.


Take a list of integers; get the absolute value of everything, then square all of them, then truncate to first three.


Take a list of integers; apply absolute value to the whole list, then multiply each element by itself, then first three.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then minimum value, zero otherwise.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then get the minimum value or zero if empty.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then give me the min or 0.


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then return the smallest number, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then unique values preserving order, then return smallest or zero if empty.


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


Take a list of integers; pad with zeros to at least three elements, then drop duplicates keeping first occurrence, then return the minimum (0 if empty).


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


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then strip the zeros.


Take a list of integers; drop non-positive values, then truncate to three items, then keep only non-zero numbers.


Take a list of integers; drop the negative numbers, then show the first three, then strip the zeros.


Take a list of integers; filter out the negative ones, then take the first three, then keep only non-zero numbers.


Take a list of integers; remove all negative values, then keep first 3, then strip the zeros.


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


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


Take a list of integers; keep everything before the first zero, then keep only odd values, then shift each up by ten.


Take a list of integers; take only what comes before the initial zero, then eliminate the even numbers, then increase all numbers by 10.


Take a list of integers; cut the list at the first zero, then keep only odd values, then add 10 to everything.


Take a list of integers; cut off after the first zero appears, then eliminate the even numbers, then give everything a boost of 10.


Take a list of integers; take values up to (excluding) the first zero, then keep only odd values, then increment each by ten.


Take a list of integers; keep the part before the first 0, then eliminate the even numbers, then add a constant 10 to each.


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


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


Take a list of integers; reverse the order, then sort smallest to largest, then keep only numbers above 5.


Take a list of integers; reverse, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; flip the list around, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; flip the order around, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; put the elements backwards, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; reverse that for me, then sort ascending, then drop anything 5 or below.


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


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


Take a list of integers; drop the zeros, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then unique values preserving order, 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 = list(dict.fromkeys(r))
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; drop the zeros, then drop duplicates keeping first occurrence, then return the first even value (0 if none).


Take a list of integers; sort ascending, then take the final 3 elements, then true if at least one even value.


Take a list of integers; Sort it from low to high, then drop everything except the final three, then any even.


Take a list of integers; arrange in increasing order, then give me the last three elements, then true if at least one even value.


Take a list of integers; Organize these ascending, then keep only the last three, then any even.


Take a list of integers; Sort in ascending order, then keep the final three items, then true if at least one even value.


Take a list of integers; I need this sorted ascending, then take the last three, then any even.


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


Take a list of integers; sort ascending, then keep only the last three, then return whether any value is even.


Take a list of integers; sort descending, then cut the list at the first zero, then find the max, defaulting to 0.


Take a list of integers; sort largest first, then cut off after the first zero appears, then Give me the maximum, but 0 if there are no items.


Take a list of integers; sort in descending order, then take values up to (excluding) the first zero, then What's the highest number in the list.


Take a list of integers; sort from greatest to least, then keep the part before the first 0, then Return the greatest value or default to 0.


Take a list of integers; sort z to a, then truncate at the first zero, then Find the largest element, defaulting to zero.


Take a list of integers; arrange in decreasing order, then delete everything starting with the first zero, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = r[:r.index(0)] if 0 in r else r
    return max(r) if r else 0


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