Take a list of integers; keep the negative numbers, then make every value non-negative, then drop anything not divisible by three.


Take a list of integers; extract negatives, then absolute value for all items, then filter out everything except multiples of three.


Take a list of integers; keep the negative numbers, then take absolute values, then keep only multiples of three.


Take a list of integers; extract negatives, then turn negatives into positives, then multiples of three only.


Take a list of integers; keep the negative numbers, then abs each element, then filter for numbers divisible by three.


Take a list of integers; extract negatives, then take the absolute value of each, then give me only the values divisible by three.


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


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


Take a list of people records (name, age); extract the ages, then keep values divisible by 3, then remove the initial run of negative numbers.


Take a list of people records (name, age); show me all ages, then keep items where x mod 3 equals zero, then strip the front negatives.


Take a list of people records (name, age); pluck the age field from each record, then drop anything not divisible by three, then remove leading negative numbers.


Take a list of people records (name, age); get the age field, then filter out everything except multiples of three, then drop negatives from start.


Take a list of people records (name, age); keep just each person's age, then keep only multiples of three, then strip negative values from the start.


Take a list of people records (name, age); extract age values, then multiples of three only, then remove negatives before the first non-negative.


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


Take a list of people records (name, age); extract the ages, then keep multiples of three, then drop the leading negative values.


Take a list of integers; keep only the first three, then multiply each by two, then give back the product of all values.


Take a list of integers; keep the first 3 items, then double each item in the list, then product of the list.


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


Take a list of integers; remove everything after the third, then double each item in the list, then what do they multiply to.


Take a list of integers; truncate to three items, then multiply each by two, then give me their product.


Take a list of integers; show the first three, then double each item in the list, then multiply them all together.


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


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


Take a list of integers; square each, then keep only odd values, then skip the first one.


Take a list of integers; each value squared, then eliminate the even numbers, then Discard the first element.


Take a list of integers; multiply each value by itself, then keep only odd values, then skip the first one.


Take a list of integers; square them all, then eliminate the even numbers, then Discard the first element.


Take a list of integers; raise each to the power of two, then keep only odd values, then skip the first one.


Take a list of integers; I need each number multiplied by itself, then eliminate the even numbers, then Discard the first element.


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


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


Take a list of integers; square each, then skip negatives at the start, then true if any value equals zero.


Take a list of integers; each value squared, then remove all negatives at the front, then check for zero.


Take a list of integers; multiply each value by itself, then remove the initial run of negative numbers, then true if any value equals zero.


Take a list of integers; square them all, then strip the front negatives, then check for zero.


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


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then check for zero.


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


Take a list of integers; square each, then drop the leading negative values, then return whether the list contains a zero.


Take a list of integers; drop duplicates keeping first occurrence, then make every value non-negative, then true if every value is unique.


Take a list of integers; drop duplicates but keep the first one, then absolute value for all items, then check for duplicates in the values.


Take a list of integers; drop duplicates keeping first occurrence, then take absolute values, then do all values appear only once.


Take a list of integers; drop duplicates but keep the first one, then turn negatives into positives, then check that there are no duplicates.


Take a list of integers; drop duplicates keeping first occurrence, then abs each element, then are the values all unique.


Take a list of integers; drop duplicates but keep the first one, then take the absolute value of each, then check if all values are unique.


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


Take a list of integers; drop duplicates keeping first occurrence, then take the absolute value of each, then return whether all values are distinct.


Take a list of integers; keep everything before the first zero, then sort smallest to largest, then give back the total.


Take a list of integers; take only what comes before the initial zero, then Ascending sort, then sum r.


Take a list of integers; cut the list at the first zero, then Sort this ascending, then add them up.


Take a list of integers; cut off after the first zero appears, then Sort lowest to highest, then calculate the sum of all elements.


Take a list of integers; take values up to (excluding) the first zero, then Arrange from smallest to largest, then what's the total.


Take a list of integers; keep the part before the first 0, then sort ascending, then what do they add up to.


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


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


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


Take a list of integers; clip values at 10, then drop everything except the final three, then product of the list.


Take a list of integers; cap each value at 10, then give me the last three elements, then what's the product.


Take a list of integers; clip values at 10, then keep only the last three, then what do they multiply to.


Take a list of integers; cap each value at 10, then keep the final three items, then give me their product.


Take a list of integers; clip values at 10, then take the last three, then multiply them all together.


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


Take a list of integers; cap each value at 10, then keep only the last three, then return their product.


Take a list of integers; drop the zeros, then flip the sign of each, then truncate to the last three items.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then show only the last three.


Take a list of integers; drop the zeros, then flip the sign of each, then remove all but the last three.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then take the final 3 elements.


Take a list of integers; drop the zeros, then flip the sign of each, then drop everything except the final three.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa, then give me the last three elements.


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


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


Take a list of integers; keep everything before the first zero, then decrement each value, then true if any value equals zero.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then check for zero.


Take a list of integers; cut the list at the first zero, then reduce each by one, then true if any value equals zero.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then check for zero.


Take a list of integers; take values up to (excluding) the first zero, then Subtract one from each, then true if any value equals zero.


Take a list of integers; keep the part before the first 0, then Drop each by one, then check for zero.


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 0 in r


Take a list of integers; keep everything before the first zero, then subtract one from each, then return whether the list contains a zero.


Take a list of people records (name, age); extract the ages, then remove repeated values, then drop the odd numbers.


Take a list of people records (name, age); show me all ages, then unique values preserving order, then filter out the odd numbers.


Take a list of people records (name, age); pluck the age field from each record, then remove repeated values, then drop the odd numbers.


Take a list of people records (name, age); get the age field, then unique values preserving order, then filter out the odd numbers.


Take a list of people records (name, age); keep just each person's age, then remove repeated values, then drop the odd numbers.


Take a list of people records (name, age); extract age values, then unique values preserving order, then filter out the odd numbers.


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


Take a list of people records (name, age); extract the ages, then drop duplicates keeping first occurrence, then keep the even numbers.


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


Take a list of integers; times two for each item, then eliminate the even numbers, then put them in order by magnitude.


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


Take a list of integers; times two for each item, then eliminate the even numbers, then sort by distance from zero.


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


Take a list of integers; times two for each item, then eliminate the even numbers, then order by distance from zero.


def solve(xs):
    r = list(xs)
    r = [x * 2 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; double each, then keep the odd numbers, then sort by absolute value.


Take a list of integers; sort descending, then remove all zero values, then true if any value equals zero.


Take a list of integers; sort largest first, then exclude zeros, then check for zero.


Take a list of integers; sort in descending order, then remove all zero values, then true if any value equals zero.


Take a list of integers; sort from greatest to least, then exclude zeros, then check for zero.


Take a list of integers; sort z to a, then remove all zero values, then true if any value equals zero.


Take a list of integers; arrange in decreasing order, then exclude zeros, then check for zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then give the number of evens.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then find how many values are divisible by two.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then how many are even.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then get the total number of even values in the list.


Take a list of integers; drop duplicates keeping first occurrence, then keep only odd values, then give me the count of even values.


Take a list of integers; drop duplicates but keep the first one, then eliminate the even numbers, then I need to know how many of these are even.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the odd numbers, then return how many values are even.


Take a list of integers; keep only the last three, then increment each value, then take values up to (excluding) the first zero.


Take a list of integers; keep the final three items, then plus one for all, then keep the part before the first 0.


Take a list of integers; take the last three, then increment each value, then truncate at the first zero.


Take a list of integers; trim to the last three, then plus one for all, then delete everything starting with the first zero.


Take a list of integers; last three only, then increment each value, then remove from the first zero onwards.


Take a list of integers; truncate to the last three items, then plus one for all, then up to but not including the first zero.


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


Take a list of integers; keep only the last three, then add one to each, then keep everything before the first zero.


Take a list of integers; sort descending, then order by distance from zero, then true if every value is unique.


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


Take a list of integers; sort in descending order, then organize by magnitude, then do all values appear only once.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending, then check that there are no duplicates.


Take a list of integers; sort z to a, then sort from smallest to largest absolute value, then are the values all unique.


Take a list of integers; arrange in decreasing order, then sort by absolute value, then check if all values are unique.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = sorted(r, key=abs)
    return len(r) == len(set(r))


Take a list of integers; sort descending, then sort by absolute value, then return whether all values are distinct.


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then skip the first one.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then Discard the first element.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then skip the first one.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then Discard the first element.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then skip the first one.


Take a list of integers; keep the part before the first 0, then keep values greater than five, then Discard the first element.


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


Take a list of integers; keep everything before the first zero, then keep values greater than five, then drop the first element.


Take a list of integers; keep only the last three, then cut the list at the first zero, then drop the even numbers.


Take a list of integers; keep the final three items, then cut off after the first zero appears, then strip out the evens.


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


Take a list of integers; trim to the last three, then keep the part before the first 0, then strip out the evens.


Take a list of integers; last three only, then truncate at the first zero, then drop the even numbers.


Take a list of integers; truncate to the last three items, then delete everything starting with the first zero, then strip out the evens.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    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; keep only the last three, then keep everything before the first zero, then keep the odd numbers.


Take a list of integers; double each, then keep only odd values, then drop non-positive values.


Take a list of integers; times two for each item, then eliminate the even numbers, then drop the negative numbers.


Take a list of integers; double each, then keep only odd values, then filter out the negative ones.


Take a list of integers; times two for each item, then eliminate the even numbers, then remove all negative values.


Take a list of integers; double each, then keep only odd values, then keep positive values only.


Take a list of integers; times two for each item, then eliminate the even numbers, then keep values above zero.


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


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


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


Take a list of integers; get rid of anything that's not positive, then Remove head, then do all of these have positive values.


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


Take a list of integers; drop the negative numbers, then Remove head, then confirm all values are positive.


Take a list of integers; filter out the negative ones, then remove the first item, then all positive.


Take a list of integers; remove all negative values, then Remove head, then check if every number is above zero.


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then true if any value equals zero.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then check for zero.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then true if any value equals zero.


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


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five, then true if any value equals zero.


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


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


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


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


Take a list of integers; times two for each item, then keep only numbers greater than 5, then show the first three.


Take a list of integers; double each, then filter for numbers above 5, then take the first three.


Take a list of integers; times two for each item, then give me values where x is greater than 5, then keep first 3.


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


Take a list of integers; times two for each item, then keep values greater than five, then first three.


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


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


Take a list of integers; subtract one from each, then make every value non-negative, then multiply each by -1.


Take a list of integers; Decrement all items, then absolute value for all items, then negate.


Take a list of integers; decrement each value, then take absolute values, then multiply each by -1.


Take a list of integers; Lower each number by one, then turn negatives into positives, then negate.


Take a list of integers; reduce each by one, then abs each element, then multiply each by -1.


Take a list of integers; Subtract 1 from all, then take the absolute value of each, then negate.


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


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


Take a list of integers; sort ascending, then sort largest to smallest, then stop at the first non-positive value.


Take a list of integers; Sort it from low to high, then sort by descending values, then keep the leading run of positive numbers.


Take a list of integers; arrange in increasing order, then sort from highest to lowest, then take values while they are positive.


Take a list of integers; Organize these ascending, then sort descending, then take positive values then stop.


Take a list of integers; Sort in ascending order, then sort largest first, then keep going while positive.


Take a list of integers; I need this sorted ascending, then sort in descending order, then stop at first non positive.


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


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


Take a list of integers; keep the positive numbers, then drop anything 5 or below, then find the min, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then keep only numbers greater than 5, then minimum value, zero otherwise.


Take a list of integers; drop non-positive values, then filter for numbers above 5, then get the minimum value or zero if empty.


Take a list of integers; drop the negative numbers, then give me values where x is greater than 5, then give me the min or 0.


Take a list of integers; filter out the negative ones, then show me only the values that are bigger than five, then return the smallest number, defaulting to 0.


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


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


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


Take a list of integers; keep the even numbers, then order by distance from zero, then give back the product of all values.


Take a list of integers; keep evens, then sort based on absolute value, then product of the list.


Take a list of integers; keep the even numbers, then organize by magnitude, then what's the product.


Take a list of integers; keep evens, then arrange by absolute value ascending, then what do they multiply to.


Take a list of integers; keep the even numbers, then sort from smallest to largest absolute value, then give me their product.


Take a list of integers; keep evens, then sort by absolute value, then multiply them all together.


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


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


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


Take a list of integers; keep evens, then Ascending sort, then check for zero.


Take a list of integers; keep the even numbers, then Sort this ascending, then true if any value equals zero.


Take a list of integers; keep evens, then Sort lowest to highest, then check for zero.


Take a list of integers; keep the even numbers, then Arrange from smallest to largest, then true if any value equals zero.


Take a list of integers; keep evens, then sort ascending, then check for zero.


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


Take a list of integers; keep the even numbers, then sort ascending, then return whether the list contains a zero.


Take a list of integers; pad with zeros to at least three elements, then sort largest to smallest, then give the earliest even value or zero.


Take a list of integers; add zeros until the list has at least three values, then sort by descending values, then fetch the first even element, default to 0.


Take a list of integers; pad with zeros to at least three elements, then sort from highest to lowest, then give the earliest even value or zero.


Take a list of integers; add zeros until the list has at least three values, then sort descending, then fetch the first even element, default to 0.


Take a list of integers; pad with zeros to at least three elements, then sort largest first, then give the earliest even value or zero.


Take a list of integers; add zeros until the list has at least three values, then sort in descending order, then fetch the first even element, default to 0.


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


Take a list of integers; pad with zeros to at least three elements, then sort descending, then return the first even value (0 if none).


Take a list of integers; subtract one from each, then keep only odd values, then true if any value equals zero.


Take a list of integers; Decrement all items, then eliminate the even numbers, then check for zero.


Take a list of integers; decrement each value, then keep only odd values, then true if any value equals zero.


Take a list of integers; Lower each number by one, then eliminate the even numbers, then check for zero.


Take a list of integers; reduce each by one, then keep only odd values, then true if any value equals zero.


Take a list of integers; Subtract 1 from all, then eliminate the even numbers, then check for zero.


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


Take a list of integers; subtract one from each, then keep the odd numbers, then return whether the list contains a zero.


Take a list of integers; pad with zeros to at least three elements, then make every value non-negative, then reduce each by one.


Take a list of integers; add zeros until the list has at least three values, then absolute value for all items, then Subtract 1 from all.


Take a list of integers; pad with zeros to at least three elements, then take absolute values, then Subtract one from each.


Take a list of integers; add zeros until the list has at least three values, then turn negatives into positives, then Drop each by one.


Take a list of integers; pad with zeros to at least three elements, then abs each element, then Decrease all values by one.


Take a list of integers; add zeros until the list has at least three values, then take the absolute value of each, then Remove one from each value.


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


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


Take a list of integers; take the absolute value of each, then remove all zero values, then bump each up by one.


Take a list of integers; convert to absolute value, then exclude zeros, then increment each item.


Take a list of integers; strip the signs, then remove all zero values, then bump each up by one.


Take a list of integers; take abs of each, then exclude zeros, then increment each item.


Take a list of integers; get the absolute value of everything, then remove all zero values, then bump each up by one.


Take a list of integers; apply absolute value to the whole list, then exclude zeros, then increment each item.


def solve(xs):
    r = list(xs)
    r = [abs(x) 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; take the absolute value of each, then drop the zeros, then add one to each.


Take a list of integers; if empty, use a single zero, then remove the first item, then drop anything not divisible by three.


Take a list of integers; if blank use 0, then Remove head, then filter out everything except multiples of three.


Take a list of integers; default to [0] when there is nothing, then remove the first item, then keep only multiples of three.


Take a list of integers; when the list is empty, substitute a zero value, then Remove head, then multiples of three only.


Take a list of integers; replace an empty list with one zero, then remove the first item, then filter for numbers divisible by three.


Take a list of integers; zero it out if it's empty, then Remove head, then give me only the values divisible by three.


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


Take a list of integers; if empty, use a single zero, then drop the first element, then keep multiples of three.


Take a list of integers; subtract one from each, then keep the leading run of positive numbers, then strip the signs.


Take a list of integers; Decrement all items, then take values while they are positive, then take abs of each.


Take a list of integers; decrement each value, then take positive values then stop, then get the absolute value of everything.


Take a list of integers; Lower each number by one, then keep going while positive, then apply absolute value to the whole list.


Take a list of integers; reduce each by one, then stop at first non positive, then make them all positive.


Take a list of integers; Subtract 1 from all, then take while greater than zero, then make every value non-negative.


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


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


Take a list of integers; drop the first element, then remove repeated values, then bump each up by one.


Take a list of integers; Take everything except the first, then unique values preserving order, then increment each item.


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


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


Take a list of strings; drop empty strings, then order the strings A to Z, then return them as one comma-separated string.


Take a list of strings; get rid of blanks, then make it alphabetical, then separate by comma.


Take a list of strings; remove blanks, then order the strings A to Z, then join with commas.


Take a list of strings; eliminate empty string values, then make it alphabetical, then comma join.


Take a list of strings; filter out blank strings, then order the strings A to Z, then combine using commas.


Take a list of strings; remove strings that are empty, then make it alphabetical, then connect with commas between each item.


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


Take a list of strings; drop empty strings, then sort alphabetically, then join them with commas.


Take a list of strings; sort alphabetically, then strip spaces around each string, then arrange by string length ascending.


Take a list of strings; arrange alphabetically, then remove leading and trailing spaces, then length sort.


Take a list of strings; sort alphabetically, then remove whitespace from each item, then sort by length shortest first.


Take a list of strings; arrange alphabetically, then clean whitespace from each entry, then organize by string length least to greatest.


Take a list of strings; sort alphabetically, then trim each string, then shortest strings first.


Take a list of strings; arrange alphabetically, then trim whitespace from each, then i want them ordered by how short they are.


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


Take a list of strings; sort alphabetically, then trim whitespace from each, then sort by length, shortest first.


Take a list of integers; keep only the last three, then sort smallest to largest, then keep only non-zero numbers.


Take a list of integers; keep the final three items, then Ascending sort, then strip the zeros.


Take a list of integers; take the last three, then Sort this ascending, then keep only non-zero numbers.


Take a list of integers; trim to the last three, then Sort lowest to highest, then strip the zeros.


Take a list of integers; last three only, then Arrange from smallest to largest, then keep only non-zero numbers.


Take a list of integers; truncate to the last three items, then sort ascending, then strip the zeros.


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


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


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


Take a list of integers; take out the first and last items, then exclude zeros, then show only the last three.


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


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


Take a list of integers; trim one element off each end, then remove all zero values, then drop everything except the final three.


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


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


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


Take a list of integers; keep the negative numbers, then multiply each value by itself, then true only if all are positive.


Take a list of integers; extract negatives, then square them all, then do all of these have positive values.


Take a list of integers; keep the negative numbers, then raise each to the power of two, then check if every value is positive.


Take a list of integers; extract negatives, then I need each number multiplied by itself, then confirm all values are positive.


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


Take a list of integers; extract negatives, then multiply each element by itself, then check if every number is above zero.


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


Take a list of integers; keep the negative numbers, then square each, then return whether all values are positive.


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


Take a list of integers; times two for each item, then when the list is empty, substitute a zero value, then drop the negative numbers.


Take a list of integers; double each, then replace an empty list with one zero, then filter out the negative ones.


Take a list of integers; times two for each item, then zero it out if it's empty, then remove all negative values.


Take a list of integers; double each, then use zero if the list is empty, then keep positive values only.


Take a list of integers; times two for each item, then default to zero when empty, then keep values above zero.


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


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


Take a list of integers; sort descending, then keep values divisible by 3, then multiply each by -1.


Take a list of integers; sort largest first, then keep items where x mod 3 equals zero, then negate.


Take a list of integers; sort in descending order, then drop anything not divisible by three, then multiply each by -1.


Take a list of integers; sort from greatest to least, then filter out everything except multiples of three, then negate.


Take a list of integers; sort z to a, then keep only multiples of three, then multiply each by -1.


Take a list of integers; arrange in decreasing order, then multiples of three only, then negate.


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


Take a list of integers; sort descending, then keep multiples of three, then negate each.


Take a list of integers; keep multiples of three, then sort largest to smallest, then keep only non-zero numbers.


Take a list of integers; get rid of non-multiples of three, then sort by descending values, then strip the zeros.


Take a list of integers; keep values divisible by 3, then sort from highest to lowest, then keep only non-zero numbers.


Take a list of integers; keep items where x mod 3 equals zero, then sort descending, then strip the zeros.


Take a list of integers; drop anything not divisible by three, then sort largest first, then keep only non-zero numbers.


Take a list of integers; filter out everything except multiples of three, then sort in descending order, then strip the zeros.


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


Take a list of integers; keep multiples of three, then sort descending, then drop the zeros.


Take a list of strings; trim whitespace from each, then add '#' to the start of each string, then deduplicate the strings.


Take a list of strings; strip whitespace from every element, then make each one start with a hash, then filter out duplicate strings retain first.


Take a list of strings; remove surrounding whitespace, then add '#' to the start of each string, then strip duplicates preserve order.


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


Take a list of strings; strip spaces from all strings, then add '#' to the start of each string, then keep unique strings first appearance.


Take a list of strings; strip all the strings, then make each one start with a hash, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; trim whitespace from each, then prefix each with a hash, then drop duplicate strings keeping the first.


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


Take a list of integers; odd numbers only, then flip the order around, then drop all positive numbers.


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


Take a list of integers; odd numbers only, then reverse that for me, then drop all positive numbers.


Take a list of integers; keep the odd numbers, then flip it backwards, then drop non-negative values.


Take a list of integers; odd numbers only, then make it backwards, then drop all positive numbers.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then arrange in increasing order.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then Organize these ascending.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then Sort in ascending order.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then I need this sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then Put these in ascending order.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then sort smallest to largest.


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then find the min, defaulting to 0.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then minimum value, zero otherwise.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then get the minimum value or zero if empty.


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


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five, then return the smallest number, defaulting to 0.


Take a list of integers; zero it out if it's empty, then keep values greater than five, then return smallest or zero if empty.


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then return the minimum (0 if empty).


Take a list of integers; negate each, then make every value non-negative, then keep only numbers above 5.


Take a list of integers; reverse the signs of everything, then absolute value for all items, then exclude values of 5 and below.


Take a list of integers; negate each, then take absolute values, then remove anything 5 or less.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then filter to keep only values above 5.


Take a list of integers; negate each, then abs each element, then get rid of values that aren't greater than five.


Take a list of integers; reverse the signs of everything, then take the absolute value of each, then drop anything 5 or below.


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


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


Take a list of integers; if empty, use a single zero, then keep only odd values, then true if every value is unique.


Take a list of integers; if blank use 0, then eliminate the even numbers, then check for duplicates in the values.


Take a list of integers; default to [0] when there is nothing, then keep only odd values, then do all values appear only once.


Take a list of integers; when the list is empty, substitute a zero value, then eliminate the even numbers, then check that there are no duplicates.


Take a list of integers; replace an empty list with one zero, then keep only odd values, then are the values all unique.


Take a list of integers; zero it out if it's empty, then eliminate the even numbers, then check if all values are unique.


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


Take a list of integers; if empty, use a single zero, then keep the odd numbers, then return whether all values are distinct.


Take a list of integers; drop the leading negative values, then keep only even values, then true if any value equals zero.


Take a list of integers; cut the leading negatives, then extract all even numbers, then check for zero.


Take a list of integers; skip negatives at the start, then keep only even values, then true if any value equals zero.


Take a list of integers; remove all negatives at the front, then extract all even numbers, then check for zero.


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then true if any value equals zero.


Take a list of integers; strip the front negatives, then extract all even numbers, then check for zero.


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


Take a list of integers; drop the leading negative values, then keep the even numbers, then return whether the list contains a zero.


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


Take a list of integers; extract negatives, then remove everything after the third, then filter out the odd numbers.


Take a list of integers; keep the negative numbers, then truncate to three items, then drop the odd numbers.


Take a list of integers; extract negatives, then show the first three, then filter out the odd numbers.


Take a list of integers; keep the negative numbers, then take the first three, then drop the odd numbers.


Take a list of integers; extract negatives, then keep first 3, then filter out the odd numbers.


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


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


Take a list of integers; drop the leading negative values, then default to [0] when there is nothing, then make each twice as big.


Take a list of integers; cut the leading negatives, then when the list is empty, substitute a zero value, then multiply each by 2.


Take a list of integers; skip negatives at the start, then replace an empty list with one zero, then make each twice as big.


Take a list of integers; remove all negatives at the front, then zero it out if it's empty, then multiply each by 2.


Take a list of integers; remove the initial run of negative numbers, then use zero if the list is empty, then make each twice as big.


Take a list of integers; strip the front negatives, then default to zero when empty, then multiply each by 2.


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


Take a list of integers; drop the leading negative values, then if empty, use a single zero, then double each.


Take a list of people records (name, age); extract the names, then keep only strings of length 3 or more, then reduce each string to its first character.


Take a list of people records (name, age); Give me the names, then get rid of short ones, then take first char drop blanks.


Take a list of people records (name, age); pluck the name field from each record, then remove strings with less than three characters, then keep first letters only.


Take a list of people records (name, age); Grab the names, then remove all strings under three characters in length, then first letter from each item that isn't empty.


Take a list of people records (name, age); keep just each person's name, then filter out short strings under three chars, then grab the first char from each.


Take a list of people records (name, age); List the names, then drop strings shorter than three characters, then isolate the first character per entry.


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


Take a list of people records (name, age); extract the names, then drop strings shorter than three characters, then keep the first character of each (dropping empties).


Take a list of integers; drop the first element, then keep the leading run of positive numbers, then arrange in increasing order.


Take a list of integers; Take everything except the first, then take values while they are positive, then Organize these ascending.


Take a list of integers; drop the first element, then take positive values then stop, then Sort in ascending order.


Take a list of integers; Take everything except the first, then keep going while positive, then I need this sorted ascending.


Take a list of integers; drop the first element, then stop at first non positive, then Put these in ascending order.


Take a list of integers; Take everything except the first, then take while greater than zero, then sort smallest to largest.


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


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


Take a list of integers; keep the positive numbers, then keep only odd values, then give back the product of all values.


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then product of the list.


Take a list of integers; drop non-positive values, then keep only odd values, then what's the product.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then what do they multiply to.


Take a list of integers; filter out the negative ones, then keep only odd values, then give me their product.


Take a list of integers; remove all negative values, then eliminate the even numbers, then multiply them all together.


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


Take a list of integers; keep the positive numbers, then keep the odd numbers, then return their product.


Take a list of integers; subtract one from each, then keep only even values, then true if at least one even value.


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


Take a list of integers; decrement each value, then keep only even values, then true if at least one even value.


Take a list of integers; Lower each number by one, then extract all even numbers, then any even.


Take a list of integers; reduce each by one, then keep only even values, then true if at least one even value.


Take a list of integers; Subtract 1 from all, then extract all even numbers, then any even.


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


Take a list of integers; subtract one from each, then keep the even numbers, then return whether any value is even.


Take a list of integers; subtract one from each, then default to [0] when there is nothing, then multiply each by -1.


Take a list of integers; Decrement all items, then when the list is empty, substitute a zero value, then negate.


Take a list of integers; decrement each value, then replace an empty list with one zero, then multiply each by -1.


Take a list of integers; Lower each number by one, then zero it out if it's empty, then negate.


Take a list of integers; reduce each by one, then use zero if the list is empty, then multiply each by -1.


Take a list of integers; Subtract 1 from all, then default to zero when empty, then negate.


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


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


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


Take a list of integers; keep only nonzero elements, then sort by descending values, then show the first three.


Take a list of integers; drop the zeros, then sort from highest to lowest, then take the first three.


Take a list of integers; keep only nonzero elements, then sort descending, then keep first 3.


Take a list of integers; drop the zeros, then sort largest first, then truncate to first three.


Take a list of integers; keep only nonzero elements, then sort in descending order, then first three.


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


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


Take a list of integers; negate each, then keep only odd values, then reduce each by one.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then Subtract 1 from all.


Take a list of integers; negate each, then keep only odd values, then Subtract one from each.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then Drop each by one.


Take a list of integers; negate each, then keep only odd values, then Decrease all values by one.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers, then Remove one from each value.


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


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


Take a list of integers; sort by absolute value, then keep values divisible by 3, then give back the product of all values.


Take a list of integers; rearrange by distance from zero, then keep items where x mod 3 equals zero, then product of the list.


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then what's the product.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then what do they multiply to.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then give me their product.


Take a list of integers; sort by distance from zero, then multiples of three only, then multiply them all together.


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


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


Take a list of integers; take values while they are positive, then order by distance from zero, then give the earliest even value or zero.


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


Take a list of integers; keep going while positive, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then fetch the first even element, default to 0.


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


Take a list of integers; take values while positive, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; square each, then skip negatives at the start, then truncate to three items.


Take a list of integers; each value squared, then remove all negatives at the front, then show the first three.


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


Take a list of integers; square them all, then strip the front negatives, then keep first 3.


Take a list of integers; raise each to the power of two, then remove leading negative numbers, then truncate to first three.


Take a list of integers; I need each number multiplied by itself, then drop negatives from start, then first three.


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


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


Take a list of integers; double each, then sort largest to smallest, then find the min, defaulting to 0.


Take a list of integers; times two for each item, then sort by descending values, then minimum value, zero otherwise.


Take a list of integers; double each, then sort from highest to lowest, then get the minimum value or zero if empty.


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


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


Take a list of integers; times two for each item, then sort in descending order, then return smallest or zero if empty.


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


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


Take a list of integers; keep only the last three, then increment each value, then drop the even numbers.


Take a list of integers; keep the final three items, then plus one for all, then strip out the evens.


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


Take a list of integers; trim to the last three, then plus one for all, then strip out the evens.


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


Take a list of integers; truncate to the last three items, then plus one for all, then strip out the evens.


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


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


Take a list of integers; drop the leading negative values, then sort largest to smallest, then true if at least one even value.


Take a list of integers; cut the leading negatives, then sort by descending values, then any even.


Take a list of integers; skip negatives at the start, then sort from highest to lowest, then true if at least one even value.


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


Take a list of integers; remove the initial run of negative numbers, then sort largest first, then true if at least one even value.


Take a list of integers; strip the front negatives, then sort in descending order, then any even.


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


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


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


Take a list of integers; get rid of anything that's not positive, then eliminate the even numbers, then show only the last three.


Take a list of integers; drop non-positive values, then keep only odd values, then remove all but the last three.


Take a list of integers; drop the negative numbers, then eliminate the even numbers, then take the final 3 elements.


Take a list of integers; filter out the negative ones, then keep only odd values, then drop everything except the final three.


Take a list of integers; remove all negative values, then eliminate the even numbers, then give me the last three elements.


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


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


Take a list of integers; add ten to each, then take the first 3 elements, then arrange in increasing order.


Take a list of integers; bump everything up by 10, then remove everything after the third, then Organize these ascending.


Take a list of integers; increase every value by 10, then truncate to three items, then Sort in ascending order.


Take a list of integers; add 10 to each item, then show the first three, then I need this sorted ascending.


Take a list of integers; shift each up by ten, then take the first three, then Put these in ascending order.


Take a list of integers; increase all numbers by 10, then keep first 3, then sort smallest to largest.


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


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


Take a list of integers; keep values greater than five, then skip negatives at the start, then give the earliest even value or zero.


Take a list of integers; filter out values less than or equal to 5, then remove all negatives at the front, then fetch the first even element, default to 0.


Take a list of integers; keep only numbers above 5, then remove the initial run of negative numbers, then give the earliest even value or zero.


Take a list of integers; exclude values of 5 and below, then strip the front negatives, then fetch the first even element, default to 0.


Take a list of integers; remove anything 5 or less, then remove leading negative numbers, then give the earliest even value or zero.


Take a list of integers; filter to keep only values above 5, then drop negatives from start, then fetch the first even element, default to 0.


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


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


Take a list of integers; add ten to each, then cut the list at the first zero, then put the elements backwards.


Take a list of integers; bump everything up by 10, then cut off after the first zero appears, then reverse that for me.


Take a list of integers; increase every value by 10, then take values up to (excluding) the first zero, then flip it backwards.


Take a list of integers; add 10 to each item, then keep the part before the first 0, then make it backwards.


Take a list of integers; shift each up by ten, then truncate at the first zero, then reverse the list.


Take a list of integers; increase all numbers by 10, then delete everything starting with the first zero, then invert the sequence.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values divisible by 3, then keep only non-zero numbers.


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


Take a list of integers; pad with zeros to at least three elements, then drop anything not divisible by three, then keep only non-zero numbers.


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


Take a list of integers; pad with zeros to at least three elements, then keep only multiples of three, then keep only non-zero numbers.


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


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


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


Take a list of integers; drop the first and last elements, then take the first 3 elements, then true if already sorted smallest to largest.


Take a list of integers; take out the first and last items, then remove everything after the third, then does this list go in ascending order.


Take a list of integers; remove both ends, then truncate to three items, then check if the list is in ascending order.


Take a list of integers; trim the edges, then show the first three, then is the list sorted.


Take a list of integers; trim one element off each end, then take the first three, then is it sorted.


Take a list of integers; cut off the first and last, then keep first 3, then check if values are in increasing order.


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


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


Take a list of integers; double each, then keep values above zero, then reduce each by one.


Take a list of integers; times two for each item, then filter for positive numbers, then Subtract 1 from all.


Take a list of integers; double each, then keep only positive numbers, then Subtract one from each.


Take a list of integers; times two for each item, then keep the positives, then Drop each by one.


Take a list of integers; double each, then remove negatives, then Decrease all values by one.


Take a list of integers; times two for each item, then keep the positive numbers, then Remove one from each value.


def solve(xs):
    r = list(xs)
    r = [x * 2 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; double each, then keep the positive numbers, then subtract one from each.


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


Take a list of integers; bump everything up by 10, then pad to 3, then put them in order by magnitude.


Take a list of integers; increase every value by 10, then extend to length 3 using zeros, then arrange in order of absolute value.


Take a list of integers; add 10 to each item, then pad to 3, then sort by distance from zero.


Take a list of integers; shift each up by ten, then extend to length 3 using zeros, then order by how far from zero.


Take a list of integers; increase all numbers by 10, then pad to 3, then order by distance from zero.


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


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


Take a list of integers; keep everything before the first zero, then multiply each by two, then truncate to three items.


Take a list of integers; take only what comes before the initial zero, then double each item in the list, then show the first three.


Take a list of integers; cut the list at the first zero, then multiply each by two, then take the first three.


Take a list of integers; cut off after the first zero appears, then double each item in the list, then keep first 3.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then truncate to first three.


Take a list of integers; keep the part before the first 0, then double each item in the list, then first three.


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


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


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then multiply each by -1.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then negate.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then multiply each by -1.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then negate.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then multiply each by -1.


Take a list of integers; keep the part before the first 0, then keep values greater than five, then negate.


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


Take a list of integers; keep everything before the first zero, then keep values greater than five, then negate each.


Take a list of integers; keep values greater than five, then increment each value, then arrange by magnitude ignoring sign.


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


Take a list of integers; keep only numbers above 5, then increment each value, then arrange in order of absolute value.


Take a list of integers; exclude values of 5 and below, then plus one for all, then sort by distance from zero.


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


Take a list of integers; filter to keep only values above 5, then plus one for all, then order by distance from zero.


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


Take a list of integers; keep values greater than five, then add one to each, then sort by absolute value.


Take a list of integers; keep multiples of three, then multiply each by two, then trim one element off each end.


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then multiply each by two, then remove the first and last elements.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then keep only the middle part.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then drop first and last.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then true only if all are positive.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then do all of these have positive values.


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then check if every value is positive.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then confirm all values are positive.


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then all positive.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then check if every number is above zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then negate each, then return whether all values are positive.


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then put the elements backwards.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then reverse that for me.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then flip it backwards.


Take a list of people records (name, age); get the age field, then strip the front negatives, then make it backwards.


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


Take a list of people records (name, age); extract age values, then drop negatives from start, then invert the sequence.


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


Take a list of people records (name, age); extract the ages, then drop the leading negative values, then reverse the order.


Take a list of people records (name, age); extract the ages, then make every value non-negative, then give back the total.


Take a list of people records (name, age); show me all ages, then absolute value for all items, then sum r.


Take a list of people records (name, age); pluck the age field from each record, then take absolute values, then add them up.


Take a list of people records (name, age); get the age field, then turn negatives into positives, then calculate the sum of all elements.


Take a list of people records (name, age); keep just each person's age, then abs each element, then what's the total.


Take a list of people records (name, age); extract age values, then take the absolute value of each, then what do they add up to.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [abs(x) for x in r]
    return sum(r)


Take a list of people records (name, age); extract the ages, then take the absolute value of each, then return their sum.


Take a list of integers; keep the odd numbers, then remove repeated values, then count the elements.


Take a list of integers; odd numbers only, then unique values preserving order, then how many items remain.


Take a list of integers; keep the odd numbers, then remove repeated values, then tell me the length.


Take a list of integers; odd numbers only, then unique values preserving order, then return the length.


Take a list of integers; keep the odd numbers, then remove repeated values, then count them.


Take a list of integers; odd numbers only, then unique values preserving order, then what's the count.


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


Take a list of integers; keep the odd numbers, then drop duplicates keeping first occurrence, then return how many remain.


Take a list of integers; keep only the first three, then sort smallest to largest, then keep only non-zero numbers.


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


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


Take a list of integers; remove everything after the third, then Sort lowest to highest, then strip the zeros.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then keep only non-zero numbers.


Take a list of integers; show the first three, then sort ascending, then strip the zeros.


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


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


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


Take a list of integers; take only what comes before the initial zero, then eliminate the even numbers, then remove repeats.


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


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


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


Take a list of integers; keep the part before the first 0, then eliminate the even numbers, then remove repeats.


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


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


Take a list of people records (name, age); extract the ages, then take the first 3 elements, then put the elements backwards.


Take a list of people records (name, age); show me all ages, then remove everything after the third, then reverse that for me.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items, then flip it backwards.


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


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


Take a list of people records (name, age); extract age values, then keep first 3, then invert the sequence.


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


Take a list of people records (name, age); extract the ages, then keep only the first three, then reverse the order.


Take a list of integers; if empty, use a single zero, then remove both ends, then true only if all are positive.


Take a list of integers; if blank use 0, then trim the edges, then do all of these have positive values.


Take a list of integers; default to [0] when there is nothing, then trim one element off each end, then check if every value is positive.


Take a list of integers; when the list is empty, substitute a zero value, then cut off the first and last, then confirm all values are positive.


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


Take a list of integers; zero it out if it's empty, then keep only the middle part, then check if every number is above zero.


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


Take a list of integers; if empty, use a single zero, then drop the first and last elements, then return whether all values are positive.


Take a list of integers; keep the odd numbers, then keep values above zero, then deduplicate the list.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; get the absolute value of everything, then increment each value, then ensure at least three items by appending zeros.


Take a list of integers; apply absolute value to the whole list, then plus one for all, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; take the absolute value of each, 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 default to [0] when there is nothing, then make each twice as big.


Take a list of integers; take positive values then stop, then when the list is empty, substitute a zero value, then multiply each by 2.


Take a list of integers; keep going while positive, then replace an empty list with one zero, then make each twice as big.


Take a list of integers; stop at first non positive, then zero it out if it's empty, then multiply each by 2.


Take a list of integers; take while greater than zero, then use zero if the list is empty, then make each twice as big.


Take a list of integers; take values while positive, then default to zero when empty, then multiply each by 2.


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


Take a list of integers; take values while they are positive, then if empty, use a single zero, then double each.


Take a list of integers; keep only the last three, then keep the leading run of positive numbers, then give the earliest even value or zero.


Take a list of integers; keep the final three items, then take values while they are positive, then fetch the first even element, default to 0.


Take a list of integers; take the last three, then take positive values then stop, then give the earliest even value or zero.


Take a list of integers; trim to the last three, then keep going while positive, then fetch the first even element, default to 0.


Take a list of integers; last three only, then stop at first non positive, then give the earliest even value or zero.


Take a list of integers; truncate to the last three items, then take while greater than zero, 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 last three, then take values while they are positive, then return the first even value (0 if none).


Take a list of integers; cap each value at 10, then make every value non-negative, then replace an empty list with one zero.


Take a list of integers; clip values at 10, then absolute value for all items, then zero it out if it's empty.


Take a list of integers; cap each value at 10, then take absolute values, then use zero if the list is empty.


Take a list of integers; clip values at 10, then turn negatives into positives, then default to zero when empty.


Take a list of integers; cap each value at 10, then abs each element, then if there's nothing, put in a zero.


Take a list of integers; clip values at 10, then take the absolute value of each, then if no items, add a zero.


def solve(xs):
    r = list(xs)
    r = [min(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; cap each value at 10, then take the absolute value of each, then if empty, use a single zero.


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


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


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


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


Take a list of integers; drop the first element, then truncate at the first zero, then make each twice as big.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then multiply each by 2.


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


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


Take a list of people records (name, age); extract the ages, then keep the leading run of positive numbers, then truncate to the last three items.


Take a list of people records (name, age); show me all ages, then take values while they are positive, then show only the last three.


Take a list of people records (name, age); pluck the age field from each record, then take positive values then stop, then remove all but the last three.


Take a list of people records (name, age); get the age field, then keep going while positive, then take the final 3 elements.


Take a list of people records (name, age); keep just each person's age, then stop at first non positive, then drop everything except the final three.


Take a list of people records (name, age); extract age values, then take while greater than zero, then give me the last three elements.


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


Take a list of people records (name, age); extract the ages, then take values while they are positive, then keep only the last three.


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


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


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


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


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


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


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


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


Take a list of integers; keep the negative numbers, then increase every value by 10, then put the elements backwards.


Take a list of integers; extract negatives, then add 10 to each item, then reverse that for me.


Take a list of integers; keep the negative numbers, then shift each up by ten, then flip it backwards.


Take a list of integers; extract negatives, then increase all numbers by 10, then make it backwards.


Take a list of integers; keep the negative numbers, then add 10 to everything, then reverse the list.


Take a list of integers; extract negatives, then give everything a boost of 10, then invert the sequence.


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


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


Take a list of integers; keep only the first three, then remove both ends, then drop the odd numbers.


Take a list of integers; keep the first 3 items, then trim the edges, then filter out the odd numbers.


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


Take a list of integers; remove everything after the third, then cut off the first and last, then filter out the odd numbers.


Take a list of integers; truncate to three items, then remove the first and last elements, then drop the odd numbers.


Take a list of integers; show the first three, then keep only the middle part, then filter out the odd numbers.


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


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


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


Take a list of integers; keep the first 3 items, then eliminate the even numbers, then drop all positive numbers.


Take a list of integers; take the first 3 elements, then keep only odd values, then drop non-negative values.


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


Take a list of integers; truncate to three items, then keep only odd values, then drop non-negative values.


Take a list of integers; show the first three, then eliminate the even numbers, then drop all positive numbers.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep the leading run of positive numbers, then true if every value is unique.


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


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then do all values appear only once.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then check that there are no duplicates.


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


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then check if all values are unique.


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 len(r) == len(set(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 distinct.


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


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


Take a list of integers; add one to each, then remove all zero values, then remove all but the last three.


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


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


Take a list of integers; make each one bigger, then exclude zeros, then give me the last three elements.


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then remove leading negative numbers.


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


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then strip negative values from the start.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, then remove negatives before the first non-negative.


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


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


Take a list of people records (name, age); extract the ages, then cut the list at the first zero, then keep only non-zero numbers.


Take a list of people records (name, age); show me all ages, then cut off after the first zero appears, then strip the zeros.


Take a list of people records (name, age); pluck the age field from each record, then take values up to (excluding) the first zero, then keep only non-zero numbers.


Take a list of people records (name, age); get the age field, then keep the part before the first 0, then strip the zeros.


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


Take a list of people records (name, age); extract age values, then delete everything starting with the first zero, then strip the zeros.


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


Take a list of people records (name, age); extract the ages, then keep everything before the first zero, then drop the zeros.


Take a list of integers; drop the first and last elements, then keep values below zero, then true only if all are positive.


Take a list of integers; take out the first and last items, then get the negative numbers, then do all of these have positive values.


Take a list of integers; remove both ends, then keep values below zero, then check if every value is positive.


Take a list of integers; trim the edges, then get the negative numbers, then confirm all values are positive.


Take a list of integers; trim one element off each end, then keep values below zero, then all positive.


Take a list of integers; cut off the first and last, then get the negative numbers, then check if every number is above zero.


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


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


Take a list of integers; double each, then remove both ends, then keep only non-zero numbers.


Take a list of integers; times two for each item, then trim the edges, then strip the zeros.


Take a list of integers; double each, then trim one element off each end, then keep only non-zero numbers.


Take a list of integers; times two for each item, then cut off the first and last, then strip the zeros.


Take a list of integers; double each, then remove the first and last elements, then keep only non-zero numbers.


Take a list of integers; times two for each item, then keep only the middle part, then strip the zeros.


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


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


Take a list of integers; keep multiples of three, then sort largest to smallest, then trim one element off each end.


Take a list of integers; get rid of non-multiples of three, then sort by descending values, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then sort from highest to lowest, then remove the first and last elements.


Take a list of integers; keep items where x mod 3 equals zero, then sort descending, then keep only the middle part.


Take a list of integers; drop anything not divisible by three, then sort largest first, then drop first and last.


Take a list of integers; filter out everything except multiples of three, then sort in descending order, then eliminate the outermost elements.


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


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


Take a list of integers; sort ascending, then sort largest to smallest, then raise each to the power of two.


Take a list of integers; Sort it from low to high, then sort by descending values, then I need each number multiplied by itself.


Take a list of integers; arrange in increasing order, then sort from highest to lowest, then square all of them.