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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then find the min, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then minimum value, zero otherwise.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then get the minimum value or zero if empty.


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then return the smallest number, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then return smallest or zero if empty.


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


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


Take a list of integers; drop the zeros, then remove repeated values, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then unique values preserving order, then check for zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the leading run of positive numbers, then find the max, defaulting to 0.


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


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then What's the highest number in the list.


Take a list of integers; drop duplicates but keep the first one, then keep going while positive, then Return the greatest value or default to 0.


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then Find the largest element, defaulting to zero.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then give the largest value (0 if none).


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(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; drop duplicates keeping first occurrence, then take values while they are positive, then return the maximum (0 if empty).


Take a list of integers; keep everything before the first zero, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; take only what comes before the initial zero, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; cut the list at the first zero, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; cut off after the first zero appears, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; take values up to (excluding) the first zero, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; keep the part before the first 0, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


Take a list of integers; keep everything before the first zero, then cap each value at 10, then return the first even value (0 if none).


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


Take a list of integers; cut the leading negatives, then take values while they are positive, then does this list go in ascending order.


Take a list of integers; skip negatives at the start, then take positive values then stop, then check if the list is in ascending order.


Take a list of integers; remove all negatives at the front, then keep going while positive, then is the list sorted.


Take a list of integers; remove the initial run of negative numbers, then stop at first non positive, then is it sorted.


Take a list of integers; strip the front negatives, then take while greater than zero, then check if values are in increasing order.


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


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


Take a list of integers; add ten to each, then take the final 3 elements, then give back the total.


Take a list of integers; bump everything up by 10, then drop everything except the final three, then sum r.


Take a list of integers; increase every value by 10, then give me the last three elements, then add them up.


Take a list of integers; add 10 to each item, then keep only the last three, then calculate the sum of all elements.


Take a list of integers; shift each up by ten, then keep the final three items, then what's the total.


Take a list of integers; increase all numbers by 10, then take the last three, then what do they add up to.


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


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


Take a list of integers; take the absolute value of each, then increase every value by 10, then give back the total.


Take a list of integers; convert to absolute value, then add 10 to each item, then sum r.


Take a list of integers; strip the signs, then shift each up by ten, then add them up.


Take a list of integers; take abs of each, then increase all numbers by 10, then calculate the sum of all elements.


Take a list of integers; get the absolute value of everything, then add 10 to everything, then what's the total.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then what do they add up to.


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


Take a list of integers; take the absolute value of each, then add ten to each, then return their sum.


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


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


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


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then flip the list around, then limit every value to 10.


Take a list of people records (name, age); show me all ages, then flip the order around, then maximum of 10 for all.


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


Take a list of people records (name, age); get the age field, then reverse that for me, then maximum of 10 for all.


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


Take a list of people records (name, age); extract age values, then make it backwards, then maximum of 10 for all.


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


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


Take a list of integers; sort by absolute value, then keep the leading run of positive numbers, then arrange in decreasing order.


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


Take a list of integers; arrange by magnitude ignoring sign, then take positive values then stop, then reverse sort.


Take a list of integers; put them in order by magnitude, then keep going while positive, then sort largest to smallest.


Take a list of integers; arrange in order of absolute value, then stop at first non positive, then sort by descending values.


Take a list of integers; sort by distance from zero, then take while greater than zero, then sort from highest to lowest.


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


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


Take a list of integers; keep only the last three, then keep values divisible by 3, then arrange in increasing order.


Take a list of integers; keep the final three items, then keep items where x mod 3 equals zero, then Organize these ascending.


Take a list of integers; take the last three, then drop anything not divisible by three, then Sort in ascending order.


Take a list of integers; trim to the last three, then filter out everything except multiples of three, then I need this sorted ascending.


Take a list of integers; last three only, then keep only multiples of three, then Put these in ascending order.


Take a list of integers; truncate to the last three items, then multiples of three only, then sort smallest to largest.


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


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


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


Take a list of integers; keep the final three items, then filter for positive numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take the last three, then keep only positive numbers, then ensure at least three items by appending zeros.


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


Take a list of integers; last three only, then remove negatives, then ensure at least three items by appending zeros.


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


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


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


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


Take a list of integers; sort largest first, then extract all even numbers, then increase all numbers by 10.


Take a list of integers; sort in descending order, then keep only even values, then add 10 to everything.


Take a list of integers; sort from greatest to least, then extract all even numbers, then give everything a boost of 10.


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


Take a list of integers; arrange in decreasing order, then extract all even numbers, then add a constant 10 to each.


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


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


Take a list of integers; subtract one from each, then cut the list at the first zero, then skip the first one.


Take a list of integers; Decrement all items, then cut off after the first zero appears, then Discard the first element.


Take a list of integers; decrement each value, then take values up to (excluding) the first zero, then skip the first one.


Take a list of integers; Lower each number by one, then keep the part before the first 0, then Discard the first element.


Take a list of integers; reduce each by one, then truncate at the first zero, then skip the first one.


Take a list of integers; Subtract 1 from all, then delete everything starting with the first zero, then Discard the first element.


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


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


Take a list of integers; keep the negative numbers, then remove both ends, then true if any value equals zero.


Take a list of integers; extract negatives, then trim the edges, then check for zero.


Take a list of integers; keep the negative numbers, then trim one element off each end, then true if any value equals zero.


Take a list of integers; extract negatives, then cut off the first and last, then check for zero.


Take a list of integers; keep the negative numbers, then remove the first and last elements, then true if any value equals zero.


Take a list of integers; extract negatives, then keep only the middle part, then check for zero.


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


Take a list of integers; keep the negative numbers, then drop the first and last elements, then return whether the list contains a zero.


Take a list of integers; keep everything before the first zero, then flip the sign of each, then true only if all are positive.


Take a list of integers; take only what comes before the initial zero, then turn positives to negatives and vice versa, then do all of these have positive values.


Take a list of integers; cut the list at the first zero, then flip the sign of each, then check if every value is positive.


Take a list of integers; cut off after the first zero appears, then turn positives to negatives and vice versa, then confirm all values are positive.


Take a list of integers; take values up to (excluding) the first zero, then flip the sign of each, then all positive.


Take a list of integers; keep the part before the first 0, then turn positives to negatives and vice versa, then check if every number is above zero.


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


Take a list of integers; keep everything before the first zero, then negate each, then return whether all values are positive.


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


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then Discard the first element.


Take a list of integers; drop the zeros, then remove the initial run of negative numbers, then skip the first one.


Take a list of integers; keep only nonzero elements, then strip the front negatives, then Discard the first element.


Take a list of integers; drop the zeros, then remove leading negative numbers, then skip the first one.


Take a list of integers; keep only nonzero elements, then drop negatives from start, then Discard the first element.


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


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


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


Take a list of integers; cut the leading negatives, then Ascending sort, then strip the zeros.


Take a list of integers; skip negatives at the start, then Sort this ascending, then keep only non-zero numbers.


Take a list of integers; remove all negatives at the front, then Sort lowest to highest, then strip the zeros.


Take a list of integers; remove the initial run of negative numbers, then Arrange from smallest to largest, then keep only non-zero numbers.


Take a list of integers; strip the front negatives, then sort ascending, then strip the zeros.


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


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


Take a list of integers; drop the first and last elements, then increment each value, then find the min, defaulting to 0.


Take a list of integers; take out the first and last items, then plus one for all, then minimum value, zero otherwise.


Take a list of integers; remove both ends, then increment each value, then get the minimum value or zero if empty.


Take a list of integers; trim the edges, then plus one for all, then give me the min or 0.


Take a list of integers; trim one element off each end, then increment each value, then return the smallest number, defaulting to 0.


Take a list of integers; cut off the first and last, then plus one for all, then return smallest or zero if empty.


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


Take a list of integers; drop the first and last elements, then add one to each, then return the minimum (0 if empty).


Take a list of integers; keep only the last three, then flip the sign of each, then drop anything not divisible by three.


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


Take a list of integers; take the last three, then flip the sign of each, then keep only multiples of three.


Take a list of integers; trim to the last three, then turn positives to negatives and vice versa, then multiples of three only.


Take a list of integers; last three only, then flip the sign of each, then filter for numbers divisible by three.


Take a list of integers; truncate to the last three items, then turn positives to negatives and vice versa, then give me only the values divisible by three.


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


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


Take a list of integers; keep values greater than five, then increment each value, then replace an empty list with one zero.


Take a list of integers; filter out values less than or equal to 5, then plus one for all, then zero it out if it's empty.


Take a list of integers; keep only numbers above 5, then increment each value, then use zero if the list is empty.


Take a list of integers; exclude values of 5 and below, then plus one for all, then default to zero when empty.


Take a list of integers; remove anything 5 or less, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; filter to keep only values above 5, then plus one for all, then if no items, add a zero.


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


Take a list of integers; keep values greater than five, then add one to each, then if empty, use a single zero.


Take a list of integers; take values while they are positive, then default to [0] when there is nothing, then bump each up by one.


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


Take a list of integers; keep going while positive, then replace an empty list with one zero, then bump each up by one.


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


Take a list of integers; take while greater than zero, then use zero if the list is empty, then bump each up by one.


Take a list of integers; take values while positive, then default to zero when empty, then increment each item.


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


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


Take a list of integers; take values while they are positive, then keep values below zero, then keep only numbers above 5.


Take a list of integers; take positive values then stop, then get the negative numbers, then exclude values of 5 and below.


Take a list of integers; keep going while positive, then keep values below zero, then remove anything 5 or less.


Take a list of integers; stop at first non positive, then get the negative numbers, then filter to keep only values above 5.


Take a list of integers; take while greater than zero, then keep values below zero, then get rid of values that aren't greater than five.


Take a list of integers; take values while positive, then get the negative numbers, then drop anything 5 or below.


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


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


Take a list of integers; keep only the last three, then keep the leading run of positive numbers, then remove the initial run of negative numbers.


Take a list of integers; keep the final three items, then take values while they are positive, then strip the front negatives.


Take a list of integers; take the last three, then take positive values then stop, then remove leading negative numbers.


Take a list of integers; trim to the last three, then keep going while positive, then drop negatives from start.


Take a list of integers; last three only, then stop at first non positive, then strip negative values from the start.


Take a list of integers; truncate to the last three items, then take while greater than zero, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep multiples of three, then cut the list at the first zero, then truncate to three items.


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


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


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


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


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


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


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


Take a list of integers; double each, then increase every value by 10, then drop the odd numbers.


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


Take a list of integers; double each, then shift each up by ten, then drop the odd numbers.


Take a list of integers; times two for each item, then increase all numbers by 10, then filter out the odd numbers.


Take a list of integers; double each, then add 10 to everything, then drop the odd numbers.


Take a list of integers; times two for each item, then give everything a boost of 10, then filter out the odd numbers.


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


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


Take a list of integers; drop the leading negative values, then make every value non-negative, then true if already sorted smallest to largest.


Take a list of integers; cut the leading negatives, then absolute value for all items, then does this list go in ascending order.


Take a list of integers; skip negatives at the start, then take absolute values, then check if the list is in ascending order.


Take a list of integers; remove all negatives at the front, then turn negatives into positives, then is the list sorted.


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


Take a list of integers; strip the front negatives, then take the absolute value of each, then check if values are in increasing order.


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


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


Take a list of integers; pad with zeros to at least three elements, then drop anything 5 or below, then true if any value equals zero.


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


Take a list of integers; pad with zeros to at least three elements, then filter for numbers above 5, then true if any value equals zero.


Take a list of integers; add zeros until the list has at least three values, then give me values where x is greater than 5, then check for zero.


Take a list of integers; pad with zeros to at least three elements, then show me only the values that are bigger than five, then true if any value equals zero.


Take a list of integers; add zeros until the list has at least three values, then keep values greater than five, then check for zero.


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


Take a list of integers; pad with zeros to at least three elements, then keep values greater than five, then return whether the list contains a zero.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then give back the total.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then sum r.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then add them up.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then calculate the sum of all elements.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then what's the total.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then what do they add up to.


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


Take a list of integers; pad with zeros to at least three elements, then drop the zeros, then return their sum.


Take a list of integers; take the absolute value of each, then take the final 3 elements, then truncate to three items.


Take a list of integers; convert to absolute value, then drop everything except the final three, then show the first three.


Take a list of integers; strip the signs, then give me the last three elements, then take the first three.


Take a list of integers; take abs of each, then keep only the last three, then keep first 3.


Take a list of integers; get the absolute value of everything, then keep the final three items, then truncate to first three.


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


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


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


Take a list of integers; add ten to each, then keep only odd values, then find the max, defaulting to 0.


Take a list of integers; bump everything up by 10, then eliminate the even numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; increase every value by 10, then keep only odd values, then What's the highest number in the list.


Take a list of integers; add 10 to each item, then eliminate the even numbers, then Return the greatest value or default to 0.


Take a list of integers; shift each up by ten, then keep only odd values, then Find the largest element, defaulting to zero.


Take a list of integers; increase all numbers by 10, then eliminate the even numbers, then give the largest value (0 if none).


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


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


Take a list of integers; double each, then remove both ends, then true if any value equals zero.


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


Take a list of integers; double each, then trim one element off each end, then true if any value equals zero.


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


Take a list of integers; double each, then remove the first and last elements, then true if any value equals zero.


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


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


Take a list of integers; double each, then drop the first and last elements, then return whether the list contains a zero.


Take a list of integers; sort ascending, then flip the sign of each, then skip the first one.


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then Discard the first element.


Take a list of integers; arrange in increasing order, then flip the sign of each, then skip the first one.


Take a list of integers; Organize these ascending, then turn positives to negatives and vice versa, then Discard the first element.


Take a list of integers; Sort in ascending order, then flip the sign of each, then skip the first one.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then Discard the first element.


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


Take a list of integers; sort ascending, then negate each, then drop the first element.


Take a list of integers; cap each value at 10, then drop anything 5 or below, then raise each to the power of two.


Take a list of integers; clip values at 10, then keep only numbers greater than 5, then I need each number multiplied by itself.


Take a list of integers; cap each value at 10, then filter for numbers above 5, then square all of them.


Take a list of integers; clip values at 10, then give me values where x is greater than 5, then multiply each element by itself.


Take a list of integers; cap each value at 10, then show me only the values that are bigger than five, then make each one squared.


Take a list of integers; clip values at 10, then keep values greater than five, then square each value in the list.


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


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


Take a list of integers; drop the first and last elements, then increase every value by 10, then keep only numbers above 5.


Take a list of integers; take out the first and last items, then add 10 to each item, then exclude values of 5 and below.


Take a list of integers; remove both ends, then shift each up by ten, then remove anything 5 or less.


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


Take a list of integers; trim one element off each end, then add 10 to everything, then get rid of values that aren't greater than five.


Take a list of integers; cut off the first and last, then give everything a boost of 10, then drop anything 5 or below.


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


Take a list of integers; drop the first and last elements, then add ten to each, then keep values greater than five.


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


Take a list of integers; get rid of anything that's not positive, then double each item in the list, then do all of these have positive values.


Take a list of integers; drop non-positive values, then multiply each by two, then check if every value is positive.


Take a list of integers; drop the negative numbers, then double each item in the list, then confirm all values are positive.


Take a list of integers; filter out the negative ones, then multiply each by two, then all positive.


Take a list of integers; remove all negative values, then double each item in the list, then check if every number is above zero.


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


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


Take a list of integers; sort by absolute value, then multiply each value by itself, then reduce each by one.


Take a list of integers; rearrange by distance from zero, then square them all, then Subtract 1 from all.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then Subtract one from each.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then Drop each by one.


Take a list of integers; arrange in order of absolute value, then square all of them, then Decrease all values by one.


Take a list of integers; sort by distance from zero, then multiply each element by itself, then Remove one from each value.


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


Take a list of integers; sort by absolute value, then square each, then subtract one from each.


Take a list of integers; drop the leading negative values, then keep only even values, then find the max, defaulting to 0.


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


Take a list of integers; skip negatives at the start, then keep only even values, then What's the highest number in the list.


Take a list of integers; remove all negatives at the front, then extract all even numbers, then Return the greatest value or default to 0.


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then Find the largest element, defaulting to zero.


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


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


Take a list of strings; drop empty strings, then order strings from shortest to longest, then remove short strings (under 3 chars).


Take a list of strings; get rid of blanks, then shortest to longest, then only keep strings with three or more characters.


Take a list of strings; remove blanks, then arrange by string length ascending, then keep only strings that are at least three characters long.


Take a list of strings; eliminate empty string values, then length sort, then filter strings shorter than 3 chars.


Take a list of strings; filter out blank strings, then sort by length shortest first, then drop anything shorter than three characters.


Take a list of strings; remove strings that are empty, then organize by string length least to greatest, then keep only strings of length 3 or more.


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


Take a list of strings; drop empty strings, then sort by length, shortest first, then drop strings shorter than three characters.


Take a list of integers; sort descending, then multiply each value by itself, then arrange by magnitude ignoring sign.


Take a list of integers; sort largest first, then square them all, then put them in order by magnitude.


Take a list of integers; sort in descending order, then raise each to the power of two, then arrange in order of absolute value.


Take a list of integers; sort from greatest to least, then I need each number multiplied by itself, then sort by distance from zero.


Take a list of integers; sort z to a, then square all of them, then order by how far from zero.


Take a list of integers; arrange in decreasing order, then multiply each element by itself, then order by distance from zero.


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


Take a list of integers; sort descending, then square each, then sort by absolute value.


Take a list of integers; negate each, then take the final 3 elements, then shift each up by ten.


Take a list of integers; reverse the signs of everything, then drop everything except the final three, then increase all numbers by 10.


Take a list of integers; negate each, then give me the last three elements, then add 10 to everything.


Take a list of integers; reverse the signs of everything, then keep only the last three, then give everything a boost of 10.


Take a list of integers; negate each, then keep the final three items, then increment each by ten.


Take a list of integers; reverse the signs of everything, then take the last three, then add a constant 10 to each.


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


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


Take a list of integers; drop the first element, then take the final 3 elements, then drop non-positive values.


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


Take a list of integers; drop the first element, then give me the last three elements, then filter out the negative ones.


Take a list of integers; Take everything except the first, then keep only the last three, then remove all negative values.


Take a list of integers; drop the first element, then keep the final three items, then keep positive values only.


Take a list of integers; Take everything except the first, then take the last three, then keep values above zero.


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


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


Take a list of integers; add ten to each, then remove both ends, then arrange by magnitude ignoring sign.


Take a list of integers; bump everything up by 10, then trim the edges, then put them in order by magnitude.


Take a list of integers; increase every value by 10, then trim one element off each end, then arrange in order of absolute value.


Take a list of integers; add 10 to each item, then cut off the first and last, then sort by distance from zero.


Take a list of integers; shift each up by ten, then remove the first and last elements, then order by how far from zero.


Take a list of integers; increase all numbers by 10, then keep only the middle part, then order by distance from zero.


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


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


Take a list of integers; cap each value at 10, then keep values above zero, then put the elements backwards.


Take a list of integers; clip values at 10, then filter for positive numbers, then reverse that for me.


Take a list of integers; cap each value at 10, then keep only positive numbers, then flip it backwards.


Take a list of integers; clip values at 10, then keep the positives, then make it backwards.


Take a list of integers; cap each value at 10, then remove negatives, then reverse the list.


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


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


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


Take a list of integers; drop the zeros, then keep values above zero, then true if every value is unique.


Take a list of integers; keep only nonzero elements, then filter for positive numbers, then check for duplicates in the values.


Take a list of integers; drop the zeros, then keep only positive numbers, then do all values appear only once.


Take a list of integers; keep only nonzero elements, then keep the positives, then check that there are no duplicates.


Take a list of integers; drop the zeros, then remove negatives, then are the values all unique.


Take a list of integers; keep only nonzero elements, then keep the positive numbers, then check if all values are unique.


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


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


Take a list of integers; double each, then keep the leading run of positive numbers, then truncate to three items.


Take a list of integers; times two for each item, then take values while they are positive, then show the first three.


Take a list of integers; double each, then take positive values then stop, then take the first three.


Take a list of integers; times two for each item, then keep going while positive, then keep first 3.


Take a list of integers; double each, then stop at first non positive, then truncate to first three.


Take a list of integers; times two for each item, then take while greater than zero, then first three.


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


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


Take a list of integers; subtract one from each, then remove the first item, then keep only numbers above 5.


Take a list of integers; Decrement all items, then Remove head, then exclude values of 5 and below.


Take a list of integers; decrement each value, then remove the first item, then remove anything 5 or less.


Take a list of integers; Lower each number by one, then Remove head, then filter to keep only values above 5.


Take a list of integers; reduce each by one, then remove the first item, then get rid of values that aren't greater than five.


Take a list of integers; Subtract 1 from all, then Remove head, then drop anything 5 or below.


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


Take a list of integers; subtract one from each, then drop the first element, then keep values greater than five.


Take a list of integers; drop the first element, then keep values above zero, then ensure at least three items by appending zeros.


Take a list of integers; Take everything except the first, then filter for positive numbers, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop the first element, then keep only positive numbers, then ensure at least three items by appending zeros.


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


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


Take a list of integers; Take everything except the first, then keep the positive numbers, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; times two for each item, then plus one for all, then any even.


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


Take a list of integers; double each, then add one to each, then return whether any value is even.


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


Take a list of integers; Take everything except the first, then eliminate the even numbers, then strip the front negatives.


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


Take a list of integers; Take everything except the first, then eliminate the even numbers, then drop negatives from start.


Take a list of integers; drop the first element, then keep only odd values, then strip negative values from the start.


Take a list of integers; Take everything except the first, then eliminate the even numbers, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; reverse, then absolute value for all items, then remove repeats.


Take a list of integers; flip the list around, then take absolute values, then deduplicate the list.


Take a list of integers; flip the order around, then turn negatives into positives, then remove repeats.


Take a list of integers; put the elements backwards, then abs each element, then deduplicate the list.


Take a list of integers; reverse that for me, then take the absolute value of each, then remove repeats.


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


Take a list of integers; reverse the order, then take the absolute value of each, then drop duplicates keeping first occurrence.


Take a list of integers; drop the leading negative values, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; cut the leading negatives, then cut off after the first zero appears, then show only the last three.


Take a list of integers; skip negatives at the start, then take values up to (excluding) the first zero, then remove all but the last three.


Take a list of integers; remove all negatives at the front, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; remove the initial run of negative numbers, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; strip the front negatives, then delete everything starting with the first zero, then give me the last three elements.


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


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


Take a list of integers; drop the first element, then default to [0] when there is nothing, then multiply each by -1.


Take a list of integers; Take everything except the first, then when the list is empty, substitute a zero value, then negate.


Take a list of integers; drop the first element, then replace an empty list with one zero, then multiply each by -1.


Take a list of integers; Take everything except the first, then zero it out if it's empty, then negate.


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


Take a list of integers; Take everything except the first, then default to zero when empty, then negate.


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


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


Take a list of integers; keep the even numbers, then flip the list around, then truncate to the last three items.


Take a list of integers; keep evens, then flip the order around, then show only the last three.


Take a list of integers; keep the even numbers, then put the elements backwards, then remove all but the last three.


Take a list of integers; keep evens, then reverse that for me, then take the final 3 elements.


Take a list of integers; keep the even numbers, then flip it backwards, then drop everything except the final three.


Take a list of integers; keep evens, then make it backwards, then give me the last three elements.


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


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


Take a list of integers; add ten to each, then skip negatives at the start, then skip the first one.


Take a list of integers; bump everything up by 10, then remove all negatives at the front, then Discard the first element.


Take a list of integers; increase every value by 10, then remove the initial run of negative numbers, then skip the first one.


Take a list of integers; add 10 to each item, then strip the front negatives, then Discard the first element.


Take a list of integers; shift each up by ten, then remove leading negative numbers, then skip the first one.


Take a list of integers; increase all numbers by 10, then drop negatives from start, then Discard the first element.


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


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


Take a list of integers; cap each value at 10, then keep values above zero, then find the max, defaulting to 0.


Take a list of integers; clip values at 10, then filter for positive numbers, then Give me the maximum, but 0 if there are no items.


Take a list of integers; cap each value at 10, then keep only positive numbers, then What's the highest number in the list.


Take a list of integers; clip values at 10, then keep the positives, then Return the greatest value or default to 0.


Take a list of integers; cap each value at 10, then remove negatives, then Find the largest element, defaulting to zero.


Take a list of integers; clip values at 10, then keep the positive numbers, then give the largest value (0 if none).


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


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


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


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


Take a list of integers; strip the signs, then shift each up by ten, then tell me the length.


Take a list of integers; take abs of each, then increase all numbers by 10, then return the length.


Take a list of integers; get the absolute value of everything, then add 10 to everything, then count them.


Take a list of integers; apply absolute value to the whole list, then give everything a boost of 10, then what's the count.


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


Take a list of integers; take the absolute value of each, then add ten to each, then return how many remain.


Take a list of integers; negate each, then cut the list at the first zero, then find the max, defaulting to 0.


Take a list of integers; reverse the signs of everything, then cut off after the first zero appears, then Give me the maximum, but 0 if there are no items.


Take a list of integers; negate each, then take values up to (excluding) the first zero, then What's the highest number in the list.


Take a list of integers; reverse the signs of everything, then keep the part before the first 0, then Return the greatest value or default to 0.


Take a list of integers; negate each, then truncate at the first zero, then Find the largest element, defaulting to zero.


Take a list of integers; reverse the signs of everything, then delete everything starting with the first zero, then give the largest value (0 if none).


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


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


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


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


Take a list of integers; take the first 3 elements, then remove repeated values, then flip it backwards.


Take a list of integers; remove everything after the third, then unique values preserving order, then make it backwards.


Take a list of integers; truncate to three items, then remove repeated values, then reverse the list.


Take a list of integers; show the first three, then unique values preserving order, then invert the sequence.


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


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


Take a list of integers; sort ascending, then remove both ends, then shift each up by ten.


Take a list of integers; Sort it from low to high, then trim the edges, then increase all numbers by 10.


Take a list of integers; arrange in increasing order, then trim one element off each end, then add 10 to everything.


Take a list of integers; Organize these ascending, then cut off the first and last, then give everything a boost of 10.


Take a list of integers; Sort in ascending order, then remove the first and last elements, then increment each by ten.


Take a list of integers; I need this sorted ascending, then keep only the middle part, then add a constant 10 to each.


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


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


Take a list of integers; take values while they are positive, then default to [0] when there is nothing, then give back the total.


Take a list of integers; take positive values then stop, then when the list is empty, substitute a zero value, then sum r.


Take a list of integers; keep going while positive, then replace an empty list with one zero, then add them up.


Take a list of integers; stop at first non positive, then zero it out if it's empty, then calculate the sum of all elements.


Take a list of integers; take while greater than zero, then use zero if the list is empty, then what's the total.


Take a list of integers; take values while positive, then default to zero when empty, 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 = r if r else [0]
    return sum(r)


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


Take a list of integers; negate each, then keep values divisible by 3, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then keep items where x mod 3 equals zero, then strip out the evens.


Take a list of integers; negate each, then drop anything not divisible by three, then drop the even numbers.


Take a list of integers; reverse the signs of everything, then filter out everything except multiples of three, then strip out the evens.


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


Take a list of integers; reverse the signs of everything, then multiples of three only, then strip out the evens.


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


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


Take a list of integers; reverse the order, then keep values divisible by 3, then true if at least one even value.


Take a list of integers; reverse, then keep items where x mod 3 equals zero, then any even.


Take a list of integers; flip the list around, then drop anything not divisible by three, then true if at least one even value.


Take a list of integers; flip the order around, then filter out everything except multiples of three, then any even.


Take a list of integers; put the elements backwards, then keep only multiples of three, then true if at least one even value.


Take a list of integers; reverse that for me, then multiples of three only, then any even.


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


Take a list of integers; reverse the order, then keep multiples of three, then return whether any value is even.


Take a list of integers; drop the leading negative values, then increment each value, then truncate to three items.


Take a list of integers; cut the leading negatives, then plus one for all, then show the first three.


Take a list of integers; skip negatives at the start, then increment each value, then take the first three.


Take a list of integers; remove all negatives at the front, then plus one for all, then keep first 3.


Take a list of integers; remove the initial run of negative numbers, then increment each value, then truncate to first three.


Take a list of integers; strip the front negatives, then plus one for all, then first three.


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


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


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


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


Take a list of integers; keep the even numbers, then raise each to the power of two, then take values while they are positive.


Take a list of integers; keep evens, then I need each number multiplied by itself, then take positive values then stop.


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


Take a list of integers; keep evens, then multiply each element by itself, then stop at first non positive.


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


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


Take a list of integers; keep values greater than five, then take the final 3 elements, then replace an empty list with one zero.


Take a list of integers; filter out values less than or equal to 5, then drop everything except the final three, then zero it out if it's empty.


Take a list of integers; keep only numbers above 5, then give me the last three elements, then use zero if the list is empty.


Take a list of integers; exclude values of 5 and below, then keep only the last three, then default to zero when empty.


Take a list of integers; remove anything 5 or less, then keep the final three items, then if there's nothing, put in a zero.


Take a list of integers; filter to keep only values above 5, then take the last three, then if no items, add a zero.


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


Take a list of integers; keep values greater than five, then keep only the last three, then if empty, use a single zero.


Take a list of integers; cap each value at 10, then remove repeated values, then arrange in increasing order.


Take a list of integers; clip values at 10, then unique values preserving order, then Organize these ascending.


Take a list of integers; cap each value at 10, then remove repeated values, then Sort in ascending order.


Take a list of integers; clip values at 10, then unique values preserving order, then I need this sorted ascending.


Take a list of integers; cap each value at 10, then remove repeated values, then Put these in ascending order.


Take a list of integers; clip values at 10, then unique values preserving order, then sort smallest to largest.


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


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


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


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


Take a list of integers; drop the first element, then give me the last three elements, then check if the list is in ascending order.


Take a list of integers; Take everything except the first, then keep only the last three, then is the list sorted.


Take a list of integers; drop the first element, then keep the final three items, then is it sorted.


Take a list of integers; Take everything except the first, then take the last three, then check if values are in increasing order.


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


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


Take a list of people records (name, age); extract the ages, then remove all zero values, then skip the first one.


Take a list of people records (name, age); show me all ages, then exclude zeros, then Discard the first element.


Take a list of people records (name, age); pluck the age field from each record, then remove all zero values, then skip the first one.


Take a list of people records (name, age); get the age field, then exclude zeros, then Discard the first element.


Take a list of people records (name, age); keep just each person's age, then remove all zero values, then skip the first one.


Take a list of people records (name, age); extract age values, then exclude zeros, then Discard the first element.


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


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


Take a list of integers; sort by absolute value, then keep only even values, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then extract all even numbers, then check for duplicates in the values.


Take a list of integers; arrange by magnitude ignoring sign, then keep only even values, then do all values appear only once.


Take a list of integers; put them in order by magnitude, then extract all even numbers, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then keep only even values, then are the values all unique.


Take a list of integers; sort by distance from zero, then extract all even numbers, then check if all values are unique.


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


Take a list of integers; sort by absolute value, then keep the even numbers, then return whether all values are distinct.


Take a list of integers; subtract one from each, then cut the list at the first zero, then arrange in decreasing order.


Take a list of integers; Decrement all items, then cut off after the first zero appears, then arrange in descending order.


Take a list of integers; decrement each value, then take values up to (excluding) the first zero, then reverse sort.


Take a list of integers; Lower each number by one, then keep the part before the first 0, then sort largest to smallest.


Take a list of integers; reduce each by one, then truncate at the first zero, then sort by descending values.


Take a list of integers; Subtract 1 from all, then delete everything starting with the first zero, then sort from highest to lowest.


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


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


Take a list of integers; square each, then increment each value, then give back the total.


Take a list of integers; each value squared, then plus one for all, then sum r.


Take a list of integers; multiply each value by itself, then increment each value, then add them up.


Take a list of integers; square them all, then plus one for all, then calculate the sum of all elements.


Take a list of integers; raise each to the power of two, then increment each value, then what's the total.


Take a list of integers; I need each number multiplied by itself, then plus one for all, then what do they add up to.


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


Take a list of integers; square each, then add one to each, then return their sum.


Take a list of integers; keep only the last three, then increase every value by 10, then replace an empty list with one zero.


Take a list of integers; keep the final three items, then add 10 to each item, then zero it out if it's empty.


Take a list of integers; take the last three, then shift each up by ten, then use zero if the list is empty.


Take a list of integers; trim to the last three, then increase all numbers by 10, then default to zero when empty.


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


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then if no items, add a zero.


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


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


Take a list of integers; add ten to each, then default to [0] when there is nothing, then give back the total.


Take a list of integers; bump everything up by 10, then when the list is empty, substitute a zero value, then sum r.


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


Take a list of integers; add 10 to each item, then zero it out if it's empty, then calculate the sum of all elements.


Take a list of integers; shift each up by ten, then use zero if the list is empty, then what's the total.


Take a list of integers; increase all numbers by 10, then default to zero when empty, then what do they add up to.


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


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


Take a list of integers; drop the leading negative values, then take the final 3 elements, then raise each to the power of two.


Take a list of integers; cut the leading negatives, then drop everything except the final three, then I need each number multiplied by itself.


Take a list of integers; skip negatives at the start, then give me the last three elements, then square all of them.


Take a list of integers; remove all negatives at the front, then keep only the last three, then multiply each element by itself.


Take a list of integers; remove the initial run of negative numbers, then keep the final three items, then make each one squared.


Take a list of integers; strip the front negatives, then take the last three, then square each value in the list.


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


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


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


Take a list of integers; times two for each item, then eliminate the even numbers, then does this list go in ascending order.


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


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


Take a list of integers; double each, then keep only odd values, then is it sorted.


Take a list of integers; times two for each item, then eliminate the even numbers, then check if values are in increasing order.


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


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


Take a list of integers; keep the odd numbers, then keep values divisible by 3, then count the elements.


Take a list of integers; odd numbers only, then keep items where x mod 3 equals zero, then how many items remain.


Take a list of integers; keep the odd numbers, then drop anything not divisible by three, then tell me the length.


Take a list of integers; odd numbers only, then filter out everything except multiples of three, then return the length.


Take a list of integers; keep the odd numbers, then keep only multiples of three, then count them.


Take a list of integers; odd numbers only, then multiples of three only, then what's the count.


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


Take a list of integers; keep the odd numbers, then keep multiples of three, then return how many remain.


Take a list of integers; drop the leading negative values, then remove the first item, then give back the product of all values.


Take a list of integers; cut the leading negatives, then Remove head, then product of the list.


Take a list of integers; skip negatives at the start, then remove the first item, then what's the product.


Take a list of integers; remove all negatives at the front, then Remove head, then what do they multiply to.


Take a list of integers; remove the initial run of negative numbers, then remove the first item, then give me their product.


Take a list of integers; strip the front negatives, then Remove head, then multiply them all together.


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


Take a list of integers; drop the leading negative values, then drop the first element, then return their product.


Take a list of integers; keep the negative numbers, then sort smallest to largest, then arrange in decreasing order.


Take a list of integers; extract negatives, then Ascending sort, then arrange in descending order.


Take a list of integers; keep the negative numbers, then Sort this ascending, then reverse sort.


Take a list of integers; extract negatives, then Sort lowest to highest, then sort largest to smallest.


Take a list of integers; keep the negative numbers, then Arrange from smallest to largest, then sort by descending values.


Take a list of integers; extract negatives, then sort ascending, then sort from highest to lowest.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then decrement each value, then find the min, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then Lower each number by one, then minimum value, zero otherwise.


Take a list of integers; drop duplicates keeping first occurrence, then reduce each by one, then get the minimum value or zero if empty.


Take a list of integers; drop duplicates but keep the first one, then Subtract 1 from all, then give me the min or 0.


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each, then return the smallest number, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then Drop each by one, then return smallest or zero if empty.


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


Take a list of integers; drop duplicates keeping first occurrence, then subtract one from each, then return the minimum (0 if empty).


Take a list of integers; cap each value at 10, then decrement each value, then arrange in decreasing order.


Take a list of integers; clip values at 10, then Lower each number by one, then arrange in descending order.


Take a list of integers; cap each value at 10, then reduce each by one, then reverse sort.


Take a list of integers; clip values at 10, then Subtract 1 from all, then sort largest to smallest.


Take a list of integers; cap each value at 10, then Subtract one from each, then sort by descending values.


Take a list of integers; clip values at 10, then Drop each by one, then sort from highest to lowest.


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


Take a list of integers; cap each value at 10, then subtract one from each, then sort descending.


Take a list of integers; keep the odd numbers, then keep the leading run of positive numbers, then truncate to three items.


Take a list of integers; odd numbers only, then take values while they are positive, then show the first three.


Take a list of integers; keep the odd numbers, then take positive values then stop, then take the first three.


Take a list of integers; odd numbers only, then keep going while positive, then keep first 3.


Take a list of integers; keep the odd numbers, then stop at first non positive, then truncate to first three.


Take a list of integers; odd numbers only, then take while greater than zero, then first three.


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


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


Take a list of integers; drop the first and last elements, then flip the sign of each, then put the elements backwards.


Take a list of integers; take out the first and last items, then turn positives to negatives and vice versa, then reverse that for me.


Take a list of integers; remove both ends, then flip the sign of each, then flip it backwards.


Take a list of integers; trim the edges, then turn positives to negatives and vice versa, then make it backwards.


Take a list of integers; trim one element off each end, then flip the sign of each, then reverse the list.


Take a list of integers; cut off the first and last, then turn positives to negatives and vice versa, then invert the sequence.


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


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


Take a list of integers; add one to each, then multiply each by two, then reduce each by one.


Take a list of integers; make each one bigger, then double each item in the list, then Subtract 1 from all.


Take a list of integers; add one to each, then multiply each by two, then Subtract one from each.


Take a list of integers; make each one bigger, then double each item in the list, then Drop each by one.


Take a list of integers; add one to each, then multiply each by two, then Decrease all values by one.


Take a list of integers; make each one bigger, then double each item in the list, then Remove one from each value.


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


Take a list of integers; add one to each, then double each, then subtract one from each.


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


Take a list of integers; keep only nonzero elements, then add 10 to each item, then exclude values of 5 and below.


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


Take a list of integers; keep only nonzero elements, then increase all numbers by 10, then filter to keep only values above 5.


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


Take a list of integers; keep only nonzero elements, then give everything a boost of 10, then drop anything 5 or below.


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


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


Take a list of integers; sort by absolute value, then decrement each value, then raise each to the power of two.


Take a list of integers; rearrange by distance from zero, then Lower each number by one, then I need each number multiplied by itself.


Take a list of integers; arrange by magnitude ignoring sign, then reduce each by one, then square all of them.


Take a list of integers; put them in order by magnitude, then Subtract 1 from all, then multiply each element by itself.


Take a list of integers; arrange in order of absolute value, then Subtract one from each, then make each one squared.


Take a list of integers; sort by distance from zero, then Drop each by one, then square each value in the list.


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


Take a list of integers; sort by absolute value, then subtract one from each, then square each.


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


Take a list of people records (name, age); put the youngest at the top, then get the age field, then find how many values are divisible by two.


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


Take a list of people records (name, age); put the youngest at the top, then extract age values, then get the total number of even values in the list.


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then give me the count of even values.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then I need to know how many of these are even.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=lambda d: d['age'])
    r = [d['age'] for d in r]
    return sum(1 for x in r if x % 2 == 0)


Take a list of people records (name, age); sort records by age, youngest first, then extract the ages, then return how many values are even.


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then strip out the evens.


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


Take a list of integers; drop the zeros, then keep the negative numbers, then keep the odd numbers.


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


Take a list of integers; keep evens, then unique values preserving order, 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 = list(dict.fromkeys(r))
    return next((x for x in r if x % 2 == 0), 0)


Take a list of integers; keep the even numbers, then drop duplicates keeping first occurrence, then return the first even value (0 if none).


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


Take a list of integers; keep the first 3 items, then plus one for all, then filter out the odd numbers.


Take a list of integers; take the first 3 elements, then increment each value, then drop the odd numbers.


Take a list of integers; remove everything after the third, then plus one for all, then filter out the odd numbers.


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


Take a list of integers; show the first three, then plus one for all, then filter out the odd numbers.


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


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


Take a list of integers; drop the zeros, then keep the leading run of positive numbers, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then take values while they are positive, then any even.


Take a list of integers; drop the zeros, then take positive values then stop, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then keep going while positive, then any even.


Take a list of integers; drop the zeros, then stop at first non positive, then true if at least one even value.


Take a list of integers; keep only nonzero elements, then take while greater than zero, then any even.


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


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


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then do all of these have positive values.


Take a list of integers; drop the zeros, then keep values below zero, then check if every value is positive.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then confirm all values are positive.


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


Take a list of integers; keep only nonzero elements, then get the negative numbers, then check if every number is above zero.


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


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


Take a list of integers; keep only the last three, then drop anything 5 or below, then keep only non-zero numbers.


Take a list of integers; keep the final three items, then keep only numbers greater than 5, then strip the zeros.


Take a list of integers; take the last three, then filter for numbers above 5, then keep only non-zero numbers.


Take a list of integers; trim to the last three, then give me values where x is greater than 5, then strip the zeros.


Take a list of integers; last three only, then show me only the values that are bigger than five, then keep only non-zero numbers.


Take a list of integers; truncate to the last three items, then keep values greater than five, then strip the zeros.


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


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


Take a list of integers; keep the even numbers, then make every value non-negative, then drop the even numbers.


Take a list of integers; keep evens, then absolute value for all items, then strip out the evens.


Take a list of integers; keep the even numbers, then take absolute values, then drop the even numbers.


Take a list of integers; keep evens, then turn negatives into positives, then strip out the evens.


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


Take a list of integers; keep evens, then take the absolute value of each, then strip out the evens.


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


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


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


Take a list of integers; rearrange by distance from zero, then exclude zeros, then Discard the first element.


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


Take a list of integers; put them in order by magnitude, then exclude zeros, then Discard the first element.


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


Take a list of integers; sort by distance from zero, then exclude zeros, then Discard the first element.


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


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


Take a list of integers; drop the first and last elements, then increment each value, then reduce each by one.


Take a list of integers; take out the first and last items, then plus one for all, then Subtract 1 from all.


Take a list of integers; remove both ends, then increment each value, then Subtract one from each.


Take a list of integers; trim the edges, then plus one for all, then Drop each by one.


Take a list of integers; trim one element off each end, then increment each value, then Decrease all values by one.


Take a list of integers; cut off the first and last, then plus one for all, then Remove one from each value.


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


Take a list of integers; drop the first and last elements, then add one to each, then subtract one from each.


Take a list of integers; drop the first element, then make every value non-negative, then true only if all are positive.


Take a list of integers; Take everything except the first, then absolute value for all items, then do all of these have positive values.


Take a list of integers; drop the first element, then take absolute values, then check if every value is positive.


Take a list of integers; Take everything except the first, then turn negatives into positives, then confirm all values are positive.


Take a list of integers; drop the first element, then abs each element, then all positive.


Take a list of integers; Take everything except the first, then take the absolute value of each, then check if every number is above zero.


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


Take a list of integers; drop the first element, then take the absolute value of each, then return whether all values are positive.


Take a list of integers; negate each, then remove repeated values, then arrange in decreasing order.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then arrange in descending order.


Take a list of integers; negate each, then remove repeated values, then reverse sort.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then sort largest to smallest.


Take a list of integers; negate each, then remove repeated values, then sort by descending values.


Take a list of integers; reverse the signs of everything, then unique values preserving order, then sort from highest to lowest.


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


Take a list of integers; negate each, then drop duplicates keeping first occurrence, then sort descending.


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


Take a list of integers; Sort it from low to high, then unique values preserving order, then increment each item.


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


Take a list of integers; Organize these ascending, then unique values preserving order, then increment each item.


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


Take a list of integers; I need this sorted ascending, then unique values preserving order, then increment each item.


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


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


Take a list of integers; keep everything before the first zero, then make every value non-negative, then deduplicate the list.


Take a list of integers; take only what comes before the initial zero, then absolute value for all items, then remove repeats.


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


Take a list of integers; cut off after the first zero appears, then turn negatives into positives, then remove repeats.


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


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


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


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


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


Take a list of integers; Take everything except the first, then add 10 to each item, then exclude values of 5 and below.


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


Take a list of integers; Take everything except the first, then increase all numbers by 10, then filter to keep only values above 5.


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


Take a list of integers; Take everything except the first, then give everything a boost of 10, then drop anything 5 or below.


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


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


Take a list of integers; drop the first and last elements, then extend to length 3 using zeros, then truncate to the last three items.


Take a list of integers; take out the first and last items, then pad to 3, then show only the last three.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then remove all but the last three.


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


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then drop everything except the final three.


Take a list of integers; cut off the first and last, then pad to 3, then give me the last three elements.


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


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


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


Take a list of integers; cut the leading negatives, then eliminate the even numbers, then reverse that for me.


Take a list of integers; skip negatives at the start, then keep only odd values, then flip it backwards.


Take a list of integers; remove all negatives at the front, then eliminate the even numbers, then make it backwards.


Take a list of integers; remove the initial run of negative numbers, then keep only odd values, then reverse the list.


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


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


Take a list of integers; keep the negative numbers, then keep values above zero, then give the number of evens.


Take a list of integers; extract negatives, then filter for positive numbers, then find how many values are divisible by two.


Take a list of integers; keep the negative numbers, then keep only positive numbers, then how many are even.


Take a list of integers; extract negatives, then keep the positives, then get the total number of even values in the list.


Take a list of integers; keep the negative numbers, then remove negatives, then give me the count of even values.


Take a list of integers; extract negatives, then keep the positive numbers, then I need to know how many of these are even.


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


Take a list of integers; keep the negative numbers, then keep the positive numbers, then return how many values are even.


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


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


Take a list of integers; take the last three, then Sort this ascending, then remove the first and last elements.


Take a list of integers; trim to the last three, then Sort lowest to highest, then keep only the middle part.


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


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