Take a list of integers; Subtract 1 from all, then keep first 3, then check if values are in increasing order.


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


Take a list of integers; subtract one from each, then keep only the first three, then return whether the list is sorted ascending.


Take a list of people records (name, age); extract the ages, then take the first 3 elements, then true if already sorted smallest to largest.


Take a list of people records (name, age); show me all ages, then remove everything after the third, then does this list go in ascending order.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items, then check if the list is in ascending order.


Take a list of people records (name, age); get the age field, then show the first three, then is the list sorted.


Take a list of people records (name, age); keep just each person's age, then take the first three, then is it sorted.


Take a list of people records (name, age); extract age values, then keep first 3, then check if values are in increasing order.


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


Take a list of people records (name, age); extract the ages, then keep only the first three, then return whether the list is sorted ascending.


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


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


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


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


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


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


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


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


Take a list of integers; keep the negative numbers, then decrement each value, then give the earliest even value or zero.


Take a list of integers; extract negatives, then Lower each number by one, then fetch the first even element, default to 0.


Take a list of integers; keep the negative numbers, then reduce each by one, then give the earliest even value or zero.


Take a list of integers; extract negatives, then Subtract 1 from all, then fetch the first even element, default to 0.


Take a list of integers; keep the negative numbers, then Subtract one from each, then give the earliest even value or zero.


Take a list of integers; extract negatives, then Drop each by one, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep the positive numbers, then take the first 3 elements, then find the min, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then minimum value, zero otherwise.


Take a list of integers; drop non-positive values, then truncate to three items, then get the minimum value or zero if empty.


Take a list of integers; drop the negative numbers, then show the first three, then give me the min or 0.


Take a list of integers; filter out the negative ones, then take the first three, then return the smallest number, defaulting to 0.


Take a list of integers; remove all negative values, then keep first 3, then return smallest or zero if empty.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then keep only numbers above 5.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then exclude values of 5 and below.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then remove anything 5 or less.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then filter to keep only values above 5.


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then get rid of values that aren't greater than five.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then drop anything 5 or below.


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


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


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then reduce each by one.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then Subtract 1 from all.


Take a list of integers; strip the signs, then filter for numbers above 5, then Subtract one from each.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then Drop each by one.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then Decrease all values by one.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then Remove one from each value.


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


Take a list of integers; take the absolute value of each, then keep values greater than five, then subtract one from each.


Take a list of integers; negate each, then increment each value, then give the number of evens.


Take a list of integers; reverse the signs of everything, then plus one for all, then find how many values are divisible by two.


Take a list of integers; negate each, then increment each value, then how many are even.


Take a list of integers; reverse the signs of everything, then plus one for all, then get the total number of even values in the list.


Take a list of integers; negate each, then increment each value, then give me the count of even values.


Take a list of integers; reverse the signs of everything, then plus one for all, then I need to know how many of these are even.


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


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


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


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


def solve(xs):
    r = list(xs)
    r = r[1:]
    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; drop the first element, then keep the odd numbers, then keep the even numbers.


Take a list of integers; drop the leading negative values, then take the first 3 elements, then shift each up by ten.


Take a list of integers; cut the leading negatives, then remove everything after the third, then increase all numbers by 10.


Take a list of integers; skip negatives at the start, then truncate to three items, then add 10 to everything.


Take a list of integers; remove all negatives at the front, then show the first three, then give everything a boost of 10.


Take a list of integers; remove the initial run of negative numbers, then take the first three, then increment each by ten.


Take a list of integers; strip the front negatives, then keep first 3, then add a constant 10 to each.


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


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


Take a list of integers; keep the odd numbers, then keep values above zero, then multiply each by -1.


Take a list of integers; odd numbers only, then filter for positive numbers, then negate.


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


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


Take a list of integers; keep the odd numbers, then remove negatives, then multiply each by -1.


Take a list of integers; odd numbers only, then keep the positive numbers, then negate.


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


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


Take a list of integers; keep everything before the first zero, then remove both ends, then limit every value to 10.


Take a list of integers; take only what comes before the initial zero, then trim the edges, then maximum of 10 for all.


Take a list of integers; cut the list at the first zero, then trim one element off each end, then limit every value to 10.


Take a list of integers; cut off after the first zero appears, then cut off the first and last, then maximum of 10 for all.


Take a list of integers; take values up to (excluding) the first zero, then remove the first and last elements, then limit every value to 10.


Take a list of integers; keep the part before the first 0, then keep only the middle part, then maximum of 10 for all.


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


Take a list of integers; keep everything before the first zero, then drop the first and last elements, then cap each value at 10.


Take a list of integers; keep only the first three, then increment each value, then put the elements backwards.


Take a list of integers; keep the first 3 items, then plus one for all, then reverse that for me.


Take a list of integers; take the first 3 elements, then increment each value, then flip it backwards.


Take a list of integers; remove everything after the third, then plus one for all, then make it backwards.


Take a list of integers; truncate to three items, then increment each value, then reverse the list.


Take a list of integers; show the first three, then plus one for all, then invert the sequence.


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


Take a list of integers; keep only the first three, then add one to each, then reverse the order.


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


Take a list of integers; take only what comes before the initial zero, then trim the edges, 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 trim one element off each end, then What's the highest number in the list.


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


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


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


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


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


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


Take a list of integers; Sort it from low to high, then get the negative numbers, then put them in order by magnitude.


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


Take a list of integers; Organize these ascending, then get the negative numbers, then sort by distance from zero.


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


Take a list of integers; I need this sorted ascending, then get the negative numbers, 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 keep the negative numbers, then sort by absolute value.


Take a list of integers; cap each value at 10, then remove repeated values, then raise each to the power of two.


Take a list of integers; clip values at 10, then unique values preserving order, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then remove repeated values, then square all of them.


Take a list of integers; clip values at 10, then unique values preserving order, then multiply each element by itself.


Take a list of integers; cap each value at 10, then remove repeated values, then make each one squared.


Take a list of integers; clip values at 10, then unique values preserving order, then square each value in the list.


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


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


Take a list of integers; reverse the order, then take the final 3 elements, then reduce each by one.


Take a list of integers; reverse, then drop everything except the final three, then Subtract 1 from all.


Take a list of integers; flip the list around, then give me the last three elements, then Subtract one from each.


Take a list of integers; flip the order around, then keep only the last three, then Drop each by one.


Take a list of integers; put the elements backwards, then keep the final three items, then Decrease all values by one.


Take a list of integers; reverse that for me, then take the last three, then Remove one from each value.


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


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


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


Take a list of integers; cut the leading negatives, then turn positives to negatives and vice versa, then filter out everything except multiples of three.


Take a list of integers; skip negatives at the start, then flip the sign of each, then keep only multiples of three.


Take a list of integers; remove all negatives at the front, then turn positives to negatives and vice versa, then multiples of three only.


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


Take a list of integers; strip the front negatives, then turn positives to negatives and vice versa, 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 = [-x for x in r]
    r = [x for x in r if x % 3 == 0]
    return r


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


Take a list of integers; sort ascending, then make every value non-negative, then true if already sorted smallest to largest.


Take a list of integers; Sort it from low to high, then absolute value for all items, then does this list go in ascending order.


Take a list of integers; arrange in increasing order, then take absolute values, then check if the list is in ascending order.


Take a list of integers; Organize these ascending, then turn negatives into positives, then is the list sorted.


Take a list of integers; Sort in ascending order, then abs each element, then is it sorted.


Take a list of integers; I need this sorted ascending, then take the absolute value of each, then check if values are in increasing order.


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


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


Take a list of integers; square each, then keep only even values, then trim one element off each end.


Take a list of integers; each value squared, then extract all even numbers, then cut off the first and last.


Take a list of integers; multiply each value by itself, then keep only even values, then remove the first and last elements.


Take a list of integers; square them all, then extract all even numbers, then keep only the middle part.


Take a list of integers; raise each to the power of two, then keep only even values, then drop first and last.


Take a list of integers; I need each number multiplied by itself, then extract all even numbers, then eliminate the outermost elements.


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


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


Take a list of integers; keep only the first three, then sort smallest to largest, then strip the signs.


Take a list of integers; keep the first 3 items, then Ascending sort, then take abs of each.


Take a list of integers; take the first 3 elements, then Sort this ascending, then get the absolute value of everything.


Take a list of integers; remove everything after the third, then Sort lowest to highest, then apply absolute value to the whole list.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then make them all positive.


Take a list of integers; show the first three, then sort ascending, then make every value non-negative.


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


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


Take a list of integers; drop the zeros, then cut the list at the first zero, then give the number of evens.


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then find how many values are divisible by two.


Take a list of integers; drop the zeros, then take values up to (excluding) the first zero, then how many are even.


Take a list of integers; keep only nonzero elements, then keep the part before the first 0, then get the total number of even values in the list.


Take a list of integers; drop the zeros, then truncate at the first zero, then give me the count of even values.


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then I need to know how many of these are even.


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


Take a list of integers; drop the zeros, then keep everything before the first zero, then return how many values are even.


Take a list of integers; pad with zeros to at least three elements, then order by distance from zero, then keep only numbers above 5.


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


Take a list of integers; pad with zeros to at least three elements, then organize by magnitude, then remove anything 5 or less.


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


Take a list of integers; pad with zeros to at least three elements, then sort from smallest to largest absolute value, then get rid of values that aren't greater than five.


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


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


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


Take a list of integers; sort by absolute value, then increment each value, then true only if all are positive.


Take a list of integers; rearrange by distance from zero, then plus one for all, then do all of these have positive values.


Take a list of integers; arrange by magnitude ignoring sign, then increment each value, then check if every value is positive.


Take a list of integers; put them in order by magnitude, then plus one for all, then confirm all values are positive.


Take a list of integers; arrange in order of absolute value, then increment each value, then all positive.


Take a list of integers; sort by distance from zero, then plus one for all, then check if every number is above zero.


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


Take a list of integers; sort by absolute value, then add one to each, then return whether all values are positive.


Take a list of integers; take the absolute value of each, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; convert to absolute value, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; strip the signs, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; take abs of each, then zero it out if it's empty, then increment each item.


Take a list of integers; get the absolute value of everything, then use zero if the list is empty, then bump each up by one.


Take a list of integers; apply absolute value to the whole list, then default to zero when empty, then increment each item.


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


Take a list of integers; take the absolute value of each, then if empty, use a single zero, then add one to each.


Take a list of integers; keep only the first three, then decrement each value, then trim one element off each end.


Take a list of integers; keep the first 3 items, then Lower each number by one, then cut off the first and last.


Take a list of integers; take the first 3 elements, then reduce each by one, then remove the first and last elements.


Take a list of integers; remove everything after the third, then Subtract 1 from all, then keep only the middle part.


Take a list of integers; truncate to three items, then Subtract one from each, then drop first and last.


Take a list of integers; show the first three, then Drop each by one, then eliminate the outermost elements.


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


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


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then true only if all are positive.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then do all of these have positive values.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then check if every value is positive.


Take a list of people records (name, age); get the age field, then strip the front negatives, then confirm all values are positive.


Take a list of people records (name, age); keep just each person's age, then remove leading negative numbers, then all positive.


Take a list of people records (name, age); extract age values, then drop negatives from start, then check if every number is above zero.


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


Take a list of people records (name, age); extract the ages, then drop the leading negative values, then return whether all values are positive.


Take a list of integers; keep values greater than five, then remove all zero values, then arrange by magnitude ignoring sign.


Take a list of integers; filter out values less than or equal to 5, then exclude zeros, then put them in order by magnitude.


Take a list of integers; keep only numbers above 5, then remove all zero values, then arrange in order of absolute value.


Take a list of integers; exclude values of 5 and below, then exclude zeros, then sort by distance from zero.


Take a list of integers; remove anything 5 or less, then remove all zero values, then order by how far from zero.


Take a list of integers; filter to keep only values above 5, then exclude zeros, then order by distance from zero.


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


Take a list of integers; keep values greater than five, then drop the zeros, then sort by absolute value.


Take a list of integers; negate each, then keep only odd values, then arrange by magnitude ignoring sign.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then put them in order by magnitude.


Take a list of integers; negate each, then keep only odd values, then arrange in order of absolute value.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then sort by distance from zero.


Take a list of integers; negate each, then keep only odd values, then order by how far from zero.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then order by distance from zero.


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


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


Take a list of integers; keep the positive numbers, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then fetch the first even element, default to 0.


Take a list of integers; drop non-positive values, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; drop the negative numbers, then double each item in the list, then fetch the first even element, default to 0.


Take a list of integers; filter out the negative ones, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; remove all negative values, then double each item in the list, then fetch the first even element, default to 0.


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


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


Take a list of integers; drop the leading negative values, then flip the sign of each, then true if already sorted smallest to largest.


Take a list of integers; cut the leading negatives, then turn positives to negatives and vice versa, then does this list go in ascending order.


Take a list of integers; skip negatives at the start, then flip the sign of each, then check if the list is in ascending order.


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


Take a list of integers; remove the initial run of negative numbers, then flip the sign of each, then is it sorted.


Take a list of integers; strip the front negatives, then turn positives to negatives and vice versa, then check if values are in increasing order.


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


Take a list of integers; drop the leading negative values, then negate each, then return whether the list is sorted ascending.


Take a list of integers; sort ascending, then remove both ends, then replace an empty list with one zero.


Take a list of integers; Sort it from low to high, then trim the edges, then zero it out if it's empty.


Take a list of integers; arrange in increasing order, then trim one element off each end, then use zero if the list is empty.


Take a list of integers; Organize these ascending, then cut off the first and last, then default to zero when empty.


Take a list of integers; Sort in ascending order, then remove the first and last elements, then if there's nothing, put in a zero.


Take a list of integers; I need this sorted ascending, then keep only the middle part, then if no items, add a zero.


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


Take a list of integers; sort ascending, then drop the first and last elements, then if empty, use a single zero.


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


Take a list of integers; convert to absolute value, then sort based on absolute value, then show the first three.


Take a list of integers; strip the signs, then organize by magnitude, then take the first three.


Take a list of integers; take abs of each, then arrange by absolute value ascending, then keep first 3.


Take a list of integers; get the absolute value of everything, then sort from smallest to largest absolute value, then truncate to first three.


Take a list of integers; apply absolute value to the whole list, then sort by absolute value, then first three.


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then drop duplicates keeping first occurrence, then return whether the list contains a zero.


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


Take a list of integers; filter out values less than or equal to 5, then remove everything after the third, then do all of these have positive values.


Take a list of integers; keep only numbers above 5, then truncate to three items, then check if every value is positive.


Take a list of integers; exclude values of 5 and below, then show the first three, then confirm all values are positive.


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


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


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


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


Take a list of integers; take the absolute value of each, then sort smallest to largest, then make each twice as big.


Take a list of integers; convert to absolute value, then Ascending sort, then multiply each by 2.


Take a list of integers; strip the signs, then Sort this ascending, then make each twice as big.


Take a list of integers; take abs of each, then Sort lowest to highest, then multiply each by 2.


Take a list of integers; get the absolute value of everything, then Arrange from smallest to largest, then make each twice as big.


Take a list of integers; apply absolute value to the whole list, then sort ascending, then multiply each by 2.


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


Take a list of integers; take the absolute value of each, then sort ascending, then double each.


Take a list of integers; drop duplicates keeping first occurrence, then sort smallest to largest, then take values up to (excluding) the first zero.


Take a list of integers; drop duplicates but keep the first one, then Ascending sort, then keep the part before the first 0.


Take a list of integers; drop duplicates keeping first occurrence, then Sort this ascending, then truncate at the first zero.


Take a list of integers; drop duplicates but keep the first one, then Sort lowest to highest, then delete everything starting with the first zero.


Take a list of integers; drop duplicates keeping first occurrence, then Arrange from smallest to largest, then remove from the first zero onwards.


Take a list of integers; drop duplicates but keep the first one, then sort ascending, then up to but not including the first zero.


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


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


Take a list of integers; drop the first element, then sort smallest to largest, then truncate to the last three items.


Take a list of integers; Take everything except the first, then Ascending sort, then show only the last three.


Take a list of integers; drop the first element, then Sort this ascending, then remove all but the last three.


Take a list of integers; Take everything except the first, then Sort lowest to highest, then take the final 3 elements.


Take a list of integers; drop the first element, then Arrange from smallest to largest, then drop everything except the final three.


Take a list of integers; Take everything except the first, then sort ascending, then give me the last three elements.


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


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


Take a list of integers; sort ascending, then take the first 3 elements, then skip the first one.


Take a list of integers; Sort it from low to high, then remove everything after the third, then Discard the first element.


Take a list of integers; arrange in increasing order, then truncate to three items, then skip the first one.


Take a list of integers; Organize these ascending, then show the first three, then Discard the first element.


Take a list of integers; Sort in ascending order, then take the first three, then skip the first one.


Take a list of integers; I need this sorted ascending, then keep first 3, then Discard the first element.


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


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


Take a list of integers; reverse the order, then multiply each by two, then find the min, defaulting to 0.


Take a list of integers; reverse, then double each item in the list, then minimum value, zero otherwise.


Take a list of integers; flip the list around, then multiply each by two, then get the minimum value or zero if empty.


Take a list of integers; flip the order around, then double each item in the list, then give me the min or 0.


Take a list of integers; put the elements backwards, then multiply each by two, then return the smallest number, defaulting to 0.


Take a list of integers; reverse that for me, then double each item in the list, then return smallest or zero if empty.


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


Take a list of integers; reverse the order, then double each, then return the minimum (0 if empty).


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


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then do all of these have positive values.


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


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


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


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


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


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


Take a list of integers; take the absolute value of each, then decrement each value, then deduplicate the list.


Take a list of integers; convert to absolute value, then Lower each number by one, then remove repeats.


Take a list of integers; strip the signs, then reduce each by one, then deduplicate the list.


Take a list of integers; take abs of each, then Subtract 1 from all, then remove repeats.


Take a list of integers; get the absolute value of everything, then Subtract one from each, then deduplicate the list.


Take a list of integers; apply absolute value to the whole list, then Drop each by one, then remove repeats.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then true only if all are positive.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then do all of these have positive values.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then check if every value is positive.


Take a list of people records (name, age); get the age field, then extract all even numbers, then confirm all values are positive.


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


Take a list of people records (name, age); extract age values, then extract all even numbers, then check if every number is above zero.


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then return whether all values are positive.


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then give back the total.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then sum r.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then add them up.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then calculate the sum of all elements.


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


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then what do they add up to.


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


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


Take a list of integers; drop the first element, then multiply each by two, then reduce each by one.


Take a list of integers; Take everything except the first, then double each item in the list, then Subtract 1 from all.


Take a list of integers; drop the first element, then multiply each by two, then Subtract one from each.


Take a list of integers; Take everything except the first, then double each item in the list, then Drop each by one.


Take a list of integers; drop the first element, then multiply each by two, then Decrease all values by one.


Take a list of integers; Take everything except the first, then double each item in the list, then Remove one from each value.


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


Take a list of integers; drop the first element, then double each, then subtract one from each.


Take a list of integers; keep values greater than five, then keep values below zero, then find the max, defaulting to 0.


Take a list of integers; filter out values less than or equal to 5, then get the negative numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep only numbers above 5, then keep values below zero, then What's the highest number in the list.


Take a list of integers; exclude values of 5 and below, then get the negative numbers, then Return the greatest value or default to 0.


Take a list of integers; remove anything 5 or less, then keep values below zero, then Find the largest element, defaulting to zero.


Take a list of integers; filter to keep only values above 5, then get the negative numbers, then give the largest value (0 if none).


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


Take a list of integers; keep values greater than five, then keep the negative numbers, then return the maximum (0 if empty).


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then shift each up by ten.


Take a list of integers; odd numbers only, then pad to 3, then increase all numbers by 10.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then add 10 to everything.


Take a list of integers; odd numbers only, then pad to 3, then give everything a boost of 10.


Take a list of integers; keep the odd numbers, then extend to length 3 using zeros, then increment each by ten.


Take a list of integers; odd numbers only, then pad to 3, then add a constant 10 to each.


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


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


Take a list of integers; keep the odd numbers, then take the final 3 elements, then give the earliest even value or zero.


Take a list of integers; odd numbers only, then drop everything except the final three, then fetch the first even element, default to 0.


Take a list of integers; keep the odd numbers, then give me the last three elements, then give the earliest even value or zero.


Take a list of integers; odd numbers only, then keep only the last three, then fetch the first even element, default to 0.


Take a list of integers; keep the odd numbers, then keep the final three items, then give the earliest even value or zero.


Take a list of integers; odd numbers only, then take the last three, then fetch the first even element, default to 0.


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


Take a list of integers; keep the odd numbers, then keep only the last three, then return the first even value (0 if none).


Take a list of integers; square each, then take the final 3 elements, then count the elements.


Take a list of integers; each value squared, then drop everything except the final three, then how many items remain.


Take a list of integers; multiply each value by itself, then give me the last three elements, then tell me the length.


Take a list of integers; square them all, then keep only the last three, then return the length.


Take a list of integers; raise each to the power of two, then keep the final three items, then count them.


Take a list of integers; I need each number multiplied by itself, then take the last three, then what's the count.


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


Take a list of integers; square each, then keep only the last three, then return how many remain.


Take a list of integers; keep everything before the first zero, then remove the first item, then make each twice as big.


Take a list of integers; take only what comes before the initial zero, then Remove head, then multiply each by 2.


Take a list of integers; cut the list at the first zero, then remove the first item, then make each twice as big.


Take a list of integers; cut off after the first zero appears, then Remove head, then multiply each by 2.


Take a list of integers; take values up to (excluding) the first zero, then remove the first item, then make each twice as big.


Take a list of integers; keep the part before the first 0, then Remove head, then multiply each by 2.


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


Take a list of integers; keep everything before the first zero, then drop the first element, then double each.


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then trim one element off each end.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then cut off the first and last.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then remove the first and last elements.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then add ten to each, then drop the first and last elements.


Take a list of integers; drop the first element, then skip negatives at the start, then ensure at least three items by appending zeros.


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


Take a list of integers; drop the first element, then remove the initial run of negative numbers, then ensure at least three items by appending zeros.


Take a list of integers; Take everything except the first, then strip the front negatives, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the first element, then remove leading negative numbers, then ensure at least three items by appending zeros.


Take a list of integers; Take everything except the first, then drop negatives from start, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; square each, then cut the list at the first zero, then drop the even numbers.


Take a list of integers; each value squared, then cut off after the first zero appears, then strip out the evens.


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


Take a list of integers; square them all, then keep the part before the first 0, then strip out the evens.


Take a list of integers; raise each to the power of two, then truncate at the first zero, then drop the even numbers.


Take a list of integers; I need each number multiplied by itself, then delete everything starting with the first zero, then strip out the evens.


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


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


Take a list of integers; drop the zeros, then drop anything 5 or below, then stop at the first non-positive value.


Take a list of integers; keep only nonzero elements, then keep only numbers greater than 5, then keep the leading run of positive numbers.


Take a list of integers; drop the zeros, then filter for numbers above 5, then take values while they are positive.


Take a list of integers; keep only nonzero elements, then give me values where x is greater than 5, then take positive values then stop.


Take a list of integers; drop the zeros, then show me only the values that are bigger than five, then keep going while positive.


Take a list of integers; keep only nonzero elements, then keep values greater than five, then stop at first non positive.


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


Take a list of integers; drop the zeros, then keep values greater than five, then take values while they are positive.


Take a list of integers; keep only the last three, then order by distance from zero, then trim one element off each end.


Take a list of integers; keep the final three items, then sort based on absolute value, then cut off the first and last.


Take a list of integers; take the last three, then organize by magnitude, then remove the first and last elements.


Take a list of integers; trim to the last three, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; last three only, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; truncate to the last three items, then sort by absolute value, then eliminate the outermost elements.


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


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


Take a list of integers; drop the leading negative values, then cut the list at the first zero, then arrange in increasing order.


Take a list of integers; cut the leading negatives, then cut off after the first zero appears, then Organize these ascending.


Take a list of integers; skip negatives at the start, then take values up to (excluding) the first zero, then Sort in ascending order.


Take a list of integers; remove all negatives at the front, then keep the part before the first 0, then I need this sorted ascending.


Take a list of integers; remove the initial run of negative numbers, then truncate at the first zero, then Put these in ascending order.


Take a list of integers; strip the front negatives, then delete everything starting with the first zero, then sort smallest to largest.


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


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


Take a list of integers; add one to each, then clamp each to at most ten, then keep only numbers above 5.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then exclude values of 5 and below.


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


Take a list of integers; make each one bigger, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; add one to each, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then drop anything 5 or below.


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


Take a list of integers; add one to each, then cap each value at 10, then keep values greater than five.


Take a list of integers; cap each value at 10, then order by distance from zero, then raise each to the power of two.


Take a list of integers; clip values at 10, then sort based on absolute value, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then organize by magnitude, then square all of them.


Take a list of integers; clip values at 10, then arrange by absolute value ascending, then multiply each element by itself.


Take a list of integers; cap each value at 10, then sort from smallest to largest absolute value, then make each one squared.


Take a list of integers; clip values at 10, then sort by absolute value, then square each value in the list.


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


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


Take a list of integers; drop the first and last elements, then keep only even values, then give back the total.


Take a list of integers; take out the first and last items, then extract all even numbers, then sum r.


Take a list of integers; remove both ends, then keep only even values, then add them up.


Take a list of integers; trim the edges, then extract all even numbers, then calculate the sum of all elements.


Take a list of integers; trim one element off each end, then keep only even values, then what's the total.


Take a list of integers; cut off the first and last, then extract all even numbers, then what do they add up to.


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


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


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


Take a list of integers; keep only nonzero elements, then unique values preserving order, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take the absolute value of each, then extend to length 3 using zeros, then drop the even numbers.


Take a list of integers; convert to absolute value, then pad to 3, then strip out the evens.


Take a list of integers; strip the signs, then extend to length 3 using zeros, then drop the even numbers.


Take a list of integers; take abs of each, then pad to 3, then strip out the evens.


Take a list of integers; get the absolute value of everything, then extend to length 3 using zeros, then drop the even numbers.


Take a list of integers; apply absolute value to the whole list, then pad to 3, then strip out the evens.


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


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


Take a list of integers; reverse the order, then increase every value by 10, then keep only numbers above 5.


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


Take a list of integers; flip the list around, then shift each up by ten, then remove anything 5 or less.


Take a list of integers; flip the order around, then increase all numbers by 10, then filter to keep only values above 5.


Take a list of integers; put the elements backwards, then add 10 to everything, then get rid of values that aren't greater than five.


Take a list of integers; reverse that for me, then give everything a boost of 10, then drop anything 5 or below.


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


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


Take a list of integers; keep multiples of three, then cut the list at the first zero, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of non-multiples of three, then cut off after the first zero appears, then put them in order by magnitude.


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


Take a list of integers; keep items where x mod 3 equals zero, then keep the part before the first 0, then sort by distance from zero.


Take a list of integers; drop anything not divisible by three, then truncate at the first zero, then order by how far from zero.


Take a list of integers; filter out everything except multiples of three, then delete everything starting with the first zero, then order by distance from zero.


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


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


Take a list of integers; keep only the last three, then remove the first item, then drop non-negative values.


Take a list of integers; keep the final three items, then Remove head, then drop all positive numbers.


Take a list of integers; take the last three, then remove the first item, then drop non-negative values.


Take a list of integers; trim to the last three, then Remove head, then drop all positive numbers.


Take a list of integers; last three only, then remove the first item, then drop non-negative values.


Take a list of integers; truncate to the last three items, then Remove head, then drop all positive numbers.


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


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


Take a list of integers; keep only the first three, then increment each value, then ensure at least three items by appending zeros.


Take a list of integers; keep the first 3 items, then plus one for all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the first 3 elements, then increment each value, then ensure at least three items by appending zeros.


Take a list of integers; remove everything after the third, then plus one for all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; truncate to three items, then increment each value, then ensure at least three items by appending zeros.


Take a list of integers; show the first three, then plus one for all, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take positive values then stop, then Ascending sort, then strip out the evens.


Take a list of integers; keep going while positive, then Sort this ascending, then drop the even numbers.


Take a list of integers; stop at first non positive, then Sort lowest to highest, then strip out the evens.


Take a list of integers; take while greater than zero, then Arrange from smallest to largest, then drop the even numbers.


Take a list of integers; take values while positive, then sort ascending, then strip out the evens.


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


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


Take a list of integers; keep only the first three, then remove all zero values, then truncate to the last three items.


Take a list of integers; keep the first 3 items, then exclude zeros, then show only the last three.


Take a list of integers; take the first 3 elements, then remove all zero values, then remove all but the last three.


Take a list of integers; remove everything after the third, then exclude zeros, then take the final 3 elements.


Take a list of integers; truncate to three items, then remove all zero values, then drop everything except the final three.


Take a list of integers; show the first three, then exclude zeros, then give me the last three elements.


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


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


Take a list of integers; keep the even numbers, then remove both ends, then make each twice as big.


Take a list of integers; keep evens, then trim the edges, then multiply each by 2.


Take a list of integers; keep the even numbers, then trim one element off each end, then make each twice as big.


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


Take a list of integers; keep the even numbers, then remove the first and last elements, then make each twice as big.


Take a list of integers; keep evens, then keep only the middle part, then multiply each by 2.


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


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


Take a list of integers; drop the zeros, then remove the first item, then truncate to the last three items.


Take a list of integers; keep only nonzero elements, then Remove head, then show only the last three.


Take a list of integers; drop the zeros, then remove the first item, then remove all but the last three.


Take a list of integers; keep only nonzero elements, then Remove head, then take the final 3 elements.


Take a list of integers; drop the zeros, then remove the first item, then drop everything except the final three.


Take a list of integers; keep only nonzero elements, then Remove head, then give me the last three elements.


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


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


Take a list of integers; negate each, then keep only even values, then shift each up by ten.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then increase all numbers by 10.


Take a list of integers; negate each, then keep only even values, then add 10 to everything.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then give everything a boost of 10.


Take a list of integers; negate each, then keep only even values, then increment each by ten.


Take a list of integers; reverse the signs of everything, then extract all even numbers, then add a constant 10 to each.


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


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


Take a list of integers; take the absolute value of each, then keep the leading run of positive numbers, then drop the odd numbers.


Take a list of integers; convert to absolute value, then take values while they are positive, then filter out the odd numbers.


Take a list of integers; strip the signs, then take positive values then stop, then drop the odd numbers.


Take a list of integers; take abs of each, then keep going while positive, then filter out the odd numbers.


Take a list of integers; get the absolute value of everything, then stop at first non positive, then drop the odd numbers.


Take a list of integers; apply absolute value to the whole list, then take while greater than zero, then filter out the odd numbers.


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


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


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then find the max, defaulting to 0.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then Give me the maximum, but 0 if there are no items.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then What's the highest number in the list.


Take a list of people records (name, age); get the age field, then strip the front negatives, then Return the greatest value or default to 0.


Take a list of people records (name, age); keep just each person's age, then remove leading negative numbers, then Find the largest element, defaulting to zero.


Take a list of people records (name, age); extract age values, then drop negatives from start, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in 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 people records (name, age); extract the ages, then drop the leading negative values, then return the maximum (0 if empty).


Take a list of integers; keep the even numbers, then keep values divisible by 3, then true only if all are positive.


Take a list of integers; keep evens, then keep items where x mod 3 equals zero, then do all of these have positive values.


Take a list of integers; keep the even numbers, then drop anything not divisible by three, then check if every value is positive.


Take a list of integers; keep evens, then filter out everything except multiples of three, then confirm all values are positive.


Take a list of integers; keep the even numbers, then keep only multiples of three, then all positive.


Take a list of integers; keep evens, then multiples of three only, then check if every number is above zero.


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


Take a list of integers; keep the even numbers, then keep multiples of three, then return whether all values are positive.


Take a list of integers; keep the negative numbers, then cut the list at the first zero, then give back the total.


Take a list of integers; extract negatives, then cut off after the first zero appears, then sum r.


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


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


Take a list of integers; keep the negative numbers, then truncate at the first zero, then what's the total.


Take a list of integers; extract negatives, then delete everything starting with the first zero, then what do they add up to.


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


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


Take a list of integers; keep everything before the first zero, then decrement each value, then give the number of evens.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then find how many values are divisible by two.


Take a list of integers; cut the list at the first zero, then reduce each by one, then how many are even.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then get the total number of even values in the list.


Take a list of integers; take values up to (excluding) the first zero, then Subtract one from each, then give me the count of even values.


Take a list of integers; keep the part before the first 0, then Drop each by one, then I need to know how many of these are even.


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


Take a list of integers; keep everything before the first zero, then subtract one from each, then return how many values are even.


Take a list of integers; keep the negative numbers, then increment each value, then give the number of evens.


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


Take a list of integers; keep the negative numbers, then increment each value, then how many are even.


Take a list of integers; extract negatives, then plus one for all, then get the total number of even values in the list.


Take a list of integers; keep the negative numbers, then increment each value, then give me the count of even values.


Take a list of integers; extract negatives, then plus one for all, then I need to know how many of these are even.


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


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


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


Take a list of integers; rearrange by distance from zero, then Ascending sort, then fetch the first even element, default to 0.


Take a list of integers; arrange by magnitude ignoring sign, then Sort this ascending, then give the earliest even value or zero.


Take a list of integers; put them in order by magnitude, then Sort lowest to highest, then fetch the first even element, default to 0.


Take a list of integers; arrange in order of absolute value, then Arrange from smallest to largest, then give the earliest even value or zero.


Take a list of integers; sort by distance from zero, then sort ascending, then fetch the first even element, default to 0.


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


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


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


Take a list of integers; keep the final three items, then unique values preserving order, then reverse that for me.


Take a list of integers; take the last three, then remove repeated values, then flip it backwards.


Take a list of integers; trim to the last three, then unique values preserving order, then make it backwards.


Take a list of integers; last three only, then remove repeated values, then reverse the list.


Take a list of integers; truncate to the last three items, then unique values preserving order, then invert the sequence.


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


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


Take a list of integers; add ten to each, then keep values below zero, then reduce each by one.


Take a list of integers; bump everything up by 10, then get the negative numbers, then Subtract 1 from all.


Take a list of integers; increase every value by 10, then keep values below zero, then Subtract one from each.


Take a list of integers; add 10 to each item, then get the negative numbers, then Drop each by one.


Take a list of integers; shift each up by ten, then keep values below zero, then Decrease all values by one.


Take a list of integers; increase all numbers by 10, then get the negative numbers, then Remove one from each value.


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


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


Take a list of integers; keep only the first three, then skip negatives at the start, then give the earliest even value or zero.


Take a list of integers; keep the first 3 items, then remove all negatives at the front, then fetch the first even element, default to 0.


Take a list of integers; take the first 3 elements, then remove the initial run of negative numbers, then give the earliest even value or zero.


Take a list of integers; remove everything after the third, then strip the front negatives, then fetch the first even element, default to 0.


Take a list of integers; truncate to three items, then remove leading negative numbers, then give the earliest even value or zero.


Take a list of integers; show the first three, then drop negatives from start, then fetch the first even element, default to 0.


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


Take a list of integers; keep only the first three, then drop the leading negative values, then return the first even value (0 if none).


Take a list of integers; drop the leading negative values, then remove both ends, then drop non-negative values.


Take a list of integers; cut the leading negatives, then trim the edges, then drop all positive numbers.


Take a list of integers; skip negatives at the start, then trim one element off each end, then drop non-negative values.


Take a list of integers; remove all negatives at the front, then cut off the first and last, then drop all positive numbers.


Take a list of integers; remove the initial run of negative numbers, then remove the first and last elements, then drop non-negative values.


Take a list of integers; strip the front negatives, then keep only the middle part, then drop all positive numbers.


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


Take a list of integers; drop the leading negative values, then drop the first and last elements, then keep the negative numbers.


Take a list of strings; sort by length, shortest first, then remove repeated strings, then true if a blank string is present.


Take a list of strings; sort ascending by length, then keep unique strings first appearance, then check for empty strings in the list.


Take a list of strings; order strings from shortest to longest, then eliminate repeated strings preserve first occurrence, then check if there's an empty string.


Take a list of strings; shortest to longest, then drop duplicate strings keeping the first, then does the collection contain an empty string value somewhere.


Take a list of strings; arrange by string length ascending, then dedupe, then whether any element is blank.


Take a list of strings; length sort, then remove duplicate strings keep first, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=len)
    r = list(dict.fromkeys(r))
    return any(s == '' for s in r)


Take a list of strings; sort by length, shortest first, then drop duplicate strings keeping the first, then return whether any string is empty.


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


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then drop all positive numbers.


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


Take a list of integers; drop the first element, then cap each value at 10, then keep the negative numbers.


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


Take a list of integers; keep the first 3 items, then remove all negatives at the front, then zero it out if it's empty.


Take a list of integers; take the first 3 elements, then remove the initial run of negative numbers, then use zero if the list is empty.


Take a list of integers; remove everything after the third, then strip the front negatives, then default to zero when empty.


Take a list of integers; truncate to three items, then remove leading negative numbers, then if there's nothing, put in a zero.


Take a list of integers; show the first three, then drop negatives from start, then if no items, add a zero.


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


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


Take a list of integers; take the absolute value of each, then remove all zero values, then give the number of evens.


Take a list of integers; convert to absolute value, then exclude zeros, then find how many values are divisible by two.


Take a list of integers; strip the signs, then remove all zero values, then how many are even.


Take a list of integers; take abs of each, then exclude zeros, then get the total number of even values in the list.


Take a list of integers; get the absolute value of everything, then remove all zero values, then give me the count of even values.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then I need to know how many of these are even.


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


Take a list of integers; take the absolute value of each, then drop the zeros, then return how many values are even.


Take a list of integers; keep only the first three, then order by distance from zero, then replace an empty list with one zero.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then zero it out if it's empty.


Take a list of integers; take the first 3 elements, then organize by magnitude, then use zero if the list is empty.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then default to zero when empty.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then if there's nothing, put in a zero.


Take a list of integers; show the first three, then sort by absolute value, then if no items, add a zero.


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


Take a list of integers; keep only the first three, then sort by absolute value, then if empty, use a single zero.


Take a list of integers; square each, then remove the first item, then true if at least one even value.


Take a list of integers; each value squared, then Remove head, then any even.


Take a list of integers; multiply each value by itself, then remove the first item, then true if at least one even value.


Take a list of integers; square them all, then Remove head, then any even.


Take a list of integers; raise each to the power of two, then remove the first item, then true if at least one even value.


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


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


Take a list of integers; square each, then drop the first element, then return whether any value is even.


Take a list of integers; drop the first element, then keep values above zero, then stop at the first non-positive value.


Take a list of integers; Take everything except the first, then filter for positive numbers, then keep the leading run of positive numbers.


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


Take a list of integers; Take everything except the first, then keep the positives, then take positive values then stop.


Take a list of integers; drop the first element, then remove negatives, then keep going while positive.


Take a list of integers; Take everything except the first, then keep the positive numbers, then stop at first non positive.


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


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


Take a list of integers; keep only the first three, then remove both ends, then skip the first one.


Take a list of integers; keep the first 3 items, then trim the edges, then Discard the first element.


Take a list of integers; take the first 3 elements, then trim one element off each end, then skip the first one.


Take a list of integers; remove everything after the third, then cut off the first and last, then Discard the first element.


Take a list of integers; truncate to three items, then remove the first and last elements, then skip the first one.


Take a list of integers; show the first three, then keep only the middle part, then Discard the first element.


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


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


Take a list of integers; sort ascending, then remove all zero values, then bump each up by one.


Take a list of integers; Sort it from low to high, then exclude zeros, then increment each item.


Take a list of integers; arrange in increasing order, then remove all zero values, then bump each up by one.


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


Take a list of integers; Sort in ascending order, then remove all zero values, then bump each up by one.


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


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


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


Take a list of integers; take the absolute value of each, then remove all zero values, then truncate to the last three items.


Take a list of integers; convert to absolute value, then exclude zeros, then show only the last three.


Take a list of integers; strip the signs, then remove all zero values, then remove all but the last three.


Take a list of integers; take abs of each, then exclude zeros, then take the final 3 elements.


Take a list of integers; get the absolute value of everything, then remove all zero values, then drop everything except the final three.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then give me the last three elements.


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


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


Take a list of integers; square each, then increase every value by 10, then count the elements.


Take a list of integers; each value squared, then add 10 to each item, then how many items remain.


Take a list of integers; multiply each value by itself, then shift each up by ten, then tell me the length.


Take a list of integers; square them all, then increase all numbers by 10, then return the length.


Take a list of integers; raise each to the power of two, then add 10 to everything, then count them.


Take a list of integers; I need each number multiplied by itself, then give everything a boost of 10, then what's the count.


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


Take a list of integers; square each, then add ten to each, then return how many remain.


Take a list of integers; keep values greater than five, then make every value non-negative, then give back the product of all values.


Take a list of integers; filter out values less than or equal to 5, then absolute value for all items, then product of the list.


Take a list of integers; keep only numbers above 5, then take absolute values, then what's the product.


Take a list of integers; exclude values of 5 and below, then turn negatives into positives, then what do they multiply to.


Take a list of integers; remove anything 5 or less, then abs each element, then give me their product.


Take a list of integers; filter to keep only values above 5, then take the absolute value of each, then multiply them all together.


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


Take a list of integers; keep values greater than five, then take the absolute value of each, then return their product.


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


Take a list of people records (name, age); show me all ages, then eliminate the even numbers, then how many items remain.


Take a list of people records (name, age); pluck the age field from each record, then keep only odd values, then tell me the length.


Take a list of people records (name, age); get the age field, then eliminate the even numbers, then return the length.


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


Take a list of people records (name, age); extract age values, then eliminate the even numbers, then what's the count.


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


Take a list of people records (name, age); extract the ages, then keep the odd numbers, then return how many remain.


Take a list of integers; keep the even numbers, then multiply each by two, then shift each up by ten.


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


Take a list of integers; keep the even numbers, then multiply each by two, then add 10 to everything.


Take a list of integers; keep evens, then double each item in the list, then give everything a boost of 10.


Take a list of integers; keep the even numbers, then multiply each by two, then increment each by ten.


Take a list of integers; keep evens, then double each item in the list, then add a constant 10 to each.


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


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


Take a list of integers; drop the first element, then order by distance from zero, then true if at least one even value.


Take a list of integers; Take everything except the first, then sort based on absolute value, then any even.


Take a list of integers; drop the first element, then organize by magnitude, then true if at least one even value.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then any even.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then true if at least one even value.


Take a list of integers; Take everything except the first, then sort by absolute value, then any even.


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


Take a list of integers; drop the first element, then sort by absolute value, then return whether any value is even.


Take a list of integers; double each, then sort smallest to largest, then true if already sorted smallest to largest.


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


Take a list of integers; double each, then Sort this ascending, then check if the list is in ascending order.


Take a list of integers; times two for each item, then Sort lowest to highest, then is the list sorted.


Take a list of integers; double each, then Arrange from smallest to largest, then is it sorted.


Take a list of integers; times two for each item, then sort ascending, then check if values are in increasing order.


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


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


Take a list of integers; keep values greater than five, then keep values below zero, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then get the negative numbers, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then keep values below zero, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then get the negative numbers, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then keep values below zero, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then get the negative numbers, then sort smallest to largest.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then drop the even numbers.


Take a list of integers; Sort it from low to high, then pad to 3, then strip out the evens.


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


Take a list of integers; Organize these ascending, then pad to 3, then strip out the evens.


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


Take a list of integers; I need this sorted ascending, then pad to 3, then strip out the evens.


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


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


Take a list of integers; double each, then extend to length 3 using zeros, then true if at least one even value.


Take a list of integers; times two for each item, then pad to 3, then any even.


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


Take a list of integers; double each, then pad with zeros to at least three elements, then return whether any value is even.


Take a list of integers; sort descending, then extend to length 3 using zeros, then stop at the first non-positive value.


Take a list of integers; sort largest first, then pad to 3, then keep the leading run of positive numbers.


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


Take a list of integers; sort from greatest to least, then pad to 3, then take positive values then stop.


Take a list of integers; sort z to a, then extend to length 3 using zeros, then keep going while positive.


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


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


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


Take a list of integers; subtract one from each, then remove all zero values, then count the elements.


Take a list of integers; Decrement all items, then exclude zeros, then how many items remain.


Take a list of integers; decrement each value, then remove all zero values, then tell me the length.


Take a list of integers; Lower each number by one, then exclude zeros, then return the length.


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


Take a list of integers; Subtract 1 from all, then exclude zeros, then what's the count.


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


Take a list of integers; subtract one from each, then drop the zeros, then return how many remain.


Take a list of integers; add ten to each, then make every value non-negative, then replace an empty list with one zero.


Take a list of integers; bump everything up by 10, then absolute value for all items, then zero it out if it's empty.


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


Take a list of integers; add 10 to each item, then turn negatives into positives, then default to zero when empty.


Take a list of integers; shift each up by ten, then abs each element, then if there's nothing, put in a zero.


Take a list of integers; increase all numbers by 10, then take the absolute value of each, then if no items, add a zero.


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


Take a list of integers; add ten to each, then take the absolute value of each, then if empty, use a single zero.


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


Take a list of integers; Take everything except the first, then remove all negatives at the front, then show only the last three.


Take a list of integers; drop the first element, then remove the initial run of negative numbers, then remove all but the last three.


Take a list of integers; Take everything except the first, then strip the front negatives, then take the final 3 elements.


Take a list of integers; drop the first element, then remove leading negative numbers, then drop everything except the final three.


Take a list of integers; Take everything except the first, then drop negatives from start, then give me the last three elements.


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


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


Take a list of integers; negate each, then keep values divisible by 3, then give back the product of all values.


Take a list of integers; reverse the signs of everything, then keep items where x mod 3 equals zero, then product of the list.


Take a list of integers; negate each, then drop anything not divisible by three, then what's the product.


Take a list of integers; reverse the signs of everything, then filter out everything except multiples of three, then what do they multiply to.


Take a list of integers; negate each, then keep only multiples of three, then give me their product.


Take a list of integers; reverse the signs of everything, then multiples of three only, then multiply them all together.


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


Take a list of integers; negate each, then keep multiples of three, then return their product.


Take a list of strings; sort by length, shortest first, then order the strings A to Z, then deduplicate the strings.