Take a list of integers; keep the final three items, then sort based on absolute value, then arrange in descending order.


Take a list of integers; take the last three, then organize by magnitude, then reverse sort.


Take a list of integers; trim to the last three, then arrange by absolute value ascending, then sort largest to smallest.


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


Take a list of integers; truncate to the last three items, then sort by absolute value, then sort from highest to lowest.


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


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


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


Take a list of integers; reverse the signs of everything, then exclude zeros, then minimum value, zero otherwise.


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


Take a list of integers; reverse the signs of everything, then exclude zeros, then give me the min or 0.


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


Take a list of integers; reverse the signs of everything, then exclude zeros, then return smallest or zero if empty.


def solve(xs):
    r = list(xs)
    r = [-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; negate each, then drop the zeros, then return the minimum (0 if empty).


Take a list of integers; keep only the first three, then decrement each value, then truncate to the last three items.


Take a list of integers; keep the first 3 items, then Lower each number by one, then show only the last three.


Take a list of integers; take the first 3 elements, then reduce each by one, then remove all but the last three.


Take a list of integers; remove everything after the third, then Subtract 1 from all, then take the final 3 elements.


Take a list of integers; truncate to three items, then Subtract one from each, then drop everything except the final three.


Take a list of integers; show the first three, then Drop each by one, then give me the last three elements.


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


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


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; extract negatives, then pad to 3, then check for zero.


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


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


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then make each twice as big.


Take a list of integers; keep the final three items, then pad to 3, then multiply each by 2.


Take a list of integers; take the last three, then extend to length 3 using zeros, then make each twice as big.


Take a list of integers; trim to the last three, then pad to 3, then multiply each by 2.


Take a list of integers; last three only, then extend to length 3 using zeros, then make each twice as big.


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


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


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


Take a list of integers; keep multiples of three, then default to [0] when there is nothing, then true if every value is unique.


Take a list of integers; get rid of non-multiples of three, then when the list is empty, substitute a zero value, then check for duplicates in the values.


Take a list of integers; keep values divisible by 3, then replace an empty list with one zero, then do all values appear only once.


Take a list of integers; keep items where x mod 3 equals zero, then zero it out if it's empty, then check that there are no duplicates.


Take a list of integers; drop anything not divisible by three, then use zero if the list is empty, then are the values all unique.


Take a list of integers; filter out everything except multiples of three, then default to zero when empty, then check if all values are unique.


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


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


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


Take a list of integers; get rid of non-multiples of three, then Lower each number by one, then product of the list.


Take a list of integers; keep values divisible by 3, then reduce each by one, then what's the product.


Take a list of integers; keep items where x mod 3 equals zero, then Subtract 1 from all, then what do they multiply to.


Take a list of integers; drop anything not divisible by three, then Subtract one from each, then give me their product.


Take a list of integers; filter out everything except multiples of three, then Drop each by one, then multiply them all together.


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


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


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


Take a list of people records (name, age); show me all ages, then pad to 3, then drop the negative numbers.


Take a list of people records (name, age); pluck the age field from each record, then extend to length 3 using zeros, then filter out the negative ones.


Take a list of people records (name, age); get the age field, then pad to 3, then remove all negative values.


Take a list of people records (name, age); keep just each person's age, then extend to length 3 using zeros, then keep positive values only.


Take a list of people records (name, age); extract age values, then pad to 3, then keep values above zero.


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


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


Take a list of integers; if empty, use a single zero, then keep only odd values, then find the min, defaulting to 0.


Take a list of integers; if blank use 0, then eliminate the even numbers, then minimum value, zero otherwise.


Take a list of integers; default to [0] when there is nothing, then keep only odd values, then get the minimum value or zero if empty.


Take a list of integers; when the list is empty, substitute a zero value, then eliminate the even numbers, then give me the min or 0.


Take a list of integers; replace an empty list with one zero, then keep only odd values, then return the smallest number, defaulting to 0.


Take a list of integers; zero it out if it's empty, then eliminate the even numbers, then return smallest or zero if empty.


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


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


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


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then drop all positive numbers.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then drop non-negative values.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then drop all positive numbers.


Take a list of integers; shift each up by ten, then clamp each to at most ten, then drop non-negative values.


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


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


Take a list of integers; add ten to each, then cap each value at 10, then keep the negative numbers.


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


Take a list of integers; get rid of non-multiples of three, then flip the order around, then show only the last three.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then remove all but the last three.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then take the final 3 elements.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then drop everything except the final three.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then give me the last three elements.


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


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


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


Take a list of integers; get rid of non-multiples of three, then plus one for all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep values divisible by 3, then increment each value, then What's the highest number in the list.


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


Take a list of integers; drop anything not divisible by three, then increment each value, then Find the largest element, defaulting to zero.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then give the largest value (0 if none).


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


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


Take a list of integers; drop duplicates keeping first occurrence, then make every value non-negative, then make each twice as big.


Take a list of integers; drop duplicates but keep the first one, then absolute value for all items, then multiply each by 2.


Take a list of integers; drop duplicates keeping first occurrence, then take absolute values, then make each twice as big.


Take a list of integers; drop duplicates but keep the first one, then turn negatives into positives, then multiply each by 2.


Take a list of integers; drop duplicates keeping first occurrence, then abs each element, then make each twice as big.


Take a list of integers; drop duplicates but keep the first one, then take the absolute value of each, then multiply each by 2.


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


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


Take a list of integers; cap each value at 10, then multiply each by two, then shift each up by ten.


Take a list of integers; clip values at 10, then double each item in the list, then increase all numbers by 10.


Take a list of integers; cap each value at 10, then multiply each by two, then add 10 to everything.


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


Take a list of integers; cap each value at 10, then multiply each by two, then increment each by ten.


Take a list of integers; clip values at 10, then double each item in the list, then add a constant 10 to each.


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


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


Take a list of integers; add one to each, then extend to length 3 using zeros, then truncate to the last three items.


Take a list of integers; make each one bigger, then pad to 3, then show only the last three.


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


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


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


Take a list of integers; make each one bigger, then pad to 3, then give me the last three elements.


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


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


Take a list of integers; drop the leading negative values, then increase every value by 10, then give back the total.


Take a list of integers; cut the leading negatives, then add 10 to each item, then sum r.


Take a list of integers; skip negatives at the start, then shift each up by ten, then add them up.


Take a list of integers; remove all negatives at the front, then increase all numbers by 10, then calculate the sum of all elements.


Take a list of integers; remove the initial run of negative numbers, then add 10 to everything, then what's the total.


Take a list of integers; strip the front negatives, then give everything a boost of 10, then what do they add up to.


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


Take a list of integers; drop the leading negative values, then add ten to each, then return their sum.


Take a list of integers; double each, then increase every value by 10, then arrange in increasing order.


Take a list of integers; times two for each item, then add 10 to each item, then Organize these ascending.


Take a list of integers; double each, then shift each up by ten, then Sort in ascending order.


Take a list of integers; times two for each item, then increase all numbers by 10, then I need this sorted ascending.


Take a list of integers; double each, then add 10 to everything, then Put these in ascending order.


Take a list of integers; times two for each item, then give everything a boost of 10, then sort smallest to largest.


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


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


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


Take a list of integers; get rid of non-multiples of three, then take values while they are positive, then any even.


Take a list of integers; keep values divisible by 3, then take positive values then stop, then true if at least one even value.


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


Take a list of integers; drop anything not divisible by three, then stop at first non positive, then true if at least one even value.


Take a list of integers; filter out everything except multiples of three, then take while greater than zero, then any even.


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


Take a list of integers; keep multiples of three, then take values while they are positive, then return whether any value is even.


Take a list of integers; drop duplicates keeping first occurrence, then keep values above zero, then true if at least one even value.


Take a list of integers; drop duplicates but keep the first one, then filter for positive numbers, then any even.


Take a list of integers; drop duplicates keeping first occurrence, then keep only positive numbers, then true if at least one even value.


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


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


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


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


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


Take a list of integers; sort ascending, then increase every value by 10, then reduce each by one.


Take a list of integers; Sort it from low to high, then add 10 to each item, then Subtract 1 from all.


Take a list of integers; arrange in increasing order, then shift each up by ten, then Subtract one from each.


Take a list of integers; Organize these ascending, then increase all numbers by 10, then Drop each by one.


Take a list of integers; Sort in ascending order, then add 10 to everything, then Decrease all values by one.


Take a list of integers; I need this sorted ascending, then give everything a boost of 10, then Remove one from each value.


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


Take a list of integers; sort ascending, then add ten to each, then subtract one from each.


Take a list of integers; keep the odd numbers, then clamp each to at most ten, then bump each up by one.


Take a list of integers; odd numbers only, then don't let anything exceed 10, then increment each item.


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


Take a list of integers; keep the odd numbers, then cap each value at 10, then add one to each.


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


Take a list of integers; make each one bigger, then drop everything except the final three, then sum r.


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


Take a list of integers; make each one bigger, then keep only the last three, then calculate the sum of all elements.


Take a list of integers; add one to each, then keep the final three items, then what's the total.


Take a list of integers; make each one bigger, then take the last three, then what do they add up to.


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


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


Take a list of integers; keep values greater than five, then default to [0] when there is nothing, then arrange in increasing order.


Take a list of integers; filter out values less than or equal to 5, then when the list is empty, substitute a zero value, then Organize these ascending.


Take a list of integers; keep only numbers above 5, then replace an empty list with one zero, then Sort in ascending order.


Take a list of integers; exclude values of 5 and below, then zero it out if it's empty, then I need this sorted ascending.


Take a list of integers; remove anything 5 or less, then use zero if the list is empty, then Put these in ascending order.


Take a list of integers; filter to keep only values above 5, then default to zero when empty, then sort smallest to largest.


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


Take a list of integers; keep values greater than five, then if empty, use a single zero, then sort ascending.


Take a list of integers; keep the negative numbers, then flip the sign of each, then strip the signs.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then take abs of each.


Take a list of integers; keep the negative numbers, then flip the sign of each, then get the absolute value of everything.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then apply absolute value to the whole list.


Take a list of integers; keep the negative numbers, then flip the sign of each, then make them all positive.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then make every value non-negative.


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


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


Take a list of integers; take values while they are positive, then remove both ends, then true if already sorted smallest to largest.


Take a list of integers; take positive values then stop, then trim the edges, then does this list go in ascending order.


Take a list of integers; keep going while positive, then trim one element off each end, then check if the list is in ascending order.


Take a list of integers; stop at first non positive, then cut off the first and last, then is the list sorted.


Take a list of integers; take while greater than zero, then remove the first and last elements, then is it sorted.


Take a list of integers; take values while positive, then keep only the middle part, then check if values are in increasing order.


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


Take a list of integers; take values while they are positive, then drop the first and last elements, then return whether the list is sorted ascending.


Take a list of integers; reverse the order, then cut the list at the first zero, then drop non-negative values.


Take a list of integers; reverse, then cut off after the first zero appears, then drop all positive numbers.


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


Take a list of integers; flip the order around, then keep the part before the first 0, then drop all positive numbers.


Take a list of integers; put the elements backwards, then truncate at the first zero, then drop non-negative values.


Take a list of integers; reverse that for me, then delete everything starting with the first zero, then drop all positive numbers.


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


Take a list of integers; reverse the order, then keep everything before the first zero, then keep the negative numbers.


Take a list of integers; sort by absolute value, then clamp each to at most ten, then ensure at least three items by appending zeros.


Take a list of integers; rearrange by distance from zero, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange by magnitude ignoring sign, then clamp each to at most ten, then ensure at least three items by appending zeros.


Take a list of integers; put them in order by magnitude, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in order of absolute value, then clamp each to at most ten, then ensure at least three items by appending zeros.


Take a list of integers; sort by distance from zero, then don't let anything exceed 10, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the first element, then remove both ends, then make each twice as big.


Take a list of integers; Take everything except the first, then trim the edges, then multiply each by 2.


Take a list of integers; drop the first element, then trim one element off each end, then make each twice as big.


Take a list of integers; Take everything except the first, then cut off the first and last, then multiply each by 2.


Take a list of integers; drop the first element, then remove the first and last elements, then make each twice as big.


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


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


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


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then arrange in order of absolute value.


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


Take a list of integers; replace an empty list with one zero, then show me only the values that are bigger than five, then order by how far from zero.


Take a list of integers; zero it out if it's empty, then keep values greater than five, then order by distance from zero.


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then sort by absolute value.


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


Take a list of integers; convert to absolute value, then flip the order around, then strip the zeros.


Take a list of integers; strip the signs, then put the elements backwards, then keep only non-zero numbers.


Take a list of integers; take abs of each, then reverse that for me, then strip the zeros.


Take a list of integers; get the absolute value of everything, then flip it backwards, then keep only non-zero numbers.


Take a list of integers; apply absolute value to the whole list, then make it backwards, then strip the zeros.


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


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


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


Take a list of integers; times two for each item, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; double each, then drop anything not divisible by three, then how many are even.


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


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


Take a list of integers; times two for each item, then multiples of three only, then I need to know how many of these are even.


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


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


Take a list of integers; keep the positive numbers, then make every value non-negative, then give the earliest even value or zero.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then fetch the first even element, default to 0.


Take a list of integers; drop non-positive values, then take absolute values, then give the earliest even value or zero.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then fetch the first even element, default to 0.


Take a list of integers; filter out the negative ones, then abs each element, then give the earliest even value or zero.


Take a list of integers; remove all negative values, then take the absolute value of each, then fetch the first even element, default to 0.


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


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


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then truncate to three items.


Take a list of integers; clip values at 10, then pad to 3, then show the first three.


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then take the first three.


Take a list of integers; clip values at 10, then pad to 3, then keep first 3.


Take a list of integers; cap each value at 10, then extend to length 3 using zeros, then truncate to first three.


Take a list of integers; clip values at 10, then pad to 3, then first three.


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


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


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


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


Take a list of integers; keep going while positive, then replace an empty list with one zero, then get the minimum value or zero if empty.


Take a list of integers; stop at first non positive, then zero it out if it's empty, then give me the min or 0.


Take a list of integers; take while greater than zero, then use zero if the list is empty, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then default to zero when empty, then return smallest or zero if empty.


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


Take a list of integers; take values while they are positive, then if empty, use a single zero, then return the minimum (0 if empty).


Take a list of integers; if empty, use a single zero, then multiply each value by itself, then reduce each by one.


Take a list of integers; if blank use 0, then square them all, then Subtract 1 from all.


Take a list of integers; default to [0] when there is nothing, then raise each to the power of two, then Subtract one from each.


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


Take a list of integers; replace an empty list with one zero, then square all of them, then Decrease all values by one.


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


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


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


Take a list of integers; keep only the last three, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; keep the final three items, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; take the last three, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; trim to the last three, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; last three only, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; truncate to the last three items, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; sort ascending, then keep the leading run of positive numbers, then bump each up by one.


Take a list of integers; Sort it from low to high, then take values while they are positive, then increment each item.


Take a list of integers; arrange in increasing order, then take positive values then stop, then bump each up by one.


Take a list of integers; Organize these ascending, then keep going while positive, then increment each item.


Take a list of integers; Sort in ascending order, then stop at first non positive, then bump each up by one.


Take a list of integers; I need this sorted ascending, then take while greater than zero, then increment each item.


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


Take a list of integers; sort ascending, then take values while they are positive, then add one to each.


Take a list of integers; drop the first element, then remove all zero values, then give the number of evens.


Take a list of integers; Take everything except the first, then exclude zeros, then find how many values are divisible by two.


Take a list of integers; drop the first element, then remove all zero values, then how many are even.


Take a list of integers; Take everything except the first, then exclude zeros, then get the total number of even values in the list.


Take a list of integers; drop the first element, then remove all zero values, then give me the count of even values.


Take a list of integers; Take everything except the first, then exclude zeros, then I need to know how many of these are even.


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


Take a list of integers; drop the first element, then drop the zeros, then return how many values are even.


Take a list of integers; cap each value at 10, then keep only odd values, then count the elements.


Take a list of integers; clip values at 10, then eliminate the even numbers, then how many items remain.


Take a list of integers; cap each value at 10, then keep only odd values, then tell me the length.


Take a list of integers; clip values at 10, then eliminate the even numbers, then return the length.


Take a list of integers; cap each value at 10, then keep only odd values, then count them.


Take a list of integers; clip values at 10, then eliminate the even numbers, then what's the count.


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


Take a list of integers; cap each value at 10, then keep the odd numbers, then return how many remain.


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


Take a list of people records (name, age); put the youngest at the top, then get the age field, then filter out the odd numbers.


Take a list of people records (name, age); sort records by age, youngest first, then keep just each person's age, then drop the odd numbers.


Take a list of people records (name, age); put the youngest at the top, then extract age values, then filter out the odd numbers.


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then drop the odd numbers.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then filter out the odd numbers.


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


Take a list of people records (name, age); sort records by age, youngest first, then extract the ages, then keep the even numbers.


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


Take a list of integers; extract negatives, then exclude zeros, then increase all numbers by 10.


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


Take a list of integers; extract negatives, then exclude zeros, then give everything a boost of 10.


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


Take a list of integers; extract negatives, then exclude zeros, then add a constant 10 to each.


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


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


Take a list of integers; add one to each, then keep values divisible by 3, then limit every value to 10.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then maximum of 10 for all.


Take a list of integers; add one to each, then drop anything not divisible by three, then limit every value to 10.


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then maximum of 10 for all.


Take a list of integers; add one to each, then keep only multiples of three, then limit every value to 10.


Take a list of integers; make each one bigger, then multiples of three only, then maximum of 10 for all.


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


Take a list of integers; add one to each, then keep multiples of three, then cap each value at 10.


Take a list of integers; if empty, use a single zero, then drop anything 5 or below, then deduplicate the list.


Take a list of integers; if blank use 0, then keep only numbers greater than 5, then remove repeats.


Take a list of integers; default to [0] when there is nothing, then filter for numbers above 5, then deduplicate the list.


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


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


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


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


Take a list of integers; if empty, use a single zero, then keep values greater than five, then drop duplicates keeping first occurrence.


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; take only what comes before the initial zero, then pad to 3, then drop all positive numbers.


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; cut off after the first zero appears, then pad to 3, then drop all positive numbers.


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then drop non-negative values.


Take a list of integers; keep the part before the first 0, then pad to 3, then drop all positive numbers.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then strip the signs.


Take a list of integers; keep evens, then keep only numbers greater than 5, then take abs of each.


Take a list of integers; keep the even numbers, then filter for numbers above 5, then get the absolute value of everything.


Take a list of integers; keep evens, then give me values where x is greater than 5, then apply absolute value to the whole list.


Take a list of integers; keep the even numbers, then show me only the values that are bigger than five, then make them all positive.


Take a list of integers; keep evens, then keep values greater than five, then make every value non-negative.


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


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


Take a list of integers; keep only the first three, then flip the sign of each, then raise each to the power of two.


Take a list of integers; keep the first 3 items, then turn positives to negatives and vice versa, then I need each number multiplied by itself.


Take a list of integers; take the first 3 elements, then flip the sign of each, then square all of them.


Take a list of integers; remove everything after the third, then turn positives to negatives and vice versa, then multiply each element by itself.


Take a list of integers; truncate to three items, then flip the sign of each, then make each one squared.


Take a list of integers; show the first three, then turn positives to negatives and vice versa, then square each value in the list.


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


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


Take a list of integers; sort by absolute value, then keep values above zero, then true if any value equals zero.


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


Take a list of integers; arrange by magnitude ignoring sign, then keep only positive numbers, then true if any value equals zero.


Take a list of integers; put them in order by magnitude, then keep the positives, then check for zero.


Take a list of integers; arrange in order of absolute value, then remove negatives, then true if any value equals zero.


Take a list of integers; sort by distance from zero, then keep the positive numbers, then check for zero.


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


Take a list of integers; sort by absolute value, then keep the positive numbers, then return whether the list contains a zero.


Take a list of integers; if empty, use a single zero, then sort smallest to largest, then bump each up by one.


Take a list of integers; if blank use 0, then Ascending sort, then increment each item.


Take a list of integers; default to [0] when there is nothing, then Sort this ascending, then bump each up by one.


Take a list of integers; when the list is empty, substitute a zero value, then Sort lowest to highest, then increment each item.


Take a list of integers; replace an empty list with one zero, then Arrange from smallest to largest, then bump each up by one.


Take a list of integers; zero it out if it's empty, then sort ascending, then increment each item.


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


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


Take a list of strings; trim whitespace from each, then add '#' to the start of each string, then find how long the longest string is.


Take a list of strings; strip whitespace from every element, then make each one start with a hash, then give the length of the longest string in the list.


Take a list of strings; remove surrounding whitespace, then add '#' to the start of each string, then get me the longest string's length.


Take a list of strings; trim the whitespace off everything, then make each one start with a hash, then give the maximum string length.


Take a list of strings; strip spaces from all strings, then add '#' to the start of each string, then max length of all strings.


Take a list of strings; strip all the strings, then make each one start with a hash, then what's the max string length.


def solve(xs):
    r = list(xs)
    r = [s.strip() for s in r]
    r = ['#' + s for s in r]
    return max((len(s) for s in r), default=0)


Take a list of strings; trim whitespace from each, then prefix each with a hash, then return the length of the longest string (0 if none).


Take a list of integers; take values while they are positive, then clamp each to at most ten, then raise each to the power of two.


Take a list of integers; take positive values then stop, then don't let anything exceed 10, then I need each number multiplied by itself.


Take a list of integers; keep going while positive, then clamp each to at most ten, then square all of them.


Take a list of integers; stop at first non positive, then don't let anything exceed 10, then multiply each element by itself.


Take a list of integers; take while greater than zero, then clamp each to at most ten, then make each one squared.


Take a list of integers; take values while positive, then don't let anything exceed 10, then square each value in the list.


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


Take a list of integers; take values while they are positive, then cap each value at 10, then square each.


Take a list of integers; negate each, then cut the list at the first zero, then drop non-positive values.


Take a list of integers; reverse the signs of everything, then cut off after the first zero appears, then drop the negative numbers.


Take a list of integers; negate each, then take values up to (excluding) the first zero, then filter out the negative ones.


Take a list of integers; reverse the signs of everything, then keep the part before the first 0, then remove all negative values.


Take a list of integers; negate each, then truncate at the first zero, then keep positive values only.


Take a list of integers; reverse the signs of everything, then delete everything starting with the first zero, then keep values above zero.


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


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


Take a list of integers; if empty, use a single zero, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; if blank use 0, then double each item in the list, then strip the zeros.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; when the list is empty, substitute a zero value, then double each item in the list, then strip the zeros.


Take a list of integers; replace an empty list with one zero, then multiply each by two, then keep only non-zero numbers.


Take a list of integers; zero it out if it's empty, then double each item in the list, then strip the zeros.


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


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


Take a list of integers; drop the leading negative values, then extend to length 3 using zeros, then raise each to the power of two.


Take a list of integers; cut the leading negatives, then pad to 3, then I need each number multiplied by itself.


Take a list of integers; skip negatives at the start, then extend to length 3 using zeros, then square all of them.


Take a list of integers; remove all negatives at the front, then pad to 3, then multiply each element by itself.


Take a list of integers; remove the initial run of negative numbers, then extend to length 3 using zeros, then make each one squared.


Take a list of integers; strip the front negatives, then pad to 3, then square each value in the list.


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


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


Take a list of integers; keep multiples of three, then take the final 3 elements, then skip the first one.


Take a list of integers; get rid of non-multiples of three, then drop everything except the final three, then Discard the first element.


Take a list of integers; keep values divisible by 3, then give me the last three elements, then skip the first one.


Take a list of integers; keep items where x mod 3 equals zero, then keep only the last three, then Discard the first element.


Take a list of integers; drop anything not divisible by three, then keep the final three items, then skip the first one.


Take a list of integers; filter out everything except multiples of three, then take the last three, then Discard the first element.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; drop duplicates keeping first occurrence, then double each, then pad with zeros to at least three elements.


Take a list of integers; keep values greater than five, then remove the first item, then keep only non-zero numbers.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then strip the zeros.


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


Take a list of integers; exclude values of 5 and below, then Remove head, then strip the zeros.


Take a list of integers; remove anything 5 or less, then remove the first item, then keep only non-zero numbers.


Take a list of integers; filter to keep only values above 5, then Remove head, then strip the zeros.


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


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


Take a list of integers; add ten to each, then keep the leading run of positive numbers, then drop the odd numbers.


Take a list of integers; bump everything up by 10, then take values while they are positive, then filter out the odd numbers.


Take a list of integers; increase every value by 10, then take positive values then stop, then drop the odd numbers.


Take a list of integers; add 10 to each item, then keep going while positive, then filter out the odd numbers.


Take a list of integers; shift each up by ten, then stop at first non positive, then drop the odd numbers.


Take a list of integers; increase all numbers by 10, then take while greater than zero, then filter out the odd numbers.


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


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


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


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


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


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


Take a list of integers; square each, then keep values above zero, then true only if all are positive.


Take a list of integers; each value squared, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; multiply each value by itself, then keep only positive numbers, then check if every value is positive.


Take a list of integers; square them all, then keep the positives, then confirm all values are positive.


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


Take a list of integers; I need each number multiplied by itself, then keep the positive numbers, then check if every number is above zero.


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


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


Take a list of integers; keep the even numbers, then sort largest to smallest, then limit every value to 10.


Take a list of integers; keep evens, then sort by descending values, then maximum of 10 for all.


Take a list of integers; keep the even numbers, then sort from highest to lowest, then limit every value to 10.


Take a list of integers; keep evens, then sort descending, then maximum of 10 for all.


Take a list of integers; keep the even numbers, then sort largest first, then limit every value to 10.


Take a list of integers; keep evens, then sort in descending order, then maximum of 10 for all.


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


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


Take a list of integers; square each, then remove both ends, then true if at least one even value.


Take a list of integers; each value squared, then trim the edges, then any even.


Take a list of integers; multiply each value by itself, then trim one element off each end, then true if at least one even value.


Take a list of integers; square them all, then cut off the first and last, then any even.


Take a list of integers; raise each to the power of two, then remove the first and last elements, then true if at least one even value.


Take a list of integers; I need each number multiplied by itself, then keep only the middle part, then any even.


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


Take a list of integers; square each, then drop the first and last elements, then return whether any value is even.


Take a list of integers; keep the even numbers, then take the final 3 elements, then give back the product of all values.


Take a list of integers; keep evens, then drop everything except the final three, then product of the list.


Take a list of integers; keep the even numbers, then give me the last three elements, then what's the product.


Take a list of integers; keep evens, then keep only the last three, then what do they multiply to.


Take a list of integers; keep the even numbers, then keep the final three items, then give me their product.


Take a list of integers; keep evens, then take the last three, then multiply them all together.


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


Take a list of integers; keep the even numbers, then keep only the last three, then return their product.


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then keep only numbers above 5.


Take a list of integers; if blank use 0, then remove everything after the third, then exclude values of 5 and below.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then remove anything 5 or less.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then filter to keep only values above 5.


Take a list of integers; replace an empty list with one zero, then take the first three, then get rid of values that aren't greater than five.


Take a list of integers; zero it out if it's empty, then keep first 3, then drop anything 5 or below.


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


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


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


Take a list of integers; rearrange by distance from zero, then remove everything after the third, then fetch the first even element, default to 0.


Take a list of integers; arrange by magnitude ignoring sign, then truncate to three items, then give the earliest even value or zero.


Take a list of integers; put them in order by magnitude, then show the first three, then fetch the first even element, default to 0.


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


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


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


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


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


Take a list of integers; rearrange by distance from zero, then unique values preserving order, then increment each item.


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


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


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


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


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


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


Take a list of integers; double each, then remove the first item, then find the max, defaulting to 0.


Take a list of integers; times two for each item, then Remove head, then Give me the maximum, but 0 if there are no items.


Take a list of integers; double each, then remove the first item, then What's the highest number in the list.


Take a list of integers; times two for each item, then Remove head, then Return the greatest value or default to 0.


Take a list of integers; double each, then remove the first item, then Find the largest element, defaulting to zero.


Take a list of integers; times two for each item, then Remove head, then give the largest value (0 if none).


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


Take a list of integers; double each, then drop the first element, then return the maximum (0 if empty).


Take a list of integers; add one to each, then take the first 3 elements, then find the min, defaulting to 0.


Take a list of integers; make each one bigger, then remove everything after the third, then minimum value, zero otherwise.


Take a list of integers; add one to each, then truncate to three items, then get the minimum value or zero if empty.


Take a list of integers; make each one bigger, then show the first three, then give me the min or 0.


Take a list of integers; add one to each, then take the first three, then return the smallest number, defaulting to 0.


Take a list of integers; make each one bigger, then keep first 3, then return smallest or zero if empty.


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


Take a list of integers; add one to each, then keep only the first three, then return the minimum (0 if empty).


Take a list of integers; drop the first element, then cut the list at the first zero, then remove the initial run of negative numbers.


Take a list of integers; Take everything except the first, then cut off after the first zero appears, then strip the front negatives.


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


Take a list of integers; Take everything except the first, then keep the part before the first 0, then drop negatives from start.


Take a list of integers; drop the first element, then truncate at the first zero, then strip negative values from the start.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; cut the leading negatives, then flip the order around, then drop all positive numbers.


Take a list of integers; skip negatives at the start, then put the elements backwards, then drop non-negative values.


Take a list of integers; remove all negatives at the front, then reverse that for me, then drop all positive numbers.


Take a list of integers; remove the initial run of negative numbers, then flip it backwards, then drop non-negative values.


Take a list of integers; strip the front negatives, then make it backwards, then drop all positive numbers.


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


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


Take a list of integers; keep the odd numbers, then keep only even values, then drop anything not divisible by three.


Take a list of integers; odd numbers only, then extract all even numbers, then filter out everything except multiples of three.


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


Take a list of integers; odd numbers only, then extract all even numbers, then multiples of three only.


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


Take a list of integers; odd numbers only, then extract all even numbers, then give me only the values divisible by three.


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


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


Take a list of strings; sort alphabetically, then order strings from shortest to longest, then return the number of strings.


Take a list of strings; arrange alphabetically, then shortest to longest, then count the strings.


Take a list of strings; sort alphabetically, then arrange by string length ascending, then return how many strings remain.


Take a list of strings; arrange alphabetically, then length sort, then give me the total number of strings.


Take a list of strings; sort alphabetically, then sort by length shortest first, then tell me how many strings we have.


Take a list of strings; arrange alphabetically, then organize by string length least to greatest, then what's the string count.


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = sorted(r, key=len)
    return len(r)


Take a list of strings; sort alphabetically, then sort by length, shortest first, then return how many strings remain.


Take a list of integers; drop the first and last elements, then keep values divisible by 3, then drop non-negative values.


Take a list of integers; take out the first and last items, then keep items where x mod 3 equals zero, then drop all positive numbers.


Take a list of integers; remove both ends, then drop anything not divisible by three, then drop non-negative values.


Take a list of integers; trim the edges, then filter out everything except multiples of three, then drop all positive numbers.


Take a list of integers; trim one element off each end, then keep only multiples of three, then drop non-negative values.


Take a list of integers; cut off the first and last, then multiples of three only, then drop all positive numbers.


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


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


Take a list of integers; drop the first and last elements, then keep only even values, then make each twice as big.


Take a list of integers; take out the first and last items, then extract all even numbers, then multiply each by 2.


Take a list of integers; remove both ends, then keep only even values, then make each twice as big.


Take a list of integers; trim the edges, then extract all even numbers, then multiply each by 2.


Take a list of integers; trim one element off each end, then keep only even values, then make each twice as big.


Take a list of integers; cut off the first and last, then extract all even numbers, then multiply each by 2.


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


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


Take a list of integers; reverse the order, then remove all zero values, then truncate to the last three items.


Take a list of integers; reverse, then exclude zeros, then show only the last three.


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


Take a list of integers; flip the order around, then exclude zeros, then take the final 3 elements.


Take a list of integers; put the elements backwards, then remove all zero values, then drop everything except the final three.


Take a list of integers; reverse that for me, then exclude zeros, then give me the last three elements.


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


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


Take a list of integers; keep everything before the first zero, then default to [0] when there is nothing, then true only if all are positive.


Take a list of integers; take only what comes before the initial zero, then when the list is empty, substitute a zero value, then do all of these have positive values.


Take a list of integers; cut the list at the first zero, then replace an empty list with one zero, then check if every value is positive.


Take a list of integers; cut off after the first zero appears, then zero it out if it's empty, then confirm all values are positive.


Take a list of integers; take values up to (excluding) the first zero, then use zero if the list is empty, then all positive.


Take a list of integers; keep the part before the first 0, then default to zero when empty, then check if every number is above zero.


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


Take a list of integers; keep everything before the first zero, then if empty, use a single zero, then return whether all values are positive.


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


Take a list of integers; get rid of anything that's not positive, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; drop non-positive values, then replace an empty list with one zero, then bump each up by one.


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


Take a list of integers; filter out the negative ones, then use zero if the list is empty, then bump each up by one.


Take a list of integers; remove all negative values, then default to zero when empty, then increment each item.


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


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


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


Take a list of integers; rearrange by distance from zero, then pad to 3, then keep the leading run of positive numbers.


Take a list of integers; arrange by magnitude ignoring sign, then extend to length 3 using zeros, then take values while they are positive.


Take a list of integers; put them in order by magnitude, then pad to 3, then take positive values then stop.


Take a list of integers; arrange in order of absolute value, then extend to length 3 using zeros, then keep going while positive.


Take a list of integers; sort by distance from zero, then pad to 3, then stop at first non positive.


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


Take a list of integers; sort by absolute value, then pad with zeros to at least three elements, then take values while they are positive.


Take a list of integers; keep only the last three, then remove the first item, then give back the total.


Take a list of integers; keep the final three items, then Remove head, then sum r.


Take a list of integers; take the last three, then remove the first item, then add them up.


Take a list of integers; trim to the last three, then Remove head, then calculate the sum of all elements.


Take a list of integers; last three only, then remove the first item, then what's the total.


Take a list of integers; truncate to the last three items, then Remove head, then what do they add up to.


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


Take a list of integers; keep only the last three, then drop the first element, then return their sum.


Take a list of people records (name, age); extract the ages, then keep the leading run of positive numbers, then bump each up by one.


Take a list of people records (name, age); show me all ages, then take values while they are positive, then increment each item.


Take a list of people records (name, age); pluck the age field from each record, then take positive values then stop, then bump each up by one.


Take a list of people records (name, age); get the age field, then keep going while positive, then increment each item.


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


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


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


Take a list of people records (name, age); extract the ages, then take values while they are positive, then add one to each.


Take a list of strings; lowercase each string, then order strings from shortest to longest, then count characters across all strings.


Take a list of strings; change to lowercase, then shortest to longest, then character count.


Take a list of strings; lowercase each string, then arrange by string length ascending, then count all the characters.


Take a list of strings; change to lowercase, then length sort, then total number of characters.


Take a list of strings; lowercase each string, then sort by length shortest first, then what's the total character count.


Take a list of strings; change to lowercase, then organize by string length least to greatest, then add up the lengths.


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


Take a list of strings; lowercase each string, then sort by length, shortest first, then return the total number of characters.


Take a list of people records (name, age); extract the ages, then sort smallest to largest, then find the max, defaulting to 0.


Take a list of people records (name, age); show me all ages, then Ascending sort, then Give me the maximum, but 0 if there are no items.


Take a list of people records (name, age); pluck the age field from each record, then Sort this ascending, then What's the highest number in the list.


Take a list of people records (name, age); get the age field, then Sort lowest to highest, then Return the greatest value or default to 0.


Take a list of people records (name, age); keep just each person's age, then Arrange from smallest to largest, then Find the largest element, defaulting to zero.


Take a list of people records (name, age); extract age values, then sort ascending, then give the largest value (0 if none).


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


Take a list of people records (name, age); extract the ages, then sort ascending, then return the maximum (0 if empty).


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


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


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


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


Take a list of integers; last three only, then truncate at the first zero, then filter for numbers divisible by three.


Take a list of integers; truncate to the last three items, then delete everything starting with the first zero, then give me only the values divisible by three.


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


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


Take a list of integers; drop the first element, then multiply each value by itself, then give back the total.


Take a list of integers; Take everything except the first, then square them all, then sum r.


Take a list of integers; drop the first element, then raise each to the power of two, then add them up.


Take a list of integers; Take everything except the first, then I need each number multiplied by itself, then calculate the sum of all elements.


Take a list of integers; drop the first element, then square all of them, then what's the total.


Take a list of integers; Take everything except the first, then multiply each element by itself, then what do they add up to.


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


Take a list of integers; drop the first element, then square each, then return their sum.


Take a list of integers; reverse the order, then increase every value by 10, then deduplicate the list.


Take a list of integers; reverse, then add 10 to each item, then remove repeats.


Take a list of integers; flip the list around, then shift each up by ten, then deduplicate the list.


Take a list of integers; flip the order around, then increase all numbers by 10, then remove repeats.


Take a list of integers; put the elements backwards, then add 10 to everything, then deduplicate the list.


Take a list of integers; reverse that for me, then give everything a boost of 10, then remove repeats.


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


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


Take a list of integers; take values while they are positive, then multiply each value by itself, then limit every value to 10.


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


Take a list of integers; keep going while positive, then raise each to the power of two, then limit every value to 10.


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


Take a list of integers; take while greater than zero, then square all of them, then limit every value to 10.


Take a list of integers; take values while positive, then multiply each element by itself, then maximum of 10 for all.


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


Take a list of integers; take values while they are positive, then square each, then cap each value at 10.


Take a list of integers; take the absolute value of each, then flip the sign of each, then arrange by magnitude ignoring sign.


Take a list of integers; convert to absolute value, then turn positives to negatives and vice versa, then put them in order by magnitude.


Take a list of integers; strip the signs, then flip the sign of each, then arrange in order of absolute value.


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


Take a list of integers; get the absolute value of everything, then flip the sign of each, then order by how far from zero.


Take a list of integers; apply absolute value to the whole list, then turn positives to negatives and vice versa, then order by distance from zero.


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


Take a list of integers; take the absolute value of each, then negate each, then sort by absolute value.


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


Take a list of integers; make each one bigger, then flip the order around, then cut off the first and last.


Take a list of integers; add one to each, then put the elements backwards, then remove the first and last elements.


Take a list of integers; make each one bigger, then reverse that for me, then keep only the middle part.


Take a list of integers; add one to each, then flip it backwards, then drop first and last.


Take a list of integers; make each one bigger, then make it backwards, then eliminate the outermost elements.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then raise each to the power of two.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, then I need each number multiplied by itself.


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then square all of them.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, then multiply each element by itself.


Take a list of integers; pad with zeros to at least three elements, then keep only even values, then make each one squared.


Take a list of integers; add zeros until the list has at least three values, then extract all even numbers, 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 = [x for x in r if x % 2 == 0]
    r = [x * x for x in r]
    return r


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


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


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


Take a list of integers; keep the negative numbers, then trim one element off each end, then remove all but the last three.


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


Take a list of integers; keep the negative numbers, then remove the first and last elements, then drop everything except the final three.


Take a list of integers; extract negatives, then keep only the middle part, then give me the last three elements.


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 last three.


Take a list of integers; keep only the last three, then keep values below zero, then remove the initial run of negative numbers.


Take a list of integers; keep the final three items, then get the negative numbers, then strip the front negatives.


Take a list of integers; take the last three, then keep values below zero, then remove leading negative numbers.


Take a list of integers; trim to the last three, then get the negative numbers, then drop negatives from start.


Take a list of integers; last three only, then keep values below zero, then strip negative values from the start.


Take a list of integers; truncate to the last three items, then get the negative numbers, then remove negatives before the first non-negative.


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


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


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


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then give the earliest even value or zero.


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


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


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


Take a list of integers; take out the first and last items, then square them all, then Organize these ascending.


Take a list of integers; remove both ends, then raise each to the power of two, then Sort in ascending order.


Take a list of integers; trim the edges, then I need each number multiplied by itself, then I need this sorted ascending.


Take a list of integers; trim one element off each end, then square all of them, then Put these in ascending order.


Take a list of integers; cut off the first and last, then multiply each element by itself, then sort smallest to largest.


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


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


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


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then cut off the first and last.


Take a list of integers; double each, then flip the sign of each, then remove the first and last elements.


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then keep only the middle part.


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


Take a list of integers; times two for each item, then turn positives to negatives and vice versa, then eliminate the outermost elements.


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


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


Take a list of people records (name, age); extract the ages, then keep the leading run of positive numbers, then raise each to the power of two.


Take a list of people records (name, age); show me all ages, then take values while they are positive, then I need each number multiplied by itself.


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


Take a list of people records (name, age); get the age field, then keep going while positive, then multiply each element by itself.


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


Take a list of people records (name, age); extract age values, then take while greater than zero, then square each value in the list.


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


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


Take a list of integers; cap each value at 10, then skip negatives at the start, then arrange in decreasing order.


Take a list of integers; clip values at 10, then remove all negatives at the front, then arrange in descending order.


Take a list of integers; cap each value at 10, then remove the initial run of negative numbers, then reverse sort.


Take a list of integers; clip values at 10, then strip the front negatives, then sort largest to smallest.


Take a list of integers; cap each value at 10, then remove leading negative numbers, then sort by descending values.


Take a list of integers; clip values at 10, then drop negatives from start, then sort from highest to lowest.


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


Take a list of integers; cap each value at 10, then drop the leading negative values, then sort descending.


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


Take a list of integers; convert to absolute value, then don't let anything exceed 10, then check for zero.


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


Take a list of integers; take abs of each, then don't let anything exceed 10, then check for zero.


Take a list of integers; get the absolute value of everything, then clamp each to at most ten, then true if any value equals zero.


Take a list of integers; apply absolute value to the whole list, then don't let anything exceed 10, then check for zero.


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


Take a list of integers; take the absolute value of each, then cap each value at 10, then return whether the list contains a zero.


Take a list of integers; drop the leading negative values, then increment each value, then limit every value to 10.


Take a list of integers; cut the leading negatives, then plus one for all, then maximum of 10 for all.


Take a list of integers; skip negatives at the start, then increment each value, then limit every value to 10.


Take a list of integers; remove all negatives at the front, then plus one for all, then maximum of 10 for all.


Take a list of integers; remove the initial run of negative numbers, then increment each value, then limit every value to 10.


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


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


Take a list of integers; drop the leading negative values, then add one to each, then cap each value at 10.


Take a list of integers; keep the negative numbers, then remove all zero values, then keep only numbers above 5.


Take a list of integers; extract negatives, then exclude zeros, then exclude values of 5 and below.


Take a list of integers; keep the negative numbers, then remove all zero values, then remove anything 5 or less.


Take a list of integers; extract negatives, then exclude zeros, then filter to keep only values above 5.


Take a list of integers; keep the negative numbers, then remove all zero values, then get rid of values that aren't greater than five.


Take a list of integers; extract negatives, then exclude zeros, then drop anything 5 or below.


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


Take a list of integers; keep the negative numbers, then drop the zeros, then keep values greater than five.


Take a list of integers; sort by absolute value, then clamp each to at most ten, then truncate to three items.


Take a list of integers; rearrange by distance from zero, then don't let anything exceed 10, then show the first three.


Take a list of integers; arrange by magnitude ignoring sign, then clamp each to at most ten, then take the first three.


Take a list of integers; put them in order by magnitude, then don't let anything exceed 10, then keep first 3.


Take a list of integers; arrange in order of absolute value, then clamp each to at most ten, then truncate to first three.


Take a list of integers; sort by distance from zero, then don't let anything exceed 10, then first three.


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


Take a list of integers; sort by absolute value, then cap each value at 10, then keep only the first three.


Take a list of integers; drop the first element, then clamp each to at most ten, then drop anything not divisible by three.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then filter out everything except multiples of three.


Take a list of integers; drop the first element, then clamp each to at most ten, then keep only multiples of three.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then multiples of three only.


Take a list of integers; drop the first element, then clamp each to at most ten, then filter for numbers divisible by three.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then give me only the values divisible by three.


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


Take a list of integers; drop the first element, then cap each value at 10, then keep multiples of three.


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


Take a list of integers; clip values at 10, then get the negative numbers, then negate.


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


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


Take a list of integers; keep only the first three, then order by distance from zero, then give back the total.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then sum r.


Take a list of integers; take the first 3 elements, then organize by magnitude, then add them up.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then calculate the sum of all elements.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then what's the total.


Take a list of integers; show the first three, then sort by absolute value, then what do they add up to.


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


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


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


Take a list of integers; keep only nonzero elements, then trim the edges, then keep the part before the first 0.


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


Take a list of integers; keep only nonzero elements, then cut off the first and last, then delete everything starting with the first zero.


Take a list of integers; drop the zeros, then remove the first and last elements, then remove from the first zero onwards.


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


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


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


Take a list of integers; keep multiples of three, then flip the list around, then deduplicate the list.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then remove repeats.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then deduplicate the list.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then remove repeats.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then deduplicate the list.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then remove repeats.


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


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


Take a list of integers; cap each value at 10, then increase every value by 10, then put the elements backwards.


Take a list of integers; clip values at 10, then add 10 to each item, then reverse that for me.


Take a list of integers; cap each value at 10, then shift each up by ten, then flip it backwards.


Take a list of integers; clip values at 10, then increase all numbers by 10, then make it backwards.


Take a list of integers; cap each value at 10, then add 10 to everything, then reverse the list.


Take a list of integers; clip values at 10, then give everything a boost of 10, then invert the sequence.


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


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