Take a list of integers; drop the zeros, then sort from smallest to largest absolute value, then remove from the first zero onwards.


Take a list of integers; keep only nonzero elements, 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 != 0]
    r = sorted(r, key=abs)
    r = r[:r.index(0)] if 0 in r else r
    return r


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


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


Take a list of integers; get rid of non-multiples of three, then turn positives to negatives and vice versa, then remove repeats.


Take a list of integers; keep values divisible by 3, then flip the sign of each, then deduplicate the list.


Take a list of integers; keep items where x mod 3 equals zero, then turn positives to negatives and vice versa, then remove repeats.


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


Take a list of integers; filter out everything except multiples of three, then turn positives to negatives and vice versa, then remove repeats.


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


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


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


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


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


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


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


Take a list of integers; filter out everything except multiples of three, then take the last three, then remove repeats.


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


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


Take a list of strings; drop empty strings, then take each string's first letter, then remove short strings (under 3 chars).


Take a list of strings; get rid of blanks, then give me the first letter of everything, then only keep strings with three or more characters.


Take a list of strings; remove blanks, then reduce each string to its first character, then keep only strings that are at least three characters long.


Take a list of strings; eliminate empty string values, then take first char drop blanks, then filter strings shorter than 3 chars.


Take a list of strings; filter out blank strings, then keep first letters only, then drop anything shorter than three characters.


Take a list of strings; remove strings that are empty, then first letter from each item that isn't empty, then keep only strings of length 3 or more.


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


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


Take a list of integers; add ten to each, then remove the first item, then make each twice as big.


Take a list of integers; bump everything up by 10, then Remove head, then multiply each by 2.


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


Take a list of integers; add 10 to each item, then Remove head, then multiply each by 2.


Take a list of integers; shift each up by ten, then remove the first item, then make each twice as big.


Take a list of integers; increase all numbers by 10, then Remove head, then multiply each by 2.


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


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


Take a list of integers; double each, then keep only even values, then give back the total.


Take a list of integers; times two for each item, then extract all even numbers, then sum r.


Take a list of integers; double each, then keep only even values, then add them up.


Take a list of integers; times two for each item, then extract all even numbers, then calculate the sum of all elements.


Take a list of integers; double each, then keep only even values, then what's the total.


Take a list of integers; times two for each item, then extract all even numbers, then what do they add up to.


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


Take a list of integers; double each, then keep the even numbers, then return their sum.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then square them all, then negate.


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then multiply each by -1.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then negate.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then multiply each by -1.


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


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


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


Take a list of integers; cap each value at 10, then flip the sign of each, then strip the signs.


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


Take a list of integers; cap each value at 10, then flip the sign of each, then get the absolute value of everything.


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


Take a list of integers; cap each value at 10, then flip the sign of each, then make them all positive.


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


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


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


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


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then drop the negative numbers.


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


Take a list of integers; keep only nonzero elements, then keep the part before the first 0, then remove all negative values.


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


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then keep values above zero.


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


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


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


Take a list of integers; keep the first 3 items, then filter for positive numbers, then take abs of each.


Take a list of integers; take the first 3 elements, then keep only positive numbers, then get the absolute value of everything.


Take a list of integers; remove everything after the third, then keep the positives, then apply absolute value to the whole list.


Take a list of integers; truncate to three items, then remove negatives, then make them all positive.


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


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


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


Take a list of integers; pad with zeros to at least three elements, then decrement each value, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then Lower each number by one, then drop all positive numbers.


Take a list of integers; pad with zeros to at least three elements, then reduce each by one, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then Subtract 1 from all, then drop all positive numbers.


Take a list of integers; pad with zeros to at least three elements, then Subtract one from each, then drop non-negative values.


Take a list of integers; add zeros until the list has at least three values, then Drop each by one, then drop all positive numbers.


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 < 0]
    return r


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


Take a list of integers; keep the even numbers, then remove the first item, then make each twice as big.


Take a list of integers; keep evens, then Remove head, then multiply each by 2.


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


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


Take a list of integers; negate each, then decrement each value, then true only if all are positive.


Take a list of integers; reverse the signs of everything, then Lower each number by one, then do all of these have positive values.


Take a list of integers; negate each, then reduce each by one, then check if every value is positive.


Take a list of integers; reverse the signs of everything, then Subtract 1 from all, then confirm all values are positive.


Take a list of integers; negate each, then Subtract one from each, then all positive.


Take a list of integers; reverse the signs of everything, then Drop each by one, then check if every number is above zero.


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


Take a list of integers; negate each, then subtract one from each, then return whether all values are positive.


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


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


Take a list of integers; increase every value by 10, then truncate to three items, then What's the highest number in the list.


Take a list of integers; add 10 to each item, then show the first three, then Return the greatest value or default to 0.


Take a list of integers; shift each up by ten, then take the first three, then Find the largest element, defaulting to zero.


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


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


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


Take a list of integers; take values while they are positive, then increase every value by 10, then true if at least one even value.


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


Take a list of integers; keep going while positive, then shift each up by ten, then true if at least one even value.


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


Take a list of integers; take while greater than zero, then add 10 to everything, then true if at least one even value.


Take a list of integers; take values while positive, then give everything a boost of 10, then any even.


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


Take a list of integers; take values while they are positive, then add ten to each, then return whether any value is even.


Take a list of integers; add one to each, then keep only odd values, then stop at the first non-positive value.


Take a list of integers; make each one bigger, then eliminate the even numbers, then keep the leading run of positive numbers.


Take a list of integers; add one to each, then keep only odd values, then take values while they are positive.


Take a list of integers; make each one bigger, then eliminate the even numbers, then take positive values then stop.


Take a list of integers; add one to each, then keep only odd values, then keep going while positive.


Take a list of integers; make each one bigger, then eliminate the even numbers, then stop at first non positive.


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


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


Take a list of people records (name, age); sort records by age, youngest first, then pluck the age field from each record, then true if at least one even value.


Take a list of people records (name, age); put the youngest at the top, then get the age field, then any even.


Take a list of people records (name, age); sort records by age, youngest first, then keep just each person's age, then true if at least one even value.


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


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then true if at least one even value.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then any even.


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


Take a list of people records (name, age); sort records by age, youngest first, then extract the ages, then return whether any value is even.


Take a list of integers; subtract one from each, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; Decrement all items, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; decrement each value, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; Lower each number by one, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; reduce each by one, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; Subtract 1 from all, then don't let anything exceed 10, then strip the zeros.


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


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


Take a list of people records (name, age); extract the ages, then default to [0] when there is nothing, then arrange in increasing order.


Take a list of people records (name, age); show me all ages, then when the list is empty, substitute a zero value, then Organize these ascending.


Take a list of people records (name, age); pluck the age field from each record, then replace an empty list with one zero, then Sort in ascending order.


Take a list of people records (name, age); get the age field, then zero it out if it's empty, then I need this sorted ascending.


Take a list of people records (name, age); keep just each person's age, then use zero if the list is empty, then Put these in ascending order.


Take a list of people records (name, age); extract age values, then default to zero when empty, then sort smallest to largest.


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


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


Take a list of integers; if empty, use a single zero, then order by distance from zero, then arrange in increasing order.


Take a list of integers; if blank use 0, then sort based on absolute value, then Organize these ascending.


Take a list of integers; default to [0] when there is nothing, then organize by magnitude, then Sort in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then arrange by absolute value ascending, then I need this sorted ascending.


Take a list of integers; replace an empty list with one zero, then sort from smallest to largest absolute value, then Put these in ascending order.


Take a list of integers; zero it out if it's empty, then sort by absolute value, then sort smallest to largest.


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


Take a list of integers; if empty, use a single zero, then sort by absolute value, then sort ascending.


Take a list of integers; keep the positive numbers, then remove both ends, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then trim the edges, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then trim one element off each end, then add 10 to everything.


Take a list of integers; drop the negative numbers, then cut off the first and last, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then remove the first and last elements, then increment each by ten.


Take a list of integers; remove all negative values, then keep only the middle part, then add a constant 10 to each.


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


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


Take a list of integers; keep the odd numbers, then skip negatives at the start, then keep only numbers above 5.


Take a list of integers; odd numbers only, then remove all negatives at the front, then exclude values of 5 and below.


Take a list of integers; keep the odd numbers, then remove the initial run of negative numbers, then remove anything 5 or less.


Take a list of integers; odd numbers only, then strip the front negatives, then filter to keep only values above 5.


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


Take a list of integers; odd numbers only, then drop negatives from start, then drop anything 5 or below.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then ensure at least three items by appending zeros.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then ensure at least three items by appending zeros.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then ensure at least three items by appending zeros.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; keep values greater than five, then take values while they are positive, then pad with zeros to at least three elements.


Take a list of people records (name, age); extract the ages, then make every value non-negative, then drop anything not divisible by three.


Take a list of people records (name, age); show me all ages, then absolute value for all items, then filter out everything except multiples of three.


Take a list of people records (name, age); pluck the age field from each record, then take absolute values, then keep only multiples of three.


Take a list of people records (name, age); get the age field, then turn negatives into positives, then multiples of three only.


Take a list of people records (name, age); keep just each person's age, then abs each element, then filter for numbers divisible by three.


Take a list of people records (name, age); extract age values, then take the absolute value of each, then give me only the values divisible by three.


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


Take a list of people records (name, age); extract the ages, then take the absolute value of each, then keep multiples of three.


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


Take a list of integers; take out the first and last items, then flip the order around, then exclude values of 5 and below.


Take a list of integers; remove both ends, then put the elements backwards, then remove anything 5 or less.


Take a list of integers; trim the edges, then reverse that for me, then filter to keep only values above 5.


Take a list of integers; trim one element off each end, then flip it backwards, then get rid of values that aren't greater than five.


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


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


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


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


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


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


Take a list of integers; cut off after the first zero appears, then Remove head, then take positive values then stop.


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


Take a list of integers; keep the part before the first 0, then Remove head, then stop at first non positive.


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


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


Take a list of integers; subtract one from each, then multiply each value by itself, then drop anything not divisible by three.


Take a list of integers; Decrement all items, then square them all, then filter out everything except multiples of three.


Take a list of integers; decrement each value, then raise each to the power of two, then keep only multiples of three.


Take a list of integers; Lower each number by one, then I need each number multiplied by itself, then multiples of three only.


Take a list of integers; reduce each by one, then square all of them, then filter for numbers divisible by three.


Take a list of integers; Subtract 1 from all, then multiply each element by itself, then give me only the values divisible by three.


def solve(xs):
    r = list(xs)
    r = [x - 1 for x in 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; subtract one from each, then square each, then keep multiples of three.


Take a list of integers; keep the odd numbers, then increase every value by 10, then make each twice as big.


Take a list of integers; odd numbers only, then add 10 to each item, then multiply each by 2.


Take a list of integers; keep the odd numbers, then shift each up by ten, then make each twice as big.


Take a list of integers; odd numbers only, then increase all numbers by 10, then multiply each by 2.


Take a list of integers; keep the odd numbers, then add 10 to everything, then make each twice as big.


Take a list of integers; odd numbers only, then give everything a boost of 10, then multiply each by 2.


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


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


Take a list of integers; sort descending, then keep only odd values, then stop at the first non-positive value.


Take a list of integers; sort largest first, then eliminate the even numbers, then keep the leading run of positive numbers.


Take a list of integers; sort in descending order, then keep only odd values, then take values while they are positive.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then take positive values then stop.


Take a list of integers; sort z to a, then keep only odd values, then keep going while positive.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then stop at first non positive.


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


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


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


Take a list of integers; odd numbers only, then trim the edges, then strip the front negatives.


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


Take a list of integers; odd numbers only, then cut off the first and last, then drop negatives from start.


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


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


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


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


Take a list of integers; keep the odd numbers, then decrement each value, then arrange in decreasing order.


Take a list of integers; odd numbers only, then Lower each number by one, then arrange in descending order.


Take a list of integers; keep the odd numbers, then reduce each by one, then reverse sort.


Take a list of integers; odd numbers only, then Subtract 1 from all, then sort largest to smallest.


Take a list of integers; keep the odd numbers, then Subtract one from each, then sort by descending values.


Take a list of integers; odd numbers only, then Drop each by one, then sort from highest to lowest.


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


Take a list of integers; keep the odd numbers, then subtract one from each, then sort descending.


Take a list of integers; drop the leading negative values, then remove the first item, then make each twice as big.


Take a list of integers; cut the leading negatives, then Remove head, then multiply each by 2.


Take a list of integers; skip negatives at the start, then remove the first item, then make each twice as big.


Take a list of integers; remove all negatives at the front, then Remove head, then multiply each by 2.


Take a list of integers; remove the initial run of negative numbers, then remove the first item, then make each twice as big.


Take a list of integers; strip the front negatives, then Remove head, then multiply each by 2.


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


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


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


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


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


Take a list of integers; flip the order around, then zero it out if it's empty, then what do they multiply to.


Take a list of integers; put the elements backwards, then use zero if the list is empty, then give me their product.


Take a list of integers; reverse that for me, then default to zero when empty, then multiply them all together.


def solve(xs):
    r = list(xs)
    r = list(reversed(r))
    r = r if r else [0]
    return __import__('math').prod(r)


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


Take a list of integers; if empty, use a single zero, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; if blank use 0, then cut off after the first zero appears, then show only the last three.


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


Take a list of integers; when the list is empty, substitute a zero value, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; replace an empty list with one zero, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; zero it out if it's empty, then delete everything starting with the first zero, then give me the last three elements.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then take values while they are positive, then show only the last three.


Take a list of integers; pad with zeros to at least three elements, then take positive values then stop, then remove all but the last three.


Take a list of integers; add zeros until the list has at least three values, then keep going while positive, then take the final 3 elements.


Take a list of integers; pad with zeros to at least three elements, then stop at first non positive, then drop everything except the final three.


Take a list of integers; add zeros until the list has at least three values, then take while greater than zero, 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 = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    r = r[-3:]
    return r


Take a list of integers; pad with zeros to at least three elements, then take values while they are positive, then keep only the last three.


Take a list of integers; keep only the first three, then multiply each by two, then put the elements backwards.


Take a list of integers; keep the first 3 items, then double each item in the list, then reverse that for me.


Take a list of integers; take the first 3 elements, then multiply each by two, then flip it backwards.


Take a list of integers; remove everything after the third, then double each item in the list, then make it backwards.


Take a list of integers; truncate to three items, then multiply each by two, then reverse the list.


Take a list of integers; show the first three, then double each item in the list, then invert the sequence.


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


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


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


Take a list of integers; take out the first and last items, then pad to 3, then remove repeats.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then deduplicate the list.


Take a list of integers; trim the edges, then pad to 3, then remove repeats.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then deduplicate the list.


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


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


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


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


Take a list of integers; extract negatives, then Lower each number by one, then reverse that for me.


Take a list of integers; keep the negative numbers, then reduce each by one, then flip it backwards.


Take a list of integers; extract negatives, then Subtract 1 from all, then make it backwards.


Take a list of integers; keep the negative numbers, then Subtract one from each, then reverse the list.


Take a list of integers; extract negatives, then Drop each by one, 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 negative numbers, then subtract one from each, then reverse the order.


Take a list of integers; keep multiples of three, then remove all zero values, then strip the signs.


Take a list of integers; get rid of non-multiples of three, then exclude zeros, then take abs of each.


Take a list of integers; keep values divisible by 3, then remove all zero values, then get the absolute value of everything.


Take a list of integers; keep items where x mod 3 equals zero, then exclude zeros, then apply absolute value to the whole list.


Take a list of integers; drop anything not divisible by three, then remove all zero values, then make them all positive.


Take a list of integers; filter out everything except multiples of three, then exclude zeros, then make every value non-negative.


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


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


Take a list of integers; take values while they are positive, then skip negatives at the start, then give the number of evens.


Take a list of integers; take positive values then stop, then remove all negatives at the front, then find how many values are divisible by two.


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then how many are even.


Take a list of integers; stop at first non positive, then strip the front negatives, then get the total number of even values in the list.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then give me the count of even values.


Take a list of integers; take values while positive, then drop negatives from start, then I need to know how many of these are even.


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


Take a list of integers; take values while they are positive, then drop the leading negative values, then return how many values are even.


Take a list of integers; subtract one from each, then increase every value by 10, then drop the even numbers.


Take a list of integers; Decrement all items, then add 10 to each item, then strip out the evens.


Take a list of integers; decrement each value, then shift each up by ten, then drop the even numbers.


Take a list of integers; Lower each number by one, then increase all numbers by 10, then strip out the evens.


Take a list of integers; reduce each by one, then add 10 to everything, then drop the even numbers.


Take a list of integers; Subtract 1 from all, then give everything a boost of 10, then strip out the evens.


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


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


Take a list of people records (name, age); extract the ages, then decrement each value, then give back the product of all values.


Take a list of people records (name, age); show me all ages, then Lower each number by one, then product of the list.


Take a list of people records (name, age); pluck the age field from each record, then reduce each by one, then what's the product.


Take a list of people records (name, age); get the age field, then Subtract 1 from all, then what do they multiply to.


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


Take a list of people records (name, age); extract age values, then Drop each by one, then multiply them all together.


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


Take a list of people records (name, age); extract the ages, then subtract one from each, then return their product.


Take a list of integers; cap each value at 10, then make every value non-negative, then make each twice as big.


Take a list of integers; clip values at 10, then absolute value for all items, then multiply each by 2.


Take a list of integers; cap each value at 10, then take absolute values, then make each twice as big.


Take a list of integers; clip values at 10, then turn negatives into positives, then multiply each by 2.


Take a list of integers; cap each value at 10, then abs each element, then make each twice as big.


Take a list of integers; clip values at 10, then take the absolute value of each, then multiply each by 2.


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


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


Take a list of integers; keep everything before the first zero, then keep values divisible by 3, then strip the signs.


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


Take a list of integers; cut the list at the first zero, then drop anything not divisible by three, then get the absolute value of everything.


Take a list of integers; cut off after the first zero appears, then filter out everything except multiples of three, then apply absolute value to the whole list.


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


Take a list of integers; keep the part before the first 0, then multiples of three only, then make every value non-negative.


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


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


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


Take a list of integers; make each one bigger, then sort based on absolute value, then exclude values of 5 and below.


Take a list of integers; add one to each, then organize by magnitude, then remove anything 5 or less.


Take a list of integers; make each one bigger, then arrange by absolute value ascending, then filter to keep only values above 5.


Take a list of integers; add one to each, then sort from smallest to largest absolute value, then get rid of values that aren't greater than five.


Take a list of integers; make each one bigger, then sort by absolute value, then drop anything 5 or below.


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


Take a list of integers; add one to each, then sort by absolute value, then keep values greater than five.


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then give the earliest even value or zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then give the earliest even value or zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then give the earliest even value or zero.


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then take abs of each.


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


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


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then make them all positive.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then make every value non-negative.


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


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


Take a list of integers; negate each, then keep the leading run of positive numbers, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then take values while they are positive, then strip the zeros.


Take a list of integers; negate each, then take positive values then stop, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then keep going while positive, then strip the zeros.


Take a list of integers; negate each, then stop at first non positive, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then take while greater than zero, then strip the zeros.


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


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


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


Take a list of integers; Take everything except the first, then flip the order around, then strip the zeros.


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


Take a list of integers; Take everything except the first, then reverse that for me, then strip the zeros.


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


Take a list of integers; Take everything except the first, then make it backwards, then strip the zeros.


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


Take a list of integers; drop the first element, then reverse the order, then drop the zeros.


Take a list of integers; keep only the last three, then increase every value by 10, then drop the odd numbers.


Take a list of integers; keep the final three items, then add 10 to each item, then filter out the odd numbers.


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


Take a list of integers; trim to the last three, then increase all numbers by 10, then filter out the odd numbers.


Take a list of integers; last three only, then add 10 to everything, then drop the odd numbers.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then filter out the odd numbers.


def solve(xs):
    r = list(xs)
    r = r[-3:]
    r = [x + 10 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 add ten to each, then keep the even numbers.


Take a list of integers; keep only the last three, then clamp each to at most ten, then true if at least one even value.


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


Take a list of integers; take the last three, then clamp each to at most ten, then true if at least one even value.


Take a list of integers; trim to the last three, then don't let anything exceed 10, then any even.


Take a list of integers; last three only, then clamp each to at most ten, then true if at least one even value.


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


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


Take a list of integers; keep only the last three, then cap each value at 10, then return whether any value is even.


Take a list of integers; take the absolute value of each, then sort largest to smallest, then make each twice as big.


Take a list of integers; convert to absolute value, then sort by descending values, then multiply each by 2.


Take a list of integers; strip the signs, then sort from highest to lowest, then make each twice as big.


Take a list of integers; take abs of each, then sort descending, then multiply each by 2.


Take a list of integers; get the absolute value of everything, then sort largest first, then make each twice as big.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then multiply each by 2.


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


Take a list of integers; take the absolute value of each, then sort descending, then double each.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; Take everything except the first, then pad to 3, then check for zero.


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


Take a list of integers; drop the first element, then pad with zeros to at least three elements, then return whether the list contains a zero.


Take a list of integers; keep only the last three, then increase every value by 10, then arrange by magnitude ignoring sign.


Take a list of integers; keep the final three items, then add 10 to each item, then put them in order by magnitude.


Take a list of integers; take the last three, then shift each up by ten, then arrange in order of absolute value.


Take a list of integers; trim to the last three, then increase all numbers by 10, then sort by distance from zero.


Take a list of integers; last three only, then add 10 to everything, then order by how far from zero.


Take a list of integers; truncate to the last three items, then give everything a boost of 10, then order by distance from zero.


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


Take a list of integers; keep only the last three, then add ten to each, then sort by absolute value.


Take a list of integers; subtract one from each, then take the first 3 elements, then arrange in increasing order.


Take a list of integers; Decrement all items, then remove everything after the third, then Organize these ascending.


Take a list of integers; decrement each value, then truncate to three items, then Sort in ascending order.


Take a list of integers; Lower each number by one, then show the first three, then I need this sorted ascending.


Take a list of integers; reduce each by one, then take the first three, then Put these in ascending order.


Take a list of integers; Subtract 1 from all, then keep first 3, then sort smallest to largest.


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


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


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


Take a list of integers; cut the leading negatives, then square them all, then exclude values of 5 and below.


Take a list of integers; skip negatives at the start, then raise each to the power of two, then remove anything 5 or less.


Take a list of integers; remove all negatives at the front, then I need each number multiplied by itself, then filter to keep only values above 5.


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


Take a list of integers; strip the front negatives, then multiply each element by itself, then drop anything 5 or below.


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


Take a list of integers; drop the leading negative values, then square each, then keep values greater than five.


Take a list of strings; sort by length, shortest first, then convert each to upper case, then count characters across all strings.


Take a list of strings; sort ascending by length, then change all strings to uppercase, then character count.


Take a list of strings; order strings from shortest to longest, then make every string uppercase, then count all the characters.


Take a list of strings; shortest to longest, then uppercase each one, then total number of characters.


Take a list of strings; arrange by string length ascending, then make all the strings uppercase, then what's the total character count.


Take a list of strings; length sort, then convert all strings to uppercase letters, then add up the lengths.


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


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


Take a list of integers; add ten to each, then remove both ends, then raise each to the power of two.


Take a list of integers; bump everything up by 10, then trim the edges, then I need each number multiplied by itself.


Take a list of integers; increase every value by 10, then trim one element off each end, then square all of them.


Take a list of integers; add 10 to each item, then cut off the first and last, then multiply each element by itself.


Take a list of integers; shift each up by ten, then remove the first and last elements, then make each one squared.


Take a list of integers; increase all numbers by 10, then keep only the middle part, then square each value in the list.


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


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


Take a list of strings; trim whitespace from each, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; strip whitespace from every element, then make each one start with a hash, then sort by letter.


Take a list of strings; remove surrounding whitespace, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; trim the whitespace off everything, then make each one start with a hash, then sort by letter.


Take a list of strings; strip spaces from all strings, then add '#' to the start of each string, then arrange in lexicographic order.


Take a list of strings; strip all the strings, then make each one start with a hash, then sort by letter.


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


Take a list of strings; trim whitespace from each, then prefix each with a hash, then sort alphabetically.


Take a list of integers; keep the positive numbers, then take the final 3 elements, then bump each up by one.


Take a list of integers; get rid of anything that's not positive, then drop everything except the final three, then increment each item.


Take a list of integers; drop non-positive values, then give me the last three elements, then bump each up by one.


Take a list of integers; drop the negative numbers, then keep only the last three, then increment each item.


Take a list of integers; filter out the negative ones, then keep the final three items, then bump each up by one.


Take a list of integers; remove all negative values, then take the last three, then increment each item.


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


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


Take a list of integers; keep the positive numbers, then skip negatives at the start, then deduplicate the list.


Take a list of integers; get rid of anything that's not positive, then remove all negatives at the front, then remove repeats.


Take a list of integers; drop non-positive values, then remove the initial run of negative numbers, then deduplicate the list.


Take a list of integers; drop the negative numbers, then strip the front negatives, then remove repeats.


Take a list of integers; filter out the negative ones, then remove leading negative numbers, then deduplicate the list.


Take a list of integers; remove all negative values, then drop negatives from start, then remove repeats.


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


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


Take a list of integers; keep values greater than five, then cut the list at the first zero, then replace an empty list with one zero.


Take a list of integers; filter out values less than or equal to 5, then cut off after the first zero appears, then zero it out if it's empty.


Take a list of integers; keep only numbers above 5, then take values up to (excluding) the first zero, then use zero if the list is empty.


Take a list of integers; exclude values of 5 and below, then keep the part before the first 0, then default to zero when empty.


Take a list of integers; remove anything 5 or less, then truncate at the first zero, then if there's nothing, put in a zero.


Take a list of integers; filter to keep only values above 5, then delete everything starting with the first zero, then if no items, add a zero.


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


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


Take a list of people records (name, age); extract the names, then add '#' to the start of each string, then return the number of strings.


Take a list of people records (name, age); Give me the names, then make each one start with a hash, then count the strings.


Take a list of people records (name, age); pluck the name field from each record, then add '#' to the start of each string, then return how many strings remain.


Take a list of people records (name, age); Grab the names, then make each one start with a hash, then give me the total number of strings.


Take a list of people records (name, age); keep just each person's name, then add '#' to the start of each string, then tell me how many strings we have.


Take a list of people records (name, age); List the names, then make each one start with a hash, then what's the string count.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = ['#' + s for s in r]
    return len(r)


Take a list of people records (name, age); extract the names, then prefix each with a hash, then return how many strings remain.


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


Take a list of integers; extract negatives, then absolute value for all items, then drop the negative numbers.


Take a list of integers; keep the negative numbers, then take absolute values, then filter out the negative ones.


Take a list of integers; extract negatives, then turn negatives into positives, then remove all negative values.


Take a list of integers; keep the negative numbers, then abs each element, then keep positive values only.


Take a list of integers; extract negatives, then take the absolute value of each, then keep values above zero.


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 > 0]
    return r


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


Take a list of integers; keep values greater than five, then cut the list at the first zero, then raise each to the power of two.


Take a list of integers; filter out values less than or equal to 5, then cut off after the first zero appears, then I need each number multiplied by itself.


Take a list of integers; keep only numbers above 5, then take values up to (excluding) the first zero, then square all of them.


Take a list of integers; exclude values of 5 and below, then keep the part before the first 0, then multiply each element by itself.


Take a list of integers; remove anything 5 or less, then truncate at the first zero, then make each one squared.


Take a list of integers; filter to keep only values above 5, then delete everything starting with the first zero, then square each value in the list.


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


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


Take a list of integers; keep everything before the first zero, then default to [0] when there is nothing, then drop non-positive values.


Take a list of integers; take only what comes before the initial zero, then when the list is empty, substitute a zero value, then drop the negative numbers.


Take a list of integers; cut the list at the first zero, then replace an empty list with one zero, then filter out the negative ones.


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


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


Take a list of integers; keep the part before the first 0, then default to zero when empty, then keep values above zero.


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


Take a list of integers; keep everything before the first zero, then if empty, use a single zero, then keep the positive numbers.


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


Take a list of integers; if blank use 0, then don't let anything exceed 10, then remove repeats.


Take a list of integers; default to [0] when there is nothing, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; when the list is empty, substitute a zero value, then don't let anything exceed 10, then remove repeats.


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


Take a list of integers; zero it out if it's empty, then don't let anything exceed 10, then remove repeats.


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


Take a list of integers; if empty, use a single zero, then cap each value at 10, then drop duplicates keeping first occurrence.


Take a list of integers; cap each value at 10, then flip the list around, then true if every value is unique.


Take a list of integers; clip values at 10, then flip the order around, then check for duplicates in the values.


Take a list of integers; cap each value at 10, then put the elements backwards, then do all values appear only once.


Take a list of integers; clip values at 10, then reverse that for me, then check that there are no duplicates.


Take a list of integers; cap each value at 10, then flip it backwards, then are the values all unique.


Take a list of integers; clip values at 10, then make it backwards, then check if all values are unique.


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


Take a list of integers; cap each value at 10, then reverse the order, then return whether all values are distinct.


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


Take a list of integers; take out the first and last items, then plus one for all, then how many items remain.


Take a list of integers; remove both ends, then increment each value, then tell me the length.


Take a list of integers; trim the edges, then plus one for all, then return the length.


Take a list of integers; trim one element off each end, then increment each value, then count them.


Take a list of integers; cut off the first and last, then plus one for all, then what's the count.


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


Take a list of integers; drop the first and last elements, then add one to each, then return how many remain.


Take a list of integers; drop the first element, then flip the list around, then drop the odd numbers.


Take a list of integers; Take everything except the first, then flip the order around, then filter out the odd numbers.


Take a list of integers; drop the first element, then put the elements backwards, then drop the odd numbers.


Take a list of integers; Take everything except the first, then reverse that for me, then filter out the odd numbers.


Take a list of integers; drop the first element, then flip it backwards, then drop the odd numbers.


Take a list of integers; Take everything except the first, then make it backwards, then filter out the odd numbers.


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


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


Take a list of integers; subtract one from each, then keep only even values, then strip the signs.


Take a list of integers; Decrement all items, then extract all even numbers, then take abs of each.


Take a list of integers; decrement each value, then keep only even values, then get the absolute value of everything.


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


Take a list of integers; reduce each by one, then keep only even values, then make them all positive.


Take a list of integers; Subtract 1 from all, then extract all even numbers, then make every value non-negative.


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


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


Take a list of integers; cap each value at 10, then remove both ends, then raise each to the power of two.


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


Take a list of integers; cap each value at 10, then trim one element off each end, then square all of them.


Take a list of integers; clip values at 10, then cut off the first and last, then multiply each element by itself.


Take a list of integers; cap each value at 10, then remove the first and last elements, then make each one squared.


Take a list of integers; clip values at 10, then keep only the middle part, then square each value in the list.


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


Take a list of integers; cap each value at 10, then drop the first and last elements, then square each.


Take a list of people records (name, age); extract the names, then keep only non-empty strings, then find the longest one, defaulting to empty.


Take a list of people records (name, age); Give me the names, then filter empty strings, then Longest string, or nothing if there isn't one.


Take a list of people records (name, age); pluck the name field from each record, then remove empty strings from the list, then find the longest one, defaulting to empty.


Take a list of people records (name, age); Grab the names, then clean up empty strings, then Longest string, or nothing if there isn't one.


Take a list of people records (name, age); keep just each person's name, then delete empty entries, then find the longest one, defaulting to empty.


Take a list of people records (name, age); List the names, then drop empty strings, then Longest string, or nothing if there isn't one.


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


Take a list of people records (name, age); extract the names, then drop empty strings, then return the longest string (empty if none).


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


Take a list of integers; convert to absolute value, then unique values preserving order, then increment each item.


Take a list of integers; strip the signs, then remove repeated values, then bump each up by one.


Take a list of integers; take abs of each, then unique values preserving order, then increment each item.


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


Take a list of integers; apply absolute value to the whole list, then unique values preserving order, then increment each item.


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


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


Take a list of integers; take the absolute value of each, then take the final 3 elements, then true if every value is unique.


Take a list of integers; convert to absolute value, then drop everything except the final three, then check for duplicates in the values.


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


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


Take a list of integers; get the absolute value of everything, then keep the final three items, then are the values all unique.


Take a list of integers; apply absolute value to the whole list, then take the last three, then check if all values are unique.


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


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


Take a list of people records (name, age); sort records by age, youngest first, then pluck the age field from each record, then raise each to the power of two.


Take a list of people records (name, age); put the youngest at the top, then get the age field, then I need each number multiplied by itself.


Take a list of people records (name, age); sort records by age, youngest first, then keep just each person's age, then square all of them.


Take a list of people records (name, age); put the youngest at the top, then extract age values, then multiply each element by itself.


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then make each one squared.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then square each value in the list.


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


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


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


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


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


Take a list of strings; arrange alphabetically, then remove all strings under three characters in length, then total number of characters.


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


Take a list of strings; arrange alphabetically, then drop strings shorter than three characters, then add up the lengths.


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


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


Take a list of integers; square each, then sort smallest to largest, then true if at least one even value.


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


Take a list of integers; multiply each value by itself, then Sort this ascending, then true if at least one even value.


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


Take a list of integers; raise each to the power of two, then Arrange from smallest to largest, then true if at least one even value.


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


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


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


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


Take a list of integers; Sort it from low to high, then cut off after the first zero appears, then strip the zeros.


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


Take a list of integers; Organize these ascending, then keep the part before the first 0, then strip the zeros.


Take a list of integers; Sort in ascending order, then truncate at the first zero, then keep only non-zero numbers.


Take a list of integers; I need this sorted ascending, then delete everything starting with the first zero, then strip the zeros.


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


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


Take a list of integers; drop the first element, then keep only even values, then drop non-positive values.


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


Take a list of integers; drop the first element, then keep only even values, then filter out the negative ones.


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


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


Take a list of integers; Take everything except the first, then extract all even numbers, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = r[1:]
    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; drop the first element, then keep the even numbers, then keep the positive numbers.


Take a list of integers; pad with zeros to at least three elements, then increase every value by 10, then true if at least one even value.


Take a list of integers; add zeros until the list has at least three values, then add 10 to each item, then any even.


Take a list of integers; pad with zeros to at least three elements, then shift each up by ten, then true if at least one even value.


Take a list of integers; add zeros until the list has at least three values, then increase all numbers by 10, then any even.


Take a list of integers; pad with zeros to at least three elements, then add 10 to everything, then true if at least one even value.


Take a list of integers; add zeros until the list has at least three values, then give everything a boost of 10, then any even.


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


Take a list of integers; pad with zeros to at least three elements, then add ten to each, then return whether any value is even.


Take a list of strings; sort by length, shortest first, then convert each to upper case, then reduce each string to its first character.


Take a list of strings; sort ascending by length, then change all strings to uppercase, then take first char drop blanks.


Take a list of strings; order strings from shortest to longest, then make every string uppercase, then keep first letters only.


Take a list of strings; shortest to longest, then uppercase each one, then first letter from each item that isn't empty.


Take a list of strings; arrange by string length ascending, then make all the strings uppercase, then grab the first char from each.


Take a list of strings; length sort, then convert all strings to uppercase letters, then isolate the first character per entry.


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


Take a list of strings; sort by length, shortest first, then uppercase each string, then keep the first character of each (dropping empties).


Take a list of integers; negate each, then order by distance from zero, then raise each to the power of two.


Take a list of integers; reverse the signs of everything, then sort based on absolute value, then I need each number multiplied by itself.


Take a list of integers; negate each, then organize by magnitude, then square all of them.


Take a list of integers; reverse the signs of everything, then arrange by absolute value ascending, then multiply each element by itself.


Take a list of integers; negate each, then sort from smallest to largest absolute value, then make each one squared.


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


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


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


Take a list of integers; keep everything before the first zero, then keep values above zero, then give back the total.


Take a list of integers; take only what comes before the initial zero, then filter for positive numbers, then sum r.


Take a list of integers; cut the list at the first zero, then keep only positive numbers, then add them up.


Take a list of integers; cut off after the first zero appears, then keep the positives, then calculate the sum of all elements.


Take a list of integers; take values up to (excluding) the first zero, then remove negatives, then what's the total.


Take a list of integers; keep the part before the first 0, then keep the positive numbers, then what do they add up to.


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 > 0]
    return sum(r)


Take a list of integers; keep everything before the first zero, then keep the positive numbers, then return their sum.


Take a list of integers; take values while they are positive, then keep values above zero, then true only if all are positive.


Take a list of integers; take positive values then stop, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; keep going while positive, then keep only positive numbers, then check if every value is positive.


Take a list of integers; stop at first non positive, then keep the positives, then confirm all values are positive.


Take a list of integers; take while greater than zero, then remove negatives, then all positive.


Take a list of integers; take values while positive, then keep the positive numbers, then check if every number is above 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 if x > 0]
    return all(x > 0 for x in r)


Take a list of integers; take values while they are positive, then keep the positive numbers, then return whether all values are positive.


Take a list of integers; double each, then decrement each value, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then Lower each number by one, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; double each, then reduce each by one, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then Subtract 1 from all, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; double each, then Subtract one from each, then ensure at least three items by appending zeros.


Take a list of integers; times two for each item, then Drop each by one, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; double each, then subtract one from each, then pad with zeros to at least three elements.


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


Take a list of integers; take out the first and last items, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


Take a list of integers; trim one element off each end, then clamp each to at most ten, then give the earliest even value or zero.


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


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


Take a list of integers; drop the first and last elements, then cap each value at 10, then return the first even value (0 if none).


Take a list of integers; keep only the last three, then take the first 3 elements, then raise each to the power of two.


Take a list of integers; keep the final three items, then remove everything after the third, then I need each number multiplied by itself.


Take a list of integers; take the last three, then truncate to three items, then square all of them.


Take a list of integers; trim to the last three, then show the first three, then multiply each element by itself.


Take a list of integers; last three only, then take the first three, then make each one squared.


Take a list of integers; truncate to the last three items, then keep first 3, then square each value in the list.


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


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


Take a list of people records (name, age); extract the names, then take each string's first letter, then find the longest one, defaulting to empty.


Take a list of people records (name, age); Give me the names, then give me the first letter of everything, then Longest string, or nothing if there isn't one.


Take a list of people records (name, age); pluck the name field from each record, then reduce each string to its first character, then find the longest one, defaulting to empty.


Take a list of people records (name, age); Grab the names, then take first char drop blanks, then Longest string, or nothing if there isn't one.


Take a list of people records (name, age); keep just each person's name, then keep first letters only, then find the longest one, defaulting to empty.


Take a list of people records (name, age); List the names, then first letter from each item that isn't empty, then Longest string, or nothing if there isn't one.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = [s[0] for s in r if s]
    return max(r, key=len) if r else ''


Take a list of people records (name, age); extract the names, then keep the first character of each (dropping empties), then return the longest string (empty if none).


Take a list of integers; keep values greater than five, then clamp each to at most ten, then trim one element off each end.


Take a list of integers; filter out values less than or equal to 5, then don't let anything exceed 10, then cut off the first and last.


Take a list of integers; keep only numbers above 5, then clamp each to at most ten, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then don't let anything exceed 10, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then clamp each to at most ten, then drop first and last.


Take a list of integers; filter to keep only values above 5, then don't let anything exceed 10, then eliminate the outermost elements.


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


Take a list of integers; keep values greater than five, then cap each value at 10, then drop the first and last elements.


Take a list of integers; take values while they are positive, then flip the list around, then make each twice as big.


Take a list of integers; take positive values then stop, then flip the order around, then multiply each by 2.


Take a list of integers; keep going while positive, then put the elements backwards, then make each twice as big.


Take a list of integers; stop at first non positive, then reverse that for me, then multiply each by 2.


Take a list of integers; take while greater than zero, then flip it backwards, then make each twice as big.


Take a list of integers; take values while positive, then make it backwards, then multiply each by 2.


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


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


Take a list of integers; keep multiples of three, then multiply each value by itself, then drop non-negative values.


Take a list of integers; get rid of non-multiples of three, then square them all, then drop all positive numbers.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then drop non-negative values.


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


Take a list of integers; drop anything not divisible by three, then square all of them, then drop non-negative values.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then drop all positive numbers.


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


Take a list of integers; keep multiples of three, then square each, then keep the negative numbers.


Take a list of integers; if empty, use a single zero, then skip negatives at the start, then find the max, defaulting to 0.


Take a list of integers; if blank use 0, then remove all negatives at the front, then Give me the maximum, but 0 if there are no items.


Take a list of integers; default to [0] when there is nothing, then remove the initial run of negative numbers, then What's the highest number in the list.


Take a list of integers; when the list is empty, substitute a zero value, then strip the front negatives, then Return the greatest value or default to 0.


Take a list of integers; replace an empty list with one zero, then remove leading negative numbers, then Find the largest element, defaulting to zero.


Take a list of integers; zero it out if it's empty, then drop negatives from start, then give the largest value (0 if none).


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


Take a list of integers; if empty, use a single zero, then drop the leading negative values, then return the maximum (0 if empty).


Take a list of integers; drop duplicates keeping first occurrence, then order by distance from zero, then arrange in decreasing order.


Take a list of integers; drop duplicates but keep the first one, then sort based on absolute value, then arrange in descending order.


Take a list of integers; drop duplicates keeping first occurrence, then organize by magnitude, then reverse sort.


Take a list of integers; drop duplicates but keep the first one, then arrange by absolute value ascending, then sort largest to smallest.


Take a list of integers; drop duplicates keeping first occurrence, then sort from smallest to largest absolute value, then sort by descending values.


Take a list of integers; drop duplicates but keep the first one, then sort by absolute value, then sort from highest to lowest.


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


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


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


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


Take a list of integers; drop the first element, then keep only odd values, then use zero if the list is empty.


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


Take a list of integers; drop the first element, then keep only odd values, then if there's nothing, put in a zero.


Take a list of integers; Take everything except the first, then eliminate the even numbers, then if no items, add a zero.


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


Take a list of integers; drop the first element, then keep the odd numbers, then if empty, use a single zero.


Take a list of integers; negate each, then default to [0] when there is nothing, then true if any value equals zero.


Take a list of integers; reverse the signs of everything, then when the list is empty, substitute a zero value, then check for zero.


Take a list of integers; negate each, then replace an empty list with one zero, then true if any value equals zero.


Take a list of integers; reverse the signs of everything, then zero it out if it's empty, then check for zero.


Take a list of integers; negate each, then use zero if the list is empty, then true if any value equals zero.


Take a list of integers; reverse the signs of everything, then default to zero when empty, then check for zero.


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


Take a list of integers; negate each, then if empty, use a single zero, then return whether the list contains a zero.


Take a list of integers; keep the odd numbers, then take the first 3 elements, then count the elements.


Take a list of integers; odd numbers only, then remove everything after the third, then how many items remain.


Take a list of integers; keep the odd numbers, then truncate to three items, then tell me the length.


Take a list of integers; odd numbers only, then show the first three, then return the length.


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


Take a list of integers; odd numbers only, then keep first 3, then what's the count.


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


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


Take a list of people records (name, age); extract the ages, then sort smallest to largest, then truncate to the last three items.


Take a list of people records (name, age); show me all ages, then Ascending sort, then show only the last three.


Take a list of people records (name, age); pluck the age field from each record, then Sort this ascending, then remove all but the last three.


Take a list of people records (name, age); get the age field, then Sort lowest to highest, then take the final 3 elements.


Take a list of people records (name, age); keep just each person's age, then Arrange from smallest to largest, then drop everything except the final three.


Take a list of people records (name, age); extract age values, then sort ascending, then give me the last three elements.


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


Take a list of people records (name, age); extract the ages, then sort ascending, then keep only the last three.


Take a list of integers; square each, then remove repeated values, then take values up to (excluding) the first zero.


Take a list of integers; each value squared, then unique values preserving order, then keep the part before the first 0.


Take a list of integers; multiply each value by itself, then remove repeated values, then truncate at the first zero.


Take a list of integers; square them all, then unique values preserving order, then delete everything starting with the first zero.


Take a list of integers; raise each to the power of two, then remove repeated values, then remove from the first zero onwards.


Take a list of integers; I need each number multiplied by itself, then unique values preserving order, then up to but not including the first zero.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then remove everything after the third, then Discard the first element.


Take a list of integers; pad with zeros to at least three elements, then truncate to three items, then skip the first one.


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


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


Take a list of integers; add zeros until the list has at least three values, then keep first 3, then Discard the first element.


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


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


Take a list of integers; if empty, use a single zero, then order by distance from zero, then drop the even numbers.


Take a list of integers; if blank use 0, then sort based on absolute value, then strip out the evens.


Take a list of integers; default to [0] when there is nothing, then organize by magnitude, then drop the even numbers.


Take a list of integers; when the list is empty, substitute a zero value, then arrange by absolute value ascending, then strip out the evens.


Take a list of integers; replace an empty list with one zero, then sort from smallest to largest absolute value, then drop the even numbers.


Take a list of integers; zero it out if it's empty, then sort by absolute value, then strip out the evens.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then cut off after the first zero appears, then product of the list.


Take a list of integers; pad with zeros to at least three elements, then take values up to (excluding) the first zero, then what's the product.


Take a list of integers; add zeros until the list has at least three values, then keep the part before the first 0, then what do they multiply to.


Take a list of integers; pad with zeros to at least three elements, then truncate at the first zero, then give me their product.


Take a list of integers; add zeros until the list has at least three values, then delete everything starting with the first zero, then multiply them all together.


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


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