Take a list of integers; keep the first 3 items, then sort based on absolute value, then keep the leading run of positive numbers.


Take a list of integers; take the first 3 elements, then organize by magnitude, then take values while they are positive.


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then take positive values then stop.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then keep going while positive.


Take a list of integers; show the first three, then sort by absolute value, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = r[:3]
    r = sorted(r, key=abs)
    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 sort by absolute value, then take values while they are positive.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then truncate to the last three items.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then show only the last three.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then remove all but the last three.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then take the final 3 elements.


Take a list of integers; pad with zeros to at least three elements, then keep only odd values, then drop everything except the final three.


Take a list of integers; add zeros until the list has at least three values, then eliminate the even numbers, then give me the last three elements.


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


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


Take a list of integers; reverse the order, then keep only odd values, then bump each up by one.


Take a list of integers; reverse, then eliminate the even numbers, then increment each item.


Take a list of integers; flip the list around, then keep only odd values, then bump each up by one.


Take a list of integers; flip the order around, then eliminate the even numbers, then increment each item.


Take a list of integers; put the elements backwards, then keep only odd values, then bump each up by one.


Take a list of integers; reverse that for me, then eliminate the even numbers, then increment each item.


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then give back the product of all values.


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


Take a list of people records (name, age); pluck the age field from each record, then clamp each to at most ten, then what's the product.


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then what do they multiply to.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then give me their product.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then multiply them all together.


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


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


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then ensure at least three items by appending zeros.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then ensure at least three items by appending zeros.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then ensure at least three items by appending zeros.


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


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


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


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


Take a list of integers; bump everything up by 10, then square them all, then increment each item.


Take a list of integers; increase every value by 10, then raise each to the power of two, then bump each up by one.


Take a list of integers; add 10 to each item, then I need each number multiplied by itself, then increment each item.


Take a list of integers; shift each up by ten, then square all of them, then bump each up by one.


Take a list of integers; increase all numbers by 10, then multiply each element by itself, then increment each item.


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


Take a list of integers; add ten to each, then square each, then add one to each.


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


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


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


Take a list of people records (name, age); get the age field, then filter out everything except multiples of three, then what do they multiply to.


Take a list of people records (name, age); keep just each person's age, then keep only multiples of three, then give me their product.


Take a list of people records (name, age); extract age values, then multiples of three only, then multiply them all together.


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


Take a list of people records (name, age); extract the ages, then keep multiples of three, then return their product.


Take a list of integers; take values while they are positive, then keep values divisible by 3, then strip the signs.


Take a list of integers; take positive values then stop, then keep items where x mod 3 equals zero, then take abs of each.


Take a list of integers; keep going while positive, then drop anything not divisible by three, then get the absolute value of everything.


Take a list of integers; stop at first non positive, then filter out everything except multiples of three, then apply absolute value to the whole list.


Take a list of integers; take while greater than zero, then keep only multiples of three, then make them all positive.


Take a list of integers; take values while positive, then multiples of three only, then make every value non-negative.


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


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


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


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


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


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


Take a list of integers; sort by absolute value, then extend to length 3 using zeros, then drop non-positive values.


Take a list of integers; rearrange by distance from zero, then pad to 3, then drop the negative numbers.


Take a list of integers; arrange by magnitude ignoring sign, then extend to length 3 using zeros, then filter out the negative ones.


Take a list of integers; put them in order by magnitude, then pad to 3, then remove all negative values.


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


Take a list of integers; sort by distance from zero, then pad to 3, then keep values above zero.


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


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


Take a list of integers; drop the first element, then keep values above zero, then strip the signs.


Take a list of integers; Take everything except the first, then filter for positive numbers, then take abs of each.


Take a list of integers; drop the first element, then keep only positive numbers, then get the absolute value of everything.


Take a list of integers; Take everything except the first, then keep the positives, then apply absolute value to the whole list.


Take a list of integers; drop the first element, then remove negatives, then make them all positive.


Take a list of integers; Take everything except the first, then keep the positive numbers, then make every value non-negative.


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


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


Take a list of integers; reverse the order, then order by distance from zero, then shift each up by ten.


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


Take a list of integers; flip the list around, then organize by magnitude, then add 10 to everything.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then give everything a boost of 10.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then increment each by ten.


Take a list of integers; reverse that for me, then sort by absolute value, then add a constant 10 to each.


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


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


Take a list of integers; keep the positive numbers, then clamp each to at most ten, then multiply each by -1.


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


Take a list of integers; drop non-positive values, then clamp each to at most ten, then multiply each by -1.


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


Take a list of integers; filter out the negative ones, then clamp each to at most ten, then multiply each by -1.


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


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


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


Take a list of integers; keep multiples of three, then multiply each value by itself, then reduce each by one.


Take a list of integers; get rid of non-multiples of three, then square them all, then Subtract 1 from all.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then Subtract one from each.


Take a list of integers; keep items where x mod 3 equals zero, then I need each number multiplied by itself, then Drop each by one.


Take a list of integers; drop anything not divisible by three, then square all of them, then Decrease all values by one.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then Remove one from each value.


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


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


Take a list of integers; keep the even numbers, then flip the list around, then true if at least one even value.


Take a list of integers; keep evens, then flip the order around, then any even.


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


Take a list of integers; keep evens, then reverse that for me, then any even.


Take a list of integers; keep the even numbers, then flip it backwards, then true if at least one even value.


Take a list of integers; keep evens, then make it backwards, then any even.


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


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


Take a list of integers; sort by absolute value, then remove all zero values, then ensure at least three items by appending zeros.


Take a list of integers; rearrange by distance from zero, then exclude zeros, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange by magnitude ignoring sign, then remove all zero values, then ensure at least three items by appending zeros.


Take a list of integers; put them in order by magnitude, then exclude zeros, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; arrange in order of absolute value, then remove all zero values, then ensure at least three items by appending zeros.


Take a list of integers; sort by distance from zero, then exclude zeros, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the zeros, then cut the list at the first zero, then limit every value to 10.


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then maximum of 10 for all.


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


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


Take a list of integers; drop the zeros, then truncate at the first zero, then limit every value to 10.


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


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


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


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


Take a list of integers; take out the first and last items, then plus one for all, then zero it out if it's empty.


Take a list of integers; remove both ends, then increment each value, then use zero if the list is empty.


Take a list of integers; trim the edges, then plus one for all, then default to zero when empty.


Take a list of integers; trim one element off each end, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; cut off the first and last, then plus one for all, then if no items, add a zero.


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


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


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


Take a list of integers; extract negatives, then unique values preserving order, then filter out the odd numbers.


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


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


Take a list of integers; keep everything before the first zero, then keep only even values, then arrange in increasing order.


Take a list of integers; take only what comes before the initial zero, then extract all even numbers, then Organize these ascending.


Take a list of integers; cut the list at the first zero, then keep only even values, then Sort in ascending order.


Take a list of integers; cut off after the first zero appears, then extract all even numbers, then I need this sorted ascending.


Take a list of integers; take values up to (excluding) the first zero, then keep only even values, then Put these in ascending order.


Take a list of integers; keep the part before the first 0, then extract all even numbers, then sort smallest to largest.


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


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


Take a list of integers; sort by absolute value, then flip the sign of each, then stop at the first non-positive value.


Take a list of integers; rearrange by distance from zero, then turn positives to negatives and vice versa, then keep the leading run of positive numbers.


Take a list of integers; arrange by magnitude ignoring sign, then flip the sign of each, then take values while they are positive.


Take a list of integers; put them in order by magnitude, then turn positives to negatives and vice versa, then take positive values then stop.


Take a list of integers; arrange in order of absolute value, then flip the sign of each, then keep going while positive.


Take a list of integers; sort by distance from zero, then turn positives to negatives and vice versa, then stop at first non positive.


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


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


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


Take a list of integers; sort largest first, then flip the order around, then drop all positive numbers.


Take a list of integers; sort in descending order, then put the elements backwards, then drop non-negative values.


Take a list of integers; sort from greatest to least, then reverse that for me, then drop all positive numbers.


Take a list of integers; sort z to a, then flip it backwards, then drop non-negative values.


Take a list of integers; arrange in decreasing order, then make it backwards, then drop all positive numbers.


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


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


Take a list of integers; cap each value at 10, then decrement each value, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then Lower each number by one, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then reduce each by one, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then Subtract 1 from all, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then Subtract one from each, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then Drop each by one, then fetch the first even element, default to 0.


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


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


Take a list of integers; add one to each, then sort smallest to largest, then drop the even numbers.


Take a list of integers; make each one bigger, then Ascending sort, then strip out the evens.


Take a list of integers; add one to each, then Sort this ascending, then drop the even numbers.


Take a list of integers; make each one bigger, then Sort lowest to highest, then strip out the evens.


Take a list of integers; add one to each, then Arrange from smallest to largest, then drop the even numbers.


Take a list of integers; make each one bigger, then sort ascending, then strip out the evens.


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


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


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


Take a list of integers; Decrement all items, then add 10 to each item, then multiply each by 2.


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


Take a list of integers; Lower each number by one, then increase all numbers by 10, then multiply each by 2.


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


Take a list of integers; Subtract 1 from all, then give everything a boost of 10, then multiply each by 2.


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


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


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


Take a list of integers; get rid of anything that's not positive, then drop everything except the final three, then Discard the first element.


Take a list of integers; drop non-positive values, then give me the last three elements, then skip the first one.


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


Take a list of integers; filter out the negative ones, then keep the final three items, then skip the first one.


Take a list of integers; remove all negative values, then take the last three, then Discard the first element.


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


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


Take a list of integers; take values while they are positive, then skip negatives at the start, then shift each up by ten.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then increase all numbers by 10.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then add 10 to everything.


Take a list of integers; stop at first non positive, then strip the front negatives, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then increment each by ten.


Take a list of integers; take values while positive, then drop negatives from start, 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[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    r = [x + 10 for x in r]
    return r


Take a list of integers; take values while they are positive, then drop the leading negative values, then add ten to each.


Take a list of integers; sort descending, then cut the list at the first zero, then bump each up by one.


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


Take a list of integers; sort in descending order, then take values up to (excluding) the first zero, then bump each up by one.


Take a list of integers; sort from greatest to least, then keep the part before the first 0, then increment each item.


Take a list of integers; sort z to a, then truncate at the first zero, then bump each up by one.


Take a list of integers; arrange in decreasing order, then delete everything starting with the first zero, then increment each item.


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


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


Take a list of integers; keep values greater than five, then multiply each by two, then put the elements backwards.


Take a list of integers; filter out values less than or equal to 5, then double each item in the list, then reverse that for me.


Take a list of integers; keep only numbers above 5, then multiply each by two, then flip it backwards.


Take a list of integers; exclude values of 5 and below, then double each item in the list, then make it backwards.


Take a list of integers; remove anything 5 or less, then multiply each by two, then reverse the list.


Take a list of integers; filter to keep only values above 5, then double each item in the list, then invert the sequence.


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


Take a list of integers; keep values greater than five, then double each, then reverse the order.


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


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then do all of these have positive values.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then check if every value is positive.


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


Take a list of integers; shift each up by ten, then clamp each to at most ten, then all positive.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then check if every number is above zero.


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


Take a list of integers; add ten to each, then cap each value at 10, then return whether all values are positive.


Take a list of strings; lowercase each string, then take each string's first letter, then deduplicate the strings.


Take a list of strings; change to lowercase, then give me the first letter of everything, then filter out duplicate strings retain first.


Take a list of strings; lowercase each string, then reduce each string to its first character, then strip duplicates preserve order.


Take a list of strings; change to lowercase, then take first char drop blanks, then remove repeated strings.


Take a list of strings; lowercase each string, then keep first letters only, then keep unique strings first appearance.


Take a list of strings; change to lowercase, then first letter from each item that isn't empty, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; lowercase each string, then keep the first character of each (dropping empties), then drop duplicate strings keeping the first.


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


Take a list of integers; take out the first and last items, then sort based on absolute value, then increase all numbers by 10.


Take a list of integers; remove both ends, then organize by magnitude, then add 10 to everything.


Take a list of integers; trim the edges, then arrange by absolute value ascending, then give everything a boost of 10.


Take a list of integers; trim one element off each end, then sort from smallest to largest absolute value, then increment each by ten.


Take a list of integers; cut off the first and last, then sort by absolute value, then add a constant 10 to each.


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


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


Take a list of integers; keep values greater than five, then keep only even values, then arrange by magnitude ignoring sign.


Take a list of integers; filter out values less than or equal to 5, then extract all even numbers, then put them in order by magnitude.


Take a list of integers; keep only numbers above 5, then keep only even values, then arrange in order of absolute value.


Take a list of integers; exclude values of 5 and below, then extract all even numbers, then sort by distance from zero.


Take a list of integers; remove anything 5 or less, then keep only even values, then order by how far from zero.


Take a list of integers; filter to keep only values above 5, then extract all even numbers, then order by distance from zero.


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


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


Take a list of integers; sort by absolute value, then keep values divisible by 3, then deduplicate the list.


Take a list of integers; rearrange by distance from zero, then keep items where x mod 3 equals zero, then remove repeats.


Take a list of integers; arrange by magnitude ignoring sign, then drop anything not divisible by three, then deduplicate the list.


Take a list of integers; put them in order by magnitude, then filter out everything except multiples of three, then remove repeats.


Take a list of integers; arrange in order of absolute value, then keep only multiples of three, then deduplicate the list.


Take a list of integers; sort by distance from zero, then multiples of three only, then remove repeats.


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


Take a list of integers; sort by absolute value, then keep multiples of three, then drop duplicates keeping first occurrence.


Take a list of integers; add ten to each, then skip negatives at the start, then give the earliest even value or zero.


Take a list of integers; bump everything up by 10, then remove all negatives at the front, then fetch the first even element, default to 0.


Take a list of integers; increase every value by 10, then remove the initial run of negative numbers, then give the earliest even value or zero.


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


Take a list of integers; shift each up by ten, then remove leading negative numbers, then give the earliest even value or zero.


Take a list of integers; increase all numbers by 10, then drop negatives from start, then fetch the first even element, default to 0.


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


Take a list of integers; add ten to each, then drop the leading negative values, then return the first even value (0 if none).


Take a list of integers; subtract one from each, then flip the sign of each, then raise each to the power of two.


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


Take a list of integers; decrement each value, then flip the sign of each, then square all of them.


Take a list of integers; Lower each number by one, then turn positives to negatives and vice versa, then multiply each element by itself.


Take a list of integers; reduce each by one, then flip the sign of each, then make each one squared.


Take a list of integers; Subtract 1 from all, then turn positives to negatives and vice versa, then square each value in the list.


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


Take a list of integers; subtract one from each, then negate each, then square each.


Take a list of integers; negate each, then keep values divisible by 3, then arrange by magnitude ignoring sign.


Take a list of integers; reverse the signs of everything, then keep items where x mod 3 equals zero, then put them in order by magnitude.


Take a list of integers; negate each, then drop anything not divisible by three, then arrange in order of absolute value.


Take a list of integers; reverse the signs of everything, then filter out everything except multiples of three, then sort by distance from zero.


Take a list of integers; negate each, then keep only multiples of three, then order by how far from zero.


Take a list of integers; reverse the signs of everything, then multiples of three only, then order by distance from zero.


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


Take a list of integers; negate each, then keep multiples of three, then sort by absolute value.


Take a list of integers; drop the first and last elements, then increase every value by 10, then remove the initial run of negative numbers.


Take a list of integers; take out the first and last items, then add 10 to each item, then strip the front negatives.


Take a list of integers; remove both ends, then shift each up by ten, then remove leading negative numbers.


Take a list of integers; trim the edges, then increase all numbers by 10, then drop negatives from start.


Take a list of integers; trim one element off each end, then add 10 to everything, then strip negative values from the start.


Take a list of integers; cut off the first and last, then give everything a boost of 10, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    r = [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; drop the first and last elements, then add ten to each, then drop the leading negative values.


Take a list of integers; keep the odd numbers, then multiply each by two, then shift each up by ten.


Take a list of integers; odd numbers only, then double each item in the list, then increase all numbers by 10.


Take a list of integers; keep the odd numbers, then multiply each by two, then add 10 to everything.


Take a list of integers; odd numbers only, then double each item in the list, then give everything a boost of 10.


Take a list of integers; keep the odd numbers, then multiply each by two, then increment each by ten.


Take a list of integers; odd numbers only, then double each item in the list, then add a constant 10 to each.


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 + 10 for x in r]
    return r


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


Take a list of integers; keep the negative numbers, then cut the list at the first zero, then drop the even numbers.


Take a list of integers; extract negatives, then cut off after the first zero appears, then strip out the evens.


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


Take a list of integers; extract negatives, then keep the part before the first 0, then strip out the evens.


Take a list of integers; keep the negative numbers, then truncate at the first zero, then drop the even numbers.


Take a list of integers; extract negatives, then delete everything starting with the first zero, then strip out the evens.


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


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


Take a list of integers; drop the leading negative values, then clamp each to at most ten, then put the elements backwards.


Take a list of integers; cut the leading negatives, then don't let anything exceed 10, then reverse that for me.


Take a list of integers; skip negatives at the start, then clamp each to at most ten, then flip it backwards.


Take a list of integers; remove all negatives at the front, then don't let anything exceed 10, then make it backwards.


Take a list of integers; remove the initial run of negative numbers, then clamp each to at most ten, then reverse the list.


Take a list of integers; strip the front negatives, then don't let anything exceed 10, then invert the sequence.


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


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


Take a list of integers; drop the zeros, then drop anything 5 or below, then find the max, defaulting to 0.


Take a list of integers; keep only nonzero elements, then keep only numbers greater than 5, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop the zeros, then filter for numbers above 5, then What's the highest number in the list.


Take a list of integers; keep only nonzero elements, then give me values where x is greater than 5, then Return the greatest value or default to 0.


Take a list of integers; drop the zeros, then show me only the values that are bigger than five, then Find the largest element, defaulting to zero.


Take a list of integers; keep only nonzero elements, then keep values greater than five, then give the largest value (0 if none).


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


Take a list of integers; drop the zeros, then keep values greater than five, then return the maximum (0 if empty).


Take a list of integers; keep only the last three, then keep only odd values, then limit every value to 10.


Take a list of integers; keep the final three items, then eliminate the even numbers, then maximum of 10 for all.


Take a list of integers; take the last three, then keep only odd values, then limit every value to 10.


Take a list of integers; trim to the last three, then eliminate the even numbers, then maximum of 10 for all.


Take a list of integers; last three only, then keep only odd values, then limit every value to 10.


Take a list of integers; truncate to the last three items, then eliminate the even numbers, then maximum of 10 for all.


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


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


Take a list of strings; drop duplicate strings keeping the first, then order the strings A to Z, then prepend a hash mark to each.


Take a list of strings; dedupe, then make it alphabetical, then prefix all with #.


Take a list of strings; remove duplicate strings keep first, then order the strings A to Z, then prepend a hash mark to each.


Take a list of strings; remove repeating strings first one stays, then make it alphabetical, then prefix all with #.


Take a list of strings; delete duplicate strings keep the first one, then order the strings A to Z, then prepend a hash mark to each.


Take a list of strings; deduplicate the strings, then make it alphabetical, then prefix all with #.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = sorted(r)
    r = ['#' + s for s in r]
    return r


Take a list of strings; drop duplicate strings keeping the first, then sort alphabetically, then prefix each with a hash.


Take a list of strings; drop duplicate strings keeping the first, then strip spaces around each string, then find the longest one, defaulting to empty.


Take a list of strings; dedupe, then remove leading and trailing spaces, then Longest string, or nothing if there isn't one.


Take a list of strings; remove duplicate strings keep first, then remove whitespace from each item, then find the longest one, defaulting to empty.


Take a list of strings; remove repeating strings first one stays, then clean whitespace from each entry, then Longest string, or nothing if there isn't one.


Take a list of strings; delete duplicate strings keep the first one, then trim each string, then find the longest one, defaulting to empty.


Take a list of strings; deduplicate the strings, then trim whitespace from each, then Longest string, or nothing if there isn't one.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = [s.strip() for s in r]
    return max(r, key=len) if r else ''


Take a list of strings; drop duplicate strings keeping the first, then trim whitespace from each, then return the longest string (empty if none).


Take a list of integers; sort by absolute value, then decrement each value, then give the earliest even value or zero.


Take a list of integers; rearrange by distance from zero, then Lower each number by one, then fetch the first even element, default to 0.


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


Take a list of integers; put them in order by magnitude, then Subtract 1 from all, then fetch the first even element, default to 0.


Take a list of integers; arrange in order of absolute value, then Subtract one from each, then give the earliest even value or zero.


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


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


Take a list of integers; sort by absolute value, then subtract one from each, then return the first even value (0 if none).


Take a list of integers; sort ascending, then keep the leading run of positive numbers, then drop anything not divisible by three.


Take a list of integers; Sort it from low to high, then take values while they are positive, then filter out everything except multiples of three.


Take a list of integers; arrange in increasing order, then take positive values then stop, then keep only multiples of three.


Take a list of integers; Organize these ascending, then keep going while positive, then multiples of three only.


Take a list of integers; Sort in ascending order, then stop at first non positive, then filter for numbers divisible by three.


Take a list of integers; I need this sorted ascending, then take while greater than zero, then give me only the values divisible by three.


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


Take a list of integers; sort ascending, then take values while they are positive, then keep multiples of three.


Take a list of integers; keep the negative numbers, then drop anything 5 or below, then skip the first one.


Take a list of integers; extract negatives, then keep only numbers greater than 5, then Discard the first element.


Take a list of integers; keep the negative numbers, then filter for numbers above 5, then skip the first one.


Take a list of integers; extract negatives, then give me values where x is greater than 5, then Discard the first element.


Take a list of integers; keep the negative numbers, then show me only the values that are bigger than five, then skip the first one.


Take a list of integers; extract negatives, then keep values greater than five, then Discard the first element.


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


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


Take a list of integers; add ten to each, then order by distance from zero, then reduce each by one.


Take a list of integers; bump everything up by 10, then sort based on absolute value, then Subtract 1 from all.


Take a list of integers; increase every value by 10, then organize by magnitude, then Subtract one from each.


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


Take a list of integers; shift each up by ten, then sort from smallest to largest absolute value, then Decrease all values by one.


Take a list of integers; increase all numbers by 10, then sort by absolute value, then Remove one from each value.


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


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


Take a list of integers; sort descending, then keep the leading run of positive numbers, then limit every value to 10.


Take a list of integers; sort largest first, then take values while they are positive, then maximum of 10 for all.


Take a list of integers; sort in descending order, then take positive values then stop, then limit every value to 10.


Take a list of integers; sort from greatest to least, then keep going while positive, then maximum of 10 for all.


Take a list of integers; sort z to a, then stop at first non positive, then limit every value to 10.


Take a list of integers; arrange in decreasing order, then take while greater than zero, then maximum of 10 for all.


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


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


Take a list of integers; sort descending, then remove all zero values, then trim one element off each end.


Take a list of integers; sort largest first, then exclude zeros, then cut off the first and last.


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


Take a list of integers; sort from greatest to least, then exclude zeros, then keep only the middle part.


Take a list of integers; sort z to a, then remove all zero values, then drop first and last.


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


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


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


Take a list of integers; add one to each, then drop anything 5 or below, then true if already sorted smallest to largest.


Take a list of integers; make each one bigger, then keep only numbers greater than 5, then does this list go in ascending order.


Take a list of integers; add one to each, then filter for numbers above 5, then check if the list is in ascending order.


Take a list of integers; make each one bigger, then give me values where x is greater than 5, then is the list sorted.


Take a list of integers; add one to each, then show me only the values that are bigger than five, then is it sorted.


Take a list of integers; make each one bigger, then keep values greater than five, then check if values are in increasing order.


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


Take a list of integers; add one to each, then keep values greater than five, then return whether the list is sorted ascending.


Take a list of integers; keep the even numbers, then keep only odd values, then drop non-negative values.


Take a list of integers; keep evens, then eliminate the even numbers, then drop all positive numbers.


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


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


Take a list of integers; keep the odd numbers, then multiply each by two, then strip the signs.


Take a list of integers; odd numbers only, then double each item in the list, then take abs of each.


Take a list of integers; keep the odd numbers, then multiply each by two, then get the absolute value of everything.


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


Take a list of integers; keep the odd numbers, then multiply each by two, then make them all positive.


Take a list of integers; odd numbers only, 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 % 2 != 0]
    r = [x * 2 for x in r]
    r = [abs(x) for x in r]
    return r


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


Take a list of integers; sort ascending, then decrement each value, then make each twice as big.


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


Take a list of integers; arrange in increasing order, then reduce each by one, then make each twice as big.


Take a list of integers; Organize these ascending, then Subtract 1 from all, then multiply each by 2.


Take a list of integers; Sort in ascending order, then Subtract one from each, then make each twice as big.


Take a list of integers; I need this sorted ascending, then Drop each by one, then multiply each by 2.


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


Take a list of integers; sort ascending, then subtract one from each, then double each.


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


Take a list of integers; take positive values then stop, then sort based on absolute value, then arrange in descending order.


Take a list of integers; keep going while positive, then organize by magnitude, then reverse sort.


Take a list of integers; stop at first non positive, then arrange by absolute value ascending, then sort largest to smallest.


Take a list of integers; take while greater than zero, then sort from smallest to largest absolute value, then sort by descending values.


Take a list of integers; take values while positive, then sort by absolute value, then sort from highest to lowest.


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


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


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


Take a list of integers; keep only nonzero elements, then absolute value for all items, then filter out the odd numbers.


Take a list of integers; drop the zeros, then take absolute values, then drop the odd numbers.


Take a list of integers; keep only nonzero elements, then turn negatives into positives, then filter out the odd numbers.


Take a list of integers; drop the zeros, then abs each element, then drop the odd numbers.


Take a list of integers; keep only nonzero elements, then take the absolute value of each, then filter out the odd numbers.


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


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


Take a list of integers; drop the zeros, then increment each value, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then plus one for all, then fetch the first even element, default to 0.


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


Take a list of integers; drop the zeros, then add one to each, then return the first even value (0 if none).


Take a list of integers; add ten to each, then multiply each value by itself, then count the elements.


Take a list of integers; bump everything up by 10, then square them all, then how many items remain.


Take a list of integers; increase every value by 10, then raise each to the power of two, then tell me the length.


Take a list of integers; add 10 to each item, then I need each number multiplied by itself, then return the length.


Take a list of integers; shift each up by ten, then square all of them, then count them.


Take a list of integers; increase all numbers by 10, then multiply each element by itself, then what's the count.


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


Take a list of integers; add ten to each, then square each, then return how many remain.


Take a list of integers; negate each, then sort smallest to largest, then put the elements backwards.


Take a list of integers; reverse the signs of everything, then Ascending sort, then reverse that for me.


Take a list of integers; negate each, then Sort this ascending, then flip it backwards.


Take a list of integers; reverse the signs of everything, then Sort lowest to highest, then make it backwards.


Take a list of integers; negate each, then Arrange from smallest to largest, then reverse the list.


Take a list of integers; reverse the signs of everything, then sort ascending, then invert the sequence.


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


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


Take a list of strings; sort alphabetically, then take each string's first letter, then remove surrounding whitespace.


Take a list of strings; arrange alphabetically, then give me the first letter of everything, then trim the whitespace off everything.


Take a list of strings; sort alphabetically, then reduce each string to its first character, then strip spaces from all strings.


Take a list of strings; arrange alphabetically, then take first char drop blanks, then strip all the strings.


Take a list of strings; sort alphabetically, then keep first letters only, then clean up whitespace in the list.


Take a list of strings; arrange alphabetically, then first letter from each item that isn't empty, then strip spaces around each string.


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


Take a list of strings; sort alphabetically, then keep the first character of each (dropping empties), then trim whitespace from each.


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


Take a list of integers; cut the leading negatives, then square them all, then Discard the first element.


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


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


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


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


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


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


Take a list of integers; take values while they are positive, then drop anything 5 or below, then remove the initial run of negative numbers.


Take a list of integers; take positive values then stop, then keep only numbers greater than 5, then strip the front negatives.


Take a list of integers; keep going while positive, then filter for numbers above 5, then remove leading negative numbers.


Take a list of integers; stop at first non positive, then give me values where x is greater than 5, then drop negatives from start.


Take a list of integers; take while greater than zero, then show me only the values that are bigger than five, then strip negative values from the start.


Take a list of integers; take values while positive, then keep values greater than five, then remove negatives before the first non-negative.


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


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


Take a list of integers; subtract one from each, then sort smallest to largest, then give back the total.


Take a list of integers; Decrement all items, then Ascending sort, then sum r.


Take a list of integers; decrement each value, then Sort this ascending, then add them up.


Take a list of integers; Lower each number by one, then Sort lowest to highest, then calculate the sum of all elements.


Take a list of integers; reduce each by one, then Arrange from smallest to largest, then what's the total.


Take a list of integers; Subtract 1 from all, then sort ascending, then what do they add up to.


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


Take a list of integers; subtract one from each, then sort ascending, then return their sum.


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


Take a list of integers; reverse, then when the list is empty, substitute a zero value, then sum r.


Take a list of integers; flip the list around, then replace an empty list with one zero, then add them up.


Take a list of integers; flip the order around, then zero it out if it's empty, then calculate the sum of all elements.


Take a list of integers; put the elements backwards, then use zero if the list is empty, then what's the total.


Take a list of integers; reverse that for me, then default to zero when empty, then what do they add up to.


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


Take a list of integers; reverse the order, then if empty, use a single zero, then return their sum.


Take a list of integers; negate each, then keep values above zero, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then filter for positive numbers, then filter out the odd numbers.


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


Take a list of integers; reverse the signs of everything, then keep the positives, then filter out the odd numbers.


Take a list of integers; negate each, then remove negatives, then drop the odd numbers.


Take a list of integers; reverse the signs of everything, then keep the positive numbers, then filter out the odd numbers.


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


Take a list of integers; negate each, then keep the positive numbers, then keep the even numbers.


Take a list of integers; sort descending, then multiply each value by itself, then drop the odd numbers.


Take a list of integers; sort largest first, then square them all, then filter out the odd numbers.


Take a list of integers; sort in descending order, then raise each to the power of two, then drop the odd numbers.


Take a list of integers; sort from greatest to least, then I need each number multiplied by itself, then filter out the odd numbers.


Take a list of integers; sort z to a, then square all of them, then drop the odd numbers.


Take a list of integers; arrange in decreasing order, then multiply each element by itself, then filter out the odd numbers.


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


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


Take a list of integers; drop the first and last elements, then keep values above zero, then raise each to the power of two.


Take a list of integers; take out the first and last items, then filter for positive numbers, then I need each number multiplied by itself.


Take a list of integers; remove both ends, then keep only positive numbers, then square all of them.


Take a list of integers; trim the edges, then keep the positives, then multiply each element by itself.


Take a list of integers; trim one element off each end, then remove negatives, then make each one squared.


Take a list of integers; cut off the first and last, then keep the positive numbers, then square each value in the list.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increase every value by 10, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then strip out the evens.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then drop the even numbers.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then strip out the evens.


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


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


Take a list of integers; keep the even numbers, then take the final 3 elements, then arrange in increasing order.


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


Take a list of integers; keep the even numbers, then give me the last three elements, then Sort in ascending order.


Take a list of integers; keep evens, then keep only the last three, then I need this sorted ascending.


Take a list of integers; keep the even numbers, then keep the final three items, then Put these in ascending order.


Take a list of integers; keep evens, then take the last three, then sort smallest to largest.


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


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


Take a list of strings; uppercase each string, then convert each to lower case, then true if a blank string is present.


Take a list of strings; make it all caps, then lowercase each one, then check for empty strings in the list.


Take a list of strings; convert each to upper case, then convert each to lower case, then check if there's an empty string.


Take a list of strings; change all strings to uppercase, then lowercase each one, then does the collection contain an empty string value somewhere.


Take a list of strings; make every string uppercase, then convert each to lower case, then whether any element is blank.


Take a list of strings; uppercase each one, then lowercase each one, then check for an empty string.


def solve(xs):
    r = list(xs)
    r = [s.upper() for s in r]
    r = [s.lower() for s in r]
    return any(s == '' for s in r)


Take a list of strings; uppercase each string, then lowercase each string, then return whether any string is empty.


Take a list of integers; keep everything before the first zero, then multiply each by two, then give back the product of all values.


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


Take a list of integers; cut the list at the first zero, then multiply each by two, then what's the product.


Take a list of integers; cut off after the first zero appears, then double each item in the list, then what do they multiply to.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then give me their product.


Take a list of integers; keep the part before the first 0, then double each item in the list, then multiply them all together.


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


Take a list of integers; keep everything before the first zero, then double each, then return their product.


Take a list of integers; keep the odd numbers, then increment each value, then keep only non-zero numbers.


Take a list of integers; odd numbers only, then plus one for all, then strip the zeros.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then take the final 3 elements, then ensure at least three items by appending zeros.


Take a list of integers; drop duplicates but keep the first one, then drop everything except the final three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop duplicates keeping first occurrence, then give me the last three elements, then ensure at least three items by appending zeros.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the final three items, then ensure at least three items by appending zeros.


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


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


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


Take a list of integers; keep only the last three, then keep values above zero, then make each twice as big.


Take a list of integers; keep the final three items, then filter for positive numbers, then multiply each by 2.


Take a list of integers; take the last three, then keep only positive numbers, then make each twice as big.


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


Take a list of integers; last three only, then remove negatives, then make each twice as big.


Take a list of integers; truncate to the last three items, then keep the positive numbers, then multiply each by 2.


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


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


Take a list of integers; keep values greater than five, then keep only even values, then drop anything not divisible by three.


Take a list of integers; filter out values less than or equal to 5, then extract all even numbers, then filter out everything except multiples of three.


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


Take a list of integers; exclude values of 5 and below, then extract all even numbers, then multiples of three only.


Take a list of integers; remove anything 5 or less, then keep only even values, then filter for numbers divisible by three.


Take a list of integers; filter to keep only values above 5, then extract all even numbers, then give me only the values divisible by three.


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


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


Take a list of integers; keep values greater than five, then decrement each value, then make each twice as big.


Take a list of integers; filter out values less than or equal to 5, then Lower each number by one, then multiply each by 2.


Take a list of integers; keep only numbers above 5, then reduce each by one, then make each twice as big.


Take a list of integers; exclude values of 5 and below, then Subtract 1 from all, then multiply each by 2.


Take a list of integers; remove anything 5 or less, then Subtract one from each, then make each twice as big.


Take a list of integers; filter to keep only values above 5, then Drop each by one, then multiply each by 2.


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


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


Take a list of integers; keep only the last three, then flip the sign of each, then drop the odd numbers.


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


Take a list of integers; take the last three, then flip the sign of each, then drop the odd numbers.


Take a list of integers; trim to the last three, then turn positives to negatives and vice versa, then filter out the odd numbers.


Take a list of integers; last three only, then flip the sign of each, then drop the odd numbers.


Take a list of integers; truncate to the last three items, then turn positives to negatives and vice versa, then filter out the odd numbers.


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


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


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


Take a list of integers; if blank use 0, then pad to 3, then remove repeats.


Take a list of integers; default to [0] when there is nothing, then extend to length 3 using zeros, then deduplicate the list.


Take a list of integers; when the list is empty, substitute a zero value, then pad to 3, then remove repeats.


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


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


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


Take a list of integers; if empty, use a single zero, then pad with zeros to at least three elements, then drop duplicates keeping first occurrence.


Take a list of integers; drop duplicates keeping first occurrence, then sort largest to smallest, then put the elements backwards.


Take a list of integers; drop duplicates but keep the first one, then sort by descending values, then reverse that for me.


Take a list of integers; drop duplicates keeping first occurrence, then sort from highest to lowest, then flip it backwards.


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


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


Take a list of integers; drop duplicates but keep the first one, then sort in descending order, then invert the sequence.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = sorted(r, reverse=True)
    r = list(reversed(r))
    return r


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


Take a list of integers; add ten to each, then remove all zero values, then stop at the first non-positive value.


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


Take a list of integers; increase every value by 10, then remove all zero values, then take values while they are positive.


Take a list of integers; add 10 to each item, then exclude zeros, then take positive values then stop.


Take a list of integers; shift each up by ten, then remove all zero values, then keep going while positive.


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


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


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


Take a list of strings; drop empty strings, then convert each to lower case, then prepend a hash mark to each.


Take a list of strings; get rid of blanks, then lowercase each one, then prefix all with #.


Take a list of strings; remove blanks, then convert each to lower case, then prepend a hash mark to each.


Take a list of strings; eliminate empty string values, then lowercase each one, then prefix all with #.


Take a list of strings; filter out blank strings, then convert each to lower case, then prepend a hash mark to each.


Take a list of strings; remove strings that are empty, then lowercase each one, then prefix all with #.


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


Take a list of strings; drop empty strings, then lowercase each string, then prefix each with a hash.


Take a list of integers; keep the positive numbers, then sort smallest to largest, then give back the product of all values.


Take a list of integers; get rid of anything that's not positive, then Ascending sort, then product of the list.


Take a list of integers; drop non-positive values, then Sort this ascending, then what's the product.


Take a list of integers; drop the negative numbers, then Sort lowest to highest, then what do they multiply to.


Take a list of integers; filter out the negative ones, then Arrange from smallest to largest, then give me their product.


Take a list of integers; remove all negative values, then sort ascending, then multiply them all together.


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


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


Take a list of integers; sort ascending, then keep values above zero, then give back the total.


Take a list of integers; Sort it from low to high, then filter for positive numbers, then sum r.


Take a list of integers; arrange in increasing order, then keep only positive numbers, then add them up.


Take a list of integers; Organize these ascending, then keep the positives, then calculate the sum of all elements.


Take a list of integers; Sort in ascending order, then remove negatives, then what's the total.


Take a list of integers; I need this sorted ascending, then keep the positive numbers, then what do they add up to.


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


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


Take a list of integers; take the absolute value of each, then keep only odd values, then multiply each by -1.


Take a list of integers; convert to absolute value, then eliminate the even numbers, then negate.


Take a list of integers; strip the signs, then keep only odd values, then multiply each by -1.


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


Take a list of integers; get the absolute value of everything, then keep only odd values, then multiply each by -1.


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


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 for x in r]
    return r


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


Take a list of integers; keep the positive numbers, then remove both ends, then arrange in increasing order.


Take a list of integers; get rid of anything that's not positive, then trim the edges, then Organize these ascending.


Take a list of integers; drop non-positive values, then trim one element off each end, then Sort in ascending order.


Take a list of integers; drop the negative numbers, then cut off the first and last, then I need this sorted ascending.


Take a list of integers; filter out the negative ones, then remove the first and last elements, then Put these in ascending order.


Take a list of integers; remove all negative values, then keep only the middle part, then sort smallest to largest.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only positive numbers, then truncate at the first zero.


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


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


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


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


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


Take a list of integers; take values while they are positive, then flip the sign of each, then arrange by magnitude ignoring sign.


Take a list of integers; take positive values then stop, then turn positives to negatives and vice versa, then put them in order by magnitude.


Take a list of integers; keep going while positive, then flip the sign of each, then arrange in order of absolute value.


Take a list of integers; stop at first non positive, then turn positives to negatives and vice versa, then sort by distance from zero.


Take a list of integers; take while greater than zero, then flip the sign of each, then order by how far from zero.


Take a list of integers; take values while positive, then turn positives to negatives and vice versa, then order by distance from zero.


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


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


Take a list of integers; cap each value at 10, then keep values above zero, then truncate to three items.


Take a list of integers; clip values at 10, then filter for positive numbers, then show the first three.


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


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


Take a list of integers; cap each value at 10, then remove negatives, then truncate to first three.


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


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


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


Take a list of integers; keep only the last three, then keep only even values, then count the elements.


Take a list of integers; keep the final three items, then extract all even numbers, then how many items remain.


Take a list of integers; take the last three, then keep only even values, then tell me the length.


Take a list of integers; trim to the last three, then extract all even numbers, then return the length.


Take a list of integers; last three only, then keep only even values, then count them.


Take a list of integers; truncate to the last three items, then extract all even numbers, then what's the count.


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


Take a list of integers; keep only the last three, then keep the even numbers, then return how many remain.


Take a list of integers; if empty, use a single zero, then remove all zero values, then give the earliest even value or zero.


Take a list of integers; if blank use 0, then exclude zeros, then fetch the first even element, default to 0.


Take a list of integers; default to [0] when there is nothing, then remove all zero values, then give the earliest even value or zero.


Take a list of integers; when the list is empty, substitute a zero value, then exclude zeros, then fetch the first even element, default to 0.


Take a list of integers; replace an empty list with one zero, then remove all zero values, then give the earliest even value or zero.


Take a list of integers; zero it out if it's empty, then exclude zeros, then fetch the first even element, default to 0.


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


Take a list of integers; if empty, use a single zero, then drop the zeros, then return the first even value (0 if none).


Take a list of integers; sort ascending, then flip the sign of each, then true if at least one even value.


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then any even.


Take a list of integers; arrange in increasing order, then flip the sign of each, then true if at least one even value.


Take a list of integers; Organize these ascending, then turn positives to negatives and vice versa, then any even.


Take a list of integers; Sort in ascending order, then flip the sign of each, then true if at least one even value.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then any even.


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


Take a list of integers; sort ascending, then negate each, then return whether any value is even.


Take a list of integers; drop duplicates keeping first occurrence, then keep the leading run of positive numbers, then take values up to (excluding) the first zero.


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then keep the part before the first 0.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then truncate at the first zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then remove from the first zero onwards.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then up to but not including the first zero.


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


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


Take a list of integers; keep everything before the first zero, then multiply each by two, then arrange by magnitude ignoring sign.


Take a list of integers; take only what comes before the initial zero, then double each item in the list, then put them in order by magnitude.


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


Take a list of integers; cut off after the first zero appears, then double each item in the list, then sort by distance from zero.


Take a list of integers; take values up to (excluding) the first zero, then multiply each by two, then order by how far from zero.


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


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, key=abs)
    return r


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


Take a list of integers; drop duplicates keeping first occurrence, then take the final 3 elements, then stop at the first non-positive value.


Take a list of integers; drop duplicates but keep the first one, then drop everything except the final three, then keep the leading run of positive numbers.


Take a list of integers; drop duplicates keeping first occurrence, then give me the last three elements, then take values while they are positive.


Take a list of integers; drop duplicates but keep the first one, then keep only the last three, then take positive values then stop.


Take a list of integers; drop duplicates keeping first occurrence, then keep the final three items, then keep going while positive.


Take a list of integers; drop duplicates but keep the first one, then take the last three, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(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; drop duplicates keeping first occurrence, then keep only the last three, then take values while they are positive.


Take a list of integers; keep multiples of three, then keep values above zero, then stop at the first non-positive value.


Take a list of integers; get rid of non-multiples of three, then filter for positive numbers, then keep the leading run of positive numbers.


Take a list of integers; keep values divisible by 3, then keep only positive numbers, then take values while they are positive.


Take a list of integers; keep items where x mod 3 equals zero, then keep the positives, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then remove negatives, then keep going while positive.


Take a list of integers; filter out everything except multiples of three, then keep the positive numbers, then stop at first non positive.


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


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


Take a list of strings; drop duplicate strings keeping the first, then take each string's first letter, then prepend a hash mark to each.


Take a list of strings; dedupe, then give me the first letter of everything, then prefix all with #.


Take a list of strings; remove duplicate strings keep first, then reduce each string to its first character, then prepend a hash mark to each.


Take a list of strings; remove repeating strings first one stays, then take first char drop blanks, then prefix all with #.


Take a list of strings; delete duplicate strings keep the first one, then keep first letters only, then prepend a hash mark to each.


Take a list of strings; deduplicate the strings, then first letter from each item that isn't empty, then prefix all with #.


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


Take a list of strings; drop duplicate strings keeping the first, then keep the first character of each (dropping empties), then prefix each with a hash.


Take a list of integers; pad with zeros to at least three elements, then multiply each value by itself, then drop anything not divisible by three.


Take a list of integers; add zeros until the list has at least three values, then square them all, then filter out everything except multiples of three.


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


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


Take a list of integers; pad with zeros to at least three elements, then square all of them, then filter for numbers divisible by three.


Take a list of integers; add zeros until the list has at least three values, then multiply each element by itself, then give me only the values divisible by three.


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


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


Take a list of integers; drop the zeros, then cut the list at the first zero, then true if already sorted smallest to largest.


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then does this list go in ascending order.


Take a list of integers; drop the zeros, then take values up to (excluding) the first zero, then check if the list is in ascending order.


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


Take a list of integers; drop the zeros, then truncate at the first zero, then is it sorted.


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then check if values are in increasing order.


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


Take a list of integers; drop the zeros, then keep everything before the first zero, then return whether the list is sorted ascending.


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


Take a list of integers; get rid of non-multiples of three, then take values while they are positive, then cut off the first and last.


Take a list of integers; keep values divisible by 3, then take positive values then stop, then remove the first and last elements.


Take a list of integers; keep items where x mod 3 equals zero, then keep going while positive, then keep only the middle part.


Take a list of integers; drop anything not divisible by three, then stop at first non positive, then drop first and last.


Take a list of integers; filter out everything except multiples of three, 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 % 3 == 0]
    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 multiples of three, then take values while they are positive, then drop the first and last elements.


Take a list of integers; keep the positive numbers, then increment each value, then put the elements backwards.


Take a list of integers; get rid of anything that's not positive, then plus one for all, then reverse that for me.


Take a list of integers; drop non-positive values, then increment each value, then flip it backwards.


Take a list of integers; drop the negative numbers, then plus one for all, then make it backwards.


Take a list of integers; filter out the negative ones, then increment each value, then reverse the list.


Take a list of integers; remove all negative values, then plus one for all, then invert the sequence.


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


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


Take a list of integers; keep the positive numbers, then take the first 3 elements, then make each twice as big.


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then multiply each by 2.


Take a list of integers; drop non-positive values, then truncate to three items, then make each twice as big.


Take a list of integers; drop the negative numbers, then show the first three, then multiply each by 2.


Take a list of integers; filter out the negative ones, then take the first three, then make each twice as big.


Take a list of integers; remove all negative values, 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; keep the positive numbers, then keep only the first three, then double each.


Take a list of integers; keep values greater than five, then order by distance from zero, then take values up to (excluding) the first zero.


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value, then keep the part before the first 0.


Take a list of integers; keep only numbers above 5, then organize by magnitude, then truncate at the first zero.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending, then delete everything starting with the first zero.


Take a list of integers; remove anything 5 or less, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; filter to keep only values above 5, then sort by absolute value, then up to but not including the first zero.


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


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


Take a list of strings; uppercase each string, then keep only non-empty strings, then return the number of strings.


Take a list of strings; make it all caps, then filter empty strings, then count the strings.


Take a list of strings; convert each to upper case, then remove empty strings from the list, then return how many strings remain.


Take a list of strings; change all strings to uppercase, then clean up empty strings, then give me the total number of strings.


Take a list of strings; make every string uppercase, then delete empty entries, then tell me how many strings we have.


Take a list of strings; uppercase each one, then drop empty strings, then what's the string count.


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


Take a list of strings; uppercase each string, then drop empty strings, then return how many strings remain.


Take a list of integers; pad with zeros to at least three elements, then remove all zero values, then keep only numbers above 5.