Take a list of people records (name, age); extract the ages, then sort by absolute value, then pad with zeros to at least three elements.


Take a list of people records (name, age); extract the ages, then keep only odd values, then give the number of evens.


Take a list of people records (name, age); show me all ages, then eliminate the even numbers, then find how many values are divisible by two.


Take a list of people records (name, age); pluck the age field from each record, then keep only odd values, then how many are even.


Take a list of people records (name, age); get the age field, then eliminate the even numbers, then get the total number of even values in the list.


Take a list of people records (name, age); keep just each person's age, then keep only odd values, then give me the count of even values.


Take a list of people records (name, age); extract age values, then eliminate the even numbers, then I need to know how many of these are even.


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


Take a list of people records (name, age); extract the ages, then keep the odd numbers, then return how many values are even.


Take a list of people records (name, age); extract the ages, then multiply each value by itself, then drop non-negative values.


Take a list of people records (name, age); show me all ages, then square them all, then drop all positive numbers.


Take a list of people records (name, age); pluck the age field from each record, then raise each to the power of two, then drop non-negative values.


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


Take a list of people records (name, age); keep just each person's age, then square all of them, then drop non-negative values.


Take a list of people records (name, age); extract age values, then multiply each element by itself, then drop all positive numbers.


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


Take a list of people records (name, age); extract the ages, then square each, then keep the negative numbers.


Take a list of integers; keep the even numbers, then multiply each by two, then reduce each by one.


Take a list of integers; keep evens, then double each item in the list, then Subtract 1 from all.


Take a list of integers; keep the even numbers, then multiply each by two, then Subtract one from each.


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


Take a list of integers; keep the even numbers, then multiply each by two, then Decrease all values by one.


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


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


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


Take a list of integers; sort ascending, then skip negatives at the start, then reduce each by one.


Take a list of integers; Sort it from low to high, then remove all negatives at the front, then Subtract 1 from all.


Take a list of integers; arrange in increasing order, then remove the initial run of negative numbers, then Subtract one from each.


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


Take a list of integers; Sort in ascending order, then remove leading negative numbers, then Decrease all values by one.


Take a list of integers; I need this sorted ascending, then drop negatives from start, then Remove one from each value.


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 drop the leading negative values, then subtract one from each.


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


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then show the first three.


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


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then keep first 3.


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


Take a list of integers; clip values at 10, then turn positives to negatives and vice versa, then first three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then cut the list at the first zero, then raise each to the power of two.


Take a list of integers; drop duplicates but keep the first one, then cut off after the first zero appears, then I need each number multiplied by itself.


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


Take a list of integers; drop duplicates but keep the first one, then keep the part before the first 0, then multiply each element by itself.


Take a list of integers; drop duplicates keeping first occurrence, then truncate at the first zero, then make each one squared.


Take a list of integers; drop duplicates but keep the first one, then delete everything starting with the first zero, then square each value in the list.


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


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


Take a list of integers; sort ascending, then make every value non-negative, then keep only non-zero numbers.


Take a list of integers; Sort it from low to high, then absolute value for all items, then strip the zeros.


Take a list of integers; arrange in increasing order, then take absolute values, then keep only non-zero numbers.


Take a list of integers; Organize these ascending, then turn negatives into positives, then strip the zeros.


Take a list of integers; Sort in ascending order, then abs each element, then keep only non-zero numbers.


Take a list of integers; I need this sorted ascending, then take the absolute value of each, then strip the zeros.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then make each twice as big.


Take a list of integers; add zeros until the list has at least three values, then exclude zeros, then multiply each by 2.


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


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


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


Take a list of integers; each value squared, then eliminate the even numbers, then filter out the odd numbers.


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


Take a list of integers; square them all, then eliminate the even numbers, then filter out the odd numbers.


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


Take a list of integers; I need each number multiplied by itself, then eliminate the even numbers, then filter out the odd numbers.


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


Take a list of integers; square each, then keep the odd numbers, then keep the even numbers.


Take a list of integers; add one to each, then order by distance from zero, then keep only non-zero numbers.


Take a list of integers; make each one bigger, then sort based on absolute value, then strip the zeros.


Take a list of integers; add one to each, then organize by magnitude, then keep only non-zero numbers.


Take a list of integers; make each one bigger, then arrange by absolute value ascending, then strip the zeros.


Take a list of integers; add one to each, then sort from smallest to largest absolute value, then keep only non-zero numbers.


Take a list of integers; make each one bigger, then sort by absolute value, then strip the zeros.


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


Take a list of integers; add one to each, then sort by absolute value, then drop the zeros.


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


Take a list of integers; keep the first 3 items, then eliminate the even numbers, then strip the front negatives.


Take a list of integers; take the first 3 elements, then keep only odd values, then remove leading negative numbers.


Take a list of integers; remove everything after the third, then eliminate the even numbers, then drop negatives from start.


Take a list of integers; truncate to three items, then keep only odd values, then strip negative values from the start.


Take a list of integers; show the first three, then eliminate the even 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 % 2 != 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 first three, then keep the odd numbers, then drop the leading negative values.


Take a list of strings; sort by length, shortest first, then add '#' to the start of each string, then find the longest one, defaulting to empty.


Take a list of strings; sort ascending by length, then make each one start with a hash, then Longest string, or nothing if there isn't one.


Take a list of strings; order strings from shortest to longest, then add '#' to the start of each string, then find the longest one, defaulting to empty.


Take a list of strings; shortest to longest, then make each one start with a hash, then Longest string, or nothing if there isn't one.


Take a list of strings; arrange by string length ascending, then add '#' to the start of each string, then find the longest one, defaulting to empty.


Take a list of strings; length sort, then make each one start with a hash, then Longest string, or nothing if there isn't one.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=len)
    r = ['#' + s for s in r]
    return max(r, key=len) if r else ''


Take a list of strings; sort by length, shortest first, then prefix each with a hash, then return the longest string (empty if none).


Take a list of integers; cap each value at 10, then remove the first item, then make each twice as big.


Take a list of integers; clip values at 10, then Remove head, then multiply each by 2.


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


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


Take a list of people records (name, age); extract the ages, then flip the sign of each, then shift each up by ten.


Take a list of people records (name, age); show me all ages, then turn positives to negatives and vice versa, then increase all numbers by 10.


Take a list of people records (name, age); pluck the age field from each record, then flip the sign of each, then add 10 to everything.


Take a list of people records (name, age); get the age field, then turn positives to negatives and vice versa, then give everything a boost of 10.


Take a list of people records (name, age); keep just each person's age, then flip the sign of each, then increment each by ten.


Take a list of people records (name, age); extract age values, then turn positives to negatives and vice versa, then add a constant 10 to each.


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


Take a list of people records (name, age); extract the ages, then negate each, then add ten to each.


Take a list of integers; keep the negative numbers, then flip the list around, then keep only non-zero numbers.


Take a list of integers; extract negatives, then flip the order around, then strip the zeros.


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


Take a list of integers; extract negatives, then reverse that for me, then strip the zeros.


Take a list of integers; keep the negative numbers, then flip it backwards, then keep only non-zero numbers.


Take a list of integers; extract negatives, then make it backwards, then strip the zeros.


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


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


Take a list of integers; keep the negative numbers, then cut the list at the first zero, then ensure at least three items by appending zeros.


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


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


Take a list of integers; extract negatives, then keep the part before the first 0, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep the negative numbers, then truncate at the first zero, then ensure at least three items by appending zeros.


Take a list of integers; extract negatives, then delete everything starting with the first zero, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; each value squared, then absolute value for all items, then fetch the first even element, default to 0.


Take a list of integers; multiply each value by itself, then take absolute values, then give the earliest even value or zero.


Take a list of integers; square them all, then turn negatives into positives, then fetch the first even element, default to 0.


Take a list of integers; raise each to the power of two, then abs each element, then give the earliest even value or zero.


Take a list of integers; I need each number multiplied by itself, then take the absolute value of each, then fetch the first even element, default to 0.


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


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


Take a list of people records (name, age); extract the ages, then sort largest to smallest, then bump each up by one.


Take a list of people records (name, age); show me all ages, then sort by descending values, then increment each item.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest, then bump each up by one.


Take a list of people records (name, age); get the age field, then sort descending, then increment each item.


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


Take a list of people records (name, age); extract age values, then sort in descending order, then increment each item.


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


Take a list of people records (name, age); extract the ages, then sort descending, then add one to each.


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


Take a list of integers; cut the leading negatives, then flip the order around, then filter out the odd numbers.


Take a list of integers; skip negatives at the start, then put the elements backwards, then drop the odd numbers.


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


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


Take a list of integers; strip the front negatives, then make it backwards, then filter out the odd numbers.


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


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


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


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


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


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


Take a list of integers; keep the negative numbers, then use zero if the list is empty, then truncate to first three.


Take a list of integers; extract negatives, then default to zero when empty, then first three.


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


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


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


Take a list of integers; reverse the signs of everything, then flip the order around, then increase all numbers by 10.


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


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


Take a list of integers; negate each, then flip it backwards, then increment each by ten.


Take a list of integers; reverse the signs of everything, then make it backwards, then add a constant 10 to each.


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


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


Take a list of integers; keep values greater than five, then keep values divisible by 3, then true if already sorted smallest to largest.


Take a list of integers; filter out values less than or equal to 5, then keep items where x mod 3 equals zero, then does this list go in ascending order.


Take a list of integers; keep only numbers above 5, then drop anything not divisible by three, then check if the list is in ascending order.


Take a list of integers; exclude values of 5 and below, then filter out everything except multiples of three, then is the list sorted.


Take a list of integers; remove anything 5 or less, then keep only multiples of three, then is it sorted.


Take a list of integers; filter to keep only values above 5, then multiples of three only, then check if values are in increasing order.


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


Take a list of integers; keep values greater than five, then keep multiples of three, then return whether the list is sorted ascending.


Take a list of integers; keep only the last three, then remove the first item, then find the max, defaulting to 0.


Take a list of integers; keep the final three items, then Remove head, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the last three, then remove the first item, then What's the highest number in the list.


Take a list of integers; trim to the last three, then Remove head, then Return the greatest value or default to 0.


Take a list of integers; last three only, then remove the first item, then Find the largest element, defaulting to zero.


Take a list of integers; truncate to the last three items, then Remove head, then give the largest value (0 if none).


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


Take a list of integers; keep only the last three, then drop the first element, then return the maximum (0 if empty).


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


Take a list of integers; get rid of non-multiples of three, then Remove head, then any even.


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


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


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


Take a list of integers; filter out everything except multiples of three, then Remove head, then any even.


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


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


Take a list of integers; sort by absolute value, then keep the leading run of positive numbers, then keep only numbers above 5.


Take a list of integers; rearrange by distance from zero, then take values while they are positive, then exclude values of 5 and below.


Take a list of integers; arrange by magnitude ignoring sign, then take positive values then stop, then remove anything 5 or less.


Take a list of integers; put them in order by magnitude, then keep going while positive, then filter to keep only values above 5.


Take a list of integers; arrange in order of absolute value, then stop at first non positive, then get rid of values that aren't greater than five.


Take a list of integers; sort by distance from zero, then take while greater than zero, then drop anything 5 or below.


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


Take a list of integers; sort by absolute value, then take values while they are positive, then keep values greater than five.


Take a list of integers; double each, then keep values above zero, then raise each to the power of two.


Take a list of integers; times two for each item, then filter for positive numbers, then I need each number multiplied by itself.


Take a list of integers; double each, then keep only positive numbers, then square all of them.


Take a list of integers; times two for each item, then keep the positives, then multiply each element by itself.


Take a list of integers; double each, then remove negatives, then make each one squared.


Take a list of integers; times two for each item, then keep the positive numbers, then square each value in the list.


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


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


Take a list of integers; keep the odd numbers, then remove repeated values, then stop at the first non-positive value.


Take a list of integers; odd numbers only, then unique values preserving order, then keep the leading run of positive numbers.


Take a list of integers; keep the odd numbers, then remove repeated values, then take values while they are positive.


Take a list of integers; odd numbers only, then unique values preserving order, then take positive values then stop.


Take a list of integers; keep the odd numbers, then remove repeated values, then keep going while positive.


Take a list of integers; odd numbers only, then unique values preserving order, then stop at first non positive.


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


Take a list of integers; keep the odd numbers, then drop duplicates keeping first occurrence, then take values while they are positive.


Take a list of integers; if empty, use a single zero, then cut the list at the first zero, then remove the initial run of negative numbers.


Take a list of integers; if blank use 0, then cut off after the first zero appears, then strip the front negatives.


Take a list of integers; default to [0] when there is nothing, then take values up to (excluding) the first zero, then remove leading negative numbers.


Take a list of integers; when the list is empty, substitute a zero value, then keep the part before the first 0, then drop negatives from start.


Take a list of integers; replace an empty list with one zero, then truncate at the first zero, then strip negative values from the start.


Take a list of integers; zero it out if it's empty, then delete everything starting with the first zero, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    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; if empty, use a single zero, then keep everything before the first zero, then drop the leading negative values.


Take a list of integers; drop the first and last elements, then take the first 3 elements, then keep only numbers above 5.


Take a list of integers; take out the first and last items, then remove everything after the third, then exclude values of 5 and below.


Take a list of integers; remove both ends, then truncate to three items, then remove anything 5 or less.


Take a list of integers; trim the edges, then show the first three, then filter to keep only values above 5.


Take a list of integers; trim one element off each end, then take the first three, then get rid of values that aren't greater than five.


Take a list of integers; cut off the first and last, then keep first 3, then drop anything 5 or below.


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


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


Take a list of integers; keep the odd numbers, then keep values below zero, then count the elements.


Take a list of integers; odd numbers only, then get the negative numbers, then how many items remain.


Take a list of integers; keep the odd numbers, then keep values below zero, then tell me the length.


Take a list of integers; odd numbers only, then get the negative numbers, then return the length.


Take a list of integers; keep the odd numbers, then keep values below zero, then count them.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the first element, then keep values below zero, then arrange in decreasing order.


Take a list of integers; Take everything except the first, then get the negative numbers, then arrange in descending order.


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


Take a list of integers; Take everything except the first, then get the negative numbers, then sort largest to smallest.


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


Take a list of integers; Take everything except the first, then get the negative numbers, then sort from highest to lowest.


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


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


Take a list of integers; sort by absolute value, then keep values below zero, then true only if all are positive.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then do all of these have positive values.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then check if every value is positive.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then confirm all values are positive.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then all positive.


Take a list of integers; sort by distance from zero, then get the negative numbers, then check if every number is above zero.


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


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


Take a list of integers; keep the even numbers, then keep values divisible by 3, then truncate to three items.


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


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


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


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


Take a list of integers; keep evens, then multiples of three only, then first 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 % 3 == 0]
    r = r[:3]
    return r


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


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


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


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


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


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


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


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


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


Take a list of integers; sort by absolute value, then flip the list around, then make each twice as big.


Take a list of integers; rearrange by distance from zero, then flip the order around, then multiply each by 2.


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards, then make each twice as big.


Take a list of integers; put them in order by magnitude, then reverse that for me, then multiply each by 2.


Take a list of integers; arrange in order of absolute value, then flip it backwards, then make each twice as big.


Take a list of integers; sort by distance from zero, then make it backwards, then multiply each by 2.


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


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


Take a list of integers; cap each value at 10, then make every value non-negative, then drop the even numbers.


Take a list of integers; clip values at 10, then absolute value for all items, then strip out the evens.


Take a list of integers; cap each value at 10, then take absolute values, then drop the even numbers.


Take a list of integers; clip values at 10, then turn negatives into positives, then strip out the evens.


Take a list of integers; cap each value at 10, then abs each element, then drop the even numbers.


Take a list of integers; clip values at 10, then take the absolute value of each, then strip out the evens.


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


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


Take a list of integers; drop the first element, then sort largest to smallest, then shift each up by ten.


Take a list of integers; Take everything except the first, then sort by descending values, then increase all numbers by 10.


Take a list of integers; drop the first element, then sort from highest to lowest, then add 10 to everything.


Take a list of integers; Take everything except the first, then sort descending, then give everything a boost of 10.


Take a list of integers; drop the first element, then sort largest first, then increment each by ten.


Take a list of integers; Take everything except the first, then sort in descending order, then add a constant 10 to each.


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


Take a list of integers; drop the first element, then sort descending, then add ten to each.


Take a list of integers; square each, then remove repeated values, then drop anything not divisible by three.


Take a list of integers; each value squared, then unique values preserving order, then filter out everything except multiples of three.


Take a list of integers; multiply each value by itself, then remove repeated values, then keep only multiples of three.


Take a list of integers; square them all, then unique values preserving order, then multiples of three only.


Take a list of integers; raise each to the power of two, then remove repeated values, then filter for numbers divisible by three.


Take a list of integers; I need each number multiplied by itself, then unique values preserving order, then give me only the values divisible by three.


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


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


Take a list of integers; keep only the last three, then keep only even values, then keep only numbers above 5.


Take a list of integers; keep the final three items, then extract all even numbers, then exclude values of 5 and below.


Take a list of integers; take the last three, then keep only even values, then remove anything 5 or less.


Take a list of integers; trim to the last three, then extract all even numbers, then filter to keep only values above 5.


Take a list of integers; last three only, then keep only even values, then get rid of values that aren't greater than five.


Take a list of integers; truncate to the last three items, then extract all even numbers, then drop anything 5 or below.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then trim one element off each end.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then cut off the first and last.


Take a list of integers; drop duplicates keeping first occurrence, then flip the sign of each, then remove the first and last elements.


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then keep only the middle part.


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


Take a list of integers; drop duplicates but keep the first one, then turn positives to negatives and vice versa, then eliminate the outermost elements.


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


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


Take a list of integers; add ten to each, then take the first 3 elements, then stop at the first non-positive value.


Take a list of integers; bump everything up by 10, then remove everything after the third, then keep the leading run of positive numbers.


Take a list of integers; increase every value by 10, then truncate to three items, then take values while they are positive.


Take a list of integers; add 10 to each item, then show the first three, then take positive values then stop.


Take a list of integers; shift each up by ten, then take the first three, then keep going while positive.


Take a list of integers; increase all numbers by 10, then keep first 3, then stop at first non positive.


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


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


Take a list of integers; reverse the order, then extend to length 3 using zeros, then replace an empty list with one zero.


Take a list of integers; reverse, then pad to 3, then zero it out if it's empty.


Take a list of integers; flip the list around, then extend to length 3 using zeros, then use zero if the list is empty.


Take a list of integers; flip the order around, then pad to 3, then default to zero when empty.


Take a list of integers; put the elements backwards, then extend to length 3 using zeros, then if there's nothing, put in a zero.


Take a list of integers; reverse that for me, then pad to 3, then if no items, add a zero.


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


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


Take a list of integers; sort ascending, then clamp each to at most ten, then true if already sorted smallest to largest.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then does this list go in ascending order.


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


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then is the list sorted.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then is it sorted.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then check if values are in increasing order.


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


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


Take a list of integers; sort descending, then increment each value, then truncate to three items.


Take a list of integers; sort largest first, then plus one for all, then show the first three.


Take a list of integers; sort in descending order, then increment each value, then take the first three.


Take a list of integers; sort from greatest to least, then plus one for all, then keep first 3.


Take a list of integers; sort z to a, then increment each value, then truncate to first three.


Take a list of integers; arrange in decreasing order, then plus one for all, then first three.


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


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


Take a list of integers; keep the negative numbers, then sort largest to smallest, then true if any value equals zero.


Take a list of integers; extract negatives, then sort by descending values, then check for zero.


Take a list of integers; keep the negative numbers, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; extract negatives, then sort descending, then check for zero.


Take a list of integers; keep the negative numbers, then sort largest first, then true if any value equals zero.


Take a list of integers; extract negatives, then sort in descending order, then check for zero.


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


Take a list of integers; keep the negative numbers, then sort descending, then return whether the list contains a zero.


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


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


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


Take a list of integers; Lower each number by one, then filter out everything except multiples of three, then fetch the first even element, default to 0.


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


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


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


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


Take a list of integers; keep the negative numbers, then default to [0] when there is nothing, then arrange in increasing order.


Take a list of integers; extract negatives, then when the list is empty, substitute a zero value, then Organize these ascending.


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


Take a list of integers; extract negatives, then zero it out if it's empty, then I need this sorted ascending.


Take a list of integers; keep the negative numbers, then use zero if the list is empty, then Put these in ascending order.


Take a list of integers; extract negatives, 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 < 0]
    r = r if r else [0]
    r = sorted(r)
    return r


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


Take a list of integers; keep the even numbers, then multiply each by two, then find the max, defaulting to 0.


Take a list of integers; keep evens, then double each item in the list, then Give me the maximum, but 0 if there are no items.


Take a list of integers; keep the even numbers, then multiply each by two, then What's the highest number in the list.


Take a list of integers; keep evens, then double each item in the list, then Return the greatest value or default to 0.


Take a list of integers; keep the even numbers, then multiply each by two, then Find the largest element, defaulting to zero.


Take a list of integers; keep evens, then double each item in the list, then give the largest value (0 if none).


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


Take a list of integers; keep the even numbers, then double each, then return the maximum (0 if empty).


Take a list of integers; square each, then sort smallest to largest, then multiply each by -1.


Take a list of integers; each value squared, then Ascending sort, then negate.


Take a list of integers; multiply each value by itself, then Sort this ascending, then multiply each by -1.


Take a list of integers; square them all, then Sort lowest to highest, then negate.


Take a list of integers; raise each to the power of two, then Arrange from smallest to largest, then multiply each by -1.


Take a list of integers; I need each number multiplied by itself, then sort ascending, then negate.


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


Take a list of integers; square each, then sort ascending, then negate each.


Take a list of integers; pad with zeros to at least three elements, then increment each value, then deduplicate the list.


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then remove repeats.


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


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


Take a list of integers; negate each, then keep the leading run of positive numbers, then make each twice as big.


Take a list of integers; reverse the signs of everything, then take values while they are positive, then multiply each by 2.


Take a list of integers; negate each, then take positive values then stop, then make each twice as big.


Take a list of integers; reverse the signs of everything, then keep going while positive, then multiply each by 2.


Take a list of integers; negate each, then stop at first non positive, then make each twice as big.


Take a list of integers; reverse the signs of everything, then take while greater than zero, then multiply each by 2.


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


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


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


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


Take a list of integers; drop the zeros, then multiply each by two, then get the absolute value of everything.


Take a list of integers; keep only nonzero elements, then double each item in the list, then apply absolute value to the whole list.


Take a list of integers; drop the zeros, then multiply each by two, then make them all positive.


Take a list of integers; keep only nonzero elements, then double each item in the list, then make every value non-negative.


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


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


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


Take a list of integers; take only what comes before the initial zero, then double each item in the list, then arrange in descending order.


Take a list of integers; cut the list at the first zero, then multiply each by two, then reverse sort.


Take a list of integers; cut off after the first zero appears, then double each item in the list, then sort largest to smallest.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then sort by descending values.


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


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


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


Take a list of strings; lowercase each string, then order strings from shortest to longest, then return them as one comma-separated string.


Take a list of strings; change to lowercase, then shortest to longest, then separate by comma.


Take a list of strings; lowercase each string, then arrange by string length ascending, then join with commas.


Take a list of strings; change to lowercase, then length sort, then comma join.


Take a list of strings; lowercase each string, then sort by length shortest first, then combine using commas.


Take a list of strings; change to lowercase, then organize by string length least to greatest, then connect with commas between each item.


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


Take a list of strings; lowercase each string, then sort by length, shortest first, then join them with commas.


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


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then cut off the first and last.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then keep only the middle part.


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


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then eliminate the outermost elements.


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


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


Take a list of strings; keep the first character of each (dropping empties), then order strings from shortest to longest, then remove short strings (under 3 chars).


Take a list of strings; extract initial letters, then shortest to longest, then only keep strings with three or more characters.


Take a list of strings; take each string's first letter, then arrange by string length ascending, then keep only strings that are at least three characters long.


Take a list of strings; give me the first letter of everything, then length sort, then filter strings shorter than 3 chars.


Take a list of strings; reduce each string to its first character, then sort by length shortest first, then drop anything shorter than three characters.


Take a list of strings; take first char drop blanks, then organize by string length least to greatest, then keep only strings of length 3 or more.


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


Take a list of strings; keep the first character of each (dropping empties), then sort by length, shortest first, then drop strings shorter than three characters.


Take a list of integers; add ten to each, then decrement each value, then remove the initial run of negative numbers.


Take a list of integers; bump everything up by 10, then Lower each number by one, then strip the front negatives.


Take a list of integers; increase every value by 10, then reduce each by one, then remove leading negative numbers.


Take a list of integers; add 10 to each item, then Subtract 1 from all, then drop negatives from start.


Take a list of integers; shift each up by ten, then Subtract one from each, then strip negative values from the start.


Take a list of integers; increase all numbers by 10, then Drop each by one, then remove negatives before the first non-negative.


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


Take a list of integers; add ten to each, then subtract one from each, then drop the leading negative values.


Take a list of integers; drop the zeros, then flip the list around, then count the elements.


Take a list of integers; keep only nonzero elements, then flip the order around, then how many items remain.


Take a list of integers; drop the zeros, then put the elements backwards, then tell me the length.


Take a list of integers; keep only nonzero elements, then reverse that for me, then return the length.


Take a list of integers; drop the zeros, then flip it backwards, then count them.


Take a list of integers; keep only nonzero elements, then make it backwards, then what's the count.


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


Take a list of integers; drop the zeros, then reverse the order, then return how many remain.


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


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


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


Take a list of integers; Take everything except the first, then strip the front negatives, then multiply each element by itself.


Take a list of integers; drop the first element, then remove leading negative numbers, then make each one squared.


Take a list of integers; Take everything except the first, then drop negatives from start, then square each value in the list.


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


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


Take a list of integers; filter out values less than or equal to 5, then unique values preserving order, then show only the last three.


Take a list of integers; keep only numbers above 5, then remove repeated values, then remove all but the last three.


Take a list of integers; exclude values of 5 and below, then unique values preserving order, then take the final 3 elements.


Take a list of integers; remove anything 5 or less, then remove repeated values, then drop everything except the final three.


Take a list of integers; filter to keep only values above 5, then unique values preserving order, then give me the last three elements.


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


Take a list of integers; keep values greater than five, then drop duplicates keeping first occurrence, then keep only the last three.


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


Take a list of integers; convert to absolute value, then remove everything after the third, then drop all positive numbers.


Take a list of integers; strip the signs, then truncate to three items, then drop non-negative values.


Take a list of integers; take abs of each, then show the first three, then drop all positive numbers.


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


Take a list of integers; apply absolute value to the whole list, then keep first 3, then drop all positive numbers.


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


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


Take a list of integers; sort ascending, then default to [0] when there is nothing, then true if already sorted smallest to largest.


Take a list of integers; Sort it from low to high, then when the list is empty, substitute a zero value, then does this list go in ascending order.


Take a list of integers; arrange in increasing order, then replace an empty list with one zero, then check if the list is in ascending order.


Take a list of integers; Organize these ascending, then zero it out if it's empty, then is the list sorted.


Take a list of integers; Sort in ascending order, then use zero if the list is empty, then is it sorted.


Take a list of integers; I need this sorted ascending, then default to zero when empty, then check if values are in increasing order.


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


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


Take a list of integers; pad with zeros to at least three elements, then remove the first item, then multiply each by -1.


Take a list of integers; add zeros until the list has at least three values, then Remove head, then negate.


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


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


Take a list of integers; sort by absolute value, then make every value non-negative, then reduce each by one.


Take a list of integers; rearrange by distance from zero, then absolute value for all items, then Subtract 1 from all.


Take a list of integers; arrange by magnitude ignoring sign, then take absolute values, then Subtract one from each.


Take a list of integers; put them in order by magnitude, then turn negatives into positives, then Drop each by one.


Take a list of integers; arrange in order of absolute value, then abs each element, then Decrease all values by one.


Take a list of integers; sort by distance from zero, then take the absolute value of each, then Remove one from each value.


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


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


Take a list of integers; double each, then flip the list around, then count the elements.


Take a list of integers; times two for each item, then flip the order around, then how many items remain.


Take a list of integers; double each, then put the elements backwards, then tell me the length.


Take a list of integers; times two for each item, then reverse that for me, then return the length.


Take a list of integers; double each, then flip it backwards, then count them.


Take a list of integers; times two for each item, then make it backwards, then what's the count.


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


Take a list of integers; double each, then reverse the order, then return how many remain.


Take a list of integers; drop duplicates keeping first occurrence, then sort smallest to largest, then trim one element off each end.


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


Take a list of integers; drop duplicates keeping first occurrence, then Sort this ascending, then remove the first and last elements.


Take a list of integers; drop duplicates but keep the first one, then Sort lowest to highest, then keep only the middle part.


Take a list of integers; drop duplicates keeping first occurrence, then Arrange from smallest to largest, then drop first and last.


Take a list of integers; drop duplicates but keep the first one, then sort ascending, then eliminate the outermost elements.


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


Take a list of integers; drop duplicates keeping first occurrence, then sort ascending, then drop the first and last elements.


Take a list of integers; negate each, then clamp each to at most ten, then replace an empty list with one zero.


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then zero it out if it's empty.


Take a list of integers; negate each, then clamp each to at most ten, then use zero if the list is empty.


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then default to zero when empty.


Take a list of integers; negate each, then clamp each to at most ten, then if there's nothing, put in a zero.


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then if no items, add a zero.


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


Take a list of integers; negate each, then cap each value at 10, then if empty, use a single zero.


Take a list of integers; keep only the last three, then keep only odd values, then replace an empty list with one zero.


Take a list of integers; keep the final three items, then eliminate the even numbers, then zero it out if it's empty.


Take a list of integers; take the last three, then keep only odd values, then use zero if the list is empty.


Take a list of integers; trim to the last three, then eliminate the even numbers, then default to zero when empty.


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


Take a list of integers; truncate to the last three items, then eliminate the even numbers, then if no items, add a zero.


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


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


Take a list of integers; drop the leading negative values, then keep only even values, then reduce each by one.


Take a list of integers; cut the leading negatives, then extract all even numbers, then Subtract 1 from all.


Take a list of integers; skip negatives at the start, then keep only even values, then Subtract one from each.


Take a list of integers; remove all negatives at the front, then extract all even numbers, then Drop each by one.


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then Decrease all values by one.


Take a list of integers; strip the front negatives, then extract all even numbers, then Remove one from each value.


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


Take a list of integers; drop the leading negative values, then keep the even numbers, then subtract one from each.


Take a list of integers; take the absolute value of each, then keep only even values, then make each twice as big.


Take a list of integers; convert to absolute value, then extract all even numbers, then multiply each by 2.


Take a list of integers; strip the signs, then keep only even values, then make each twice as big.


Take a list of integers; take abs of each, then extract all even numbers, then multiply each by 2.


Take a list of integers; get the absolute value of everything, then keep only even values, then make each twice as big.


Take a list of integers; apply absolute value to the whole list, then extract all even numbers, then multiply each by 2.


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


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


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


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then increase all numbers by 10.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then add 10 to everything.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then give everything a boost of 10.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then increment each by ten.


Take a list of integers; sort by distance from zero, then get the negative numbers, then add a constant 10 to each.


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


Take a list of integers; sort by absolute value, then keep the negative numbers, then add ten to each.


Take a list of integers; add ten to each, then order by distance from zero, then multiply each by -1.


Take a list of integers; bump everything up by 10, then sort based on absolute value, then negate.


Take a list of integers; increase every value by 10, then organize by magnitude, then multiply each by -1.


Take a list of integers; add 10 to each item, then arrange by absolute value ascending, then negate.


Take a list of integers; shift each up by ten, then sort from smallest to largest absolute value, then multiply each by -1.


Take a list of integers; increase all numbers by 10, then sort by absolute value, then negate.


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


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


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then remove the initial run of negative numbers.


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


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then remove leading negative numbers.


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


Take a list of integers; pad with zeros to at least three elements, then clamp each to at most ten, then strip negative values from the start.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove both ends, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then trim the edges, then drop all positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then trim one element off each end, then drop non-negative values.


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first and last elements, then drop non-negative values.


Take a list of integers; drop duplicates but keep the first one, then keep only the middle part, then drop all positive numbers.


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


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


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


Take a list of integers; extract negatives, then remove everything after the third, then cut off the first and last.


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


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


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


Take a list of integers; extract negatives, then keep first 3, then eliminate the outermost elements.


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


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


Take a list of integers; reverse the order, then increase every value by 10, then true if at least one even value.


Take a list of integers; reverse, then add 10 to each item, then any even.


Take a list of integers; flip the list around, then shift each up by ten, then true if at least one even value.


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


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


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


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


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


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


Take a list of integers; keep the first 3 items, then Ascending sort, then zero it out if it's empty.


Take a list of integers; take the first 3 elements, then Sort this ascending, then use zero if the list is empty.


Take a list of integers; remove everything after the third, then Sort lowest to highest, then default to zero when empty.


Take a list of integers; truncate to three items, then Arrange from smallest to largest, then if there's nothing, put in a zero.


Take a list of integers; show the first three, then sort ascending, then if no items, add a zero.


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


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


Take a list of integers; keep everything before the first zero, then flip the list around, then stop at the first non-positive value.


Take a list of integers; take only what comes before the initial zero, then flip the order around, then keep the leading run of positive numbers.


Take a list of integers; cut the list at the first zero, then put the elements backwards, then take values while they are positive.


Take a list of integers; cut off after the first zero appears, then reverse that for me, then take positive values then stop.


Take a list of integers; take values up to (excluding) the first zero, then flip it backwards, then keep going while positive.


Take a list of integers; keep the part before the first 0, then make it backwards, then stop at first non positive.


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


Take a list of integers; keep everything before the first zero, then reverse the order, then take values while they are positive.


Take a list of integers; keep values greater than five, then remove the first item, then give back the total.


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


Take a list of integers; keep only numbers above 5, then remove the first item, then add them up.


Take a list of integers; exclude values of 5 and below, then Remove head, then calculate the sum of all elements.


Take a list of integers; remove anything 5 or less, then remove the first item, then what's the total.


Take a list of integers; filter to keep only values above 5, then Remove head, then what do they add up to.


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


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


Take a list of integers; drop the first and last elements, then flip the list around, then stop at the first non-positive value.


Take a list of integers; take out the first and last items, then flip the order around, then keep the leading run of positive numbers.


Take a list of integers; remove both ends, then put the elements backwards, then take values while they are positive.


Take a list of integers; trim the edges, then reverse that for me, then take positive values then stop.


Take a list of integers; trim one element off each end, then flip it backwards, then keep going while positive.


Take a list of integers; cut off the first and last, then make it backwards, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = list(reversed(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 and last elements, then reverse the order, then take values while they are positive.


Take a list of integers; keep everything before the first zero, then multiply each by two, then trim one element off each end.


Take a list of integers; take only what comes before the initial zero, then double each item in the list, then cut off the first and last.


Take a list of integers; cut the list at the first zero, then multiply each by two, then remove the first and last elements.


Take a list of integers; cut off after the first zero appears, then double each item in the list, then keep only the middle part.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then drop first and last.


Take a list of integers; keep the part before the first 0, then double each item in the list, then eliminate the outermost elements.


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


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


Take a list of integers; take the absolute value of each, then sort smallest to largest, then count the elements.


Take a list of integers; convert to absolute value, then Ascending sort, then how many items remain.


Take a list of integers; strip the signs, then Sort this ascending, then tell me the length.


Take a list of integers; take abs of each, then Sort lowest to highest, then return the length.


Take a list of integers; get the absolute value of everything, then Arrange from smallest to largest, then count them.


Take a list of integers; apply absolute value to the whole list, then sort ascending, then what's the count.


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


Take a list of integers; take the absolute value of each, then sort ascending, then return how many remain.


Take a list of integers; sort descending, then remove the first item, then drop the odd numbers.


Take a list of integers; sort largest first, then Remove head, then filter out the odd numbers.


Take a list of integers; sort in descending order, then remove the first item, then drop the odd numbers.


Take a list of integers; sort from greatest to least, then Remove head, then filter out the odd numbers.


Take a list of integers; sort z to a, then remove the first item, then drop the odd numbers.


Take a list of integers; arrange in decreasing order, then Remove head, then filter out the odd numbers.


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


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


Take a list of integers; drop the leading negative values, then extend to length 3 using zeros, then shift each up by ten.


Take a list of integers; cut the leading negatives, then pad to 3, then increase all numbers by 10.


Take a list of integers; skip negatives at the start, then extend to length 3 using zeros, then add 10 to everything.


Take a list of integers; remove all negatives at the front, then pad to 3, then give everything a boost of 10.


Take a list of integers; remove the initial run of negative numbers, then extend to length 3 using zeros, then increment each by ten.


Take a list of integers; strip the front negatives, then pad to 3, then add a constant 10 to each.


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 + 10 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 add ten to each.


Take a list of integers; sort by absolute value, then keep values below zero, then take values up to (excluding) the first zero.


Take a list of integers; rearrange by distance from zero, then get the negative numbers, then keep the part before the first 0.


Take a list of integers; arrange by magnitude ignoring sign, then keep values below zero, then truncate at the first zero.


Take a list of integers; put them in order by magnitude, then get the negative numbers, then delete everything starting with the first zero.


Take a list of integers; arrange in order of absolute value, then keep values below zero, then remove from the first zero onwards.


Take a list of integers; sort by distance from zero, then get the negative numbers, then up to but not including the first zero.


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


Take a list of integers; sort by absolute value, then keep the negative numbers, then keep everything before the first zero.


Take a list of integers; keep only the last three, then sort smallest to largest, then multiply each by -1.


Take a list of integers; keep the final three items, then Ascending sort, then negate.


Take a list of integers; take the last three, then Sort this ascending, then multiply each by -1.


Take a list of integers; trim to the last three, then Sort lowest to highest, then negate.


Take a list of integers; last three only, then Arrange from smallest to largest, then multiply each by -1.


Take a list of integers; truncate to the last three items, then sort ascending, then negate.


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


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


Take a list of integers; add ten to each, then remove all zero values, then give back the product of all values.


Take a list of integers; bump everything up by 10, then exclude zeros, then product of the list.


Take a list of integers; increase every value by 10, then remove all zero values, then what's the product.


Take a list of integers; add 10 to each item, then exclude zeros, then what do they multiply to.


Take a list of integers; shift each up by ten, then remove all zero values, then give me their product.


Take a list of integers; increase all numbers by 10, then exclude zeros, then multiply them all together.


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


Take a list of integers; add ten to each, then drop the zeros, then return their product.


Take a list of integers; square each, then clamp each to at most ten, then bump each up by one.


Take a list of integers; each value squared, then don't let anything exceed 10, then increment each item.


Take a list of integers; multiply each value by itself, then clamp each to at most ten, then bump each up by one.


Take a list of integers; square them all, then don't let anything exceed 10, then increment each item.


Take a list of integers; raise each to the power of two, then clamp each to at most ten, then bump each up by one.


Take a list of integers; I need each number multiplied by itself, then don't let anything exceed 10, then increment each item.


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


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


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


Take a list of integers; times two for each item, then absolute value for all items, then increase all numbers by 10.


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


Take a list of integers; times two for each item, then turn negatives into positives, then give everything a boost of 10.


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


Take a list of integers; times two for each item, then take the absolute value of each, then add a constant 10 to each.


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


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


Take a list of integers; drop the first element, then clamp each to at most ten, then true only if all are positive.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then do all of these have positive values.


Take a list of integers; drop the first element, then clamp each to at most ten, then check if every value is positive.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then confirm all values are positive.


Take a list of integers; drop the first element, then clamp each to at most ten, then all positive.


Take a list of integers; Take everything except the first, then don't let anything exceed 10, then check if every number is above zero.


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


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


Take a list of integers; drop the zeros, then take the first 3 elements, then make each twice as big.


Take a list of integers; keep only nonzero elements, then remove everything after the third, then multiply each by 2.


Take a list of integers; drop the zeros, then truncate to three items, then make each twice as big.


Take a list of integers; keep only nonzero elements, then show the first three, then multiply each by 2.


Take a list of integers; drop the zeros, then take the first three, then make each twice as big.


Take a list of integers; keep only nonzero elements, then keep first 3, then multiply each by 2.


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


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


Take a list of integers; take the absolute value of each, then drop anything 5 or below, then count the elements.


Take a list of integers; convert to absolute value, then keep only numbers greater than 5, then how many items remain.


Take a list of integers; strip the signs, then filter for numbers above 5, then tell me the length.


Take a list of integers; take abs of each, then give me values where x is greater than 5, then return the length.


Take a list of integers; get the absolute value of everything, then show me only the values that are bigger than five, then count them.


Take a list of integers; apply absolute value to the whole list, then keep values greater than five, then what's the count.


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


Take a list of integers; take the absolute value of each, then keep values greater than five, then return how many remain.


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


Take a list of integers; keep evens, then plus one for all, then show the first three.


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


Take a list of integers; keep evens, then plus one for all, then keep first 3.


Take a list of integers; keep the even numbers, then increment each value, then truncate to first three.


Take a list of integers; keep evens, then plus one for all, then first three.


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


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


Take a list of integers; reverse the order, then multiply each by two, then replace an empty list with one zero.


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


Take a list of integers; flip the list around, then multiply each by two, then use zero if the list is empty.


Take a list of integers; flip the order around, then double each item in the list, then default to zero when empty.


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


Take a list of integers; reverse that for me, then double each item in the list, then if no items, add a zero.


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


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


Take a list of people records (name, age); extract the ages, then sort largest to smallest, then true only if all are positive.


Take a list of people records (name, age); show me all ages, then sort by descending values, then do all of these have positive values.


Take a list of people records (name, age); pluck the age field from each record, then sort from highest to lowest, then check if every value is positive.


Take a list of people records (name, age); get the age field, then sort descending, then confirm all values are positive.


Take a list of people records (name, age); keep just each person's age, then sort largest first, then all positive.


Take a list of people records (name, age); extract age values, then sort in descending order, then check if every number is above zero.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = sorted(r, reverse=True)
    return all(x > 0 for x in r)


Take a list of people records (name, age); extract the ages, then sort descending, then return whether all values are positive.


Take a list of integers; reverse the order, then remove both ends, then true if at least one even value.


Take a list of integers; reverse, then trim the edges, then any even.


Take a list of integers; flip the list around, then trim one element off each end, then true if at least one even value.


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


Take a list of integers; put the elements backwards, then remove the first and last elements, then true if at least one even value.


Take a list of integers; reverse that for me, then keep only the middle part, then any even.


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


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


Take a list of integers; square each, then order by distance from zero, then put the elements backwards.


Take a list of integers; each value squared, then sort based on absolute value, then reverse that for me.


Take a list of integers; multiply each value by itself, then organize by magnitude, then flip it backwards.


Take a list of integers; square them all, then arrange by absolute value ascending, then make it backwards.


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


Take a list of integers; I need each number multiplied by itself, then sort by absolute value, then invert the sequence.


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


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


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


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


Take a list of integers; skip negatives at the start, then clamp each to at most ten, then What's the highest number in the list.


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


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


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


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


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


Take a list of integers; double each, then default to [0] when there is nothing, then give back the product of all values.


Take a list of integers; times two for each item, then when the list is empty, substitute a zero value, then product of the list.


Take a list of integers; double each, then replace an empty list with one zero, then what's the product.


Take a list of integers; times two for each item, then zero it out if it's empty, then what do they multiply to.


Take a list of integers; double each, then use zero if the list is empty, then give me their product.


Take a list of integers; times two for each item, then default to zero when empty, then multiply them all together.


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


Take a list of integers; double each, then if empty, use a single zero, then return their product.


Take a list of people records (name, age); extract the ages, then skip negatives at the start, then find the min, defaulting to 0.


Take a list of people records (name, age); show me all ages, then remove all negatives at the front, then minimum value, zero otherwise.


Take a list of people records (name, age); pluck the age field from each record, then remove the initial run of negative numbers, then get the minimum value or zero if empty.


Take a list of people records (name, age); get the age field, then strip the front negatives, then give me the min or 0.


Take a list of people records (name, age); keep just each person's age, then remove leading negative numbers, then return the smallest number, defaulting to 0.


Take a list of people records (name, age); extract age values, then drop negatives from start, then return smallest or zero if empty.


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


Take a list of people records (name, age); extract the ages, then drop the leading negative values, then return the minimum (0 if empty).


Take a list of integers; cap each value at 10, then order by distance from zero, then drop non-positive values.


Take a list of integers; clip values at 10, then sort based on absolute value, then drop the negative numbers.


Take a list of integers; cap each value at 10, then organize by magnitude, then filter out the negative ones.


Take a list of integers; clip values at 10, then arrange by absolute value ascending, then remove all negative values.


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


Take a list of integers; clip values at 10, then sort by absolute value, then keep values above zero.


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


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


Take a list of integers; double each, then skip negatives at the start, then deduplicate the list.


Take a list of integers; times two for each item, then remove all negatives at the front, then remove repeats.


Take a list of integers; double each, then remove the initial run of negative numbers, then deduplicate the list.


Take a list of integers; times two for each item, then strip the front negatives, then remove repeats.


Take a list of integers; double each, then remove leading negative numbers, then deduplicate the list.


Take a list of integers; times two for each item, then drop negatives from start, then remove repeats.


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


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


Take a list of integers; drop the first element, then keep values below zero, then limit every value to 10.


Take a list of integers; Take everything except the first, then get the negative numbers, then maximum of 10 for all.


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


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


Take a list of integers; add ten to each, then cut the list at the first zero, then remove the initial run of negative numbers.


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


Take a list of integers; increase every value by 10, then take values up to (excluding) the first zero, then remove leading negative numbers.


Take a list of integers; add 10 to each item, then keep the part before the first 0, then drop negatives from start.


Take a list of integers; shift each up by ten, then truncate at the first zero, then strip negative values from the start.


Take a list of integers; increase all numbers by 10, then delete everything starting with the first zero, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [x + 10 for x in r]
    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; add ten to each, then keep everything before the first zero, then drop the leading negative values.


Take a list of integers; reverse the order, then multiply each value by itself, then give the number of evens.


Take a list of integers; reverse, then square them all, then find how many values are divisible by two.


Take a list of integers; flip the list around, then raise each to the power of two, then how many are even.


Take a list of integers; flip the order around, then I need each number multiplied by itself, then get the total number of even values in the list.