Take a list of integers; times two for each item, then keep going while positive, then sort largest to smallest.


Take a list of integers; double each, then stop at first non positive, then sort by descending values.


Take a list of integers; times two for each item, then take while greater than zero, then sort from highest to lowest.


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


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


Take a list of integers; keep only the first three, then drop anything 5 or below, then drop the odd numbers.


Take a list of integers; keep the first 3 items, then keep only numbers greater than 5, then filter out the odd numbers.


Take a list of integers; take the first 3 elements, then filter for numbers above 5, then drop the odd numbers.


Take a list of integers; remove everything after the third, then give me values where x is greater than 5, then filter out the odd numbers.


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


Take a list of integers; show the first three, then keep values greater than five, then filter out the odd numbers.


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


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


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


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


Take a list of integers; drop the first element, then truncate to three items, then take values while they are positive.


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


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


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


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


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


Take a list of integers; double each, then remove repeated values, then shift each up by ten.


Take a list of integers; times two for each item, then unique values preserving order, then increase all numbers by 10.


Take a list of integers; double each, then remove repeated values, then add 10 to everything.


Take a list of integers; times two for each item, then unique values preserving order, then give everything a boost of 10.


Take a list of integers; double each, then remove repeated values, then increment each by ten.


Take a list of integers; times two for each item, then unique values preserving order, then add a constant 10 to each.


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


Take a list of integers; double each, then drop duplicates keeping first occurrence, then add ten to each.


Take a list of integers; take values while they are positive, then order by distance from zero, then arrange in increasing order.


Take a list of integers; take positive values then stop, then sort based on absolute value, then Organize these ascending.


Take a list of integers; keep going while positive, then organize by magnitude, then Sort in ascending order.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then I need this sorted ascending.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then Put these in ascending order.


Take a list of integers; take values while positive, then sort by absolute value, then sort smallest to largest.


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


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


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


Take a list of integers; bump everything up by 10, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; increase every value by 10, then drop anything not divisible by three, then how many are even.


Take a list of integers; add 10 to each item, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; shift each up by ten, then keep only multiples of three, then give me the count of even values.


Take a list of integers; increase all numbers by 10, then multiples of three only, then I need to know how many of these are even.


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


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


Take a list of integers; add one to each, then sort largest to smallest, then raise each to the power of two.


Take a list of integers; make each one bigger, then sort by descending values, then I need each number multiplied by itself.


Take a list of integers; add one to each, then sort from highest to lowest, then square all of them.


Take a list of integers; make each one bigger, then sort descending, then multiply each element by itself.


Take a list of integers; add one to each, then sort largest first, then make each one squared.


Take a list of integers; make each one bigger, then sort in descending order, then square each value in the list.


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


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


Take a list of integers; cap each value at 10, then increase every value by 10, then raise each to the power of two.


Take a list of integers; clip values at 10, then add 10 to each item, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then shift each up by ten, then square all of them.


Take a list of integers; clip values at 10, then increase all numbers by 10, then multiply each element by itself.


Take a list of integers; cap each value at 10, then add 10 to everything, then make each one squared.


Take a list of integers; clip values at 10, then give everything a boost of 10, then square each value in the list.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then reduce each by one.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then Subtract 1 from all.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then Subtract one from each.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then Drop each by one.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then Decrease all values by one.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then Remove one from each value.


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


Take a list of integers; keep values greater than five, then take values while they are positive, then subtract one from each.


Take a list of integers; add ten to each, then drop anything 5 or below, then take values up to (excluding) the first zero.


Take a list of integers; bump everything up by 10, then keep only numbers greater than 5, then keep the part before the first 0.


Take a list of integers; increase every value by 10, then filter for numbers above 5, then truncate at the first zero.


Take a list of integers; add 10 to each item, then give me values where x is greater than 5, then delete everything starting with the first zero.


Take a list of integers; shift each up by ten, then show me only the values that are bigger than five, then remove from the first zero onwards.


Take a list of integers; increase all numbers by 10, then keep values greater than five, then up to but not including the first zero.


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


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


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


Take a list of integers; take positive values then stop, then Lower each number by one, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then reduce each by one, then how many are even.


Take a list of integers; stop at first non positive, then Subtract 1 from all, then get the total number of even values in the list.


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


Take a list of integers; take values while positive, then Drop each by one, then I need to know how many of these are even.


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


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


Take a list of integers; sort ascending, then decrement each value, then true only if all are positive.


Take a list of integers; Sort it from low to high, then Lower each number by one, then do all of these have positive values.


Take a list of integers; arrange in increasing order, then reduce each by one, then check if every value is positive.


Take a list of integers; Organize these ascending, then Subtract 1 from all, then confirm all values are positive.


Take a list of integers; Sort in ascending order, then Subtract one from each, then all positive.


Take a list of integers; I need this sorted ascending, then Drop each by one, then check if every number is above zero.


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


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


Take a list of integers; cap each value at 10, then sort smallest to largest, then keep only numbers above 5.


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


Take a list of integers; cap each value at 10, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; clip values at 10, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; cap each value at 10, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; clip values at 10, then sort ascending, then drop anything 5 or below.


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


Take a list of integers; cap each value at 10, then sort ascending, then keep values greater than five.


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


Take a list of integers; rearrange by distance from zero, then remove everything after the third, then strip the zeros.


Take a list of integers; arrange by magnitude ignoring sign, then truncate to three items, then keep only non-zero numbers.


Take a list of integers; put them in order by magnitude, then show the first three, then strip the zeros.


Take a list of integers; arrange in order of absolute value, then take the first three, then keep only non-zero numbers.


Take a list of integers; sort by distance from zero, then keep first 3, then strip the zeros.


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


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


Take a list of integers; drop the first and last elements, then multiply each value by itself, then ensure at least three items by appending zeros.


Take a list of integers; take out the first and last items, then square them all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove both ends, then raise each to the power of two, then ensure at least three items by appending zeros.


Take a list of integers; trim the edges, then I need each number multiplied by itself, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; trim one element off each end, then square all of them, then ensure at least three items by appending zeros.


Take a list of integers; cut off the first and last, then multiply each element by itself, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; drop the first and last elements, then square each, then pad with zeros to at least three elements.


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


Take a list of integers; cut the leading negatives, then trim the edges, then keep the part before the first 0.


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


Take a list of integers; remove all negatives at the front, then cut off the first and last, then delete everything starting with the first zero.


Take a list of integers; remove the initial run of negative numbers, then remove the first and last elements, then remove from the first zero onwards.


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


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


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


Take a list of integers; reverse the order, then make every value non-negative, then arrange in increasing order.


Take a list of integers; reverse, then absolute value for all items, then Organize these ascending.


Take a list of integers; flip the list around, then take absolute values, then Sort in ascending order.


Take a list of integers; flip the order around, then turn negatives into positives, then I need this sorted ascending.


Take a list of integers; put the elements backwards, then abs each element, then Put these in ascending order.


Take a list of integers; reverse that for me, then take the absolute value of each, then sort smallest to largest.


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


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


Take a list of integers; if empty, use a single zero, then multiply each value by itself, then arrange by magnitude ignoring sign.


Take a list of integers; if blank use 0, then square them all, then put them in order by magnitude.


Take a list of integers; default to [0] when there is nothing, then raise each to the power of two, then arrange in order of absolute value.


Take a list of integers; when the list is empty, substitute a zero value, then I need each number multiplied by itself, then sort by distance from zero.


Take a list of integers; replace an empty list with one zero, then square all of them, then order by how far from zero.


Take a list of integers; zero it out if it's empty, then multiply each element by itself, then order by distance from zero.


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


Take a list of integers; if empty, use a single zero, then square each, then sort by absolute value.


Take a list of integers; pad with zeros to at least three elements, then multiply each value by itself, then arrange by magnitude ignoring sign.


Take a list of integers; add zeros until the list has at least three values, then square them all, then put them in order by magnitude.


Take a list of integers; pad with zeros to at least three elements, then raise each to the power of two, then arrange in order of absolute value.


Take a list of integers; add zeros until the list has at least three values, then I need each number multiplied by itself, then sort by distance from zero.


Take a list of integers; pad with zeros to at least three elements, then square all of them, then order by how far from zero.


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then order by distance from zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then drop anything 5 or below, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then keep only numbers greater than 5, then drop all positive numbers.


Take a list of integers; pad with zeros to at least three elements, then filter for numbers above 5, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then give me values where x is greater than 5, then drop all positive numbers.


Take a list of integers; pad with zeros to at least three elements, then show me only the values that are bigger than five, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then keep values greater than five, then drop all positive numbers.


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 > 5]
    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 values greater than five, then keep the negative numbers.


Take a list of integers; reverse the order, then remove both ends, then give the earliest even value or zero.


Take a list of integers; reverse, then trim the edges, then fetch the first even element, default to 0.


Take a list of integers; flip the list around, then trim one element off each end, then give the earliest even value or zero.


Take a list of integers; flip the order around, then cut off the first and last, then fetch the first even element, default to 0.


Take a list of integers; put the elements backwards, then remove the first and last elements, then give the earliest even value or zero.


Take a list of integers; reverse that for me, then keep only the middle part, then fetch the first even element, default to 0.


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


Take a list of integers; reverse the order, then drop the first and last elements, then return the first even value (0 if none).


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


Take a list of integers; keep evens, then sort by descending values, then strip the zeros.


Take a list of integers; keep the even numbers, then sort from highest to lowest, then keep only non-zero numbers.


Take a list of integers; keep evens, then sort descending, then strip the zeros.


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


Take a list of integers; keep evens, then sort in descending order, then strip the zeros.


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


Take a list of integers; keep the even numbers, then sort descending, then drop the zeros.


Take a list of integers; sort descending, then extend to length 3 using zeros, then true only if all are positive.


Take a list of integers; sort largest first, then pad to 3, then do all of these have positive values.


Take a list of integers; sort in descending order, then extend to length 3 using zeros, then check if every value is positive.


Take a list of integers; sort from greatest to least, then pad to 3, then confirm all values are positive.


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


Take a list of integers; arrange in decreasing order, then pad to 3, then check if every number is above zero.


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


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


Take a list of integers; keep only the last three, then order by distance from zero, then drop non-positive values.


Take a list of integers; keep the final three items, then sort based on absolute value, then drop the negative numbers.


Take a list of integers; take the last three, then organize by magnitude, then filter out the negative ones.


Take a list of integers; trim to the last three, then arrange by absolute value ascending, then remove all negative values.


Take a list of integers; last three only, then sort from smallest to largest absolute value, then keep positive values only.


Take a list of integers; truncate to the last three items, then sort by absolute value, then keep values above zero.


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


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


Take a list of strings; drop strings shorter than three characters, then convert each to upper case, then reduce each string to its first character.


Take a list of strings; eliminate strings below length three, then change all strings to uppercase, then take first char drop blanks.


Take a list of strings; remove short strings (under 3 chars), then make every string uppercase, then keep first letters only.


Take a list of strings; only keep strings with three or more characters, then uppercase each one, then first letter from each item that isn't empty.


Take a list of strings; keep only strings that are at least three characters long, then make all the strings uppercase, then grab the first char from each.


Take a list of strings; filter strings shorter than 3 chars, then convert all strings to uppercase letters, then isolate the first character per entry.


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


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


Take a list of people records (name, age); extract the ages, then extend to length 3 using zeros, then find the min, defaulting to 0.


Take a list of people records (name, age); show me all ages, then pad to 3, then minimum value, zero otherwise.


Take a list of people records (name, age); pluck the age field from each record, then extend to length 3 using zeros, then get the minimum value or zero if empty.


Take a list of people records (name, age); get the age field, then pad to 3, then give me the min or 0.


Take a list of people records (name, age); keep just each person's age, then extend to length 3 using zeros, then return the smallest number, defaulting to 0.


Take a list of people records (name, age); extract age values, then pad to 3, then return smallest or zero if empty.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return min(r) if r else 0


Take a list of people records (name, age); extract the ages, then pad with zeros to at least three elements, then return the minimum (0 if empty).


Take a list of integers; drop the first element, then keep values below zero, then deduplicate the list.


Take a list of integers; Take everything except the first, then get the negative numbers, then remove repeats.


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


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


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


Take a list of integers; Decrement all items, then filter for positive numbers, then check for zero.


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


Take a list of integers; Lower each number by one, then keep the positives, then check for zero.


Take a list of integers; reduce each by one, then remove negatives, then true if any value equals zero.


Take a list of integers; Subtract 1 from all, then keep the positive 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 > 0]
    return 0 in r


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


Take a list of integers; negate each, then remove the first item, then truncate to three items.


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


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


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


Take a list of integers; negate each, then remove the first item, then truncate to first three.


Take a list of integers; reverse the signs of everything, then Remove head, then first three.


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


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


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


Take a list of integers; make each one bigger, then drop everything except the final three, then Subtract 1 from all.


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


Take a list of integers; make each one bigger, then keep only the last three, then Drop each by one.


Take a list of integers; add one to each, then keep the final three items, then Decrease all values by one.


Take a list of integers; make each one bigger, then take the last three, then Remove one from each value.


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


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


Take a list of integers; keep multiples of three, then multiply each by two, then drop non-positive values.


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then drop the negative numbers.


Take a list of integers; keep values divisible by 3, then multiply each by two, then filter out the negative ones.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then remove all negative values.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then keep positive values only.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then keep values above zero.


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


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


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


Take a list of integers; get rid of non-multiples of three, then extract all even numbers, then keep the part before the first 0.


Take a list of integers; keep values divisible by 3, then keep only even values, then truncate at the first zero.


Take a list of integers; keep items where x mod 3 equals zero, then extract all even numbers, then delete everything starting with the first zero.


Take a list of integers; drop anything not divisible by three, then keep only even values, then remove from the first zero onwards.


Take a list of integers; filter out everything except multiples of three, then extract all even numbers, then up to but not including the first zero.


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


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


Take a list of integers; keep multiples of three, then take the final 3 elements, then stop at the first non-positive value.


Take a list of integers; get rid of non-multiples of three, then drop everything except the final three, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then give me the last three elements, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then keep only the last three, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then keep the final three items, then keep going while positive.


Take a list of integers; filter out everything except multiples of three, then take the last three, then stop at first non positive.


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


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


Take a list of integers; drop the zeros, then remove the first item, then reduce each by one.


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


Take a list of integers; drop the zeros, then remove the first item, then Subtract one from each.


Take a list of integers; keep only nonzero elements, then Remove head, then Drop each by one.


Take a list of integers; drop the zeros, then remove the first item, then Decrease all values by one.


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


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


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


Take a list of integers; keep only the last three, then sort smallest to largest, then ensure at least three items by appending zeros.


Take a list of integers; keep the final three items, then Ascending sort, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the last three, then Sort this ascending, then ensure at least three items by appending zeros.


Take a list of integers; trim to the last three, then Sort lowest to highest, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; last three only, then Arrange from smallest to largest, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; keep the odd numbers, then keep the leading run of positive numbers, then true if already sorted smallest to largest.


Take a list of integers; odd numbers only, then take values while they are positive, then does this list go in ascending order.


Take a list of integers; keep the odd numbers, then take positive values then stop, then check if the list is in ascending order.


Take a list of integers; odd numbers only, then keep going while positive, then is the list sorted.


Take a list of integers; keep the odd numbers, then stop at first non positive, then is it sorted.


Take a list of integers; odd numbers only, then take while greater than zero, then check if values are in increasing order.


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


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


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


Take a list of integers; take out the first and last items, then sort by descending values, then keep the part before the first 0.


Take a list of integers; remove both ends, then sort from highest to lowest, then truncate at the first zero.


Take a list of integers; trim the edges, then sort descending, then delete everything starting with the first zero.


Take a list of integers; trim one element off each end, then sort largest first, then remove from the first zero onwards.


Take a list of integers; cut off the first and last, then sort in descending order, then up to but not including the first zero.


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


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


Take a list of integers; add one to each, then order by distance from zero, then find the max, defaulting to 0.


Take a list of integers; make each one bigger, then sort based on absolute value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; add one to each, then organize by magnitude, then What's the highest number in the list.


Take a list of integers; make each one bigger, then arrange by absolute value ascending, then Return the greatest value or default to 0.


Take a list of integers; add one to each, then sort from smallest to largest absolute value, then Find the largest element, defaulting to zero.


Take a list of integers; make each one bigger, then sort by absolute value, then give the largest value (0 if none).


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


Take a list of integers; add one to each, then sort by absolute value, then return the maximum (0 if empty).


Take a list of integers; drop the leading negative values, then order by distance from zero, then arrange in decreasing order.


Take a list of integers; cut the leading negatives, then sort based on absolute value, then arrange in descending order.


Take a list of integers; skip negatives at the start, then organize by magnitude, then reverse sort.


Take a list of integers; remove all negatives at the front, then arrange by absolute value ascending, then sort largest to smallest.


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


Take a list of integers; strip the front negatives, then sort by absolute value, then sort from highest to lowest.


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


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


Take a list of integers; subtract one from each, then increment each value, then true only if all are positive.


Take a list of integers; Decrement all items, then plus one for all, then do all of these have positive values.


Take a list of integers; decrement each value, then increment each value, then check if every value is positive.


Take a list of integers; Lower each number by one, then plus one for all, then confirm all values are positive.


Take a list of integers; reduce each by one, then increment each value, then all positive.


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


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


Take a list of integers; subtract one from each, then add one to each, then return whether all values are positive.


Take a list of integers; keep the negative numbers, then keep values divisible by 3, then deduplicate the list.


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


Take a list of integers; keep the negative numbers, then drop anything not divisible by three, then deduplicate the list.


Take a list of integers; extract negatives, then filter out everything except multiples of three, then remove repeats.


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


Take a list of integers; extract negatives, then multiples of three only, then remove repeats.


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


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


Take a list of strings; lowercase each string, then order the strings A to Z, then remove short strings (under 3 chars).


Take a list of strings; change to lowercase, then make it alphabetical, then only keep strings with three or more characters.


Take a list of strings; lowercase each string, then order the strings A to Z, then keep only strings that are at least three characters long.


Take a list of strings; change to lowercase, then make it alphabetical, then filter strings shorter than 3 chars.


Take a list of strings; lowercase each string, then order the strings A to Z, then drop anything shorter than three characters.


Take a list of strings; change to lowercase, then make it alphabetical, then keep only strings of length 3 or more.


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


Take a list of strings; lowercase each string, then sort alphabetically, then drop strings shorter than three characters.


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


Take a list of integers; times two for each item, then filter for positive numbers, then filter out the odd numbers.


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


Take a list of integers; times two for each item, then keep the positives, then filter out the odd numbers.


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


Take a list of integers; times two for each item, then keep the positive numbers, then filter out the odd numbers.


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


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


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


Take a list of integers; odd numbers only, then Lower each number by one, then negate.


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


Take a list of integers; odd numbers only, then Subtract 1 from all, then negate.


Take a list of integers; keep the odd numbers, then Subtract one from each, then multiply each by -1.


Take a list of integers; odd numbers only, then Drop each by one, then negate.


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


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


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


Take a list of integers; times two for each item, then don't let anything exceed 10, then drop the negative numbers.


Take a list of integers; double each, then clamp each to at most ten, then filter out the negative ones.


Take a list of integers; times two for each item, then don't let anything exceed 10, then remove all negative values.


Take a list of integers; double each, then clamp each to at most ten, then keep positive values only.


Take a list of integers; times two for each item, then don't let anything exceed 10, then keep values above zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then shift each up by ten.


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


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then add 10 to everything.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then give everything a boost of 10.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then increment each by ten.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then square each, then add ten to each.


Take a list of integers; drop the first element, then multiply each value by itself, then true if already sorted smallest to largest.


Take a list of integers; Take everything except the first, then square them all, then does this list go in ascending order.


Take a list of integers; drop the first element, then raise each to the power of two, then check if the list is in ascending order.


Take a list of integers; Take everything except the first, then I need each number multiplied by itself, then is the list sorted.


Take a list of integers; drop the first element, then square all of them, then is it sorted.


Take a list of integers; Take everything except the first, then multiply each element by itself, then check if values are in increasing order.


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


Take a list of integers; drop the first element, then square each, then return whether the list is sorted ascending.


Take a list of integers; add one to each, then remove repeated values, then keep only numbers above 5.


Take a list of integers; make each one bigger, then unique values preserving order, then exclude values of 5 and below.


Take a list of integers; add one to each, then remove repeated values, then remove anything 5 or less.


Take a list of integers; make each one bigger, then unique values preserving order, then filter to keep only values above 5.


Take a list of integers; add one to each, then remove repeated values, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then unique values preserving order, then drop anything 5 or below.


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


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


Take a list of integers; sort ascending, then increment each value, then find the max, defaulting to 0.


Take a list of integers; Sort it from low to high, then plus one for all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange in increasing order, then increment each value, then What's the highest number in the list.


Take a list of integers; Organize these ascending, then plus one for all, then Return the greatest value or default to 0.


Take a list of integers; Sort in ascending order, then increment each value, then Find the largest element, defaulting to zero.


Take a list of integers; I need this sorted ascending, then plus one for all, then give the largest value (0 if none).


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


Take a list of integers; sort ascending, then add one to each, then return the maximum (0 if empty).


Take a list of integers; if empty, use a single zero, then keep values above zero, then bump each up by one.


Take a list of integers; if blank use 0, then filter for positive numbers, then increment each item.


Take a list of integers; default to [0] when there is nothing, then keep only positive numbers, then bump each up by one.


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


Take a list of integers; replace an empty list with one zero, then remove negatives, then bump each up by one.


Take a list of integers; zero it out if it's empty, then keep the positive numbers, then increment each item.


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


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


Take a list of integers; take the absolute value of each, then keep only even values, then stop at the first non-positive value.


Take a list of integers; convert to absolute value, then extract all even numbers, then keep the leading run of positive numbers.


Take a list of integers; strip the signs, then keep only even values, then take values while they are positive.


Take a list of integers; take abs of each, then extract all even numbers, then take positive values then stop.


Take a list of integers; get the absolute value of everything, then keep only even values, then keep going while positive.


Take a list of integers; apply absolute value to the whole list, then extract all even numbers, then stop at first non positive.


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


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


Take a list of integers; drop the leading negative values, then multiply each value by itself, then deduplicate the list.


Take a list of integers; cut the leading negatives, then square them all, then remove repeats.


Take a list of integers; skip negatives at the start, then raise each to the power of two, then deduplicate the list.


Take a list of integers; remove all negatives at the front, then I need each number multiplied by itself, then remove repeats.


Take a list of integers; remove the initial run of negative numbers, then square all of them, then deduplicate the list.


Take a list of integers; strip the front negatives, then multiply each element by itself, then remove repeats.


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


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


Take a list of integers; drop the zeros, then skip negatives at the start, then drop non-positive values.


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then drop the negative numbers.


Take a list of integers; drop the zeros, then remove the initial run of negative numbers, then filter out the negative ones.


Take a list of integers; keep only nonzero elements, then strip the front negatives, then remove all negative values.


Take a list of integers; drop the zeros, then remove leading negative numbers, then keep positive values only.


Take a list of integers; keep only nonzero elements, then drop negatives from start, then keep values above zero.


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


Take a list of integers; drop the zeros, then drop the leading negative values, then keep the positive numbers.


Take a list of integers; pad with zeros to at least three elements, then order by distance from zero, then limit every value to 10.


Take a list of integers; add zeros until the list has at least three values, then sort based on absolute value, then maximum of 10 for all.


Take a list of integers; pad with zeros to at least three elements, then organize by magnitude, then limit every value to 10.


Take a list of integers; add zeros until the list has at least three values, then arrange by absolute value ascending, then maximum of 10 for all.


Take a list of integers; pad with zeros to at least three elements, then sort from smallest to largest absolute value, then limit every value to 10.


Take a list of integers; add zeros until the list has at least three values, then sort by absolute value, then maximum of 10 for all.


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


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


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


Take a list of integers; rearrange by distance from zero, then filter for positive numbers, then Organize these ascending.


Take a list of integers; arrange by magnitude ignoring sign, then keep only positive numbers, then Sort in ascending order.


Take a list of integers; put them in order by magnitude, then keep the positives, then I need this sorted ascending.


Take a list of integers; arrange in order of absolute value, then remove negatives, then Put these in ascending order.


Take a list of integers; sort by distance from zero, then keep the positive numbers, then sort smallest to largest.


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


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


Take a list of people records (name, age); extract the ages, then keep the leading run of positive numbers, then drop non-positive values.


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


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


Take a list of people records (name, age); get the age field, then keep going while positive, then remove all negative values.


Take a list of people records (name, age); keep just each person's age, then stop at first non positive, then keep positive values only.


Take a list of people records (name, age); extract age values, then take while greater than zero, then keep values above zero.


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


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


Take a list of integers; keep the positive numbers, then remove the first item, then count the elements.


Take a list of integers; get rid of anything that's not positive, then Remove head, then how many items remain.


Take a list of integers; drop non-positive values, then remove the first item, then tell me the length.


Take a list of integers; drop the negative numbers, then Remove head, then return the length.


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


Take a list of integers; remove all negative values, then Remove head, then what's the count.


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


Take a list of integers; keep the positive numbers, then drop the first element, then return how many remain.


Take a list of integers; keep the negative numbers, then remove the first item, then arrange in increasing order.


Take a list of integers; extract negatives, then Remove head, then Organize these ascending.


Take a list of integers; keep the negative numbers, then remove the first item, then Sort in ascending order.


Take a list of integers; extract negatives, then Remove head, then I need this sorted ascending.


Take a list of integers; keep the negative numbers, then remove the first item, then Put these in ascending order.


Take a list of integers; extract negatives, then Remove head, then sort smallest to largest.


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


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


Take a list of integers; subtract one from each, then remove both ends, then give the earliest even value or zero.


Take a list of integers; Decrement all items, then trim the edges, then fetch the first even element, default to 0.


Take a list of integers; decrement each value, then trim one element off each end, then give the earliest even value or zero.


Take a list of integers; Lower each number by one, then cut off the first and last, then fetch the first even element, default to 0.


Take a list of integers; reduce each by one, then remove the first and last elements, then give the earliest even value or zero.


Take a list of integers; Subtract 1 from all, then keep only the middle part, then fetch the first even element, default to 0.


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


Take a list of integers; subtract one from each, then drop the first and last elements, then return the first even value (0 if none).


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


Take a list of integers; Sort it from low to high, then eliminate the even numbers, then does this list go in ascending order.


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


Take a list of integers; Organize these ascending, then eliminate the even numbers, then is the list sorted.


Take a list of integers; Sort in ascending order, then keep only odd values, then is it sorted.


Take a list of integers; I need this sorted ascending, then eliminate the even numbers, then check if values are in increasing order.


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


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


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


Take a list of integers; get rid of non-multiples of three, then remove all negatives at the front, then check for zero.


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


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


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


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


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


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


Take a list of integers; drop the first element, then cut the list at the first zero, then shift each up by ten.


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


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


Take a list of integers; Take everything except the first, then keep the part before the first 0, then give everything a boost of 10.


Take a list of integers; drop the first element, then truncate at the first zero, then increment each by ten.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then add a constant 10 to each.


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


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


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


Take a list of integers; Decrement all items, then exclude zeros, then take abs of each.


Take a list of integers; decrement each value, then remove all zero values, then get the absolute value of everything.


Take a list of integers; Lower each number by one, then exclude zeros, then apply absolute value to the whole list.


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


Take a list of integers; Subtract 1 from all, then exclude zeros, then make every value non-negative.


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then put the elements backwards.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then reverse that for me.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then flip it backwards.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then make it backwards.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five, then reverse the list.


Take a list of integers; strip the front negatives, then keep values greater than five, then invert the sequence.


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


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


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


Take a list of integers; get rid of anything that's not positive, then square them all, then keep the leading run of positive numbers.


Take a list of integers; drop non-positive values, then raise each to the power of two, then take values while they are positive.


Take a list of integers; drop the negative numbers, then I need each number multiplied by itself, then take positive values then stop.


Take a list of integers; filter out the negative ones, then square all of them, then keep going while positive.


Take a list of integers; remove all negative values, then multiply each element by itself, then stop at first non positive.


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


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


Take a list of integers; sort by absolute value, then flip the sign of each, then true if any value equals zero.


Take a list of integers; rearrange by distance from zero, then turn positives to negatives and vice versa, then check for zero.


Take a list of integers; arrange by magnitude ignoring sign, then flip the sign of each, then true if any value equals zero.


Take a list of integers; put them in order by magnitude, then turn positives to negatives and vice versa, then check for zero.


Take a list of integers; arrange in order of absolute value, then flip the sign of each, then true if any value equals zero.


Take a list of integers; sort by distance from zero, then turn positives to negatives and vice versa, then check for zero.


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


Take a list of integers; sort by absolute value, then negate each, then return whether the list contains a zero.


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


Take a list of integers; sort largest first, then Ascending sort, then strip out the evens.


Take a list of integers; sort in descending order, then Sort this ascending, then drop the even numbers.


Take a list of integers; sort from greatest to least, then Sort lowest to highest, then strip out the evens.


Take a list of integers; sort z to a, then Arrange from smallest to largest, then drop the even numbers.


Take a list of integers; arrange in decreasing order, then sort ascending, then strip out the evens.


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


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then keep only non-zero numbers.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then strip the zeros.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then keep only non-zero numbers.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then strip the zeros.


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


Take a list of integers; remove all negative values, then delete everything starting with the first zero, then strip the zeros.


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then trim one element off each end, then skip the first one.


Take a list of integers; add zeros until the list has at least three values, then cut off the first and last, then Discard the first element.


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


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


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


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


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


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


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


Take a list of integers; drop the negative numbers, then unique values preserving order, then confirm all values are positive.


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


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


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


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


Take a list of integers; if empty, use a single zero, then multiply each by two, then give the number of evens.


Take a list of integers; if blank use 0, then double each item in the list, then find how many values are divisible by two.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then how many are even.


Take a list of integers; when the list is empty, substitute a zero value, then double each item in the list, then get the total number of even values in the list.


Take a list of integers; replace an empty list with one zero, then multiply each by two, then give me the count of even values.


Take a list of integers; zero it out if it's empty, then double each item in the list, then I need to know how many of these are even.


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


Take a list of integers; if empty, use a single zero, then double each, then return how many values are even.


Take a list of strings; keep the first character of each (dropping empties), then order the strings A to Z, then remove blanks.


Take a list of strings; extract initial letters, then make it alphabetical, then eliminate empty string values.


Take a list of strings; take each string's first letter, then order the strings A to Z, then filter out blank strings.


Take a list of strings; give me the first letter of everything, then make it alphabetical, then remove strings that are empty.


Take a list of strings; reduce each string to its first character, then order the strings A to Z, then strip out empty strings.


Take a list of strings; take first char drop blanks, then make it alphabetical, then keep only non-empty strings.


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


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


Take a list of integers; sort descending, then extend to length 3 using zeros, then truncate to three items.


Take a list of integers; sort largest first, then pad to 3, then show the first three.


Take a list of integers; sort in descending order, then extend to length 3 using zeros, then take the first three.


Take a list of integers; sort from greatest to least, then pad to 3, then keep first 3.


Take a list of integers; sort z to a, then extend to length 3 using zeros, then truncate to first three.


Take a list of integers; arrange in decreasing order, then pad to 3, then first three.


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


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


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


Take a list of integers; bump everything up by 10, then when the list is empty, substitute a zero value, then Give me the maximum, but 0 if there are no items.


Take a list of integers; increase every value by 10, then replace an empty list with one zero, then What's the highest number in the list.


Take a list of integers; add 10 to each item, then zero it out if it's empty, then Return the greatest value or default to 0.


Take a list of integers; shift each up by ten, then use zero if the list is empty, then Find the largest element, defaulting to zero.


Take a list of integers; increase all numbers by 10, then default to zero when empty, then give the largest value (0 if none).


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


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


Take a list of integers; if empty, use a single zero, then decrement each value, then true if any value equals zero.


Take a list of integers; if blank use 0, then Lower each number by one, then check for zero.


Take a list of integers; default to [0] when there is nothing, then reduce each by one, then true if any value equals zero.


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


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then true if any value equals zero.


Take a list of integers; zero it out if it's empty, then Drop each by one, then check for zero.


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


Take a list of integers; if empty, use a single zero, then subtract one from each, then return whether the list contains a zero.


Take a list of integers; subtract one from each, then make every value non-negative, then take values up to (excluding) the first zero.


Take a list of integers; Decrement all items, then absolute value for all items, then keep the part before the first 0.


Take a list of integers; decrement each value, then take absolute values, then truncate at the first zero.


Take a list of integers; Lower each number by one, then turn negatives into positives, then delete everything starting with the first zero.


Take a list of integers; reduce each by one, then abs each element, then remove from the first zero onwards.


Take a list of integers; Subtract 1 from all, then take the absolute value of each, then up to but not including the first zero.


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


Take a list of integers; subtract one from each, then take the absolute value of each, then keep everything before the first zero.


Take a list of integers; keep the positive numbers, then sort smallest to largest, then replace an empty list with one zero.


Take a list of integers; get rid of anything that's not positive, then Ascending sort, then zero it out if it's empty.


Take a list of integers; drop non-positive values, then Sort this ascending, then use zero if the list is empty.


Take a list of integers; drop the negative numbers, then Sort lowest to highest, then default to zero when empty.


Take a list of integers; filter out the negative ones, then Arrange from smallest to largest, then if there's nothing, put in a zero.


Take a list of integers; remove all negative values, then sort ascending, then if no items, add a zero.


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


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


Take a list of integers; keep multiples of three, then cut the list at the first zero, then count the elements.


Take a list of integers; get rid of non-multiples of three, then cut off after the first zero appears, then how many items remain.


Take a list of integers; keep values divisible by 3, then take values up to (excluding) the first zero, then tell me the length.


Take a list of integers; keep items where x mod 3 equals zero, then keep the part before the first 0, then return the length.


Take a list of integers; drop anything not divisible by three, then truncate at the first zero, then count them.


Take a list of integers; filter out everything except multiples of three, then delete everything starting with the first zero, then what's the count.


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


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


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; strip the signs, then filter for numbers above 5, then arrange in order of absolute value.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then sort by distance from zero.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then order by distance from zero.


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


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


Take a list of integers; drop the leading negative values, then take the first 3 elements, then arrange in increasing order.


Take a list of integers; cut the leading negatives, then remove everything after the third, then Organize these ascending.


Take a list of integers; skip negatives at the start, then truncate to three items, then Sort in ascending order.


Take a list of integers; remove all negatives at the front, then show the first three, then I need this sorted ascending.


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


Take a list of integers; strip the front negatives, then keep first 3, then sort smallest to largest.


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


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


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


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then strip the front negatives.


Take a list of integers; default to [0] when there is nothing, then flip the sign of each, then remove leading negative numbers.


Take a list of integers; when the list is empty, substitute a zero value, then turn positives to negatives and vice versa, then drop negatives from start.


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


Take a list of integers; zero it out if it's empty, then turn positives to negatives and vice versa, then remove negatives before the first non-negative.


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


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


Take a list of integers; add one to each, then multiply each value by itself, then put the elements backwards.


Take a list of integers; make each one bigger, then square them all, then reverse that for me.


Take a list of integers; add one to each, then raise each to the power of two, then flip it backwards.


Take a list of integers; make each one bigger, then I need each number multiplied by itself, then make it backwards.


Take a list of integers; add one to each, then square all of them, then reverse the list.


Take a list of integers; make each one bigger, then multiply each element by itself, then invert the sequence.


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


Take a list of integers; add one to each, then square each, then reverse the order.


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


Take a list of integers; convert to absolute value, then double each item in the list, then strip the zeros.


Take a list of integers; strip the signs, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; take abs of each, then double each item in the list, then strip the zeros.


Take a list of integers; get the absolute value of everything, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; apply absolute value to the whole list, then double each item in the list, then strip the zeros.


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


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


Take a list of people records (name, age); extract the ages, then multiply each value by itself, then limit every value to 10.


Take a list of people records (name, age); show me all ages, then square them all, then maximum of 10 for all.


Take a list of people records (name, age); pluck the age field from each record, then raise each to the power of two, then limit every value to 10.


Take a list of people records (name, age); get the age field, then I need each number multiplied by itself, then maximum of 10 for all.


Take a list of people records (name, age); keep just each person's age, then square all of them, then limit every value to 10.


Take a list of people records (name, age); extract age values, then multiply each element by itself, then maximum of 10 for all.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = [x * x for x in r]
    r = [min(x, 10) for x in r]
    return r


Take a list of people records (name, age); extract the ages, then square each, then cap each value at 10.


Take a list of integers; add one to each, then increase every value by 10, then replace an empty list with one zero.


Take a list of integers; make each one bigger, then add 10 to each item, then zero it out if it's empty.


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


Take a list of integers; make each one bigger, then increase all numbers by 10, then default to zero when empty.


Take a list of integers; add one to each, then add 10 to everything, then if there's nothing, put in a zero.


Take a list of integers; make each one bigger, then give everything a boost of 10, then if no items, add a zero.


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


Take a list of integers; add one to each, then add ten to each, then if empty, use a single zero.


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


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


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


Take a list of integers; reverse the signs of everything, then get the negative numbers, then give everything a boost of 10.


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


Take a list of integers; reverse the signs of everything, then get the negative numbers, then add a constant 10 to each.


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


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


Take a list of integers; keep only the last three, then increase every value by 10, then true if already sorted smallest to largest.


Take a list of integers; keep the final three items, then add 10 to each item, then does this list go in ascending order.


Take a list of integers; take the last three, then shift each up by ten, then check if the list is in ascending order.


Take a list of integers; trim to the last three, then increase all numbers by 10, then is the list sorted.


Take a list of integers; last three only, then add 10 to everything, then is it sorted.


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


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


Take a list of integers; keep only the last three, then add ten to each, then return whether the list is sorted ascending.


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


Take a list of integers; keep the final three items, then keep items where x mod 3 equals zero, then increase all numbers by 10.


Take a list of integers; take the last three, then drop anything not divisible by three, then add 10 to everything.


Take a list of integers; trim to the last three, then filter out everything except multiples of three, then give everything a boost of 10.


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


Take a list of integers; truncate to the last three items, then multiples of three only, then add a constant 10 to each.


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


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


Take a list of integers; keep only the last three, then clamp each to at most ten, then true if every value is unique.


Take a list of integers; keep the final three items, then don't let anything exceed 10, then check for duplicates in the values.


Take a list of integers; take the last three, then clamp each to at most ten, then do all values appear only once.


Take a list of integers; trim to the last three, then don't let anything exceed 10, then check that there are no duplicates.


Take a list of integers; last three only, then clamp each to at most ten, then are the values all unique.


Take a list of integers; truncate to the last three items, then don't let anything exceed 10, then check if all values are unique.


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


Take a list of integers; keep only the last three, then cap each value at 10, then return whether all values are distinct.


Take a list of integers; sort ascending, then skip negatives at the start, then make each twice as big.


Take a list of integers; Sort it from low to high, then remove all negatives at the front, then multiply each by 2.


Take a list of integers; arrange in increasing order, then remove the initial run of negative numbers, then make each twice as big.


Take a list of integers; Organize these ascending, then strip the front negatives, then multiply each by 2.


Take a list of integers; Sort in ascending order, then remove leading negative numbers, then make each twice as big.


Take a list of integers; I need this sorted ascending, then drop negatives from start, then multiply each by 2.


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


Take a list of integers; sort ascending, then drop the leading negative values, then double each.


Take a list of people records (name, age); extract the ages, then keep values below zero, then give the earliest even value or zero.


Take a list of people records (name, age); show me all ages, then get the negative numbers, then fetch the first even element, default to 0.


Take a list of people records (name, age); pluck the age field from each record, then keep values below zero, then give the earliest even value or zero.


Take a list of people records (name, age); get the age field, then get the negative numbers, then fetch the first even element, default to 0.


Take a list of people records (name, age); keep just each person's age, then keep values below zero, then give the earliest even value or zero.


Take a list of people records (name, age); extract age values, then get the negative numbers, then fetch the first even element, default to 0.


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


Take a list of people records (name, age); extract the ages, then keep the negative numbers, then return the first even value (0 if none).


Take a list of integers; double each, then decrement each value, then drop anything not divisible by three.


Take a list of integers; times two for each item, then Lower each number by one, then filter out everything except multiples of three.


Take a list of integers; double each, then reduce each by one, then keep only multiples of three.


Take a list of integers; times two for each item, then Subtract 1 from all, then multiples of three only.


Take a list of integers; double each, then Subtract one from each, then filter for numbers divisible by three.


Take a list of integers; times two for each item, then Drop each by one, then give me only the values divisible by three.


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


Take a list of integers; double each, then subtract one from each, then keep multiples of three.


Take a list of integers; drop the zeros, then keep values below zero, then deduplicate the list.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then remove repeats.


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


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


Take a list of integers; take the absolute value of each, then cut the list at the first zero, then reduce each by one.


Take a list of integers; convert to absolute value, then cut off after the first zero appears, then Subtract 1 from all.


Take a list of integers; strip the signs, then take values up to (excluding) the first zero, then Subtract one from each.


Take a list of integers; take abs of each, then keep the part before the first 0, then Drop each by one.


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


Take a list of integers; apply absolute value to the whole list, then delete everything starting with the first zero, then Remove one from each value.


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


Take a list of integers; take the absolute value of each, then keep everything before the first zero, then subtract one from each.


Take a list of integers; keep the odd numbers, then flip the list around, then find the min, defaulting to 0.


Take a list of integers; odd numbers only, then flip the order around, then minimum value, zero otherwise.


Take a list of integers; keep the odd numbers, then put the elements backwards, then get the minimum value or zero if empty.


Take a list of integers; odd numbers only, then reverse that for me, then give me the min or 0.


Take a list of integers; keep the odd numbers, then flip it backwards, then return the smallest number, defaulting to 0.


Take a list of integers; odd numbers only, then make it backwards, then return smallest or zero if empty.


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


Take a list of integers; keep the odd numbers, then reverse the order, then return the minimum (0 if empty).


Take a list of integers; drop the leading negative values, then remove all zero values, then stop at the first non-positive value.


Take a list of integers; cut the leading negatives, then exclude zeros, then keep the leading run of positive numbers.


Take a list of integers; skip negatives at the start, then remove all zero values, then take values while they are positive.


Take a list of integers; remove all negatives at the front, then exclude zeros, then take positive values then stop.


Take a list of integers; remove the initial run of negative numbers, then remove all zero values, then keep going while positive.


Take a list of integers; strip the front negatives, then exclude zeros, then stop at first non positive.


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


Take a list of integers; drop the leading negative values, then drop the zeros, then take values while they are positive.


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then arrange in increasing order.


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


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then Sort in ascending order.


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then Put these in ascending order.


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


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


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


Take a list of integers; subtract one from each, then take the final 3 elements, then limit every value to 10.


Take a list of integers; Decrement all items, then drop everything except the final three, then maximum of 10 for all.


Take a list of integers; decrement each value, then give me the last three elements, then limit every value to 10.


Take a list of integers; Lower each number by one, then keep only the last three, then maximum of 10 for all.


Take a list of integers; reduce each by one, then keep the final three items, then limit every value to 10.


Take a list of integers; Subtract 1 from all, then take the last three, then maximum of 10 for all.


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


Take a list of integers; subtract one from each, then keep only the last three, then cap each value at 10.


Take a list of integers; if empty, use a single zero, then keep only even values, then ensure at least three items by appending zeros.


Take a list of integers; if blank use 0, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; when the list is empty, substitute a zero value, then extract all even numbers, then ensure minimum length of three by adding zeros to the end.


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


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


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


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


Take a list of integers; keep everything before the first zero, then flip the list around, then true if every value is unique.


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


Take a list of integers; cut the list at the first zero, then put the elements backwards, then do all values appear only once.


Take a list of integers; cut off after the first zero appears, then reverse that for me, then check that there are no duplicates.


Take a list of integers; take values up to (excluding) the first zero, then flip it backwards, then are the values all unique.


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


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


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


Take a list of integers; cap each value at 10, then drop anything 5 or below, then take values up to (excluding) the first zero.


Take a list of integers; clip values at 10, then keep only numbers greater than 5, then keep the part before the first 0.


Take a list of integers; cap each value at 10, then filter for numbers above 5, then truncate at the first zero.


Take a list of integers; clip values at 10, then give me values where x is greater than 5, then delete everything starting with the first zero.


Take a list of integers; cap each value at 10, then show me only the values that are bigger than five, then remove from the first zero onwards.


Take a list of integers; clip values at 10, then keep values greater than five, then up to but not including the first zero.


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


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


Take a list of integers; sort descending, then remove all zero values, then true if already sorted smallest to largest.


Take a list of integers; sort largest first, then exclude zeros, then does this list go in ascending order.


Take a list of integers; sort in descending order, then remove all zero values, then check if the list is in ascending order.


Take a list of integers; sort from greatest to least, then exclude zeros, then is the list sorted.


Take a list of integers; sort z to a, then remove all zero values, then is it sorted.


Take a list of integers; arrange in decreasing order, then exclude zeros, then check if values are in increasing order.


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


Take a list of integers; sort descending, then drop the zeros, then return whether the list is sorted ascending.


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then negate.


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