Take a list of integers; strip the signs, then sort from highest to lowest, then Subtract one from each.


Take a list of integers; take abs of each, then sort descending, then Drop each by one.


Take a list of integers; get the absolute value of everything, then sort largest first, then Decrease all values by one.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then Remove one from each value.


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


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


Take a list of integers; double each, then keep values above zero, then arrange in decreasing order.


Take a list of integers; times two for each item, then filter for positive numbers, then arrange in descending order.


Take a list of integers; double each, then keep only positive numbers, then reverse sort.


Take a list of integers; times two for each item, then keep the positives, then sort largest to smallest.


Take a list of integers; double each, then remove negatives, then sort by descending values.


Take a list of integers; times two for each item, then keep the positive numbers, then sort from highest to lowest.


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


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


Take a list of integers; keep the even numbers, then clamp each to at most ten, then count the elements.


Take a list of integers; keep evens, then don't let anything exceed 10, then how many items remain.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then tell me the length.


Take a list of integers; keep evens, then don't let anything exceed 10, then return the length.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then count them.


Take a list of integers; keep evens, then don't let anything exceed 10, then what's the count.


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


Take a list of integers; keep the even numbers, then cap each value at 10, then return how many remain.


Take a list of integers; keep the even numbers, then remove the first item, then raise each to the power of two.


Take a list of integers; keep evens, then Remove head, then I need each number multiplied by itself.


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


Take a list of integers; keep evens, then Remove head, then multiply each element by itself.


Take a list of integers; keep the even numbers, then remove the first item, then make each one squared.


Take a list of integers; keep evens, then Remove head, then square each value in the list.


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


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


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then reduce each string to its first character.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then take first char drop blanks.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then keep first letters only.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then first letter from each item that isn't empty.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then grab the first char from each.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then isolate the first character per entry.


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


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


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


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


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


Take a list of integers; flip the order around, then eliminate the even numbers, then is the list sorted.


Take a list of integers; put the elements backwards, then keep only odd values, then is it sorted.


Take a list of integers; reverse that for me, then eliminate the even numbers, then check if values are in increasing order.


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


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


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


Take a list of integers; keep only nonzero elements, then pad to 3, then Organize these ascending.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then Sort in ascending order.


Take a list of integers; keep only nonzero elements, then pad to 3, then I need this sorted ascending.


Take a list of integers; drop the zeros, then extend to length 3 using zeros, then Put these in ascending order.


Take a list of integers; keep only nonzero elements, then pad to 3, then sort smallest to largest.


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


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


Take a list of integers; keep everything before the first zero, then make every value non-negative, then truncate to the last three items.


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


Take a list of integers; cut the list at the first zero, then take absolute values, then remove all but the last three.


Take a list of integers; cut off after the first zero appears, then turn negatives into positives, then take the final 3 elements.


Take a list of integers; take values up to (excluding) the first zero, then abs each element, then drop everything except the final three.


Take a list of integers; keep the part before the first 0, then take the absolute value of each, then give me the last three elements.


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


Take a list of integers; keep everything before the first zero, then take the absolute value of each, then keep only the last three.


Take a list of integers; keep the positive numbers, then make every value non-negative, then arrange in decreasing order.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then arrange in descending order.


Take a list of integers; drop non-positive values, then take absolute values, then reverse sort.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then sort largest to smallest.


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


Take a list of integers; remove all negative values, then take the absolute value of each, then sort from highest to lowest.


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


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


Take a list of people records (name, age); extract the ages, then flip the sign of each, then keep only non-zero numbers.


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


Take a list of people records (name, age); pluck the age field from each record, then flip the sign of each, then keep only non-zero numbers.


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


Take a list of people records (name, age); keep just each person's age, then flip the sign of each, then keep only non-zero numbers.


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then strip the zeros.


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


Take a list of people records (name, age); extract the ages, then negate each, then drop the zeros.


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


Take a list of integers; times two for each item, then filter for positive numbers, then does this list go in ascending order.


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


Take a list of integers; times two for each item, then keep the positives, then is the list sorted.


Take a list of integers; double each, then remove negatives, then is it sorted.


Take a list of integers; times two for each item, then keep the positive numbers, then check if values are in increasing order.


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


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


Take a list of integers; keep the even numbers, then make every value non-negative, then drop non-negative values.


Take a list of integers; keep evens, then absolute value for all items, then drop all positive numbers.


Take a list of integers; keep the even numbers, then take absolute values, then drop non-negative values.


Take a list of integers; keep evens, then turn negatives into positives, then drop all positive numbers.


Take a list of integers; keep the even numbers, then abs each element, then drop non-negative values.


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


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


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


Take a list of integers; negate each, then remove the first item, then true if any value equals zero.


Take a list of integers; reverse the signs of everything, then Remove head, then check for zero.


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


Take a list of integers; negate each, then drop the first element, then return whether the list contains a zero.


Take a list of integers; add ten to each, then flip the list around, then give the earliest even value or zero.


Take a list of integers; bump everything up by 10, then flip the order around, then fetch the first even element, default to 0.


Take a list of integers; increase every value by 10, then put the elements backwards, then give the earliest even value or zero.


Take a list of integers; add 10 to each item, then reverse that for me, then fetch the first even element, default to 0.


Take a list of integers; shift each up by ten, then flip it backwards, then give the earliest even value or zero.


Take a list of integers; increase all numbers by 10, then make it backwards, then fetch the first even element, default to 0.


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


Take a list of integers; add ten to each, then reverse the order, then return the first even value (0 if none).


Take a list of integers; drop duplicates keeping first occurrence, then remove both ends, then count the elements.


Take a list of integers; drop duplicates but keep the first one, then trim the edges, then how many items remain.


Take a list of integers; drop duplicates keeping first occurrence, then trim one element off each end, then tell me the length.


Take a list of integers; drop duplicates but keep the first one, then cut off the first and last, then return the length.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first and last elements, then count them.


Take a list of integers; drop duplicates but keep the first one, then keep only the middle part, then what's the count.


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


Take a list of integers; drop duplicates keeping first occurrence, then drop the first and last elements, then return how many remain.


Take a list of integers; keep the negative numbers, then decrement each value, then remove the initial run of negative numbers.


Take a list of integers; extract negatives, then Lower each number by one, then strip the front negatives.


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


Take a list of integers; extract negatives, then Subtract 1 from all, then drop negatives from start.


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


Take a list of integers; extract negatives, then Drop each by one, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; keep the final three items, then flip the order around, then cut off the first and last.


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


Take a list of integers; trim to the last three, then reverse that for me, then keep only the middle part.


Take a list of integers; last three only, then flip it backwards, then drop first and last.


Take a list of integers; truncate to the last three items, then make it backwards, then eliminate the outermost elements.


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


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


Take a list of integers; subtract one from each, then keep values above zero, then true if every value is unique.


Take a list of integers; Decrement all items, then filter for positive numbers, then check for duplicates in the values.


Take a list of integers; decrement each value, then keep only positive numbers, then do all values appear only once.


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


Take a list of integers; reduce each by one, then remove negatives, then are the values all unique.


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then check if all values are unique.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then truncate to three items.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then show the first three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then truncate to first three.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then first three.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = [x + 10 for x in r]
    r = r[:3]
    return r


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


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


Take a list of integers; get rid of non-multiples of three, then when the list is empty, substitute a zero value, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep values divisible by 3, then replace an empty list with one zero, then ensure at least three items by appending zeros.


Take a list of integers; keep items where x mod 3 equals zero, then zero it out if it's empty, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop anything not divisible by three, then use zero if the list is empty, then ensure at least three items by appending zeros.


Take a list of integers; filter out everything except multiples of three, then default to zero when empty, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; get rid of anything that's not positive, then when the list is empty, substitute a zero value, then show only the last three.


Take a list of integers; drop non-positive values, then replace an empty list with one zero, then remove all but the last three.


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


Take a list of integers; filter out the negative ones, then use zero if the list is empty, then drop everything except the final three.


Take a list of integers; remove all negative values, then default to zero when empty, then give me the last three elements.


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


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


Take a list of integers; if empty, use a single zero, then remove the first item, then strip the signs.


Take a list of integers; if blank use 0, then Remove head, then take abs of each.


Take a list of integers; default to [0] when there is nothing, then remove the first item, then get the absolute value of everything.


Take a list of integers; when the list is empty, substitute a zero value, then Remove head, then apply absolute value to the whole list.


Take a list of integers; replace an empty list with one zero, then remove the first item, then make them all positive.


Take a list of integers; zero it out if it's empty, then Remove head, then make every value non-negative.


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


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


Take a list of integers; square each, then drop anything 5 or below, then truncate to three items.


Take a list of integers; each value squared, then keep only numbers greater than 5, then show the first three.


Take a list of integers; multiply each value by itself, then filter for numbers above 5, then take the first three.


Take a list of integers; square them all, then give me values where x is greater than 5, then keep first 3.


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


Take a list of integers; I need each number multiplied by itself, then keep values greater than five, then first three.


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


Take a list of integers; square each, then keep values greater than five, then keep only the first three.


Take a list of integers; keep multiples of three, then drop anything 5 or below, then remove the initial run of negative numbers.


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then strip the front negatives.


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then remove leading negative numbers.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then drop negatives from start.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then strip negative values from the start.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then remove negatives before the first non-negative.


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


Take a list of integers; keep multiples of three, then keep values greater than five, then drop the leading negative values.


Take a list of integers; keep everything before the first zero, then keep only odd values, then count the elements.


Take a list of integers; take only what comes before the initial zero, then eliminate the even numbers, then how many items remain.


Take a list of integers; cut the list at the first zero, then keep only odd values, then tell me the length.


Take a list of integers; cut off after the first zero appears, then eliminate the even numbers, then return the length.


Take a list of integers; take values up to (excluding) the first zero, then keep only odd values, then count them.


Take a list of integers; keep the part before the first 0, then eliminate the even numbers, then what's the count.


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


Take a list of integers; keep everything before the first zero, then keep the odd numbers, then return how many remain.


Take a list of integers; drop duplicates keeping first occurrence, then cut the list at the first zero, then drop non-positive values.


Take a list of integers; drop duplicates but keep the first one, then cut off after the first zero appears, then drop the negative numbers.


Take a list of integers; drop duplicates keeping first occurrence, then take values up to (excluding) the first zero, then filter out the negative ones.


Take a list of integers; drop duplicates but keep the first one, then keep the part before the first 0, then remove all negative values.


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then keep positive values only.


Take a list of integers; drop duplicates but keep the first one, then delete everything starting with the first zero, then keep values above zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep everything before the first zero, then keep the positive numbers.


Take a list of integers; sort descending, then remove the first item, then replace an empty list with one zero.


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


Take a list of integers; sort in descending order, then remove the first item, then use zero if the list is empty.


Take a list of integers; sort from greatest to least, then Remove head, then default to zero when empty.


Take a list of integers; sort z to a, then remove the first item, then if there's nothing, put in a zero.


Take a list of integers; arrange in decreasing order, then Remove head, then if no items, add a zero.


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


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


Take a list of integers; keep values greater than five, then skip negatives at the start, then truncate to three items.


Take a list of integers; filter out values less than or equal to 5, then remove all negatives at the front, then show the first three.


Take a list of integers; keep only numbers above 5, then remove the initial run of negative numbers, then take the first three.


Take a list of integers; exclude values of 5 and below, then strip the front negatives, then keep first 3.


Take a list of integers; remove anything 5 or less, then remove leading negative numbers, then truncate to first three.


Take a list of integers; filter to keep only values above 5, then drop negatives from start, then first three.


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


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


Take a list of integers; keep the negative numbers, then keep values above zero, then arrange by magnitude ignoring sign.


Take a list of integers; extract negatives, then filter for positive numbers, then put them in order by magnitude.


Take a list of integers; keep the negative numbers, then keep only positive numbers, then arrange in order of absolute value.


Take a list of integers; extract negatives, then keep the positives, then sort by distance from zero.


Take a list of integers; keep the negative numbers, then remove negatives, then order by how far from zero.


Take a list of integers; extract negatives, then keep the positive numbers, then order by distance from zero.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then square them all, then find how many values are divisible by two.


Take a list of integers; pad with zeros to at least three elements, then raise each to the power of two, then how many are even.


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


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


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then I need to know how many of these are even.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then replace an empty list with one zero.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then zero it out if it's empty.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then use zero if the list is empty.


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then default to zero when empty.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then if there's nothing, put in a zero.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then if no items, add a zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then add ten to each, then if empty, use a single zero.


Take a list of integers; keep only the first three, then multiply each by two, then shift each up by ten.


Take a list of integers; keep the first 3 items, then double each item in the list, then increase all numbers by 10.


Take a list of integers; take the first 3 elements, then multiply each by two, then add 10 to everything.


Take a list of integers; remove everything after the third, then double each item in the list, then give everything a boost of 10.


Take a list of integers; truncate to three items, then multiply each by two, then increment each by ten.


Take a list of integers; show the first three, then double each item in the list, then add a constant 10 to each.


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


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


Take a list of integers; take values while they are positive, then take the first 3 elements, then put the elements backwards.


Take a list of integers; take positive values then stop, then remove everything after the third, then reverse that for me.


Take a list of integers; keep going while positive, then truncate to three items, then flip it backwards.


Take a list of integers; stop at first non positive, then show the first three, then make it backwards.


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


Take a list of integers; take values while positive, then keep first 3, then invert the sequence.


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


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


Take a list of integers; keep only the first three, then clamp each to at most ten, then make each twice as big.


Take a list of integers; keep the first 3 items, then don't let anything exceed 10, then multiply each by 2.


Take a list of integers; take the first 3 elements, then clamp each to at most ten, then make each twice as big.


Take a list of integers; remove everything after the third, then don't let anything exceed 10, then multiply each by 2.


Take a list of integers; truncate to three items, then clamp each to at most ten, then make each twice as big.


Take a list of integers; show the first three, then don't let anything exceed 10, then multiply each by 2.


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


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


Take a list of integers; drop the first element, then flip the list around, then replace an empty list with one zero.


Take a list of integers; Take everything except the first, then flip the order around, then zero it out if it's empty.


Take a list of integers; drop the first element, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; Take everything except the first, then reverse that for me, then default to zero when empty.


Take a list of integers; drop the first element, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; Take everything except the first, then make it backwards, then if no items, add a zero.


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


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


Take a list of strings; keep the first character of each (dropping empties), then add '#' to the start of each string, then remove surrounding whitespace.


Take a list of strings; extract initial letters, then make each one start with a hash, then trim the whitespace off everything.


Take a list of strings; take each string's first letter, then add '#' to the start of each string, then strip spaces from all strings.


Take a list of strings; give me the first letter of everything, then make each one start with a hash, then strip all the strings.


Take a list of strings; reduce each string to its first character, then add '#' to the start of each string, then clean up whitespace in the list.


Take a list of strings; take first char drop blanks, then make each one start with a hash, then strip spaces around each string.


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


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


Take a list of integers; keep only the last three, then flip the sign of each, then deduplicate the list.


Take a list of integers; keep the final three items, then turn positives to negatives and vice versa, then remove repeats.


Take a list of integers; take the last three, then flip the sign of each, then deduplicate the list.


Take a list of integers; trim to the last three, then turn positives to negatives and vice versa, then remove repeats.


Take a list of integers; last three only, then flip the sign of each, then deduplicate the list.


Take a list of integers; truncate to the last three items, then turn positives to negatives and vice versa, then remove repeats.


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


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


Take a list of strings; drop strings shorter than three characters, then order strings from shortest to longest, then true if a blank string is present.


Take a list of strings; eliminate strings below length three, then shortest to longest, then check for empty strings in the list.


Take a list of strings; remove short strings (under 3 chars), then arrange by string length ascending, then check if there's an empty string.


Take a list of strings; only keep strings with three or more characters, then length sort, then does the collection contain an empty string value somewhere.


Take a list of strings; keep only strings that are at least three characters long, then sort by length shortest first, then whether any element is blank.


Take a list of strings; filter strings shorter than 3 chars, then organize by string length least to greatest, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = [s for s in r if len(s) >= 3]
    r = sorted(r, key=len)
    return any(s == '' for s in r)


Take a list of strings; drop strings shorter than three characters, then sort by length, shortest first, then return whether any string is empty.


Take a list of integers; keep only the first three, then increase every value by 10, then give back the product of all values.


Take a list of integers; keep the first 3 items, then add 10 to each item, then product of the list.


Take a list of integers; take the first 3 elements, then shift each up by ten, then what's the product.


Take a list of integers; remove everything after the third, then increase all numbers by 10, then what do they multiply to.


Take a list of integers; truncate to three items, then add 10 to everything, then give me their product.


Take a list of integers; show the first three, then give everything a boost of 10, then multiply them all together.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then remove the initial run of negative numbers.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then strip the front negatives.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then remove leading negative numbers.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then drop negatives from start.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then strip negative values from the start.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then remove negatives before the first non-negative.


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


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


Take a list of strings; prefix each with a hash, then keep only non-empty strings, then reduce each string to its first character.


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


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


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


Take a list of strings; prefix each with a hash, then delete empty entries, then grab the first char from each.


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


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


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


Take a list of integers; subtract one from each, then drop anything 5 or below, then true if every value is unique.


Take a list of integers; Decrement all items, then keep only numbers greater than 5, then check for duplicates in the values.


Take a list of integers; decrement each value, then filter for numbers above 5, then do all values appear only once.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then check that there are no duplicates.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then are the values all unique.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then check if all values are unique.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values above zero, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then filter for positive numbers, then Discard the first element.


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


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


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


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


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


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


Take a list of integers; keep the positive numbers, then extend to length 3 using zeros, then truncate to three items.


Take a list of integers; get rid of anything that's not positive, then pad to 3, then show the first three.


Take a list of integers; drop non-positive values, then extend to length 3 using zeros, then take the first three.


Take a list of integers; drop the negative numbers, then pad to 3, then keep first 3.


Take a list of integers; filter out the negative ones, then extend to length 3 using zeros, then truncate to first three.


Take a list of integers; remove all negative values, then pad to 3, then first three.


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


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


Take a list of integers; keep the even numbers, then remove all zero values, then shift each up by ten.


Take a list of integers; keep evens, then exclude zeros, then increase all numbers by 10.


Take a list of integers; keep the even numbers, then remove all zero values, then add 10 to everything.


Take a list of integers; keep evens, then exclude zeros, then give everything a boost of 10.


Take a list of integers; keep the even numbers, then remove all zero values, then increment each by ten.


Take a list of integers; keep evens, then exclude zeros, then add a constant 10 to each.


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


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


Take a list of integers; keep the positive numbers, then flip the sign of each, then find the min, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then turn positives to negatives and vice versa, then minimum value, zero otherwise.


Take a list of integers; drop non-positive values, then flip the sign of each, then get the minimum value or zero if empty.


Take a list of integers; drop the negative numbers, then turn positives to negatives and vice versa, then give me the min or 0.


Take a list of integers; filter out the negative ones, then flip the sign of each, then return the smallest number, defaulting to 0.


Take a list of integers; remove all negative values, then turn positives to negatives and vice versa, then return smallest or zero if empty.


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


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


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


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


Take a list of integers; sort in descending order, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; sort from greatest to least, then unique values preserving order, then fetch the first even element, default to 0.


Take a list of integers; sort z to a, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then fetch the first even element, default to 0.


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


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


Take a list of integers; take the absolute value of each, then sort smallest to largest, then keep only numbers above 5.


Take a list of integers; convert to absolute value, then Ascending sort, then exclude values of 5 and below.


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


Take a list of integers; take abs of each, then Sort lowest to highest, then filter to keep only values above 5.


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


Take a list of integers; apply absolute value to the whole list, then sort ascending, then drop anything 5 or below.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then put the elements backwards.


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


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then flip it backwards.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then make it backwards.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then reverse the list.


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


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


Take a list of integers; sort by absolute value, then keep the negative numbers, then reverse the order.


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


Take a list of integers; bump everything up by 10, then take values while they are positive, then strip out the evens.


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


Take a list of integers; add 10 to each item, then keep going while positive, then strip out the evens.


Take a list of integers; shift each up by ten, then stop at first non positive, then drop the even numbers.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then strip out the evens.


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


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


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


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


Take a list of integers; keep going while positive, then raise each to the power of two, then add 10 to everything.


Take a list of integers; stop at first non positive, then I need each number multiplied by itself, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then square all of them, then increment each by ten.


Take a list of integers; take values while positive, then multiply each element by itself, then add a constant 10 to each.


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


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


Take a list of integers; square each, then sort largest to smallest, then drop the even numbers.


Take a list of integers; each value squared, then sort by descending values, then strip out the evens.


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then drop the even numbers.


Take a list of integers; square them all, then sort descending, then strip out the evens.


Take a list of integers; raise each to the power of two, then sort largest first, then drop the even numbers.


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then strip out the evens.


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


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


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then remove short strings (under 3 chars).


Take a list of strings; arrange alphabetically, then make each one start with a hash, then only keep strings with three or more characters.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then keep only strings that are at least three characters long.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then filter strings shorter than 3 chars.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then drop anything shorter than three characters.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then keep only strings of length 3 or more.


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


Take a list of strings; sort alphabetically, then prefix each with a hash, then drop strings shorter than three characters.


Take a list of integers; drop the zeros, then sort smallest to largest, then reduce each by one.


Take a list of integers; keep only nonzero elements, then Ascending sort, then Subtract 1 from all.


Take a list of integers; drop the zeros, then Sort this ascending, then Subtract one from each.


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then Drop each by one.


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then Decrease all values by one.


Take a list of integers; keep only nonzero elements, then sort ascending, then Remove one from each value.


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


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


Take a list of integers; sort ascending, then take the first 3 elements, then drop the odd numbers.


Take a list of integers; Sort it from low to high, then remove everything after the third, then filter out the odd numbers.


Take a list of integers; arrange in increasing order, then truncate to three items, then drop the odd numbers.


Take a list of integers; Organize these ascending, then show the first three, then filter out the odd numbers.


Take a list of integers; Sort in ascending order, then take the first three, then drop the odd numbers.


Take a list of integers; I need this sorted ascending, then keep first 3, then filter out the odd numbers.


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


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


Take a list of integers; pad with zeros to at least three elements, then default to [0] when there is nothing, then arrange in decreasing order.


Take a list of integers; add zeros until the list has at least three values, then when the list is empty, substitute a zero value, then arrange in descending order.


Take a list of integers; pad with zeros to at least three elements, then replace an empty list with one zero, then reverse sort.


Take a list of integers; add zeros until the list has at least three values, then zero it out if it's empty, then sort largest to smallest.


Take a list of integers; pad with zeros to at least three elements, then use zero if the list is empty, then sort by descending values.


Take a list of integers; add zeros until the list has at least three values, then default to zero when empty, then sort from highest to lowest.


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


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


Take a list of integers; drop the first and last elements, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; take out the first and last items, then take values while they are positive, then take abs of each.


Take a list of integers; remove both ends, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; trim the edges, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; trim one element off each end, then stop at first non positive, then make them all positive.


Take a list of integers; cut off the first and last, then take while greater than zero, then make every value non-negative.


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


Take a list of integers; drop the first and last elements, then take values while they are positive, then take the absolute value of each.


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


Take a list of integers; get rid of anything that's not positive, then when the list is empty, substitute a zero value, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop non-positive values, then replace an empty list with one zero, then ensure at least three items by appending zeros.


Take a list of integers; drop the negative numbers, then zero it out if it's empty, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; filter out the negative ones, then use zero if the list is empty, then ensure at least three items by appending zeros.


Take a list of integers; remove all negative values, then default to zero when empty, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort descending, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; sort largest first, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; sort in descending order, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; sort z to a, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; arrange in decreasing order, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep everything before the first zero, then sort smallest to largest, then drop anything not divisible by three.


Take a list of integers; take only what comes before the initial zero, then Ascending sort, then filter out everything except multiples of three.


Take a list of integers; cut the list at the first zero, then Sort this ascending, then keep only multiples of three.


Take a list of integers; cut off after the first zero appears, then Sort lowest to highest, then multiples of three only.


Take a list of integers; take values up to (excluding) the first zero, then Arrange from smallest to largest, then filter for numbers divisible by three.


Take a list of integers; keep the part before the first 0, then sort ascending, then give me only the values divisible by three.


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


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


Take a list of integers; sort descending, then increment each value, then reduce each by one.


Take a list of integers; sort largest first, then plus one for all, then Subtract 1 from all.


Take a list of integers; sort in descending order, then increment each value, then Subtract one from each.


Take a list of integers; sort from greatest to least, then plus one for all, then Drop each by one.


Take a list of integers; sort z to a, then increment each value, then Decrease all values by one.


Take a list of integers; arrange in decreasing order, then plus one for all, then Remove one from each value.


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


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


Take a list of integers; square each, then order by distance from zero, then stop at the first non-positive value.


Take a list of integers; each value squared, then sort based on absolute value, then keep the leading run of positive numbers.


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


Take a list of integers; square them all, then arrange by absolute value ascending, then take positive values then stop.


Take a list of integers; raise each to the power of two, then sort from smallest to largest absolute value, then keep going while positive.


Take a list of integers; I need each number multiplied by itself, then sort by absolute value, then stop at first non positive.


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


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


Take a list of integers; keep everything before the first zero, then remove both ends, then true if already sorted smallest to largest.


Take a list of integers; take only what comes before the initial zero, then trim the edges, then does this list go in ascending order.


Take a list of integers; cut the list at the first zero, then trim one element off each end, then check if the list is in ascending order.


Take a list of integers; cut off after the first zero appears, then cut off the first and last, then is the list sorted.


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


Take a list of integers; keep the part before the first 0, then keep only the middle part, then check if values are in increasing order.


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


Take a list of integers; keep everything before the first zero, then drop the first and last elements, then return whether the list is sorted ascending.


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


Take a list of integers; keep the first 3 items, then eliminate the even numbers, then remove repeats.


Take a list of integers; take the first 3 elements, then keep only odd values, then deduplicate the list.


Take a list of integers; remove everything after the third, then eliminate the even numbers, then remove repeats.


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


Take a list of integers; show the first three, then eliminate the even numbers, then remove repeats.


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


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


Take a list of integers; take values while they are positive, then extend to length 3 using zeros, then arrange in increasing order.


Take a list of integers; take positive values then stop, then pad to 3, then Organize these ascending.


Take a list of integers; keep going while positive, then extend to length 3 using zeros, then Sort in ascending order.


Take a list of integers; stop at first non positive, then pad to 3, then I need this sorted ascending.


Take a list of integers; take while greater than zero, then extend to length 3 using zeros, then Put these in ascending order.


Take a list of integers; take values while positive, then pad to 3, then sort smallest to largest.


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


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


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


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


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then ensure at least three items by appending zeros.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then ensure at least three items by appending zeros.


Take a list of integers; sort by distance from zero, then multiples of three only, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then maximum of 10 for all.


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


Take a list of integers; drop the negative numbers, then double each item in the list, then maximum of 10 for all.


Take a list of integers; filter out the negative ones, then multiply each by two, then limit every value to 10.


Take a list of integers; remove all negative values, then double each item in the list, then maximum of 10 for all.


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


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


Take a list of integers; reverse the order, then increase every value by 10, then drop the odd numbers.


Take a list of integers; reverse, then add 10 to each item, then filter out the odd numbers.


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


Take a list of integers; flip the order around, then increase all numbers by 10, then filter out the odd numbers.


Take a list of integers; put the elements backwards, then add 10 to everything, then drop the odd numbers.


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


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


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


Take a list of integers; drop the leading negative values, then remove the first item, then arrange by magnitude ignoring sign.


Take a list of integers; cut the leading negatives, then Remove head, then put them in order by magnitude.


Take a list of integers; skip negatives at the start, then remove the first item, then arrange in order of absolute value.


Take a list of integers; remove all negatives at the front, then Remove head, then sort by distance from zero.


Take a list of integers; remove the initial run of negative numbers, then remove the first item, then order by how far from zero.


Take a list of integers; strip the front negatives, then Remove head, then order by distance from zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then give the number of evens.


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then how many are even.


Take a list of integers; add zeros until the list has at least three values, then show the first three, then get the total number of even values in the list.


Take a list of integers; pad with zeros to at least three elements, then take the first three, then give me the count of even values.


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then I need to know how many of these are even.


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


Take a list of integers; pad with zeros to at least three elements, then keep only the first three, then return how many values are even.


Take a list of integers; keep the negative numbers, then increment each value, then count the elements.


Take a list of integers; extract negatives, then plus one for all, then how many items remain.


Take a list of integers; keep the negative numbers, then increment each value, then tell me the length.


Take a list of integers; extract negatives, then plus one for all, then return the length.


Take a list of integers; keep the negative numbers, then increment each value, then count them.


Take a list of integers; extract negatives, then plus one for all, then what's the count.


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


Take a list of integers; keep the negative numbers, then add one to each, then return how many remain.


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


Take a list of integers; get rid of anything that's not positive, then sort based on absolute value, then I need each number multiplied by itself.


Take a list of integers; drop non-positive values, then organize by magnitude, then square all of them.


Take a list of integers; drop the negative numbers, then arrange by absolute value ascending, then multiply each element by itself.


Take a list of integers; filter out the negative ones, then sort from smallest to largest absolute value, then make each one squared.


Take a list of integers; remove all negative values, then sort by absolute value, then square each value in the list.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove repeated values, then true if at least one even value.


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


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


Take a list of integers; pad with zeros to at least three elements, then drop duplicates keeping first occurrence, then return whether any value is even.


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


Take a list of integers; Sort it from low to high, then unique values preserving order, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange in increasing order, then remove repeated values, then What's the highest number in the list.


Take a list of integers; Organize these ascending, then unique values preserving order, then Return the greatest value or default to 0.


Take a list of integers; Sort in ascending order, then remove repeated values, then Find the largest element, defaulting to zero.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then give the largest value (0 if none).


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


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


Take a list of integers; take values while they are positive, then drop anything 5 or below, then give the number of evens.


Take a list of integers; take positive values then stop, then keep only numbers greater than 5, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then filter for numbers above 5, then how many are even.


Take a list of integers; stop at first non positive, then give me values where x is greater than 5, then get the total number of even values in the list.


Take a list of integers; take while greater than zero, then show me only the values that are bigger than five, then give me the count of even values.


Take a list of integers; take values while positive, then keep values greater than five, 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 = [x for x in r if x > 5]
    return sum(1 for x in r if x % 2 == 0)


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


Take a list of integers; drop the first and last elements, then flip the list around, then reduce each by one.


Take a list of integers; take out the first and last items, then flip the order around, then Subtract 1 from all.


Take a list of integers; remove both ends, then put the elements backwards, then Subtract one from each.


Take a list of integers; trim the edges, then reverse that for me, then Drop each by one.


Take a list of integers; trim one element off each end, then flip it backwards, then Decrease all values by one.


Take a list of integers; cut off the first and last, then make it backwards, then Remove one from each value.


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


Take a list of integers; drop the first and last elements, then reverse the order, then subtract one from each.


Take a list of integers; pad with zeros to at least three elements, then keep values divisible by 3, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then keep items where x mod 3 equals zero, then Discard the first element.


Take a list of integers; pad with zeros to at least three elements, then drop anything not divisible by three, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then filter out everything except multiples of three, then Discard the first element.


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


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then if no items, add a zero.


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


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


Take a list of integers; take the absolute value of each, then remove repeated values, then shift each up by ten.


Take a list of integers; convert to absolute value, then unique values preserving order, then increase all numbers by 10.


Take a list of integers; strip the signs, then remove repeated values, then add 10 to everything.


Take a list of integers; take abs of each, then unique values preserving order, then give everything a boost of 10.


Take a list of integers; get the absolute value of everything, then remove repeated values, then increment each by ten.


Take a list of integers; apply absolute value to the whole list, then unique values preserving order, then add a constant 10 to each.


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


Take a list of integers; take the absolute value of each, then drop duplicates keeping first occurrence, then add ten to each.


Take a list of integers; reverse the order, then sort smallest to largest, then true if at least one even value.


Take a list of integers; reverse, then Ascending sort, then any even.


Take a list of integers; flip the list around, then Sort this ascending, then true if at least one even value.


Take a list of integers; flip the order around, then Sort lowest to highest, then any even.


Take a list of integers; put the elements backwards, then Arrange from smallest to largest, then true if at least one even value.


Take a list of integers; reverse that for me, then sort ascending, then any even.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = sorted(r)
    return any(x % 2 == 0 for x in r)


Take a list of integers; reverse the order, then sort ascending, then return whether any value is even.


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then keep only non-zero numbers.


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


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then keep only non-zero numbers.


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


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


Take a list of integers; zero it out if it's empty, then keep values greater than five, then strip the zeros.


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


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


Take a list of integers; if empty, use a single zero, then remove all zero values, then limit every value to 10.


Take a list of integers; if blank use 0, then exclude zeros, then maximum of 10 for all.


Take a list of integers; default to [0] when there is nothing, then remove all zero values, then limit every value to 10.


Take a list of integers; when the list is empty, substitute a zero value, then exclude zeros, then maximum of 10 for all.


Take a list of integers; replace an empty list with one zero, then remove all zero values, then limit every value to 10.


Take a list of integers; zero it out if it's empty, then exclude zeros, then maximum of 10 for all.


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


Take a list of integers; if empty, use a single zero, then drop the zeros, then cap each value at 10.


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


Take a list of integers; keep the first 3 items, then drop everything except the final three, then I need each number multiplied by itself.


Take a list of integers; take the first 3 elements, then give me the last three elements, then square all of them.


Take a list of integers; remove everything after the third, then keep only the last three, then multiply each element by itself.


Take a list of integers; truncate to three items, then keep the final three items, then make each one squared.


Take a list of integers; show the first three, then take the last three, then square each value in the list.


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


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


Take a list of integers; keep everything before the first zero, then multiply each value by itself, then give back the product of all values.


Take a list of integers; take only what comes before the initial zero, then square them all, then product of the list.


Take a list of integers; cut the list at the first zero, then raise each to the power of two, then what's the product.


Take a list of integers; cut off after the first zero appears, then I need each number multiplied by itself, then what do they multiply to.


Take a list of integers; take values up to (excluding) the first zero, then square all of them, then give me their product.


Take a list of integers; keep the part before the first 0, then multiply each element by itself, then multiply them all together.


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


Take a list of integers; keep everything before the first zero, then square each, then return their product.


Take a list of integers; reverse the order, then cut the list at the first zero, then remove the initial run of negative numbers.


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


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


Take a list of integers; flip the order around, then keep the part before the first 0, then drop negatives from start.


Take a list of integers; put the elements backwards, then truncate at the first zero, then strip negative values from the start.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then remove negatives before the first non-negative.


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


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


Take a list of strings; prefix each with a hash, then convert each to lower case, then return them as one comma-separated string.


Take a list of strings; add # to the start of each string, then lowercase each one, then separate by comma.


Take a list of strings; prefix each with a hash, then convert each to lower case, then join with commas.


Take a list of strings; add # to the start of each string, then lowercase each one, then comma join.


Take a list of strings; prefix each with a hash, then convert each to lower case, then combine using commas.


Take a list of strings; add # to the start of each string, then lowercase each one, then connect with commas between each item.


def solve(xs):
    r = list(xs)
    r = ['#' + s for s in r]
    r = [s.lower() for s in r]
    return ','.join(r)


Take a list of strings; prefix each with a hash, then lowercase each string, then join them with commas.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then arrange in decreasing order.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then arrange in descending order.


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


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then sort largest to smallest.


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


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then sort from highest to lowest.


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]
    r = sorted(r, reverse=True)
    return r


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


Take a list of integers; cap each value at 10, then remove repeated values, then drop the even numbers.


Take a list of integers; clip values at 10, then unique values preserving order, then strip out the evens.


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


Take a list of integers; cap each value at 10, then drop duplicates keeping first occurrence, then keep the odd numbers.


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


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


Take a list of integers; take the first 3 elements, then filter for numbers above 5, then check if every value is positive.


Take a list of integers; remove everything after the third, then give me values where x is greater than 5, then confirm all values are positive.


Take a list of integers; truncate to three items, then show me only the values that are bigger than five, then all positive.


Take a list of integers; show the first three, then keep values greater than five, then check if every number is above zero.


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


Take a list of integers; keep only the first three, then keep values greater than five, 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 true if at least one even value.


Take a list of integers; if blank use 0, then add 10 to each item, then any even.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then true if at least one even value.


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


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then true if at least one even value.


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


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


Take a list of integers; if empty, use a single zero, then add ten to each, then return whether any value is even.


Take a list of integers; keep the positive numbers, then flip the list around, then multiply each by -1.


Take a list of integers; get rid of anything that's not positive, then flip the order around, then negate.


Take a list of integers; drop non-positive values, then put the elements backwards, then multiply each by -1.


Take a list of integers; drop the negative numbers, then reverse that for me, then negate.


Take a list of integers; filter out the negative ones, then flip it backwards, then multiply each by -1.


Take a list of integers; remove all negative values, then make it backwards, then negate.


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


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


Take a list of integers; reverse the order, then take the final 3 elements, then give back the product of all values.


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


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


Take a list of integers; flip the order around, then keep only the last three, then what do they multiply to.


Take a list of integers; put the elements backwards, then keep the final three items, then give me their product.


Take a list of integers; reverse that for me, then take the last three, then multiply them all together.


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


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


Take a list of integers; add ten to each, then remove repeated values, then limit every value to 10.


Take a list of integers; bump everything up by 10, then unique values preserving order, then maximum of 10 for all.


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


Take a list of integers; add 10 to each item, then unique values preserving order, then maximum of 10 for all.


Take a list of integers; shift each up by ten, then remove repeated values, then limit every value to 10.


Take a list of integers; increase all numbers by 10, then unique values preserving order, then maximum of 10 for all.


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


Take a list of integers; add ten to each, then drop duplicates keeping first occurrence, then cap each value at 10.


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


Take a list of integers; extract negatives, then eliminate the even numbers, then filter out the odd numbers.


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


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


Take a list of integers; sort ascending, then order by distance from zero, then remove the initial run of negative numbers.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then strip the front negatives.


Take a list of integers; arrange in increasing order, then organize by magnitude, then remove leading negative numbers.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then drop negatives from start.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then strip negative values from the start.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then remove negatives before the first non-negative.


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


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


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


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


Take a list of integers; flip the list around, then organize by magnitude, then truncate at the first zero.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; reverse that for me, then sort by absolute value, then up to but not including the first zero.


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


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


Take a list of integers; drop the zeros, then take the final 3 elements, then skip the first one.


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


Take a list of integers; drop the zeros, then give me the last three elements, then skip the first one.


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then raise each to the power of two.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then I need each number multiplied by itself.


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then square all of them.


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


Take a list of integers; drop duplicates keeping first occurrence, then extend to length 3 using zeros, then make each one squared.


Take a list of integers; drop duplicates but keep the first one, then pad to 3, then square each value in the list.


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


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


Take a list of integers; keep only the first three, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; keep the first 3 items, then don't let anything exceed 10, then remove repeats.


Take a list of integers; take the first 3 elements, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; remove everything after the third, then don't let anything exceed 10, then remove repeats.


Take a list of integers; truncate to three items, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; show the first three, then don't let anything exceed 10, then remove repeats.


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


Take a list of integers; keep only the first three, then cap each value at 10, then drop duplicates keeping first occurrence.


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then give back the product of all values.


Take a list of integers; keep the final three items, then pad to 3, then product of the list.


Take a list of integers; take the last three, then extend to length 3 using zeros, then what's the product.


Take a list of integers; trim to the last three, then pad to 3, then what do they multiply to.


Take a list of integers; last three only, then extend to length 3 using zeros, then give me their product.


Take a list of integers; truncate to the last three items, then pad to 3, then multiply them all together.


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


Take a list of integers; keep only the last three, then pad with zeros to at least three elements, then return their product.


Take a list of integers; sort ascending, then increase every value by 10, then put the elements backwards.


Take a list of integers; Sort it from low to high, then add 10 to each item, then reverse that for me.


Take a list of integers; arrange in increasing order, then shift each up by ten, then flip it backwards.


Take a list of integers; Organize these ascending, then increase all numbers by 10, then make it backwards.


Take a list of integers; Sort in ascending order, then add 10 to everything, then reverse the list.


Take a list of integers; I need this sorted ascending, then give everything a boost of 10, then invert the sequence.


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


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


Take a list of integers; keep everything before the first zero, then sort smallest to largest, then true if every value is unique.


Take a list of integers; take only what comes before the initial zero, then Ascending sort, then check for duplicates in the values.


Take a list of integers; cut the list at the first zero, then Sort this ascending, then do all values appear only once.


Take a list of integers; cut off after the first zero appears, then Sort lowest to highest, then check that there are no duplicates.


Take a list of integers; take values up to (excluding) the first zero, then Arrange from smallest to largest, then are the values all unique.


Take a list of integers; keep the part before the first 0, then sort ascending, then check if all values are unique.


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


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


Take a list of integers; keep everything before the first zero, then order by distance from zero, then ensure at least three items by appending zeros.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then ensure at least three items by appending zeros.


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


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