Take a list of integers; decrement each value, then filter for numbers above 5, then ensure at least three items by appending zeros.


Take a list of integers; Lower each number by one, then give me values where x is greater than 5, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; reduce each by one, then show me only the values that are bigger than five, then ensure at least three items by appending zeros.


Take a list of integers; Subtract 1 from all, then keep values greater than five, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; subtract one from each, then keep values greater than five, then pad with zeros to at least three elements.


Take a list of integers; drop the zeros, then flip the list around, then bump each up by one.


Take a list of integers; keep only nonzero elements, then flip the order around, then increment each item.


Take a list of integers; drop the zeros, then put the elements backwards, then bump each up by one.


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


Take a list of integers; drop the zeros, then flip it backwards, then bump each up by one.


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


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


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


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


Take a list of integers; keep only nonzero elements, then keep items where x mod 3 equals zero, then keep the leading run of positive numbers.


Take a list of integers; drop the zeros, then drop anything not divisible by three, then take values while they are positive.


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then take positive values then stop.


Take a list of integers; drop the zeros, then keep only multiples of three, then keep going while positive.


Take a list of integers; keep only nonzero elements, then multiples of three only, then stop at first non positive.


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


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


Take a list of integers; keep the odd numbers, then take the first 3 elements, then shift each up by ten.


Take a list of integers; odd numbers only, then remove everything after the third, then increase all numbers by 10.


Take a list of integers; keep the odd numbers, then truncate to three items, then add 10 to everything.


Take a list of integers; odd numbers only, then show the first three, then give everything a boost of 10.


Take a list of integers; keep the odd numbers, then take the first three, then increment each by ten.


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then truncate at the first zero.


Take a list of integers; drop duplicates but keep the first one, then exclude zeros, then delete everything starting with the first zero.


Take a list of integers; drop duplicates keeping first occurrence, then remove all zero values, then remove from the first zero onwards.


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


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


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


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


Take a list of integers; keep evens, then Lower each number by one, then exclude values of 5 and below.


Take a list of integers; keep the even numbers, then reduce each by one, then remove anything 5 or less.


Take a list of integers; keep evens, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; keep the even numbers, then Subtract one from each, then get rid of values that aren't greater than five.


Take a list of integers; keep evens, then Drop each by one, then drop anything 5 or below.


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


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


Take a list of integers; keep the odd numbers, then increase every value by 10, then find the min, defaulting to 0.


Take a list of integers; odd numbers only, then add 10 to each item, then minimum value, zero otherwise.


Take a list of integers; keep the odd numbers, then shift each up by ten, then get the minimum value or zero if empty.


Take a list of integers; odd numbers only, then increase all numbers by 10, then give me the min or 0.


Take a list of integers; keep the odd numbers, then add 10 to everything, then return the smallest number, defaulting to 0.


Take a list of integers; odd numbers only, then give everything a boost of 10, then return smallest or zero if empty.


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


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


Take a list of integers; sort ascending, then multiply each by two, then true if any value equals zero.


Take a list of integers; Sort it from low to high, then double each item in the list, then check for zero.


Take a list of integers; arrange in increasing order, then multiply each by two, then true if any value equals zero.


Take a list of integers; Organize these ascending, then double each item in the list, then check for zero.


Take a list of integers; Sort in ascending order, then multiply each by two, then true if any value equals zero.


Take a list of integers; I need this sorted ascending, then double each item in the list, then check for zero.


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


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


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


Take a list of integers; times two for each item, then Remove head, then any even.


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


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


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


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then Organize these ascending.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then Sort in ascending order.


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


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


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then sort smallest to largest.


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


Take a list of integers; drop duplicates keeping first occurrence, then take values while they are positive, then sort ascending.


Take a list of integers; add ten to each, then remove repeated values, then arrange in increasing order.


Take a list of integers; bump everything up by 10, then unique values preserving order, then Organize these ascending.


Take a list of integers; increase every value by 10, then remove repeated values, then Sort in ascending order.


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


Take a list of integers; shift each up by ten, then remove repeated values, then Put these in ascending order.


Take a list of integers; increase all numbers by 10, then unique values preserving order, then sort smallest to largest.


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


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


Take a list of integers; keep values greater than five, then sort smallest to largest, then truncate to three items.


Take a list of integers; filter out values less than or equal to 5, then Ascending sort, then show the first three.


Take a list of integers; keep only numbers above 5, then Sort this ascending, then take the first three.


Take a list of integers; exclude values of 5 and below, then Sort lowest to highest, then keep first 3.


Take a list of integers; remove anything 5 or less, then Arrange from smallest to largest, then truncate to first three.


Take a list of integers; filter to keep only values above 5, then sort ascending, then first three.


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


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


Take a list of integers; sort by absolute value, then flip the sign of each, then find the min, defaulting to 0.


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


Take a list of integers; arrange by magnitude ignoring sign, then flip the sign of each, then get the minimum value or zero if empty.


Take a list of integers; put them in order by magnitude, then turn positives to negatives and vice versa, then give me the min or 0.


Take a list of integers; arrange in order of absolute value, then flip the sign of each, then return the smallest number, defaulting to 0.


Take a list of integers; sort by distance from zero, then turn positives to negatives and vice versa, then return smallest or zero if empty.


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


Take a list of integers; sort by absolute value, then negate each, then return the minimum (0 if empty).


Take a list of integers; keep the positive numbers, then keep values divisible by 3, then find the min, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then keep items where x mod 3 equals zero, then minimum value, zero otherwise.


Take a list of integers; drop non-positive values, then drop anything not divisible by three, then get the minimum value or zero if empty.


Take a list of integers; drop the negative numbers, then filter out everything except multiples of three, then give me the min or 0.


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


Take a list of integers; remove all negative values, then multiples of three only, then return smallest or zero if empty.


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


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


Take a list of integers; keep the odd numbers, then drop anything 5 or below, then limit every value to 10.


Take a list of integers; odd numbers only, then keep only numbers greater than 5, then maximum of 10 for all.


Take a list of integers; keep the odd numbers, then filter for numbers above 5, then limit every value to 10.


Take a list of integers; odd numbers only, then give me values where x is greater than 5, then maximum of 10 for all.


Take a list of integers; keep the odd numbers, then show me only the values that are bigger than five, then limit every value to 10.


Take a list of integers; odd numbers only, then keep values greater than five, then maximum of 10 for all.


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


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


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


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


Take a list of integers; arrange by magnitude ignoring sign, then Sort this ascending, then square all of them.


Take a list of integers; put them in order by magnitude, then Sort lowest to highest, then multiply each element by itself.


Take a list of integers; arrange in order of absolute value, then Arrange from smallest to largest, then make each one squared.


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


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


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


Take a list of people records (name, age); extract the ages, then keep the leading run of positive numbers, then replace an empty list with one zero.


Take a list of people records (name, age); show me all ages, then take values while they are positive, then zero it out if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then take positive values then stop, then use zero if the list is empty.


Take a list of people records (name, age); get the age field, then keep going while positive, then default to zero when empty.


Take a list of people records (name, age); keep just each person's age, then stop at first non positive, then if there's nothing, put in a zero.


Take a list of people records (name, age); extract age values, then take while greater than zero, then if no items, add a zero.


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


Take a list of people records (name, age); extract the ages, then take values while they are positive, then if empty, use a single zero.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then true if already sorted smallest to largest.


Take a list of integers; extract negatives, then don't let anything exceed 10, then does this list go in ascending order.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then check if the list is in ascending order.


Take a list of integers; extract negatives, then don't let anything exceed 10, then is the list sorted.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then is it sorted.


Take a list of integers; extract negatives, then don't let anything exceed 10, then check if values are in increasing order.


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


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


Take a list of integers; if empty, use a single zero, then clamp each to at most ten, then give the number of evens.


Take a list of integers; if blank use 0, then don't let anything exceed 10, then find how many values are divisible by two.


Take a list of integers; default to [0] when there is nothing, then clamp each to at most ten, then how many are even.


Take a list of integers; when the list is empty, substitute a zero value, then don't let anything exceed 10, then get the total number of even values in the list.


Take a list of integers; replace an empty list with one zero, then clamp each to at most ten, then give me the count of even values.


Take a list of integers; zero it out if it's empty, then don't let anything exceed 10, then I need to know how many of these are even.


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


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


Take a list of integers; sort descending, then increment each value, then stop at the first non-positive value.


Take a list of integers; sort largest first, then plus one for all, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then increment each value, then take values while they are positive.


Take a list of integers; sort from greatest to least, then plus one for all, then take positive values then stop.


Take a list of integers; sort z to a, then increment each value, then keep going while positive.


Take a list of integers; arrange in decreasing order, then plus one for all, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = sorted(r, reverse=True)
    r = [x + 1 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; sort descending, then add one to each, then take values while they are positive.


Take a list of people records (name, age); extract the ages, then keep values divisible by 3, then deduplicate the list.


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


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


Take a list of people records (name, age); get the age field, then filter out everything except multiples of three, then remove repeats.


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


Take a list of people records (name, age); extract age values, then multiples of three only, then remove repeats.


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


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


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then truncate to three items.


Take a list of integers; get rid of anything that's not positive, then don't let anything exceed 10, then show the first three.


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


Take a list of integers; drop the negative numbers, then don't let anything exceed 10, then keep first 3.


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


Take a list of integers; remove all negative values, then don't let anything exceed 10, then first three.


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


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


Take a list of integers; if empty, use a single zero, then take the final 3 elements, then truncate to three items.


Take a list of integers; if blank use 0, then drop everything except the final three, then show the first three.


Take a list of integers; default to [0] when there is nothing, then give me the last three elements, then take the first three.


Take a list of integers; when the list is empty, substitute a zero value, then keep only the last three, then keep first 3.


Take a list of integers; replace an empty list with one zero, then keep the final three items, then truncate to first three.


Take a list of integers; zero it out if it's empty, then take the last three, then first three.


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


Take a list of integers; if empty, use a single zero, then keep only the last three, then keep only the first three.


Take a list of integers; add ten to each, then keep values below zero, then give back the total.


Take a list of integers; bump everything up by 10, then get the negative numbers, then sum r.


Take a list of integers; increase every value by 10, then keep values below zero, then add them up.


Take a list of integers; add 10 to each item, then get the negative numbers, then calculate the sum of all elements.


Take a list of integers; shift each up by ten, then keep values below zero, then what's the total.


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


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


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


Take a list of integers; add one to each, then flip the list around, then true if at least one even value.


Take a list of integers; make each one bigger, then flip the order around, then any even.


Take a list of integers; add one to each, then put the elements backwards, then true if at least one even value.


Take a list of integers; make each one bigger, then reverse that for me, then any even.


Take a list of integers; add one to each, then flip it backwards, then true if at least one even value.


Take a list of integers; make each one bigger, then make it backwards, then any even.


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


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


Take a list of integers; pad with zeros to at least three elements, then decrement each value, then keep only numbers above 5.


Take a list of integers; add zeros until the list has at least three values, then Lower each number by one, then exclude values of 5 and below.


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


Take a list of integers; add zeros until the list has at least three values, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; pad with zeros to at least three elements, then Subtract one from each, then get rid of values that aren't greater than five.


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


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


Take a list of integers; pad with zeros to at least three elements, then subtract one from each, then keep values greater than five.


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


Take a list of integers; reverse the signs of everything, then exclude zeros, then Subtract 1 from all.


Take a list of integers; negate each, then remove all zero values, then Subtract one from each.


Take a list of integers; reverse the signs of everything, then exclude zeros, then Drop each by one.


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


Take a list of integers; reverse the signs of everything, then exclude zeros, then Remove one from each value.


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


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


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


Take a list of integers; if blank use 0, then exclude zeros, then check for duplicates in the values.


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


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


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


Take a list of integers; zero it out if it's empty, then exclude zeros, then check if all values are unique.


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


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


Take a list of integers; keep the even numbers, then multiply each by two, then arrange by magnitude ignoring sign.


Take a list of integers; keep evens, then double each item in the list, then put them in order by magnitude.


Take a list of integers; keep the even numbers, then multiply each by two, then arrange in order of absolute value.


Take a list of integers; keep evens, then double each item in the list, then sort by distance from zero.


Take a list of integers; keep the even numbers, then multiply each by two, then order by how far from zero.


Take a list of integers; keep evens, then double each item in the list, then order by distance from zero.


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


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


Take a list of integers; take values while they are positive, then multiply each value by itself, then true if any value equals zero.


Take a list of integers; take positive values then stop, then square them all, then check for zero.


Take a list of integers; keep going while positive, then raise each to the power of two, then true if any value equals zero.


Take a list of integers; stop at first non positive, then I need each number multiplied by itself, then check for zero.


Take a list of integers; take while greater than zero, then square all of them, then true if any value equals zero.


Take a list of integers; take values while positive, then multiply each element by itself, then check for zero.


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


Take a list of integers; take values while they are positive, then square each, then return whether the list contains a zero.


Take a list of integers; square each, then multiply each by two, then true if already sorted smallest to largest.


Take a list of integers; each value squared, then double each item in the list, then does this list go in ascending order.


Take a list of integers; multiply each value by itself, then multiply each by two, then check if the list is in ascending order.


Take a list of integers; square them all, then double each item in the list, then is the list sorted.


Take a list of integers; raise each to the power of two, then multiply each by two, then is it sorted.


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


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


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


Take a list of integers; keep everything before the first zero, then increment each value, then deduplicate the list.


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


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


Take a list of integers; cut off after the first zero appears, then plus one for all, then remove repeats.


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


Take a list of integers; keep the part before the first 0, then plus one for all, then remove repeats.


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


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


Take a list of integers; keep only the first three, then remove the first item, then remove the initial run of negative numbers.


Take a list of integers; keep the first 3 items, then Remove head, then strip the front negatives.


Take a list of integers; take the first 3 elements, then remove the first item, then remove leading negative numbers.


Take a list of integers; remove everything after the third, then Remove head, then drop negatives from start.


Take a list of integers; truncate to three items, then remove the first item, then strip negative values from the start.


Take a list of integers; show the first three, then Remove head, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = r[1:]
    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 first three, then drop the first element, then drop the leading negative values.


Take a list of integers; keep the negative numbers, then remove both ends, then truncate to three items.


Take a list of integers; extract negatives, then trim the edges, then show the first three.


Take a list of integers; keep the negative numbers, then trim one element off each end, then take the first three.


Take a list of integers; extract negatives, then cut off the first and last, then keep first 3.


Take a list of integers; keep the negative numbers, then remove the first and last elements, then truncate to first three.


Take a list of integers; extract negatives, then keep only the middle part, then first three.


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


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


Take a list of integers; keep the positive numbers, then flip the list around, then make each twice as big.


Take a list of integers; get rid of anything that's not positive, then flip the order around, then multiply each by 2.


Take a list of integers; drop non-positive values, then put the elements backwards, then make each twice as big.


Take a list of integers; drop the negative numbers, then reverse that for me, then multiply each by 2.


Take a list of integers; filter out the negative ones, then flip it backwards, then make each twice as big.


Take a list of integers; remove all negative values, then make it backwards, then multiply each by 2.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then arrange by magnitude ignoring sign.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then put them in order by magnitude.


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


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then sort by distance from zero.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then order by how far from zero.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then order by distance from zero.


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


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


Take a list of integers; square each, then remove all zero values, then find the min, defaulting to 0.


Take a list of integers; each value squared, then exclude zeros, then minimum value, zero otherwise.


Take a list of integers; multiply each value by itself, then remove all zero values, then get the minimum value or zero if empty.


Take a list of integers; square them all, then exclude zeros, then give me the min or 0.


Take a list of integers; raise each to the power of two, then remove all zero values, then return the smallest number, defaulting to 0.


Take a list of integers; I need each number multiplied by itself, then exclude zeros, then return smallest or zero if empty.


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


Take a list of integers; square each, then drop the zeros, then return the minimum (0 if empty).


Take a list of integers; keep the positive numbers, then order by distance from zero, then give the number of evens.


Take a list of integers; get rid of anything that's not positive, then sort based on absolute value, then find how many values are divisible by two.


Take a list of integers; drop non-positive values, then organize by magnitude, then how many are even.


Take a list of integers; drop the negative numbers, then arrange by absolute value ascending, then get the total number of even values in the list.


Take a list of integers; filter out the negative ones, then sort from smallest to largest absolute value, then give me the count of even values.


Take a list of integers; remove all negative values, then sort by absolute value, 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 = sorted(r, key=abs)
    return sum(1 for x in r if x % 2 == 0)


Take a list of integers; keep the positive numbers, then sort by absolute value, then return how many values are even.


Take a list of integers; sort ascending, then decrement each value, then true if any value equals zero.


Take a list of integers; Sort it from low to high, then Lower each number by one, then check for zero.


Take a list of integers; arrange in increasing order, then reduce each by one, then true if any value equals zero.


Take a list of integers; Organize these ascending, then Subtract 1 from all, then check for zero.


Take a list of integers; Sort in ascending order, then Subtract one from each, then true if any value equals zero.


Take a list of integers; I need this sorted ascending, then Drop each by one, then check for zero.


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


Take a list of integers; sort ascending, then subtract one from each, then return whether the list contains a zero.


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


Take a list of integers; Take everything except the first, then keep items where x mod 3 equals zero, then show the first three.


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


Take a list of integers; Take everything except the first, then filter out everything except multiples of three, then keep first 3.


Take a list of integers; drop the first element, then keep only multiples of three, then truncate to first three.


Take a list of integers; Take everything except the first, then multiples of three only, then first three.


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


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


Take a list of integers; cap each value at 10, then sort largest to smallest, then drop non-positive values.


Take a list of integers; clip values at 10, then sort by descending values, then drop the negative numbers.


Take a list of integers; cap each value at 10, then sort from highest to lowest, then filter out the negative ones.


Take a list of integers; clip values at 10, then sort descending, then remove all negative values.


Take a list of integers; cap each value at 10, then sort largest first, then keep positive values only.


Take a list of integers; clip values at 10, then sort in descending order, then keep values above zero.


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


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


Take a list of integers; keep the even numbers, then remove both ends, then remove the initial run of negative numbers.


Take a list of integers; keep evens, then trim the edges, then strip the front negatives.


Take a list of integers; keep the even numbers, then trim one element off each end, then remove leading negative numbers.


Take a list of integers; keep evens, then cut off the first and last, then drop negatives from start.


Take a list of integers; keep the even numbers, then remove the first and last elements, then strip negative values from the start.


Take a list of integers; keep evens, then keep only the middle part, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 0]
    r = r[1:-1]
    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 drop the first and last elements, then drop the leading negative values.


Take a list of integers; keep everything before the first zero, then sort smallest to largest, then keep only numbers above 5.


Take a list of integers; take only what comes before the initial zero, then Ascending sort, then exclude values of 5 and below.


Take a list of integers; cut the list at the first zero, then Sort this ascending, then remove anything 5 or less.


Take a list of integers; cut off after the first zero appears, then Sort lowest to highest, then filter to keep only values above 5.


Take a list of integers; take values up to (excluding) the first zero, then Arrange from smallest to largest, then get rid of values that aren't greater than five.


Take a list of integers; keep the part before the first 0, then sort ascending, then drop anything 5 or below.


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


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


Take a list of strings; trim whitespace from each, then remove repeated strings, then count characters across all strings.


Take a list of strings; strip whitespace from every element, then keep unique strings first appearance, then character count.


Take a list of strings; remove surrounding whitespace, then eliminate repeated strings preserve first occurrence, then count all the characters.


Take a list of strings; trim the whitespace off everything, then drop duplicate strings keeping the first, then total number of characters.


Take a list of strings; strip spaces from all strings, then dedupe, then what's the total character count.


Take a list of strings; strip all the strings, then remove duplicate strings keep first, then add up the lengths.


def solve(xs):
    r = list(xs)
    r = [s.strip() for s in r]
    r = list(dict.fromkeys(r))
    return sum(len(s) for s in r)


Take a list of strings; trim whitespace from each, then drop duplicate strings keeping the first, then return the total number of characters.


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


Take a list of integers; sort largest first, then remove all negatives at the front, then drop the negative numbers.


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then filter out the negative ones.


Take a list of integers; sort from greatest to least, then strip the front negatives, then remove all negative values.


Take a list of integers; sort z to a, then remove leading negative numbers, then keep positive values only.


Take a list of integers; arrange in decreasing order, then drop negatives from start, then keep values above zero.


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


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


Take a list of integers; keep everything before the first zero, then clamp each to at most ten, then keep only numbers above 5.


Take a list of integers; take only what comes before the initial zero, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of integers; cut the list at the first zero, then clamp each to at most ten, then remove anything 5 or less.


Take a list of integers; cut off after the first zero appears, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; take values up to (excluding) the first zero, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; keep the part before the first 0, then don't let anything exceed 10, then drop anything 5 or below.


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


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


Take a list of integers; keep the odd numbers, then flip the list around, then true only if all are positive.


Take a list of integers; odd numbers only, then flip the order around, then do all of these have positive values.


Take a list of integers; keep the odd numbers, then put the elements backwards, then check if every value is positive.


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


Take a list of integers; keep the odd numbers, then flip it backwards, then all positive.


Take a list of integers; odd numbers only, then make it backwards, then check if every number is above zero.


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


Take a list of integers; keep the odd numbers, then reverse the order, then return whether all values are positive.


Take a list of integers; subtract one from each, then remove the first item, then replace an empty list with one zero.


Take a list of integers; Decrement all items, then Remove head, then zero it out if it's empty.


Take a list of integers; decrement each value, then remove the first item, then use zero if the list is empty.


Take a list of integers; Lower each number by one, then Remove head, then default to zero when empty.


Take a list of integers; reduce each by one, then remove the first item, then if there's nothing, put in a zero.


Take a list of integers; Subtract 1 from all, then Remove head, then if no items, add a zero.


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


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


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


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


Take a list of integers; keep the odd numbers, then give me the last three elements, then check if the list is in ascending order.


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


Take a list of integers; keep the odd numbers, then keep the final three items, then is it sorted.


Take a list of integers; odd numbers only, then take the last three, then check if values are in increasing order.


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


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


Take a list of integers; pad with zeros to at least three elements, then take the first 3 elements, then raise each to the power of two.


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then I need each number multiplied by itself.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then square all of them.


Take a list of integers; add zeros until the list has at least three values, then show the first three, then multiply each element by itself.


Take a list of integers; pad with zeros to at least three elements, then take the first three, then make each one squared.


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then square each value in the list.


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


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


Take a list of integers; sort ascending, then clamp each to at most ten, then find the max, defaulting to 0.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then give the largest value (0 if none).


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


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


Take a list of people records (name, age); extract the ages, then remove all zero values, then replace an empty list with one zero.


Take a list of people records (name, age); show me all ages, then exclude zeros, then zero it out if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then remove all zero values, then use zero if the list is empty.


Take a list of people records (name, age); get the age field, then exclude zeros, then default to zero when empty.


Take a list of people records (name, age); keep just each person's age, then remove all zero values, then if there's nothing, put in a zero.


Take a list of people records (name, age); extract age values, then exclude zeros, then if no items, add a zero.


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


Take a list of people records (name, age); extract the ages, then drop the zeros, then if empty, use a single zero.


Take a list of integers; sort by absolute value, then remove both ends, then give the earliest even value or zero.


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


Take a list of integers; arrange by magnitude ignoring sign, then trim one element off each end, then give the earliest even value or zero.


Take a list of integers; put them in order by magnitude, then cut off the first and last, then fetch the first even element, default to 0.


Take a list of integers; arrange in order of absolute value, then remove the first and last elements, then give the earliest even value or zero.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then true if at least one even value.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then any even.


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


Take a list of integers; drop duplicates keeping first occurrence, then drop the first element, then return whether any value is even.


Take a list of integers; drop the first element, then keep only even values, then true if at least one even value.


Take a list of integers; Take everything except the first, then extract all even numbers, then any even.


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


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


Take a list of strings; drop empty strings, then keep only strings of length 3 or more, then count characters across all strings.


Take a list of strings; get rid of blanks, then get rid of short ones, then character count.


Take a list of strings; remove blanks, then remove strings with less than three characters, then count all the characters.


Take a list of strings; eliminate empty string values, then remove all strings under three characters in length, then total number of characters.


Take a list of strings; filter out blank strings, then filter out short strings under three chars, then what's the total character count.


Take a list of strings; remove strings that are empty, then drop strings shorter than three characters, then add up the lengths.


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


Take a list of strings; drop empty strings, then drop strings shorter than three characters, then return the total number of characters.


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then shift each up by ten.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then increase all numbers by 10.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then add 10 to everything.


Take a list of people records (name, age); get the age field, then zero it out if it's empty, then give everything a boost of 10.


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then increment each by ten.


Take a list of people records (name, age); extract age values, then default to zero when empty, then add a constant 10 to each.


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


Take a list of people records (name, age); extract the ages, then if empty, use a single zero, then add ten to each.


Take a list of integers; drop the zeros, then multiply each value by itself, then skip the first one.


Take a list of integers; keep only nonzero elements, then square them all, then Discard the first element.


Take a list of integers; drop the zeros, then raise each to the power of two, then skip the first one.


Take a list of integers; keep only nonzero elements, then I need each number multiplied by itself, then Discard the first element.


Take a list of integers; drop the zeros, then square all of them, then skip the first one.


Take a list of integers; keep only nonzero elements, then multiply each element by itself, then Discard the first element.


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


Take a list of integers; drop the zeros, then square each, then drop the first element.


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


Take a list of integers; Take everything except the first, then square them all, then keep the part before the first 0.


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


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


Take a list of integers; drop the first element, then square all of them, then remove from the first zero onwards.


Take a list of integers; Take everything except the first, then multiply each element by itself, then up to but not including the first zero.


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


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


Take a list of integers; keep multiples of three, then keep only even values, then true if any value equals zero.


Take a list of integers; get rid of non-multiples of three, then extract all even numbers, then check for zero.


Take a list of integers; keep values divisible by 3, then keep only even values, then true if any value equals zero.


Take a list of integers; keep items where x mod 3 equals zero, then extract all even numbers, then check for zero.


Take a list of integers; drop anything not divisible by three, then keep only even values, then true if any value equals zero.


Take a list of integers; filter out everything except multiples of three, then extract all even numbers, then check for zero.


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


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


Take a list of integers; sort descending, then skip negatives at the start, then give the earliest even value or zero.


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


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then give the earliest even value or zero.


Take a list of integers; sort from greatest to least, then strip the front negatives, then fetch the first even element, default to 0.


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


Take a list of integers; arrange in decreasing order, then drop negatives from start, then fetch the first even element, default to 0.


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


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


Take a list of integers; keep only the last three, then decrement each value, then keep only numbers above 5.


Take a list of integers; keep the final three items, then Lower each number by one, then exclude values of 5 and below.


Take a list of integers; take the last three, then reduce each by one, then remove anything 5 or less.


Take a list of integers; trim to the last three, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; last three only, then Subtract one from each, then get rid of values that aren't greater than five.


Take a list of integers; truncate to the last three items, then Drop each by one, then drop anything 5 or below.


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


Take a list of integers; keep only the last three, then subtract one from each, then keep values greater than five.


Take a list of integers; take values while they are positive, then drop anything 5 or below, then truncate to three items.


Take a list of integers; take positive values then stop, then keep only numbers greater than 5, then show the first three.


Take a list of integers; keep going while positive, then filter for numbers above 5, then take the first three.


Take a list of integers; stop at first non positive, then give me values where x is greater than 5, then keep first 3.


Take a list of integers; take while greater than zero, then show me only the values that are bigger than five, then truncate to first three.


Take a list of integers; take values while positive, then keep values greater than five, 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 for x in r if x > 5]
    r = r[:3]
    return r


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


Take a list of integers; add one to each, then keep values below zero, then count the elements.


Take a list of integers; make each one bigger, then get the negative numbers, then how many items remain.


Take a list of integers; add one to each, then keep values below zero, then tell me the length.


Take a list of integers; make each one bigger, then get the negative numbers, then return the length.


Take a list of integers; add one to each, then keep values below zero, then count them.


Take a list of integers; make each one bigger, then get the negative numbers, then what's the count.


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


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


Take a list of integers; keep the negative numbers, then keep only even values, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then true if every value is unique.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then check for duplicates in the values.


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


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then check that there are no duplicates.


Take a list of integers; drop duplicates keeping first occurrence, then keep only even values, then are the values all unique.


Take a list of integers; drop duplicates but keep the first one, then extract all even numbers, then check if all values are unique.


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


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


Take a list of integers; sort descending, then keep only odd values, then replace an empty list with one zero.


Take a list of integers; sort largest first, then eliminate the even numbers, then zero it out if it's empty.


Take a list of integers; sort in descending order, then keep only odd values, then use zero if the list is empty.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then default to zero when empty.


Take a list of integers; sort z to a, then keep only odd values, then if there's nothing, put in a zero.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then if no items, add a zero.


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


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


Take a list of integers; sort descending, then skip negatives at the start, then give back the total.


Take a list of integers; sort largest first, then remove all negatives at the front, then sum r.


Take a list of integers; sort in descending order, then remove the initial run of negative numbers, then add them up.


Take a list of integers; sort from greatest to least, then strip the front negatives, then calculate the sum of all elements.


Take a list of integers; sort z to a, then remove leading negative numbers, then what's the total.


Take a list of integers; arrange in decreasing order, then drop negatives from start, then what do they add up to.


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


Take a list of integers; sort descending, then drop the leading negative values, then return their sum.


Take a list of integers; keep only the first three, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; keep the first 3 items, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then filter for numbers above 5, then arrange in order of absolute value.


Take a list of integers; remove everything after the third, then give me values where x is greater than 5, then sort by distance from zero.


Take a list of integers; truncate to three items, then show me only the values that are bigger than five, then order by how far from zero.


Take a list of integers; show the first three, then keep values greater than five, then order by distance from zero.


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


Take a list of integers; keep only the first three, then keep values greater than five, then sort by absolute value.


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


Take a list of integers; reverse the signs of everything, then remove all negatives at the front, then zero it out if it's empty.


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


Take a list of integers; reverse the signs of everything, then strip the front negatives, then default to zero when empty.


Take a list of integers; negate each, then remove leading negative numbers, then if there's nothing, put in a zero.


Take a list of integers; reverse the signs of everything, then drop negatives from start, then if no items, add a zero.


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


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


Take a list of integers; take values while they are positive, then make every value non-negative, then drop the odd numbers.


Take a list of integers; take positive values then stop, then absolute value for all items, then filter out the odd numbers.


Take a list of integers; keep going while positive, then take absolute values, then drop the odd numbers.


Take a list of integers; stop at first non positive, then turn negatives into positives, then filter out the odd numbers.


Take a list of integers; take while greater than zero, then abs each element, then drop the odd numbers.


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


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


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


Take a list of integers; keep multiples of three, then multiply each by two, then skip the first one.


Take a list of integers; get rid of non-multiples of three, then double each item in the list, then Discard the first element.


Take a list of integers; keep values divisible by 3, then multiply each by two, then skip the first one.


Take a list of integers; keep items where x mod 3 equals zero, then double each item in the list, then Discard the first element.


Take a list of integers; drop anything not divisible by three, then multiply each by two, then skip the first one.


Take a list of integers; filter out everything except multiples of three, then double each item in the list, then Discard the first element.


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


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


Take a list of integers; keep only the last three, then remove both ends, then deduplicate the list.


Take a list of integers; keep the final three items, then trim the edges, then remove repeats.


Take a list of integers; take the last three, then trim one element off each end, then deduplicate the list.


Take a list of integers; trim to the last three, then cut off the first and last, then remove repeats.


Take a list of integers; last three only, then remove the first and last elements, then deduplicate the list.


Take a list of integers; truncate to the last three items, then keep only the middle part, then remove repeats.


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


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


Take a list of integers; reverse the order, then remove repeated values, then raise each to the power of two.


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


Take a list of integers; flip the list around, then remove repeated values, then square all of them.


Take a list of integers; flip the order around, then unique values preserving order, then multiply each element by itself.


Take a list of integers; put the elements backwards, then remove repeated values, then make each one squared.


Take a list of integers; reverse that for me, then unique values preserving order, then square each value in the list.


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


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


Take a list of integers; keep everything before the first zero, then order by distance from zero, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then minimum value, zero otherwise.


Take a list of integers; cut the list at the first zero, then organize by magnitude, then get the minimum value or zero if empty.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then give me the min or 0.


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then return the smallest number, defaulting to 0.


Take a list of integers; keep the part before the first 0, then sort by absolute value, then return smallest or zero if empty.


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


Take a list of integers; keep everything before the first zero, then sort by absolute value, then return the minimum (0 if empty).


Take a list of integers; keep only the last three, then decrement each value, then give back the product of all values.


Take a list of integers; keep the final three items, then Lower each number by one, then product of the list.


Take a list of integers; take the last three, then reduce each by one, then what's the product.


Take a list of integers; trim to the last three, then Subtract 1 from all, then what do they multiply to.


Take a list of integers; last three only, then Subtract one from each, then give me their product.


Take a list of integers; truncate to the last three items, then Drop each by one, then multiply them all together.


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


Take a list of integers; keep only the last three, then subtract one from each, then return their product.


Take a list of integers; take the absolute value of each, then take the first 3 elements, then true only if all are positive.


Take a list of integers; convert to absolute value, then remove everything after the third, then do all of these have positive values.


Take a list of integers; strip the signs, then truncate to three items, then check if every value is positive.


Take a list of integers; take abs of each, then show the first three, then confirm all values are positive.


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


Take a list of integers; apply absolute value to the whole list, then keep first 3, then check if every number is above zero.


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


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


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


Take a list of integers; reverse the signs of everything, then add 10 to each item, then multiply each by 2.


Take a list of integers; negate each, then shift each up by ten, then make each twice as big.


Take a list of integers; reverse the signs of everything, then increase all numbers by 10, then multiply each by 2.


Take a list of integers; negate each, then add 10 to everything, then make each twice as big.


Take a list of integers; reverse the signs of everything, then give everything a boost of 10, then multiply each by 2.


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


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


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


Take a list of integers; keep evens, then keep items where x mod 3 equals zero, then check for zero.


Take a list of integers; keep the even numbers, then drop anything not divisible by three, then true if any value equals zero.


Take a list of integers; keep evens, then filter out everything except multiples of three, then check for zero.


Take a list of integers; keep the even numbers, then keep only multiples of three, then true if any value equals zero.


Take a list of integers; keep evens, then multiples of three only, then check for zero.


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


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


Take a list of integers; keep everything before the first zero, then keep values divisible by 3, then make each twice as big.


Take a list of integers; take only what comes before the initial zero, then keep items where x mod 3 equals zero, then multiply each by 2.


Take a list of integers; cut the list at the first zero, then drop anything not divisible by three, then make each twice as big.


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


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


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


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


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


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


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then increase all numbers by 10.


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


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


Take a list of integers; trim one element off each end, then truncate at the first zero, then increment each by ten.


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


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


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


Take a list of integers; keep the even numbers, then keep values divisible by 3, then give the earliest even value or zero.


Take a list of integers; keep evens, then keep items where x mod 3 equals zero, then fetch the first even element, default to 0.


Take a list of integers; keep the even numbers, then drop anything not divisible by three, then give the earliest even value or zero.


Take a list of integers; keep evens, then filter out everything except multiples of three, then fetch the first even element, default to 0.


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


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


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


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


Take a list of integers; keep only the last three, then sort smallest to largest, then make each twice as big.


Take a list of integers; keep the final three items, then Ascending sort, then multiply each by 2.


Take a list of integers; take the last three, then Sort this ascending, then make each twice as big.


Take a list of integers; trim to the last three, then Sort lowest to highest, then multiply each by 2.


Take a list of integers; last three only, then Arrange from smallest to largest, then make each twice as big.


Take a list of integers; truncate to the last three items, then sort ascending, then multiply each by 2.


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


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


Take a list of integers; reverse the order, then remove both ends, then count the elements.


Take a list of integers; reverse, then trim the edges, then how many items remain.


Take a list of integers; flip the list around, then trim one element off each end, then tell me the length.


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


Take a list of integers; put the elements backwards, then remove the first and last elements, then count them.


Take a list of integers; reverse that for me, then keep only the middle part, then what's the count.


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


Take a list of integers; reverse the order, then drop the first and last elements, then return how many remain.


Take a list of integers; drop the zeros, then remove repeated values, then strip the signs.


Take a list of integers; keep only nonzero elements, then unique values preserving order, then take abs of each.


Take a list of integers; drop the zeros, then remove repeated values, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then unique values preserving order, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then remove repeated values, then make them all positive.


Take a list of integers; keep only nonzero elements, then unique values preserving order, then make every value non-negative.


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


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


Take a list of integers; double each, then decrement each value, then trim one element off each end.


Take a list of integers; times two for each item, then Lower each number by one, then cut off the first and last.


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


Take a list of integers; times two for each item, then Subtract 1 from all, then keep only the middle part.


Take a list of integers; double each, then Subtract one from each, then drop first and last.


Take a list of integers; times two for each item, then Drop each by one, then eliminate the outermost elements.


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


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


Take a list of strings; drop empty strings, then convert each to upper case, then deduplicate the strings.


Take a list of strings; get rid of blanks, then change all strings to uppercase, then filter out duplicate strings retain first.


Take a list of strings; remove blanks, then make every string uppercase, then strip duplicates preserve order.


Take a list of strings; eliminate empty string values, then uppercase each one, then remove repeated strings.


Take a list of strings; filter out blank strings, then make all the strings uppercase, then keep unique strings first appearance.


Take a list of strings; remove strings that are empty, then convert all strings to uppercase letters, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; drop empty strings, then uppercase each string, then drop duplicate strings keeping the first.


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


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


Take a list of integers; double each, then filter for numbers above 5, then remove all but the last three.


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


Take a list of integers; double each, then show me only the values that are bigger than five, then drop everything except the final three.


Take a list of integers; times two for each item, then keep values greater than five, then give me the last three elements.


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


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


Take a list of integers; keep the even numbers, then increment each value, then deduplicate the list.


Take a list of integers; keep evens, then plus one for all, then remove repeats.


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


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


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then deduplicate the list.


Take a list of integers; if blank use 0, then remove everything after the third, then remove repeats.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then deduplicate the list.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then remove repeats.


Take a list of integers; replace an empty list with one zero, then take the first three, then deduplicate the list.


Take a list of integers; zero it out if it's empty, then keep first 3, then remove repeats.


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


Take a list of integers; if empty, use a single zero, then keep only the first three, then drop duplicates keeping first occurrence.


Take a list of integers; cap each value at 10, then multiply each value by itself, then keep only non-zero numbers.


Take a list of integers; clip values at 10, then square them all, then strip the zeros.


Take a list of integers; cap each value at 10, then raise each to the power of two, then keep only non-zero numbers.


Take a list of integers; clip values at 10, then I need each number multiplied by itself, then strip the zeros.


Take a list of integers; cap each value at 10, then square all of them, then keep only non-zero numbers.


Take a list of integers; clip values at 10, then multiply each element by itself, then strip the zeros.


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


Take a list of integers; cap each value at 10, then square each, then drop the zeros.


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


Take a list of integers; keep the final three items, then sort by descending values, then show the first three.


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


Take a list of integers; trim to the last three, then sort descending, then keep first 3.


Take a list of integers; last three only, then sort largest first, then truncate to first three.


Take a list of integers; truncate to the last three items, then sort in descending order, then first three.


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


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


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


Take a list of integers; odd numbers only, then cut off after the first zero appears, then strip the zeros.


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


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


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


Take a list of integers; odd numbers only, then delete everything starting with the first zero, then strip the zeros.


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


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


Take a list of integers; keep the positive numbers, then remove repeated values, then drop non-negative values.


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


Take a list of integers; drop non-positive values, then remove repeated values, then drop non-negative values.


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


Take a list of integers; filter out the negative ones, then remove repeated values, then drop non-negative values.


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


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


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


Take a list of integers; negate each, then make every value non-negative, then shift each up by ten.


Take a list of integers; reverse the signs of everything, then absolute value for all items, then increase all numbers by 10.


Take a list of integers; negate each, then take absolute values, then add 10 to everything.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then give everything a boost of 10.


Take a list of integers; negate each, then abs each element, then increment each by ten.


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


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


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


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


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


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


Take a list of integers; flip the order around, then double each item in the list, then strip the zeros.


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


Take a list of integers; reverse that for me, then double each item in the list, then strip the zeros.


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


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


Take a list of integers; drop the first and last elements, then take the final 3 elements, then true if every value is unique.


Take a list of integers; take out the first and last items, then drop everything except the final three, then check for duplicates in the values.


Take a list of integers; remove both ends, then give me the last three elements, then do all values appear only once.


Take a list of integers; trim the edges, then keep only the last three, then check that there are no duplicates.


Take a list of integers; trim one element off each end, then keep the final three items, then are the values all unique.


Take a list of integers; cut off the first and last, then take the last three, then check if all values are unique.


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


Take a list of integers; drop the first and last elements, then keep only the last three, then return whether all values are distinct.


Take a list of integers; negate each, then remove the first item, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then Remove head, then strip the zeros.


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


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


Take a list of integers; keep only the last three, then clamp each to at most ten, then arrange in increasing order.


Take a list of integers; keep the final three items, then don't let anything exceed 10, then Organize these ascending.


Take a list of integers; take the last three, then clamp each to at most ten, then Sort in ascending order.


Take a list of integers; trim to the last three, then don't let anything exceed 10, then I need this sorted ascending.


Take a list of integers; last three only, then clamp each to at most ten, then Put these in ascending order.


Take a list of integers; truncate to the last three items, then don't let anything exceed 10, then sort smallest to largest.


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


Take a list of integers; keep only the last three, then cap each value at 10, then sort ascending.


Take a list of integers; add one to each, then keep values divisible by 3, then deduplicate the list.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then remove repeats.


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


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then remove repeats.


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


Take a list of integers; make each one bigger, then multiples of three only, then remove repeats.


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


Take a list of integers; add one to each, then keep multiples of three, then drop duplicates keeping first occurrence.


Take a list of integers; sort descending, then keep only odd values, then trim one element off each end.


Take a list of integers; sort largest first, then eliminate the even numbers, then cut off the first and last.


Take a list of integers; sort in descending order, then keep only odd values, then remove the first and last elements.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then keep only the middle part.


Take a list of integers; sort z to a, then keep only odd values, then drop first and last.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then eliminate the outermost elements.


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


Take a list of integers; sort descending, then keep the odd numbers, then drop the first and last elements.


Take a list of integers; sort ascending, then take the first 3 elements, then arrange by magnitude ignoring sign.


Take a list of integers; Sort it from low to high, then remove everything after the third, then put them in order by magnitude.


Take a list of integers; arrange in increasing order, then truncate to three items, then arrange in order of absolute value.


Take a list of integers; Organize these ascending, then show the first three, then sort by distance from zero.


Take a list of integers; Sort in ascending order, then take the first three, then order by how far from zero.


Take a list of integers; I need this sorted ascending, then keep first 3, then order by distance from zero.


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


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


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then find the max, defaulting to 0.


Take a list of integers; extract negatives, then don't let anything exceed 10, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; extract negatives, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; extract negatives, then don't let anything exceed 10, then give the largest value (0 if none).


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


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


Take a list of integers; reverse the order, then increment each value, then replace an empty list with one zero.


Take a list of integers; reverse, then plus one for all, then zero it out if it's empty.


Take a list of integers; flip the list around, then increment each value, then use zero if the list is empty.


Take a list of integers; flip the order around, then plus one for all, then default to zero when empty.


Take a list of integers; put the elements backwards, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; reverse that for me, then plus one for all, then if no items, add a zero.


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


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


Take a list of integers; drop the zeros, then make every value non-negative, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then absolute value for all items, then maximum of 10 for all.


Take a list of integers; drop the zeros, then take absolute values, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then turn negatives into positives, then maximum of 10 for all.


Take a list of integers; drop the zeros, then abs each element, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then take the absolute value of each, then maximum of 10 for all.


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


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


Take a list of integers; sort ascending, then drop anything 5 or below, then remove the initial run of negative numbers.


Take a list of integers; Sort it from low to high, then keep only numbers greater than 5, then strip the front negatives.


Take a list of integers; arrange in increasing order, then filter for numbers above 5, then remove leading negative numbers.


Take a list of integers; Organize these ascending, then give me values where x is greater than 5, then drop negatives from start.


Take a list of integers; Sort in ascending order, then show me only the values that are bigger than five, then strip negative values from the start.


Take a list of integers; I need this sorted ascending, then keep values greater than five, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep the even numbers, then keep the leading run of positive numbers, then drop anything not divisible by three.


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


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


Take a list of integers; keep evens, then keep going while positive, then multiples of three only.