Take a list of integers; odd numbers only, then extract all even numbers, then sort from highest to lowest.


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


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


Take a list of people records (name, age); extract the ages, then sort smallest to largest, then arrange by magnitude ignoring sign.


Take a list of people records (name, age); show me all ages, then Ascending sort, then put them in order by magnitude.


Take a list of people records (name, age); pluck the age field from each record, then Sort this ascending, then arrange in order of absolute value.


Take a list of people records (name, age); get the age field, then Sort lowest to highest, then sort by distance from zero.


Take a list of people records (name, age); keep just each person's age, then Arrange from smallest to largest, then order by how far from zero.


Take a list of people records (name, age); extract age values, then sort ascending, then order by distance from zero.


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


Take a list of people records (name, age); extract the ages, then sort ascending, then sort by absolute value.


Take a list of integers; sort by absolute value, then take the first 3 elements, then drop non-negative values.


Take a list of integers; rearrange by distance from zero, then remove everything after the third, then drop all positive numbers.


Take a list of integers; arrange by magnitude ignoring sign, then truncate to three items, then drop non-negative values.


Take a list of integers; put them in order by magnitude, then show the first three, then drop all positive numbers.


Take a list of integers; arrange in order of absolute value, then take the first three, then drop non-negative values.


Take a list of integers; sort by distance from zero, then keep first 3, then drop all positive numbers.


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


Take a list of integers; pad with zeros to at least three elements, then sort smallest to largest, then find the max, defaulting to 0.


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


Take a list of integers; pad with zeros to at least three elements, then Sort this ascending, then What's the highest number in the list.


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


Take a list of integers; pad with zeros to at least three elements, then Arrange from smallest to largest, then Find the largest element, defaulting to zero.


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


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


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


Take a list of integers; keep the odd numbers, then keep values below zero, then give the earliest even value or zero.


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


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


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


Take a list of integers; sort descending, then keep values below zero, then remove the initial run of negative numbers.


Take a list of integers; sort largest first, then get the negative numbers, then strip the front negatives.


Take a list of integers; sort in descending order, then keep values below zero, then remove leading negative numbers.


Take a list of integers; sort from greatest to least, then get the negative numbers, then drop negatives from start.


Take a list of integers; sort z to a, then keep values below zero, then strip negative values from the start.


Take a list of integers; arrange in decreasing order, then get the negative numbers, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    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; sort descending, then keep the negative numbers, then drop the leading negative values.


Take a list of strings; drop strings shorter than three characters, then convert each to lower case, then deduplicate the strings.


Take a list of strings; eliminate strings below length three, then lowercase each one, then filter out duplicate strings retain first.


Take a list of strings; remove short strings (under 3 chars), then convert each to lower case, then strip duplicates preserve order.


Take a list of strings; only keep strings with three or more characters, then lowercase each one, then remove repeated strings.


Take a list of strings; keep only strings that are at least three characters long, then convert each to lower case, then keep unique strings first appearance.


Take a list of strings; filter strings shorter than 3 chars, then lowercase each one, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; drop strings shorter than three characters, then lowercase each string, then drop duplicate strings keeping the first.


Take a list of integers; sort descending, then increase every value by 10, then true if every value is unique.


Take a list of integers; sort largest first, then add 10 to each item, then check for duplicates in the values.


Take a list of integers; sort in descending order, then shift each up by ten, then do all values appear only once.


Take a list of integers; sort from greatest to least, then increase all numbers by 10, then check that there are no duplicates.


Take a list of integers; sort z to a, then add 10 to everything, then are the values all unique.


Take a list of integers; arrange in decreasing order, then give everything a boost of 10, then check if all values are unique.


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


Take a list of integers; sort descending, then add ten to each, then return whether all values are distinct.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then remove the initial run of negative numbers.


Take a list of integers; Take everything except the first, then pad to 3, then strip the front negatives.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then remove leading negative numbers.


Take a list of integers; Take everything except the first, then pad to 3, then drop negatives from start.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then strip negative values from the start.


Take a list of integers; Take everything except the first, then pad to 3, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep everything before the first zero, then keep values divisible by 3, then truncate to three items.


Take a list of integers; take only what comes before the initial zero, then keep items where x mod 3 equals zero, then show the first three.


Take a list of integers; cut the list at the first zero, then drop anything not divisible by three, then take the first three.


Take a list of integers; cut off after the first zero appears, then filter out everything except multiples of three, then keep first 3.


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


Take a list of integers; keep the part before the first 0, then multiples of three only, then first three.


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


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


Take a list of strings; uppercase each string, then keep only non-empty strings, then arrange in lexicographic order.


Take a list of strings; make it all caps, then filter empty strings, then sort by letter.


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


Take a list of strings; change all strings to uppercase, then clean up empty strings, then sort by letter.


Take a list of strings; make every string uppercase, then delete empty entries, then arrange in lexicographic order.


Take a list of strings; uppercase each one, then drop empty strings, then sort by letter.


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


Take a list of strings; uppercase each string, then drop empty strings, then sort alphabetically.


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


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


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


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


Take a list of integers; filter out the negative ones, then truncate at the first zero, then deduplicate the list.


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


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


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


Take a list of integers; keep values greater than five, then order by distance from zero, then drop the even numbers.


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value, then strip out the evens.


Take a list of integers; keep only numbers above 5, then organize by magnitude, then drop the even numbers.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending, then strip out the evens.


Take a list of integers; remove anything 5 or less, then sort from smallest to largest absolute value, then drop the even numbers.


Take a list of integers; filter to keep only values above 5, then sort by absolute value, then strip out the evens.


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


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


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


Take a list of integers; each value squared, then filter for positive numbers, then check for duplicates in the values.


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


Take a list of integers; square them all, then keep the positives, then check that there are no duplicates.


Take a list of integers; raise each to the power of two, then remove negatives, then are the values all unique.


Take a list of integers; I need each number multiplied by itself, then keep the positive numbers, then check if all values are unique.


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


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


Take a list of integers; take the absolute value of each, then take the first 3 elements, then give the earliest even value or zero.


Take a list of integers; convert to absolute value, then remove everything after the third, then fetch the first even element, default to 0.


Take a list of integers; strip the signs, then truncate to three items, then give the earliest even value or zero.


Take a list of integers; take abs of each, then show the first three, then fetch the first even element, default to 0.


Take a list of integers; get the absolute value of everything, then take the first three, then give the earliest even value or zero.


Take a list of integers; apply absolute value to the whole list, then keep first 3, then fetch the first even element, default to 0.


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


Take a list of integers; take the absolute value of each, then keep only the first three, then return the first even value (0 if none).


Take a list of integers; if empty, use a single zero, then skip negatives at the start, then drop anything not divisible by three.


Take a list of integers; if blank use 0, then remove all negatives at the front, then filter out everything except multiples of three.


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


Take a list of integers; when the list is empty, substitute a zero value, then strip the front negatives, then multiples of three only.


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


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


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


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


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then true if any value equals zero.


Take a list of integers; extract negatives, then don't let anything exceed 10, then check for zero.


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


Take a list of integers; keep the negative numbers, then cap each value at 10, then return whether the list contains a zero.


Take a list of integers; drop the first element, then multiply each value by itself, then count the elements.


Take a list of integers; Take everything except the first, then square them all, then how many items remain.


Take a list of integers; drop the first element, then raise each to the power of two, then tell me the length.


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


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


Take a list of integers; Take everything except the first, then multiply each element by itself, then what's the count.


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


Take a list of integers; drop the first element, then square each, then return how many remain.


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


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then filter out the odd numbers.


Take a list of integers; cut the list at the first zero, then reduce each by one, then drop the odd numbers.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then filter out the odd numbers.


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


Take a list of integers; keep the part before the first 0, then Drop each by one, then filter out the odd numbers.


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


Take a list of integers; keep everything before the first zero, then subtract one from each, then keep the even numbers.


Take a list of integers; take values while they are positive, then skip negatives at the start, then true if at least one even value.


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


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then true if at least one even value.


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


Take a list of integers; take while greater than zero, then remove leading negative numbers, then true if at least one even value.


Take a list of integers; take values while positive, then drop negatives from start, then any even.


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


Take a list of integers; take values while they are positive, then drop the leading negative values, then return whether any value is even.


Take a list of integers; add ten to each, then keep the leading run of positive numbers, then true only if all are positive.


Take a list of integers; bump everything up by 10, then take values while they are positive, then do all of these have positive values.


Take a list of integers; increase every value by 10, then take positive values then stop, then check if every value is positive.


Take a list of integers; add 10 to each item, then keep going while positive, then confirm all values are positive.


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


Take a list of integers; increase all numbers by 10, then take while greater than zero, then check if every number is above zero.


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


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


Take a list of integers; take values while they are positive, then take the first 3 elements, then trim one element off each end.


Take a list of integers; take positive values then stop, then remove everything after the third, then cut off the first and last.


Take a list of integers; keep going while positive, then truncate to three items, then remove the first and last elements.


Take a list of integers; stop at first non positive, then show the first three, then keep only the middle part.


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


Take a list of integers; take values while positive, then keep first 3, then eliminate the outermost elements.


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


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


Take a list of strings; trim whitespace from each, then keep only non-empty strings, then prepend a hash mark to each.


Take a list of strings; strip whitespace from every element, then filter empty strings, then prefix all with #.


Take a list of strings; remove surrounding whitespace, then remove empty strings from the list, then prepend a hash mark to each.


Take a list of strings; trim the whitespace off everything, then clean up empty strings, then prefix all with #.


Take a list of strings; strip spaces from all strings, then delete empty entries, then prepend a hash mark to each.


Take a list of strings; strip all the strings, then drop empty strings, then prefix all with #.


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


Take a list of strings; trim whitespace from each, then drop empty strings, then prefix each with a hash.


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then truncate to three items.


Take a list of integers; add zeros until the list has at least three values, then don't let anything exceed 10, then show the first three.


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then take the first three.


Take a list of integers; add zeros until the list has at least three values, then don't let anything exceed 10, then keep first 3.


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then truncate to first three.


Take a list of integers; add zeros until the list has at least three values, then don't let anything exceed 10, then first three.


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


Take a list of integers; pad with zeros to at least three elements, then cap each value at 10, then keep only the first three.


Take a list of integers; drop the leading negative values, then keep only odd values, then arrange in increasing order.


Take a list of integers; cut the leading negatives, then eliminate the even numbers, then Organize these ascending.


Take a list of integers; skip negatives at the start, then keep only odd values, then Sort in ascending order.


Take a list of integers; remove all negatives at the front, then eliminate the even numbers, then I need this sorted ascending.


Take a list of integers; remove the initial run of negative numbers, then keep only odd values, then Put these in ascending order.


Take a list of integers; strip the front negatives, then eliminate the even numbers, 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 = [x for x in r if x % 2 != 0]
    r = sorted(r)
    return r


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


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


Take a list of integers; extract negatives, then eliminate the even numbers, then take abs of each.


Take a list of integers; keep the negative numbers, then keep only odd values, then get the absolute value of everything.


Take a list of integers; extract negatives, then eliminate the even numbers, then apply absolute value to the whole list.


Take a list of integers; keep the negative numbers, then keep only odd values, then make them all positive.


Take a list of integers; extract negatives, then eliminate the even numbers, then make every value non-negative.


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


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


Take a list of integers; drop the zeros, then clamp each to at most ten, then take values up to (excluding) the first zero.


Take a list of integers; keep only nonzero elements, then don't let anything exceed 10, then keep the part before the first 0.


Take a list of integers; drop the zeros, then clamp each to at most ten, then truncate at the first zero.


Take a list of integers; keep only nonzero elements, then don't let anything exceed 10, then delete everything starting with the first zero.


Take a list of integers; drop the zeros, then clamp each to at most ten, then remove from the first zero onwards.


Take a list of integers; keep only nonzero elements, then don't let anything exceed 10, then up to but not including the first zero.


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


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


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


Take a list of integers; convert to absolute value, then pad to 3, then keep the leading run of positive numbers.


Take a list of integers; strip the signs, then extend to length 3 using zeros, then take values while they are positive.


Take a list of integers; take abs of each, then pad to 3, then take positive values then stop.


Take a list of integers; get the absolute value of everything, then extend to length 3 using zeros, then keep going while positive.


Take a list of integers; apply absolute value to the whole list, then pad to 3, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [abs(x) for x in r]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = 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 pad with zeros to at least three elements, then take values while they are positive.


Take a list of integers; double each, then keep the leading run of positive numbers, then trim one element off each end.


Take a list of integers; times two for each item, then take values while they are positive, then cut off the first and last.


Take a list of integers; double each, then take positive values then stop, then remove the first and last elements.


Take a list of integers; times two for each item, then keep going while positive, then keep only the middle part.


Take a list of integers; double each, then stop at first non positive, then drop first and last.


Take a list of integers; times two for each item, then take while greater than zero, then eliminate the outermost elements.


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


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


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


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then show the first three.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then take the first three.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then keep first 3.


Take a list of integers; shift each up by ten, then clamp each to at most ten, then truncate to first three.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then first three.


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


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


Take a list of integers; keep the positive numbers, then extend to length 3 using zeros, then find the max, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then pad to 3, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop non-positive values, then extend to length 3 using zeros, then What's the highest number in the list.


Take a list of integers; drop the negative numbers, then pad to 3, then Return the greatest value or default to 0.


Take a list of integers; filter out the negative ones, then extend to length 3 using zeros, then Find the largest element, defaulting to zero.


Take a list of integers; remove all negative values, then pad to 3, then give the largest value (0 if none).


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


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


Take a list of integers; add one to each, then default to [0] when there is nothing, then take values up to (excluding) the first zero.


Take a list of integers; make each one bigger, then when the list is empty, substitute a zero value, then keep the part before the first 0.


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


Take a list of integers; make each one bigger, then zero it out if it's empty, then delete everything starting with the first zero.


Take a list of integers; add one to each, then use zero if the list is empty, then remove from the first zero onwards.


Take a list of integers; make each one bigger, then default to zero when empty, then up to but not including the first zero.


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


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


Take a list of integers; keep everything before the first zero, then multiply each by two, then arrange in increasing order.


Take a list of integers; take only what comes before the initial zero, then double each item in the list, then Organize these ascending.


Take a list of integers; cut the list at the first zero, then multiply each by two, then Sort in ascending order.


Take a list of integers; cut off after the first zero appears, then double each item in the list, then I need this sorted ascending.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then Put these in ascending order.


Take a list of integers; keep the part before the first 0, then double each item in the list, then sort smallest to largest.


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


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


Take a list of integers; take the absolute value of each, then take the first 3 elements, then true if every value is unique.


Take a list of integers; convert to absolute value, then remove everything after the third, then check for duplicates in the values.


Take a list of integers; strip the signs, then truncate to three items, then do all values appear only once.


Take a list of integers; take abs of each, then show the first three, then check that there are no duplicates.


Take a list of integers; get the absolute value of everything, then take the first three, then are the values all unique.


Take a list of integers; apply absolute value to the whole list, then keep first 3, then check if all values are unique.


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


Take a list of integers; take the absolute value of each, then keep only the first three, then return whether all values are distinct.


Take a list of integers; if empty, use a single zero, then flip the list around, then arrange by magnitude ignoring sign.


Take a list of integers; if blank use 0, then flip the order around, then put them in order by magnitude.


Take a list of integers; default to [0] when there is nothing, then put the elements backwards, then arrange in order of absolute value.


Take a list of integers; when the list is empty, substitute a zero value, then reverse that for me, then sort by distance from zero.


Take a list of integers; replace an empty list with one zero, then flip it backwards, then order by how far from zero.


Take a list of integers; zero it out if it's empty, then make it backwards, then order by distance from zero.


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


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


Take a list of integers; keep values greater than five, then increment each value, then drop the even numbers.


Take a list of integers; filter out values less than or equal to 5, then plus one for all, then strip out the evens.


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


Take a list of integers; exclude values of 5 and below, then plus one for all, then strip out the evens.


Take a list of integers; remove anything 5 or less, then increment each value, then drop the even numbers.


Take a list of integers; filter to keep only values above 5, then plus one for all, then strip out the evens.


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


Take a list of integers; keep values greater than five, then add one to each, then keep the odd numbers.


Take a list of integers; square each, then sort largest to smallest, then remove the initial run of negative numbers.


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


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then remove leading negative numbers.


Take a list of integers; square them all, then sort descending, then drop negatives from start.


Take a list of integers; raise each to the power of two, then sort largest first, then strip negative values from the start.


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then remove negatives before the first non-negative.


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


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


Take a list of integers; take values while they are positive, then extend to length 3 using zeros, then count the elements.


Take a list of integers; take positive values then stop, then pad to 3, then how many items remain.


Take a list of integers; keep going while positive, then extend to length 3 using zeros, then tell me the length.


Take a list of integers; stop at first non positive, then pad to 3, then return the length.


Take a list of integers; take while greater than zero, then extend to length 3 using zeros, then count them.


Take a list of integers; take values while positive, then pad to 3, then what's the count.


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


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


Take a list of integers; drop the leading negative values, then remove all zero values, then put the elements backwards.


Take a list of integers; cut the leading negatives, then exclude zeros, then reverse that for me.


Take a list of integers; skip negatives at the start, then remove all zero values, then flip it backwards.


Take a list of integers; remove all negatives at the front, then exclude zeros, then make it backwards.


Take a list of integers; remove the initial run of negative numbers, then remove all zero values, then reverse the list.


Take a list of integers; strip the front negatives, then exclude zeros, 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 != 0]
    r = list(reversed(r))
    return r


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


Take a list of integers; subtract one from each, then flip the sign of each, then give the number of evens.


Take a list of integers; Decrement all items, then turn positives to negatives and vice versa, then find how many values are divisible by two.


Take a list of integers; decrement each value, then flip the sign of each, then how many are even.


Take a list of integers; Lower each number by one, then turn positives to negatives and vice versa, then get the total number of even values in the list.


Take a list of integers; reduce each by one, then flip the sign of each, then give me the count of even values.


Take a list of integers; Subtract 1 from all, then turn positives to negatives and vice versa, then I need to know how many of these are even.


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


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


Take a list of integers; reverse the order, then keep only even values, then arrange by magnitude ignoring sign.


Take a list of integers; reverse, then extract all even numbers, then put them in order by magnitude.


Take a list of integers; flip the list around, then keep only even values, then arrange in order of absolute value.


Take a list of integers; flip the order around, then extract all even numbers, then sort by distance from zero.


Take a list of integers; put the elements backwards, then keep only even values, then order by how far from zero.


Take a list of integers; reverse that for me, then extract all even numbers, then order by distance from zero.


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


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


Take a list of integers; keep the odd numbers, then default to [0] when there is nothing, then trim one element off each end.


Take a list of integers; odd numbers only, then when the list is empty, substitute a zero value, then cut off the first and last.


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


Take a list of integers; odd numbers only, then zero it out if it's empty, then keep only the middle part.


Take a list of integers; keep the odd numbers, then use zero if the list is empty, then drop first and last.


Take a list of integers; odd numbers only, then default to zero when empty, then eliminate the outermost elements.


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


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


Take a list of integers; drop the zeros, then increment each value, then take values up to (excluding) the first zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then keep the part before the first 0.


Take a list of integers; drop the zeros, then increment each value, then truncate at the first zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then delete everything starting with the first zero.


Take a list of integers; drop the zeros, then increment each value, then remove from the first zero onwards.


Take a list of integers; keep only nonzero elements, then plus one for all, then up to but not including the first zero.


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


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


Take a list of integers; sort ascending, then increment each value, then drop the odd numbers.


Take a list of integers; Sort it from low to high, then plus one for all, then filter out the odd numbers.


Take a list of integers; arrange in increasing order, then increment each value, then drop the odd numbers.


Take a list of integers; Organize these ascending, then plus one for all, then filter out the odd numbers.


Take a list of integers; Sort in ascending order, then increment each value, then drop the odd numbers.


Take a list of integers; I need this sorted ascending, then plus one for all, then filter out the odd numbers.


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


Take a list of integers; sort ascending, then add one to each, then keep the even numbers.


Take a list of integers; double each, then remove repeated values, then arrange by magnitude ignoring sign.


Take a list of integers; times two for each item, then unique values preserving order, then put them in order by magnitude.


Take a list of integers; double each, then remove repeated values, then arrange in order of absolute value.


Take a list of integers; times two for each item, then unique values preserving order, then sort by distance from zero.


Take a list of integers; double each, then remove repeated values, then order by how far from zero.


Take a list of integers; times two for each item, then unique values preserving order, then order by distance from zero.


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


Take a list of integers; double each, then drop duplicates keeping first occurrence, then sort by absolute value.


Take a list of integers; keep the negative numbers, then remove repeated values, then shift each up by ten.


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


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


Take a list of integers; extract negatives, then unique values preserving order, then give everything a boost of 10.


Take a list of integers; keep the negative numbers, then remove repeated values, then increment each by ten.


Take a list of integers; extract negatives, then unique values preserving order, then add a constant 10 to each.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the list around, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then flip the order around, then strip the zeros.


Take a list of integers; drop duplicates keeping first occurrence, then put the elements backwards, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then reverse that for me, then strip the zeros.


Take a list of integers; drop duplicates keeping first occurrence, then flip it backwards, then keep only non-zero numbers.


Take a list of integers; drop duplicates but keep the first one, then make it backwards, then strip the zeros.


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


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


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


Take a list of integers; reverse, then take values while they are positive, then Give me the maximum, but 0 if there are no items.


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


Take a list of integers; flip the order around, then keep going while positive, then Return the greatest value or default to 0.


Take a list of integers; put the elements backwards, then stop at first non positive, then Find the largest element, defaulting to zero.


Take a list of integers; reverse that for me, then take while greater than zero, then give the largest value (0 if none).


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


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


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then count the elements.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then how many items remain.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then tell me the length.


Take a list of integers; keep only nonzero elements, then zero it out if it's empty, then return the length.


Take a list of integers; drop the zeros, then use zero if the list is empty, then count them.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then what's the count.


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


Take a list of integers; drop the zeros, then if empty, use a single zero, then return how many remain.


Take a list of integers; sort descending, then flip the list around, then trim one element off each end.


Take a list of integers; sort largest first, then flip the order around, then cut off the first and last.


Take a list of integers; sort in descending order, then put the elements backwards, then remove the first and last elements.


Take a list of integers; sort from greatest to least, then reverse that for me, then keep only the middle part.


Take a list of integers; sort z to a, then flip it backwards, then drop first and last.


Take a list of integers; arrange in decreasing order, then make it backwards, then eliminate the outermost elements.


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


Take a list of integers; sort descending, then reverse the order, then drop the first and last elements.


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


Take a list of integers; add zeros until the list has at least three values, then filter for positive numbers, then keep the leading run of positive numbers.


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


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


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


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


def solve(xs):
    r = list(xs)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    r = [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; pad with zeros to at least three elements, then keep the positive numbers, then take values while they are positive.


Take a list of integers; subtract one from each, then keep values below zero, then arrange in decreasing order.


Take a list of integers; Decrement all items, then get the negative numbers, then arrange in descending order.


Take a list of integers; decrement each value, then keep values below zero, then reverse sort.


Take a list of integers; Lower each number by one, then get the negative numbers, then sort largest to smallest.


Take a list of integers; reduce each by one, then keep values below zero, then sort by descending values.


Take a list of integers; Subtract 1 from all, then get the negative numbers, then sort from highest to lowest.


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


Take a list of integers; subtract one from each, then keep the negative numbers, then sort descending.


Take a list of integers; drop the leading negative values, then multiply each value by itself, then find the max, defaulting to 0.


Take a list of integers; cut the leading negatives, then square them all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; skip negatives at the start, then raise each to the power of two, then What's the highest number in the list.


Take a list of integers; remove all negatives at the front, then I need each number multiplied by itself, then Return the greatest value or default to 0.


Take a list of integers; remove the initial run of negative numbers, then square all of them, then Find the largest element, defaulting to zero.


Take a list of integers; strip the front negatives, then multiply each element by itself, then give the largest value (0 if none).


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]
    return max(r) if r else 0


Take a list of integers; drop the leading negative values, then square each, then return the maximum (0 if empty).


Take a list of integers; add one to each, then take the first 3 elements, then drop non-negative values.


Take a list of integers; make each one bigger, then remove everything after the third, then drop all positive numbers.


Take a list of integers; add one to each, then truncate to three items, then drop non-negative values.


Take a list of integers; make each one bigger, then show the first three, then drop all positive numbers.


Take a list of integers; add one to each, then take the first three, then drop non-negative values.


Take a list of integers; make each one bigger, then keep first 3, then drop all positive numbers.


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


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


Take a list of integers; keep values greater than five, then increase every value by 10, then arrange in decreasing order.


Take a list of integers; filter out values less than or equal to 5, then add 10 to each item, then arrange in descending order.


Take a list of integers; keep only numbers above 5, then shift each up by ten, then reverse sort.


Take a list of integers; exclude values of 5 and below, then increase all numbers by 10, then sort largest to smallest.


Take a list of integers; remove anything 5 or less, then add 10 to everything, then sort by descending values.


Take a list of integers; filter to keep only values above 5, then give everything a boost of 10, then sort from highest to lowest.


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


Take a list of integers; keep values greater than five, then add ten to each, then sort descending.


Take a list of integers; square each, then take the final 3 elements, then true if already sorted smallest to largest.


Take a list of integers; each value squared, then drop everything except the final three, then does this list go in ascending order.


Take a list of integers; multiply each value by itself, then give me the last three elements, then check if the list is in ascending order.


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


Take a list of integers; raise each to the power of two, then keep the final three items, then is it sorted.


Take a list of integers; I need each number multiplied by itself, then take the last three, then check if values are in increasing order.


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


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


Take a list of integers; cap each value at 10, then flip the list around, then truncate to three items.


Take a list of integers; clip values at 10, then flip the order around, then show the first three.


Take a list of integers; cap each value at 10, then put the elements backwards, then take the first three.


Take a list of integers; clip values at 10, then reverse that for me, then keep first 3.


Take a list of integers; cap each value at 10, then flip it backwards, then truncate to first three.


Take a list of integers; clip values at 10, then make it backwards, then first three.


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


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


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


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then arrange in descending order.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then reverse sort.


Take a list of integers; exclude values of 5 and below, then keep the positives, then sort largest to smallest.


Take a list of integers; remove anything 5 or less, then remove negatives, then sort by descending values.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers, then sort from highest to lowest.


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


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


Take a list of integers; add one to each, then keep values above zero, then make each twice as big.


Take a list of integers; make each one bigger, then filter for positive numbers, then multiply each by 2.


Take a list of integers; add one to each, then keep only positive numbers, then make each twice as big.


Take a list of integers; make each one bigger, then keep the positives, then multiply each by 2.


Take a list of integers; add one to each, then remove negatives, then make each twice as big.


Take a list of integers; make each one bigger, then keep the positive numbers, then multiply each by 2.


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


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


Take a list of integers; drop the zeros, then multiply each by two, then put the elements backwards.


Take a list of integers; keep only nonzero elements, then double each item in the list, then reverse that for me.


Take a list of integers; drop the zeros, then multiply each by two, then flip it backwards.


Take a list of integers; keep only nonzero elements, then double each item in the list, then make it backwards.


Take a list of integers; drop the zeros, then multiply each by two, then reverse the list.


Take a list of integers; keep only nonzero elements, then double each item in the list, then invert the sequence.


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


Take a list of integers; drop the zeros, then double each, then reverse the order.


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


Take a list of integers; Sort it from low to high, then get the negative numbers, then product of the list.


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


Take a list of integers; Organize these ascending, then get the negative numbers, then what do they multiply to.


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


Take a list of integers; I need this sorted ascending, then get the negative numbers, then multiply them all together.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then drop the even numbers.


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


Take a list of integers; keep only numbers above 5, then take positive values then stop, then drop the even numbers.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then strip out the evens.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then drop the even numbers.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then strip out the evens.


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


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


Take a list of integers; keep the negative numbers, then skip negatives at the start, then count the elements.


Take a list of integers; extract negatives, then remove all negatives at the front, then how many items remain.


Take a list of integers; keep the negative numbers, then remove the initial run of negative numbers, then tell me the length.


Take a list of integers; extract negatives, then strip the front negatives, then return the length.


Take a list of integers; keep the negative numbers, then remove leading negative numbers, then count them.


Take a list of integers; extract negatives, then drop negatives from start, then what's the count.


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


Take a list of integers; keep the negative numbers, then drop the leading negative values, then return how many remain.


Take a list of integers; drop the leading negative values, then flip the list around, then skip the first one.


Take a list of integers; cut the leading negatives, then flip the order around, then Discard the first element.


Take a list of integers; skip negatives at the start, then put the elements backwards, then skip the first one.


Take a list of integers; remove all negatives at the front, then reverse that for me, then Discard the first element.


Take a list of integers; remove the initial run of negative numbers, then flip it backwards, then skip the first one.


Take a list of integers; strip the front negatives, then make it backwards, then Discard the first element.


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


Take a list of integers; drop the leading negative values, then reverse the order, then drop the first element.


Take a list of integers; keep only the last three, then skip negatives at the start, then reduce each by one.


Take a list of integers; keep the final three items, then remove all negatives at the front, then Subtract 1 from all.


Take a list of integers; take the last three, then remove the initial run of negative numbers, then Subtract one from each.


Take a list of integers; trim to the last three, then strip the front negatives, then Drop each by one.


Take a list of integers; last three only, then remove leading negative numbers, then Decrease all values by one.


Take a list of integers; truncate to the last three items, then drop negatives from start, then Remove one from each value.


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


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


Take a list of integers; subtract one from each, then keep only even values, then arrange in increasing order.


Take a list of integers; Decrement all items, then extract all even numbers, then Organize these ascending.


Take a list of integers; decrement each value, then keep only even values, then Sort in ascending order.


Take a list of integers; Lower each number by one, then extract all even numbers, then I need this sorted ascending.


Take a list of integers; reduce each by one, then keep only even values, then Put these in ascending order.


Take a list of integers; Subtract 1 from all, then extract all even numbers, then sort smallest to largest.


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


Take a list of integers; subtract one from each, then keep the even numbers, then sort ascending.


Take a list of integers; double each, then keep only even values, then drop anything not divisible by three.


Take a list of integers; times two for each item, then extract all even numbers, then filter out everything except multiples of three.


Take a list of integers; double each, then keep only even values, then keep only multiples of three.


Take a list of integers; times two for each item, then extract all even numbers, then multiples of three only.


Take a list of integers; double each, then keep only even values, then filter for numbers divisible by three.


Take a list of integers; times two for each item, then extract all even numbers, then give me only the values divisible by three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove both ends, then true if already sorted smallest to largest.


Take a list of integers; drop duplicates but keep the first one, then trim the edges, then does this list go in ascending order.


Take a list of integers; drop duplicates keeping first occurrence, then trim one element off each end, then check if the list is in ascending order.


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first and last elements, then is it sorted.


Take a list of integers; drop duplicates but keep the first one, then keep only the middle part, then check if values are in increasing order.


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


Take a list of integers; drop duplicates keeping first occurrence, then drop the first and last elements, then return whether the list is sorted ascending.


Take a list of integers; keep the odd numbers, then increment each value, then find the max, defaulting to 0.


Take a list of integers; odd numbers only, then plus one for all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the odd numbers, then increment each value, then What's the highest number in the list.


Take a list of integers; odd numbers only, then plus one for all, then Return the greatest value or default to 0.


Take a list of integers; keep the odd numbers, then increment each value, then Find the largest element, defaulting to zero.


Take a list of integers; odd numbers only, then plus one for all, then give the largest value (0 if none).


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


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


Take a list of integers; if empty, use a single zero, then flip the sign of each, then true if already sorted smallest to largest.


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then does this list go in ascending order.


Take a list of integers; default to [0] when there is nothing, then flip the sign of each, then check if the list is in ascending order.


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


Take a list of integers; replace an empty list with one zero, then flip the sign of each, then is it sorted.


Take a list of integers; zero it out if it's empty, then turn positives to negatives and vice versa, then check if values are in increasing order.


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


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


Take a list of integers; add ten to each, then sort smallest to largest, then make each twice as big.


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


Take a list of integers; increase every value by 10, then Sort this ascending, then make each twice as big.


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


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then make each twice as big.


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


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


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


Take a list of integers; add one to each, then keep values divisible by 3, then keep only numbers above 5.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then exclude values of 5 and below.


Take a list of integers; add one to each, then drop anything not divisible by three, then remove anything 5 or less.


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then filter to keep only values above 5.


Take a list of integers; add one to each, then keep only multiples of three, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then multiples of three only, then drop anything 5 or below.


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


Take a list of integers; add one to each, then keep multiples of three, then keep values greater than five.


Take a list of integers; cap each value at 10, then take the first 3 elements, then put the elements backwards.


Take a list of integers; clip values at 10, then remove everything after the third, then reverse that for me.


Take a list of integers; cap each value at 10, then truncate to three items, then flip it backwards.


Take a list of integers; clip values at 10, then show the first three, then make it backwards.


Take a list of integers; cap each value at 10, then take the first three, then reverse the list.


Take a list of integers; clip values at 10, then keep first 3, then invert the sequence.


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


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


Take a list of integers; add one to each, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then remove repeats.


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


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


Take a list of integers; keep everything before the first zero, then remove the first item, then truncate to three items.


Take a list of integers; take only what comes before the initial zero, then Remove head, then show the first three.


Take a list of integers; cut the list at the first zero, then remove the first item, then take the first three.


Take a list of integers; cut off after the first zero appears, then Remove head, then keep first 3.


Take a list of integers; take values up to (excluding) the first zero, then remove the first item, then truncate to first three.


Take a list of integers; keep the part before the first 0, then Remove head, then first three.


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


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


Take a list of people records (name, age); extract the names, then remove repeated strings, then return them as one comma-separated string.


Take a list of people records (name, age); Give me the names, then keep unique strings first appearance, then separate by comma.


Take a list of people records (name, age); pluck the name field from each record, then eliminate repeated strings preserve first occurrence, then join with commas.


Take a list of people records (name, age); Grab the names, then drop duplicate strings keeping the first, then comma join.


Take a list of people records (name, age); keep just each person's name, then dedupe, then combine using commas.


Take a list of people records (name, age); List the names, then remove duplicate strings keep first, then connect with commas between each item.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = list(dict.fromkeys(r))
    return ','.join(r)


Take a list of people records (name, age); extract the names, then drop duplicate strings keeping the first, then join them with commas.


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


Take a list of integers; get rid of anything that's not positive, then pad to 3, then find how many values are divisible by two.


Take a list of integers; drop non-positive values, then extend to length 3 using zeros, then how many are even.


Take a list of integers; drop the negative numbers, then pad to 3, then get the total number of even values in the list.


Take a list of integers; filter out the negative ones, then extend to length 3 using zeros, then give me the count of even values.


Take a list of integers; remove all negative values, then pad to 3, then I need to know how many of these are even.


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


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


Take a list of integers; add ten to each, then flip the list around, then drop non-negative values.


Take a list of integers; bump everything up by 10, then flip the order around, then drop all positive numbers.


Take a list of integers; increase every value by 10, then put the elements backwards, then drop non-negative values.


Take a list of integers; add 10 to each item, then reverse that for me, then drop all positive numbers.


Take a list of integers; shift each up by ten, then flip it backwards, then drop non-negative values.


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


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


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


Take a list of integers; add one to each, then take the final 3 elements, then drop anything not divisible by three.


Take a list of integers; make each one bigger, then drop everything except the final three, then filter out everything except multiples of three.


Take a list of integers; add one to each, then give me the last three elements, then keep only multiples of three.


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


Take a list of integers; add one to each, then keep the final three items, then filter for numbers divisible by three.


Take a list of integers; make each one bigger, then take the last three, then give me only the values divisible by three.


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


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


Take a list of integers; keep the positive numbers, then remove all zero values, then make each twice as big.


Take a list of integers; get rid of anything that's not positive, then exclude zeros, then multiply each by 2.


Take a list of integers; drop non-positive values, then remove all zero values, then make each twice as big.


Take a list of integers; drop the negative numbers, then exclude zeros, then multiply each by 2.


Take a list of integers; filter out the negative ones, then remove all zero values, then make each twice as big.


Take a list of integers; remove all negative values, then exclude zeros, then multiply each by 2.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then sort largest to smallest, then find the min, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then sort by descending values, then minimum value, zero otherwise.


Take a list of integers; drop duplicates keeping first occurrence, then sort from highest to lowest, then get the minimum value or zero if empty.


Take a list of integers; drop duplicates but keep the first one, then sort descending, then give me the min or 0.


Take a list of integers; drop duplicates keeping first occurrence, then sort largest first, then return the smallest number, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then sort in descending order, then return smallest or zero if empty.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = sorted(r, reverse=True)
    return min(r) if r else 0


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then trim one element off each end.


Take a list of people records (name, age); show me all ages, then don't let anything exceed 10, then cut off the first and last.


Take a list of people records (name, age); pluck the age field from each record, then clamp each to at most ten, then remove the first and last elements.


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then keep only the middle part.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then drop first and last.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then eliminate the outermost elements.


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


Take a list of people records (name, age); extract the ages, then cap each value at 10, then drop the first and last elements.


Take a list of integers; keep everything before the first zero, then order by distance from zero, then true if every value is unique.


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


Take a list of integers; cut the list at the first zero, then organize by magnitude, then do all values appear only once.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then check that there are no duplicates.


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


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


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


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


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then keep the leading run of positive numbers.


Take a list of integers; drop the zeros, then keep values below zero, then take values while they are positive.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then take positive values then stop.


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x != 0]
    r = [x for x in r if x < 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 zeros, then keep the negative numbers, then take values while they are positive.


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then ensure at least three items by appending zeros.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then ensure at least three items by appending zeros.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then ensure at least three items by appending zeros.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; keep the first 3 items, then exclude zeros, then check for zero.


Take a list of integers; take the first 3 elements, then remove all zero values, then true if any value equals zero.


Take a list of integers; remove everything after the third, then exclude zeros, then check for zero.


Take a list of integers; truncate to three items, then remove all zero values, then true if any value equals zero.


Take a list of integers; show the first three, then exclude zeros, then check for zero.


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


Take a list of integers; keep only the first three, then drop the zeros, then return whether the list contains a zero.


Take a list of integers; drop the zeros, then order by distance from zero, then skip the first one.


Take a list of integers; keep only nonzero elements, then sort based on absolute value, then Discard the first element.


Take a list of integers; drop the zeros, then organize by magnitude, then skip the first one.


Take a list of integers; keep only nonzero elements, then arrange by absolute value ascending, then Discard the first element.


Take a list of integers; drop the zeros, then sort from smallest to largest absolute value, then skip the first one.


Take a list of integers; keep only nonzero elements, then sort by absolute value, then Discard the first element.


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


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


Take a list of integers; keep multiples of three, then extend to length 3 using zeros, then find the max, defaulting to 0.


Take a list of integers; get rid of non-multiples of three, then pad to 3, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep values divisible by 3, then extend to length 3 using zeros, then What's the highest number in the list.


Take a list of integers; keep items where x mod 3 equals zero, then pad to 3, then Return the greatest value or default to 0.


Take a list of integers; drop anything not divisible by three, then extend to length 3 using zeros, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, then pad to 3, then give the largest value (0 if none).


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


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


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


Take a list of integers; convert to absolute value, then cut off after the first zero appears, then remove repeats.


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


Take a list of integers; take abs of each, then keep the part before the first 0, then remove repeats.


Take a list of integers; get the absolute value of everything, then truncate at the first zero, then deduplicate the list.


Take a list of integers; apply absolute value to the whole list, then delete everything starting with the first zero, then remove repeats.


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


Take a list of integers; take the absolute value of each, then keep everything before the first zero, then drop duplicates keeping first occurrence.


Take a list of integers; reverse the order, then flip the sign of each, then arrange in decreasing order.


Take a list of integers; reverse, then turn positives to negatives and vice versa, then arrange in descending order.


Take a list of integers; flip the list around, then flip the sign of each, then reverse sort.


Take a list of integers; flip the order around, then turn positives to negatives and vice versa, then sort largest to smallest.


Take a list of integers; put the elements backwards, then flip the sign of each, then sort by descending values.


Take a list of integers; reverse that for me, then turn positives to negatives and vice versa, then sort from highest to lowest.


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


Take a list of integers; reverse the order, then negate each, then sort descending.


Take a list of integers; sort ascending, then multiply each by two, then trim one element off each end.


Take a list of integers; Sort it from low to high, then double each item in the list, then cut off the first and last.


Take a list of integers; arrange in increasing order, then multiply each by two, then remove the first and last elements.


Take a list of integers; Organize these ascending, then double each item in the list, then keep only the middle part.


Take a list of integers; Sort in ascending order, then multiply each by two, then drop first and last.


Take a list of integers; I need this sorted ascending, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; keep the positive numbers, then remove all zero values, then strip the signs.


Take a list of integers; get rid of anything that's not positive, then exclude zeros, then take abs of each.


Take a list of integers; drop non-positive values, then remove all zero values, then get the absolute value of everything.


Take a list of integers; drop the negative numbers, then exclude zeros, then apply absolute value to the whole list.


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


Take a list of integers; remove all negative values, then exclude zeros, then make every value non-negative.


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


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


Take a list of integers; negate each, then remove repeated values, then true if any value equals zero.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then check for zero.


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


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


Take a list of integers; keep values greater than five, then multiply each value by itself, then drop the odd numbers.


Take a list of integers; filter out values less than or equal to 5, then square them all, then filter out the odd numbers.


Take a list of integers; keep only numbers above 5, then raise each to the power of two, then drop the odd numbers.


Take a list of integers; exclude values of 5 and below, then I need each number multiplied by itself, then filter out the odd numbers.


Take a list of integers; remove anything 5 or less, then square all of them, then drop the odd numbers.


Take a list of integers; filter to keep only values above 5, then multiply each element by itself, then filter out the odd numbers.


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


Take a list of integers; keep values greater than five, then square each, then keep the even numbers.


Take a list of integers; square each, then skip negatives at the start, then true if at least one even value.


Take a list of integers; each value squared, then remove all negatives at the front, then any even.


Take a list of integers; multiply each value by itself, then remove the initial run of negative numbers, then true if at least one even value.


Take a list of integers; square them all, then strip the front negatives, then any even.


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


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


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


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


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


Take a list of integers; each value squared, then double each item in the list, then cut off the first and last.


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


Take a list of integers; square them all, then double each item in the list, then keep only the middle part.


Take a list of integers; raise each to the power of two, then multiply each by two, then drop first and last.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; take values while they are positive, then sort smallest to largest, then give back the total.


Take a list of integers; take positive values then stop, then Ascending sort, then sum r.


Take a list of integers; keep going while positive, then Sort this ascending, then add them up.


Take a list of integers; stop at first non positive, then Sort lowest to highest, then calculate the sum of all elements.


Take a list of integers; take while greater than zero, then Arrange from smallest to largest, then what's the total.


Take a list of integers; take values while positive, then sort ascending, then what do they add up to.


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


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


Take a list of integers; square each, then take the final 3 elements, then drop non-negative values.


Take a list of integers; each value squared, then drop everything except the final three, then drop all positive numbers.


Take a list of integers; multiply each value by itself, then give me the last three elements, then drop non-negative values.


Take a list of integers; square them all, then keep only the last three, then drop all positive numbers.


Take a list of integers; raise each to the power of two, then keep the final three items, then drop non-negative values.


Take a list of integers; I need each number multiplied by itself, then take the last three, then drop all positive numbers.


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


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


Take a list of integers; reverse the order, then keep values below zero, then drop the even numbers.


Take a list of integers; reverse, then get the negative numbers, then strip out the evens.


Take a list of integers; flip the list around, then keep values below zero, then drop the even numbers.


Take a list of integers; flip the order around, then get the negative numbers, then strip out the evens.


Take a list of integers; put the elements backwards, then keep values below zero, then drop the even numbers.


Take a list of integers; reverse that for me, then get the negative numbers, then strip out the evens.


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


Take a list of people records (name, age); extract the ages, then extend to length 3 using zeros, then drop the even numbers.


Take a list of people records (name, age); show me all ages, then pad to 3, then strip out the evens.


Take a list of people records (name, age); pluck the age field from each record, then extend to length 3 using zeros, then drop the even numbers.


Take a list of people records (name, age); get the age field, then pad to 3, then strip out the evens.


Take a list of people records (name, age); keep just each person's age, then extend to length 3 using zeros, then drop the even numbers.


Take a list of people records (name, age); extract age values, then pad to 3, then strip out the evens.


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


Take a list of people records (name, age); extract the ages, then pad with zeros to at least three elements, then keep the odd numbers.


Take a list of integers; sort by absolute value, then extend to length 3 using zeros, then drop anything not divisible by three.


Take a list of integers; rearrange by distance from zero, then pad to 3, then filter out everything except multiples of three.


Take a list of integers; arrange by magnitude ignoring sign, then extend to length 3 using zeros, then keep only multiples of three.


Take a list of integers; put them in order by magnitude, then pad to 3, then multiples of three only.


Take a list of integers; arrange in order of absolute value, then extend to length 3 using zeros, then filter for numbers divisible by three.


Take a list of integers; sort by distance from zero, then pad to 3, then give me only the values divisible by three.


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


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


Take a list of integers; if empty, use a single zero, then increase every value by 10, then deduplicate the list.


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


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then deduplicate the list.


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


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then deduplicate the list.


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


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


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


Take a list of integers; cap each value at 10, then keep only even values, then multiply each by -1.


Take a list of integers; clip values at 10, then extract all even numbers, then negate.


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


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


Take a list of integers; subtract one from each, then increase every value by 10, then true if any value equals zero.


Take a list of integers; Decrement all items, then add 10 to each item, then check for zero.


Take a list of integers; decrement each value, then shift each up by ten, then true if any value equals zero.


Take a list of integers; Lower each number by one, then increase all numbers by 10, then check for zero.


Take a list of integers; reduce each by one, then add 10 to everything, then true if any value equals zero.


Take a list of integers; Subtract 1 from all, then give everything a boost of 10, then check for zero.


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


Take a list of integers; subtract one from each, then add ten to each, then return whether the list contains a zero.


Take a list of integers; reverse the order, then make every value non-negative, then trim one element off each end.


Take a list of integers; reverse, then absolute value for all items, then cut off the first and last.


Take a list of integers; flip the list around, then take absolute values, then remove the first and last elements.


Take a list of integers; flip the order around, then turn negatives into positives, then keep only the middle part.


Take a list of integers; put the elements backwards, then abs each element, then drop first and last.


Take a list of integers; reverse that for me, then take the absolute value of each, then eliminate the outermost elements.


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


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


Take a list of integers; keep only the last three, then order by distance from zero, then arrange in decreasing order.