Take a list of integers; keep the even numbers, then stop at first non positive, then filter for numbers divisible by three.


Take a list of integers; keep evens, then take while greater than zero, then give me only the values divisible by three.


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


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


Take a list of people records (name, age); extract the ages, then keep values above zero, then multiply each by -1.


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


Take a list of people records (name, age); pluck the age field from each record, then keep only positive numbers, then multiply each by -1.


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


Take a list of people records (name, age); keep just each person's age, then remove negatives, then multiply each by -1.


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


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


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


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


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


Take a list of integers; take the first 3 elements, then shift each up by ten, then add them up.


Take a list of integers; remove everything after the third, then increase all numbers by 10, then calculate the sum of all elements.


Take a list of integers; truncate to three items, then add 10 to everything, then what's the total.


Take a list of integers; show the first three, then give everything a boost of 10, then what do they add up to.


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


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


Take a list of integers; add ten to each, then sort smallest to largest, then bump each up by one.


Take a list of integers; bump everything up by 10, then Ascending sort, then increment each item.


Take a list of integers; increase every value by 10, then Sort this ascending, then bump each up by one.


Take a list of integers; add 10 to each item, then Sort lowest to highest, then increment each item.


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then bump each up by one.


Take a list of integers; increase all numbers by 10, then sort ascending, then increment each item.


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


Take a list of integers; add ten to each, then sort ascending, then add one to each.


Take a list of integers; take values while they are positive, then order by distance from zero, then find the min, defaulting to 0.


Take a list of integers; take positive values then stop, then sort based on absolute value, then minimum value, zero otherwise.


Take a list of integers; keep going while positive, then organize by magnitude, then get the minimum value or zero if empty.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then give me the min or 0.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then sort by absolute value, then return smallest or zero if empty.


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


Take a list of integers; take values while they are positive, then sort by absolute value, then return the minimum (0 if empty).


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then stop at the first non-positive value.


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then keep the leading run of positive numbers.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then stop at first non positive.


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


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


Take a list of integers; cap each value at 10, then keep the leading run of positive numbers, then reduce each by one.


Take a list of integers; clip values at 10, then take values while they are positive, then Subtract 1 from all.


Take a list of integers; cap each value at 10, then take positive values then stop, then Subtract one from each.


Take a list of integers; clip values at 10, then keep going while positive, then Drop each by one.


Take a list of integers; cap each value at 10, then stop at first non positive, then Decrease all values by one.


Take a list of integers; clip values at 10, then take while greater than zero, then Remove one from each value.


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


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


Take a list of integers; sort by absolute value, then keep only odd values, then find the min, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then eliminate the even numbers, then minimum value, zero otherwise.


Take a list of integers; arrange by magnitude ignoring sign, then keep only odd values, then get the minimum value or zero if empty.


Take a list of integers; put them in order by magnitude, then eliminate the even numbers, then give me the min or 0.


Take a list of integers; arrange in order of absolute value, then keep only odd values, then return the smallest number, defaulting to 0.


Take a list of integers; sort by distance from zero, then eliminate the even numbers, then return smallest or zero if empty.


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


Take a list of integers; sort by absolute value, then keep the odd numbers, then return the minimum (0 if empty).


Take a list of integers; drop the leading negative values, then decrement each value, then ensure at least three items by appending zeros.


Take a list of integers; cut the leading negatives, then Lower each number by one, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; remove all negatives at the front, then Subtract 1 from all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove the initial run of negative numbers, then Subtract one from each, then ensure at least three items by appending zeros.


Take a list of integers; strip the front negatives, then Drop each by one, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort ascending, then remove all zero values, then truncate to three items.


Take a list of integers; Sort it from low to high, then exclude zeros, then show the first three.


Take a list of integers; arrange in increasing order, then remove all zero values, then take the first three.


Take a list of integers; Organize these ascending, then exclude zeros, then keep first 3.


Take a list of integers; Sort in ascending order, then remove all zero values, then truncate to first three.


Take a list of integers; I need this sorted ascending, then exclude zeros, then first three.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then find the max, defaulting to 0.


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


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


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then Return the greatest value or default to 0.


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then Find the largest element, defaulting to zero.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then give the largest value (0 if none).


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


Take a list of integers; pad with zeros to at least three elements, then keep the negative numbers, then return the maximum (0 if empty).


Take a list of people records (name, age); extract the ages, then flip the sign of each, then drop non-positive values.


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


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


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


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


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then keep values above zero.


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 keep the positive numbers.


Take a list of integers; if empty, use a single zero, then decrement each value, then remove the initial run of negative numbers.


Take a list of integers; if blank use 0, then Lower each number by one, then strip the front negatives.


Take a list of integers; default to [0] when there is nothing, then reduce each by one, then remove leading negative numbers.


Take a list of integers; when the list is empty, substitute a zero value, then Subtract 1 from all, then drop negatives from start.


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then strip negative values from the start.


Take a list of integers; zero it out if it's empty, then Drop each by one, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = r if r else [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; if empty, use a single zero, then subtract one from each, then drop the leading negative values.


Take a list of integers; sort ascending, then remove all zero values, then arrange by magnitude ignoring sign.


Take a list of integers; Sort it from low to high, then exclude zeros, then put them in order by magnitude.


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


Take a list of integers; Organize these ascending, then exclude zeros, then sort by distance from zero.


Take a list of integers; Sort in ascending order, then remove all zero values, then order by how far from zero.


Take a list of integers; I need this sorted ascending, then exclude zeros, then order by distance from zero.


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


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


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then give the number of evens.


Take a list of integers; keep the final three items, then pad to 3, then find how many values are divisible by two.


Take a list of integers; take the last three, then extend to length 3 using zeros, then how many are even.


Take a list of integers; trim to the last three, then pad to 3, then get the total number of even values in the list.


Take a list of integers; last three only, then extend to length 3 using zeros, then give me the count of even values.


Take a list of integers; truncate to the last three items, then pad to 3, then I need to know how many of these are even.


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


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


Take a list of people records (name, age); extract the names, then keep only strings of length 3 or more, then true if a blank string is present.


Take a list of people records (name, age); Give me the names, then get rid of short ones, then check for empty strings in the list.


Take a list of people records (name, age); pluck the name field from each record, then remove strings with less than three characters, then check if there's an empty string.


Take a list of people records (name, age); Grab the names, then remove all strings under three characters in length, then does the collection contain an empty string value somewhere.


Take a list of people records (name, age); keep just each person's name, then filter out short strings under three chars, then whether any element is blank.


Take a list of people records (name, age); List the names, then drop strings shorter than three characters, then check for an empty string.


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


Take a list of people records (name, age); extract the names, then drop strings shorter than three characters, then return whether any string is empty.


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


Take a list of integers; keep evens, then unique values preserving order, then exclude values of 5 and below.


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


Take a list of integers; keep evens, then unique values preserving order, then filter to keep only values above 5.


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


Take a list of integers; keep evens, then unique values preserving order, then drop anything 5 or below.


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


Take a list of integers; keep the even numbers, then drop duplicates keeping first occurrence, then keep values greater than five.


Take a list of integers; keep multiples of three, then make every value non-negative, then true if any value equals zero.


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


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


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


Take a list of integers; drop anything not divisible by three, then abs each element, then true if any value equals zero.


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


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


Take a list of integers; keep multiples of three, then take the absolute value of each, then return whether the list contains a zero.


Take a list of integers; if empty, use a single zero, then keep values divisible by 3, then drop the even numbers.


Take a list of integers; if blank use 0, then keep items where x mod 3 equals zero, then strip out the evens.


Take a list of integers; default to [0] when there is nothing, then drop anything not divisible by three, then drop the even numbers.


Take a list of integers; when the list is empty, substitute a zero value, then filter out everything except multiples of three, then strip out the evens.


Take a list of integers; replace an empty list with one zero, then keep only multiples of three, then drop the even numbers.


Take a list of integers; zero it out if it's empty, then multiples of three only, then strip out the evens.


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


Take a list of integers; if empty, use a single zero, then keep multiples of three, then keep the odd numbers.


Take a list of strings; drop strings shorter than three characters, then take each string's first letter, then find the longest one, defaulting to empty.


Take a list of strings; eliminate strings below length three, then give me the first letter of everything, then Longest string, or nothing if there isn't one.


Take a list of strings; remove short strings (under 3 chars), then reduce each string to its first character, then find the longest one, defaulting to empty.


Take a list of strings; only keep strings with three or more characters, then take first char drop blanks, then Longest string, or nothing if there isn't one.


Take a list of strings; keep only strings that are at least three characters long, then keep first letters only, then find the longest one, defaulting to empty.


Take a list of strings; filter strings shorter than 3 chars, then first letter from each item that isn't empty, then Longest string, or nothing if there isn't one.


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


Take a list of strings; drop strings shorter than three characters, then keep the first character of each (dropping empties), then return the longest string (empty if none).


Take a list of integers; drop the first element, then order by distance from zero, then arrange in decreasing order.


Take a list of integers; Take everything except the first, then sort based on absolute value, then arrange in descending order.


Take a list of integers; drop the first element, then organize by magnitude, then reverse sort.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then sort largest to smallest.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then sort by descending values.


Take a list of integers; Take everything except the first, then sort by absolute value, then sort from highest to lowest.


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


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


Take a list of strings; sort by length, shortest first, then convert each to lower case, then find how long the longest string is.


Take a list of strings; sort ascending by length, then lowercase each one, then give the length of the longest string in the list.


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


Take a list of strings; shortest to longest, then lowercase each one, then give the maximum string length.


Take a list of strings; arrange by string length ascending, then convert each to lower case, then max length of all strings.


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


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


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


Take a list of integers; cap each value at 10, then increase every value by 10, then true if at least one even value.


Take a list of integers; clip values at 10, then add 10 to each item, then any even.


Take a list of integers; cap each value at 10, then shift each up by ten, then true if at least one even value.


Take a list of integers; clip values at 10, then increase all numbers by 10, then any even.


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


Take a list of integers; clip values at 10, then give everything a boost of 10, then any even.


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


Take a list of integers; cap each value at 10, then add ten to each, then return whether any value is even.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then truncate to three items.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then show the first three.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then take the first three.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then keep first 3.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then truncate to first three.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then first three.


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


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


Take a list of integers; keep only the first three, then drop anything 5 or below, then true if any value equals zero.


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


Take a list of integers; take the first 3 elements, then filter for numbers above 5, then true if any value equals zero.


Take a list of integers; remove everything after the third, then give me values where x is greater than 5, then check for zero.


Take a list of integers; truncate to three items, then show me only the values that are bigger than five, then true if any value equals zero.


Take a list of integers; show the first three, then keep values greater than five, then check for zero.


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


Take a list of integers; keep only the first three, then keep values greater than five, then return whether the list contains a zero.


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


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then strip out the evens.


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


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then strip out the evens.


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


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


Take a list of integers; keep everything before the first zero, then increase every value by 10, then count the elements.


Take a list of integers; take only what comes before the initial zero, then add 10 to each item, then how many items remain.


Take a list of integers; cut the list at the first zero, then shift each up by ten, then tell me the length.


Take a list of integers; cut off after the first zero appears, then increase all numbers by 10, then return the length.


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


Take a list of integers; keep the part before the first 0, then give everything a boost of 10, then what's the count.


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


Take a list of integers; keep everything before the first zero, then add ten to each, then return how many remain.


Take a list of integers; keep the negative numbers, then sort smallest to largest, then find the max, defaulting to 0.


Take a list of integers; extract negatives, then Ascending sort, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the negative numbers, then Sort this ascending, then What's the highest number in the list.


Take a list of integers; extract negatives, then Sort lowest to highest, then Return the greatest value or default to 0.


Take a list of integers; keep the negative numbers, then Arrange from smallest to largest, then Find the largest element, defaulting to zero.


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


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


Take a list of integers; keep the negative numbers, then sort ascending, then return the maximum (0 if empty).


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


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


Take a list of integers; increase every value by 10, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; add 10 to each item, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; shift each up by ten, then stop at first non positive, then make them all positive.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then make every value non-negative.


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


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


Take a list of integers; if empty, use a single zero, then multiply each value by itself, then truncate to the last three items.


Take a list of integers; if blank use 0, then square them all, then show only the last three.


Take a list of integers; default to [0] when there is nothing, then raise each to the power of two, then remove all but the last three.


Take a list of integers; when the list is empty, substitute a zero value, then I need each number multiplied by itself, then take the final 3 elements.


Take a list of integers; replace an empty list with one zero, then square all of them, then drop everything except the final three.


Take a list of integers; zero it out if it's empty, then multiply each element by itself, then give me the last three elements.


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


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


Take a list of integers; keep the odd numbers, then keep the leading run of positive numbers, then make each twice as big.


Take a list of integers; odd numbers only, then take values while they are positive, then multiply each by 2.


Take a list of integers; keep the odd numbers, then take positive values then stop, then make each twice as big.


Take a list of integers; odd numbers only, then keep going while positive, then multiply each by 2.


Take a list of integers; keep the odd numbers, then stop at first non positive, then make each twice as big.


Take a list of integers; odd numbers only, then take while greater than zero, then multiply each by 2.


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


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


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


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


Take a list of integers; take the last three, then replace an empty list with one zero, then What's the highest number in the list.


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


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


Take a list of integers; truncate to the last three items, then default to zero when empty, then give the largest value (0 if none).


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


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


Take a list of integers; pad with zeros to at least three elements, then skip negatives at the start, then truncate to three items.


Take a list of integers; add zeros until the list has at least three values, then remove all negatives at the front, then show the first three.


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


Take a list of integers; add zeros until the list has at least three values, then strip the front negatives, then keep first 3.


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


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


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


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


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


Take a list of integers; Take everything except the first, then turn positives to negatives and vice versa, then filter out the odd numbers.


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


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


Take a list of integers; negate each, then remove all zero values, then truncate to three items.


Take a list of integers; reverse the signs of everything, then exclude zeros, then show the first three.


Take a list of integers; negate each, then remove all zero values, then take the first three.


Take a list of integers; reverse the signs of everything, then exclude zeros, then keep first 3.


Take a list of integers; negate each, then remove all zero values, then truncate to first three.


Take a list of integers; reverse the signs of everything, then exclude zeros, then first three.


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


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


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


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


Take a list of integers; cut the list at the first zero, then keep only positive numbers, then What's the highest number in the list.


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


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


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


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


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


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


Take a list of integers; Sort it from low to high, then take values while they are positive, then negate.


Take a list of integers; arrange in increasing order, then take positive values then stop, then multiply each by -1.


Take a list of integers; Organize these ascending, then keep going while positive, then negate.


Take a list of integers; Sort in ascending order, then stop at first non positive, then multiply each by -1.


Take a list of integers; I need this sorted ascending, then take while greater than zero, then negate.


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


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


Take a list of people records (name, age); sort records by age, youngest first, then pluck the name field from each record, then return the number of strings.


Take a list of people records (name, age); put the youngest at the top, then Grab the names, then count the strings.


Take a list of people records (name, age); sort records by age, youngest first, then keep just each person's name, then return how many strings remain.


Take a list of people records (name, age); put the youngest at the top, then List the names, then give me the total number of strings.


Take a list of people records (name, age); sort records by age, youngest first, then Extract the names, then tell me how many strings we have.


Take a list of people records (name, age); put the youngest at the top, then Get the name field, then what's the string count.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=lambda d: d['age'])
    r = [d['name'] for d in r]
    return len(r)


Take a list of people records (name, age); sort records by age, youngest first, then extract the names, then return how many strings remain.


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


Take a list of integers; Take everything except the first, then flip the order around, then show the first three.


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


Take a list of integers; Take everything except the first, then reverse that for me, then keep first 3.


Take a list of integers; drop the first element, then flip it backwards, then truncate to first three.


Take a list of integers; Take everything except the first, then make it backwards, then first three.


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


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


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


Take a list of integers; Sort it from low to high, then extract all even numbers, then product of the list.


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


Take a list of integers; Organize these ascending, then extract all even numbers, then what do they multiply to.


Take a list of integers; Sort in ascending order, then keep only even values, then give me their product.


Take a list of integers; I need this sorted ascending, then extract all even numbers, then multiply them all together.


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


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


Take a list of integers; keep the positive numbers, then skip negatives at the start, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of anything that's not positive, then remove all negatives at the front, then put them in order by magnitude.


Take a list of integers; drop non-positive values, then remove the initial run of negative numbers, then arrange in order of absolute value.


Take a list of integers; drop the negative numbers, then strip the front negatives, then sort by distance from zero.


Take a list of integers; filter out the negative ones, then remove leading negative numbers, then order by how far from zero.


Take a list of integers; remove all negative values, then drop negatives from start, then order by distance from zero.


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


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


Take a list of integers; take the absolute value of each, then remove both ends, then replace an empty list with one zero.


Take a list of integers; convert to absolute value, then trim the edges, then zero it out if it's empty.


Take a list of integers; strip the signs, then trim one element off each end, then use zero if the list is empty.


Take a list of integers; take abs of each, then cut off the first and last, then default to zero when empty.


Take a list of integers; get the absolute value of everything, then remove the first and last elements, then if there's nothing, put in a zero.


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then if no items, add a zero.


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


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


Take a list of integers; drop the leading negative values, then flip the list around, then drop anything not divisible by three.


Take a list of integers; cut the leading negatives, then flip the order around, then filter out everything except multiples of three.


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


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


Take a list of integers; remove the initial run of negative numbers, then flip it backwards, then filter for numbers divisible by three.


Take a list of integers; strip the front negatives, then make it backwards, then give me only the values divisible by three.


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


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


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then find the min, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then minimum value, zero otherwise.


Take a list of integers; drop non-positive values, then clamp each to at most ten, then get the minimum value or zero if empty.


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then give me the min or 0.


Take a list of integers; filter out the negative ones, then clamp each to at most ten, then return the smallest number, defaulting to 0.


Take a list of integers; remove all negative values, then don't let anything exceed 10, then return smallest or zero if empty.


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


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


Take a list of integers; square each, then keep the leading run of positive numbers, then give back the total.


Take a list of integers; each value squared, then take values while they are positive, then sum r.


Take a list of integers; multiply each value by itself, then take positive values then stop, then add them up.


Take a list of integers; square them all, then keep going while positive, then calculate the sum of all elements.


Take a list of integers; raise each to the power of two, then stop at first non positive, then what's the total.


Take a list of integers; I need each number multiplied by itself, then take while greater than zero, then what do they add up to.


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


Take a list of integers; square each, then take values while they are positive, then return their sum.


Take a list of integers; drop duplicates keeping first occurrence, then sort smallest to largest, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then Ascending sort, then maximum of 10 for all.


Take a list of integers; drop duplicates keeping first occurrence, then Sort this ascending, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then Sort lowest to highest, then maximum of 10 for all.


Take a list of integers; drop duplicates keeping first occurrence, then Arrange from smallest to largest, then limit every value to 10.


Take a list of integers; drop duplicates but keep the first one, then sort ascending, then maximum of 10 for all.


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


Take a list of integers; drop duplicates keeping first occurrence, then sort ascending, then cap each value at 10.


Take a list of integers; keep only the first three, then multiply each by two, then stop at the first non-positive value.


Take a list of integers; keep the first 3 items, then double each item in the list, then keep the leading run of positive numbers.


Take a list of integers; take the first 3 elements, then multiply each by two, then take values while they are positive.


Take a list of integers; remove everything after the third, then double each item in the list, then take positive values then stop.


Take a list of integers; truncate to three items, then multiply each by two, then keep going while positive.


Take a list of integers; show the first three, then double each item in the list, then stop at first non positive.


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


Take a list of integers; keep values greater than five, then flip the list around, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then flip the order around, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then put the elements backwards, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then reverse that for me, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then flip it backwards, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then make it backwards, then sort smallest to largest.


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


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


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then give the number of evens.


Take a list of integers; if blank use 0, then remove everything after the third, then find how many values are divisible by two.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then how many are even.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then get the total number of even values in the list.


Take a list of integers; replace an empty list with one zero, then take the first three, then give me the count of even values.


Take a list of integers; zero it out if it's empty, then keep first 3, then I need to know how many of these are even.


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


Take a list of integers; if empty, use a single zero, then keep only the first three, then return how many values are even.


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


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


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


Take a list of integers; flip the order around, then eliminate the even numbers, then filter out the odd numbers.


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


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


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    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; reverse the order, then keep the odd numbers, then keep the even numbers.


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


Take a list of integers; if blank use 0, then trim the edges, then take abs of each.


Take a list of integers; default to [0] when there is nothing, then trim one element off each end, then get the absolute value of everything.


Take a list of integers; when the list is empty, substitute a zero value, then cut off the first and last, then apply absolute value to the whole list.


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


Take a list of integers; zero it out if it's empty, then keep only the middle part, then make every value non-negative.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    r = r[1:-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 and last elements, then take the absolute value of each.


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


Take a list of integers; if blank use 0, then filter for positive numbers, then does this list go in ascending order.


Take a list of integers; default to [0] when there is nothing, then keep only positive numbers, then check if the list is in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then keep the positives, then is the list sorted.


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


Take a list of integers; zero it out if it's empty, then keep the positive numbers, then check if values are in increasing order.


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


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


Take a list of people records (name, age); extract the ages, then keep only odd values, then strip the signs.


Take a list of people records (name, age); show me all ages, then eliminate the even numbers, then take abs of each.


Take a list of people records (name, age); pluck the age field from each record, then keep only odd values, then get the absolute value of everything.


Take a list of people records (name, age); get the age field, then eliminate the even numbers, then apply absolute value to the whole list.


Take a list of people records (name, age); keep just each person's age, then keep only odd values, then make them all positive.


Take a list of people records (name, age); extract age values, then eliminate the even numbers, then make every value non-negative.


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


Take a list of people records (name, age); extract the ages, then keep the odd numbers, then take the absolute value of each.


Take a list of integers; sort descending, then default to [0] when there is nothing, then drop non-positive values.


Take a list of integers; sort largest first, then when the list is empty, substitute a zero value, then drop the negative numbers.


Take a list of integers; sort in descending order, then replace an empty list with one zero, then filter out the negative ones.


Take a list of integers; sort from greatest to least, then zero it out if it's empty, then remove all negative values.


Take a list of integers; sort z to a, then use zero if the list is empty, then keep positive values only.


Take a list of integers; arrange in decreasing order, then default to zero when empty, then keep values above zero.


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


Take a list of integers; sort descending, then if empty, use a single zero, then keep the positive numbers.


Take a list of integers; sort ascending, then keep the leading run of positive numbers, then find the max, defaulting to 0.


Take a list of integers; Sort it from low to high, then take values while they are positive, then Give me the maximum, but 0 if there are no items.


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


Take a list of integers; Organize these ascending, then keep going while positive, then Return the greatest value or default to 0.


Take a list of integers; Sort in ascending order, then stop at first non positive, then Find the largest element, defaulting to zero.


Take a list of integers; I need this sorted ascending, then take while greater than zero, then give the largest value (0 if none).


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


Take a list of integers; sort ascending, then take values while they are positive, then return the maximum (0 if empty).


Take a list of integers; sort by absolute value, then flip the list around, then replace an empty list with one zero.


Take a list of integers; rearrange by distance from zero, then flip the order around, then zero it out if it's empty.


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards, then use zero if the list is empty.


Take a list of integers; put them in order by magnitude, then reverse that for me, then default to zero when empty.


Take a list of integers; arrange in order of absolute value, then flip it backwards, then if there's nothing, put in a zero.


Take a list of integers; sort by distance from zero, then make it backwards, then if no items, add a zero.


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


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


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


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


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


Take a list of integers; remove everything after the third, then zero it out if it's empty, then give me the min or 0.


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


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


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then skip the first one.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then Discard the first element.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then skip the first one.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then Discard the first element.


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


Take a list of integers; sort by distance from zero, then get the negative numbers, then Discard the first element.


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


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


Take a list of integers; double each, then sort smallest to largest, then true only if all are positive.


Take a list of integers; times two for each item, then Ascending sort, then do all of these have positive values.


Take a list of integers; double each, then Sort this ascending, then check if every value is positive.


Take a list of integers; times two for each item, then Sort lowest to highest, then confirm all values are positive.


Take a list of integers; double each, then Arrange from smallest to largest, then all positive.


Take a list of integers; times two for each item, then sort ascending, then check if every number is above zero.


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


Take a list of integers; double each, then sort ascending, then return whether all values are positive.


Take a list of integers; pad with zeros to at least three elements, then flip the list around, then truncate to the last three items.


Take a list of integers; add zeros until the list has at least three values, then flip the order around, then show only the last three.


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


Take a list of integers; add zeros until the list has at least three values, then reverse that for me, then take the final 3 elements.


Take a list of integers; pad with zeros to at least three elements, then flip it backwards, then drop everything except the final three.


Take a list of integers; add zeros until the list has at least three values, then make it backwards, then give me the last three elements.


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


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


Take a list of integers; double each, then order by distance from zero, then truncate to the last three items.


Take a list of integers; times two for each item, then sort based on absolute value, then show only the last three.


Take a list of integers; double each, then organize by magnitude, then remove all but the last three.


Take a list of integers; times two for each item, then arrange by absolute value ascending, then take the final 3 elements.


Take a list of integers; double each, then sort from smallest to largest absolute value, then drop everything except the final three.


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


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


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


Take a list of integers; keep everything before the first zero, then keep values below zero, then drop anything not divisible by three.


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


Take a list of integers; cut the list at the first zero, then keep values below zero, then keep only multiples of three.


Take a list of integers; cut off after the first zero appears, then get the negative numbers, then multiples of three only.


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


Take a list of integers; keep the part before the first 0, then get the negative numbers, 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 = [x for x in r if x < 0]
    r = [x for x in r if x % 3 == 0]
    return r


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


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then find the max, defaulting to 0.


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


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then What's the highest number in the list.


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


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then Find the largest element, defaulting to zero.


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


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


Take a list of integers; keep everything before the first zero, then pad with zeros to at least three elements, then return the maximum (0 if empty).


Take a list of integers; square each, then extend to length 3 using zeros, then drop non-positive values.


Take a list of integers; each value squared, then pad to 3, then drop the negative numbers.


Take a list of integers; multiply each value by itself, then extend to length 3 using zeros, then filter out the negative ones.


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


Take a list of integers; raise each to the power of two, then extend to length 3 using zeros, then keep positive values only.


Take a list of integers; I need each number multiplied by itself, then pad to 3, then keep values above zero.


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


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


Take a list of integers; add ten to each, then remove the first item, then replace an empty list with one zero.


Take a list of integers; bump everything up by 10, then Remove head, then zero it out if it's empty.


Take a list of integers; increase every value by 10, then remove the first item, then use zero if the list is empty.


Take a list of integers; add 10 to each item, then Remove head, then default to zero when empty.


Take a list of integers; shift each up by ten, then remove the first item, then if there's nothing, put in a zero.


Take a list of integers; increase all numbers by 10, then Remove head, then if no items, add a zero.


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


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


Take a list of integers; cap each value at 10, then keep only odd values, then true if already sorted smallest to largest.


Take a list of integers; clip values at 10, then eliminate the even numbers, then does this list go in ascending order.


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


Take a list of integers; clip values at 10, then eliminate the even numbers, then is the list sorted.


Take a list of integers; cap each value at 10, then keep only odd values, then is it sorted.


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


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


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


Take a list of integers; take the absolute value of each, then remove both ends, then raise each to the power of two.


Take a list of integers; convert to absolute value, then trim the edges, then I need each number multiplied by itself.


Take a list of integers; strip the signs, then trim one element off each end, then square all of them.


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


Take a list of integers; get the absolute value of everything, then remove the first and last elements, then make each one squared.


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then square each value in the list.


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


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


Take a list of integers; drop the leading negative values, then clamp each to at most ten, then stop at the first non-positive value.


Take a list of integers; cut the leading negatives, then don't let anything exceed 10, then keep the leading run of positive numbers.


Take a list of integers; skip negatives at the start, then clamp each to at most ten, then take values while they are positive.


Take a list of integers; remove all negatives at the front, then don't let anything exceed 10, then take positive values then stop.


Take a list of integers; remove the initial run of negative numbers, then clamp each to at most ten, then keep going while positive.


Take a list of integers; strip the front negatives, then don't let anything exceed 10, then stop at first non positive.


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


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


Take a list of integers; take values while they are positive, then keep only even values, then arrange in decreasing order.


Take a list of integers; take positive values then stop, then extract all even numbers, then arrange in descending order.


Take a list of integers; keep going while positive, then keep only even values, then reverse sort.


Take a list of integers; stop at first non positive, then extract all even numbers, then sort largest to smallest.


Take a list of integers; take while greater than zero, then keep only even values, then sort by descending values.


Take a list of integers; take values while positive, then extract all even numbers, then sort from highest to lowest.


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


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


Take a list of integers; take values while they are positive, then order by distance from zero, then shift each up by ten.


Take a list of integers; take positive values then stop, then sort based on absolute value, then increase all numbers by 10.


Take a list of integers; keep going while positive, then organize by magnitude, then add 10 to everything.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then increment each by ten.


Take a list of integers; take values while positive, then sort by absolute value, 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 = sorted(r, key=abs)
    r = [x + 10 for x in r]
    return r


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


Take a list of integers; reverse the order, then cut the list at the first zero, then bump each up by one.


Take a list of integers; reverse, then cut off after the first zero appears, then increment each item.


Take a list of integers; flip the list around, then take values up to (excluding) the first zero, then bump each up by one.


Take a list of integers; flip the order around, then keep the part before the first 0, then increment each item.


Take a list of integers; put the elements backwards, then truncate at the first zero, then bump each up by one.


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


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


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


Take a list of integers; keep only the last three, then increment each value, then true if at least one even value.


Take a list of integers; keep the final three items, then plus one for all, then any even.


Take a list of integers; take the last three, then increment each value, then true if at least one even value.


Take a list of integers; trim to the last three, then plus one for all, then any even.


Take a list of integers; last three only, then increment each value, then true if at least one even value.


Take a list of integers; truncate to the last three items, then plus one for all, then any even.


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


Take a list of integers; keep only the last three, then add one to each, then return whether any value is even.


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


Take a list of integers; clip values at 10, then exclude zeros, then strip out the evens.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then keep only numbers above 5.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then exclude values of 5 and below.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then remove anything 5 or less.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then filter to keep only values above 5.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then get rid of values that aren't greater than five.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then drop anything 5 or below.


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


Take a list of integers; drop duplicates keeping first occurrence, then double each, then keep values greater than five.


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


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


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


Take a list of integers; Take everything except the first, then keep the part before the first 0, then keep only the middle part.


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


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then eliminate the outermost elements.


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


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


Take a list of integers; drop the first and last elements, then order by distance from zero, then drop the even numbers.


Take a list of integers; take out the first and last items, then sort based on absolute value, then strip out the evens.


Take a list of integers; remove both ends, then organize by magnitude, then drop the even numbers.


Take a list of integers; trim the edges, then arrange by absolute value ascending, then strip out the evens.


Take a list of integers; trim one element off each end, then sort from smallest to largest absolute value, then drop the even numbers.


Take a list of integers; cut off the first and last, then sort by absolute value, then strip out the evens.


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


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


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


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


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


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then drop non-positive values.


Take a list of people records (name, age); show me all ages, then drop everything except the final three, then drop the negative numbers.


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then filter out the negative ones.


Take a list of people records (name, age); get the age field, then keep only the last three, then remove all negative values.


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then keep positive values only.


Take a list of people records (name, age); extract age values, then take the last three, then keep values above zero.


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


Take a list of people records (name, age); extract the ages, then keep only the last three, then keep the positive numbers.


Take a list of integers; take values while they are positive, then increment each value, then give the number of evens.


Take a list of integers; take positive values then stop, then plus one for all, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then increment each value, then how many are even.


Take a list of integers; stop at first non positive, then plus one for all, then get the total number of even values in the list.


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


Take a list of integers; take values while positive, then plus one for all, 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 + 1 for x in r]
    return sum(1 for x in r if x % 2 == 0)


Take a list of integers; take values while they are positive, then add one to each, then return how many values are even.


Take a list of integers; if empty, use a single zero, then keep only even values, then take values up to (excluding) the first zero.


Take a list of integers; if blank use 0, then extract all even numbers, then keep the part before the first 0.


Take a list of integers; default to [0] when there is nothing, then keep only even values, then truncate at the first zero.


Take a list of integers; when the list is empty, substitute a zero value, then extract all even numbers, then delete everything starting with the first zero.


Take a list of integers; replace an empty list with one zero, then keep only even values, then remove from the first zero onwards.


Take a list of integers; zero it out if it's empty, then extract all even numbers, then up to but not including the first zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep the leading run of positive numbers, then arrange in decreasing order.


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then arrange in descending order.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then reverse sort.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then sort largest to smallest.


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then sort by descending values.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, 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[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = sorted(r, reverse=True)
    return r


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


Take a list of integers; keep only the last three, then keep values below zero, then shift each up by ten.


Take a list of integers; keep the final three items, then get the negative numbers, then increase all numbers by 10.


Take a list of integers; take the last three, then keep values below zero, then add 10 to everything.


Take a list of integers; trim to the last three, then get the negative numbers, then give everything a boost of 10.


Take a list of integers; last three only, then keep values below zero, then increment each by ten.


Take a list of integers; truncate to the last three items, then get the negative numbers, then add a constant 10 to each.


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


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


Take a list of strings; uppercase each string, then strip spaces around each string, then arrange in lexicographic order.


Take a list of strings; make it all caps, then remove leading and trailing spaces, then sort by letter.


Take a list of strings; convert each to upper case, then remove whitespace from each item, then arrange in lexicographic order.


Take a list of strings; change all strings to uppercase, then clean whitespace from each entry, then sort by letter.


Take a list of strings; make every string uppercase, then trim each string, then arrange in lexicographic order.


Take a list of strings; uppercase each one, then trim whitespace from each, then sort by letter.


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


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


Take a list of integers; keep the positive numbers, then keep values divisible by 3, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then keep items where x mod 3 equals zero, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then drop anything not divisible by three, then add 10 to everything.


Take a list of integers; drop the negative numbers, then filter out everything except multiples of three, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then keep only multiples of three, then increment each by ten.


Take a list of integers; remove all negative values, then multiples of three only, then add a constant 10 to each.


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


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


Take a list of integers; drop the zeros, then skip negatives at the start, then strip the signs.


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then take abs of each.


Take a list of integers; drop the zeros, then remove the initial run of negative numbers, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then strip the front negatives, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then remove leading negative numbers, then make them all positive.


Take a list of integers; keep only nonzero elements, then drop negatives from start, then make every value non-negative.


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


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


Take a list of integers; sort by absolute value, then increase every value by 10, then skip the first one.


Take a list of integers; rearrange by distance from zero, then add 10 to each item, then Discard the first element.


Take a list of integers; arrange by magnitude ignoring sign, then shift each up by ten, then skip the first one.


Take a list of integers; put them in order by magnitude, then increase all numbers by 10, then Discard the first element.


Take a list of integers; arrange in order of absolute value, then add 10 to everything, then skip the first one.


Take a list of integers; sort by distance from zero, then give everything a boost of 10, then Discard the first element.


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


Take a list of integers; sort by absolute value, then add ten to each, then drop the first element.


Take a list of integers; drop the first element, then remove both ends, then take values up to (excluding) the first zero.


Take a list of integers; Take everything except the first, then trim the edges, then keep the part before the first 0.


Take a list of integers; drop the first element, then trim one element off each end, then truncate at the first zero.


Take a list of integers; Take everything except the first, then cut off the first and last, then delete everything starting with the first zero.


Take a list of integers; drop the first element, then remove the first and last elements, then remove from the first zero onwards.


Take a list of integers; Take everything except the first, then keep only the middle part, then up to but not including the first zero.


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


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


Take a list of integers; keep multiples of three, then keep only odd values, then make each twice as big.


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then multiply each by 2.


Take a list of integers; keep values divisible by 3, then keep only odd values, then make each twice as big.


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then multiply each by 2.


Take a list of integers; drop anything not divisible by three, then keep only odd values, then make each twice as big.


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then multiply each by 2.


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


Take a list of integers; keep multiples of three, then keep the odd numbers, then double each.


Take a list of strings; drop empty strings, then convert each to upper case, then return the number of strings.


Take a list of strings; get rid of blanks, then change all strings to uppercase, then count the strings.


Take a list of strings; remove blanks, then make every string uppercase, then return how many strings remain.


Take a list of strings; eliminate empty string values, then uppercase each one, then give me the total number of strings.


Take a list of strings; filter out blank strings, then make all the strings uppercase, then tell me how many strings we have.


Take a list of strings; remove strings that are empty, then convert all strings to uppercase letters, then what's the string count.


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


Take a list of strings; drop empty strings, then uppercase each string, then return how many strings remain.


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


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


Take a list of integers; drop the first element, then truncate to three items, then what's the product.


Take a list of integers; Take everything except the first, then show the first three, then what do they multiply to.


Take a list of integers; drop the first element, then take the first three, then give me their product.


Take a list of integers; Take everything except the first, then keep first 3, then multiply them all together.


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


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


Take a list of integers; keep only the first three, then remove all zero values, then true only if all are positive.


Take a list of integers; keep the first 3 items, then exclude zeros, then do all of these have positive values.


Take a list of integers; take the first 3 elements, then remove all zero values, then check if every value is positive.


Take a list of integers; remove everything after the third, then exclude zeros, then confirm all values are positive.


Take a list of integers; truncate to three items, then remove all zero values, then all positive.


Take a list of integers; show the first three, then exclude zeros, 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 != 0]
    return all(x > 0 for x in r)


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


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


Take a list of integers; keep the final three items, 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; take the last three, then drop anything not divisible by three, then ensure at least three items by appending zeros.


Take a list of integers; trim to the last three, 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; last three only, then keep only multiples of three, then ensure at least three items by appending zeros.


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


def solve(xs):
    r = list(xs)
    r = r[-3:]
    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; keep only the last three, then keep multiples of three, then pad with zeros to at least three elements.


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


Take a list of integers; Sort it from low to high, then add 10 to each item, then fetch the first even element, default to 0.


Take a list of integers; arrange in increasing order, then shift each up by ten, then give the earliest even value or zero.


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


Take a list of integers; Sort in ascending order, then add 10 to everything, then give the earliest even value or zero.


Take a list of integers; I need this sorted ascending, then give everything a boost of 10, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep the even numbers, then order by distance from zero, then find the min, defaulting to 0.


Take a list of integers; keep evens, then sort based on absolute value, then minimum value, zero otherwise.


Take a list of integers; keep the even numbers, then organize by magnitude, then get the minimum value or zero if empty.


Take a list of integers; keep evens, then arrange by absolute value ascending, then give me the min or 0.


Take a list of integers; keep the even numbers, then sort from smallest to largest absolute value, then return the smallest number, defaulting to 0.


Take a list of integers; keep evens, then sort by absolute value, then return smallest or zero if empty.


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


Take a list of integers; keep the even numbers, then sort by absolute value, then return the minimum (0 if empty).


Take a list of integers; drop the leading negative values, then take the final 3 elements, then keep only numbers above 5.


Take a list of integers; cut the leading negatives, then drop everything except the final three, then exclude values of 5 and below.


Take a list of integers; skip negatives at the start, then give me the last three elements, then remove anything 5 or less.


Take a list of integers; remove all negatives at the front, then keep only the last three, then filter to keep only values above 5.


Take a list of integers; remove the initial run of negative numbers, then keep the final three items, then get rid of values that aren't greater than five.


Take a list of integers; strip the front negatives, then take the last three, then drop anything 5 or below.


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


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


Take a list of integers; keep multiples of three, then drop anything 5 or below, then truncate to the last three items.


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


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then remove all but the last three.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then take the final 3 elements.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then drop everything except the final three.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then give me the last three elements.


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


Take a list of integers; keep multiples of three, then keep values greater than five, then keep only the last three.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then keep only numbers above 5.


Take a list of integers; odd numbers only, then pad to 3, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then remove anything 5 or less.


Take a list of integers; odd numbers only, then pad to 3, then filter to keep only values above 5.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then get rid of values that aren't greater than five.


Take a list of integers; odd numbers only, then pad to 3, then drop anything 5 or below.


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


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


Take a list of integers; sort by absolute value, then sort largest to smallest, then give back the product of all values.


Take a list of integers; rearrange by distance from zero, then sort by descending values, then product of the list.


Take a list of integers; arrange by magnitude ignoring sign, then sort from highest to lowest, then what's the product.


Take a list of integers; put them in order by magnitude, then sort descending, then what do they multiply to.


Take a list of integers; arrange in order of absolute value, then sort largest first, then give me their product.


Take a list of integers; sort by distance from zero, then sort in descending order, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = sorted(r, reverse=True)
    return __import__('math').prod(r)


Take a list of integers; sort by absolute value, then sort descending, then return their product.


Take a list of integers; reverse the order, then multiply each by two, then truncate to the last three items.


Take a list of integers; reverse, then double each item in the list, then show only the last three.


Take a list of integers; flip the list around, then multiply each by two, then remove all but the last three.


Take a list of integers; flip the order around, then double each item in the list, then take the final 3 elements.


Take a list of integers; put the elements backwards, then multiply each by two, then drop everything except the final three.


Take a list of integers; reverse that for me, then double each item in the list, then give me the last three elements.


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


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


Take a list of integers; square each, then cut the list at the first zero, then give back the total.


Take a list of integers; each value squared, then cut off after the first zero appears, then sum r.


Take a list of integers; multiply each value by itself, then take values up to (excluding) the first zero, then add them up.


Take a list of integers; square them all, then keep the part before the first 0, then calculate the sum of all elements.


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


Take a list of integers; I need each number multiplied by itself, then delete everything starting with the first zero, then what do they add up to.


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


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


Take a list of integers; take the absolute value of each, then take the final 3 elements, then remove the initial run of negative numbers.


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


Take a list of integers; strip the signs, then give me the last three elements, then remove leading negative numbers.


Take a list of integers; take abs of each, then keep only the last three, then drop negatives from start.


Take a list of integers; get the absolute value of everything, then keep the final three items, then strip negative values from the start.


Take a list of integers; apply absolute value to the whole list, then take the last three, then remove negatives before the first non-negative.


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


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


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