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


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


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


Take a list of integers; put the elements backwards, then truncate at the first zero.


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


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


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


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


Take a list of integers; convert to absolute value, then sort based on absolute value.


Take a list of integers; strip the signs, then organize by magnitude.


Take a list of integers; take abs of each, then arrange by absolute value ascending.


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


Take a list of integers; apply absolute value to the whole list, then sort by absolute value.


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


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


Take a list of integers; subtract one from each, then give the smallest value (0 if none).


Take a list of integers; Decrement all items, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; decrement each value, then find the min, defaulting to 0.


Take a list of integers; Lower each number by one, then minimum value, zero otherwise.


Take a list of integers; reduce each by one, then get the minimum value or zero if empty.


Take a list of integers; Subtract 1 from all, then give me the min or 0.


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


Take a list of integers; subtract one from each, then return the minimum (0 if empty).


Take a list of integers; take values while they are positive, then sort smallest to largest.


Take a list of integers; take positive values then stop, then Ascending sort.


Take a list of integers; keep going while positive, then Sort this ascending.


Take a list of integers; stop at first non positive, then Sort lowest to highest.


Take a list of integers; take while greater than zero, then Arrange from smallest to largest.


Take a list of integers; take values while positive, then sort ascending.


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


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


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


Take a list of integers; make each one bigger, then filter for positive numbers.


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


Take a list of integers; make each one bigger, then keep the positives.


Take a list of integers; add one to each, then remove negatives.


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


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


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


Take a list of integers; add one to each, then make every value non-negative.


Take a list of integers; make each one bigger, then absolute value for all items.


Take a list of integers; add one to each, then take absolute values.


Take a list of integers; make each one bigger, then turn negatives into positives.


Take a list of integers; add one to each, then abs each element.


Take a list of integers; make each one bigger, then take the absolute value of each.


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


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


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


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


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


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


Take a list of integers; negate each, then keep values below zero.


Take a list of integers; reverse the signs of everything, then get the negative numbers.


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


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


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


Take a list of integers; each value squared, then remove all negatives at the front.


Take a list of integers; multiply each value by itself, then remove the initial run of negative numbers.


Take a list of integers; square them all, then strip the front negatives.


Take a list of integers; raise each to the power of two, then remove leading negative numbers.


Take a list of integers; I need each number multiplied by itself, then drop negatives from start.


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


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


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


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


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


Take a list of integers; extract negatives, then turn negatives into positives.


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep everything before the first zero, then remove both ends.


Take a list of integers; take only what comes before the initial zero, then trim the edges.


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


Take a list of integers; cut off after the first zero appears, then cut off the first and last.


Take a list of integers; take values up to (excluding) the first zero, then remove the first and last elements.


Take a list of integers; keep the part before the first 0, then keep only the middle part.


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


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


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


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


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


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


Take a list of integers; subtract one from each, then check if values are in increasing order.


Take a list of integers; Decrement all items, then give me a yes or no if the list is sorted.


Take a list of integers; decrement each value, then is this list sorted.


Take a list of integers; Lower each number by one, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; reduce each by one, then tell me if it's sorted ascending.


Take a list of integers; Subtract 1 from all, then return whether the list is sorted ascending.


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


Take a list of integers; subtract one from each, then return whether the list is sorted ascending.


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the positive numbers, then increase every value by 10.


Take a list of integers; get rid of anything that's not positive, then add 10 to each item.


Take a list of integers; drop non-positive values, then shift each up by ten.


Take a list of integers; drop the negative numbers, then increase all numbers by 10.


Take a list of integers; filter out the negative ones, then add 10 to everything.


Take a list of integers; remove all negative values, then give everything a boost of 10.


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


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


Take a list of integers; keep the positive numbers, then keep values below zero.


Take a list of integers; get rid of anything that's not positive, then get the negative numbers.


Take a list of integers; drop non-positive values, then keep values below zero.


Take a list of integers; drop the negative numbers, then get the negative numbers.


Take a list of integers; filter out the negative ones, then keep values below zero.


Take a list of integers; remove all negative values, then get the negative numbers.


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


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


Take a list of integers; drop the first element, then decrement each value.


Take a list of integers; Take everything except the first, then Lower each number by one.


Take a list of integers; drop the first element, then reduce each by one.


Take a list of integers; Take everything except the first, then Subtract 1 from all.


Take a list of integers; drop the first element, then Subtract one from each.


Take a list of integers; Take everything except the first, then Drop each by one.


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


Take a list of integers; drop the first element, then subtract one from each.


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


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


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


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


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


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


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


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


Take a list of integers; negate each, then remove the first item.


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


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


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


Take a list of integers; cap each value at 10, then sort smallest to largest.


Take a list of integers; clip values at 10, then Ascending sort.


Take a list of integers; cap each value at 10, then Sort this ascending.


Take a list of integers; clip values at 10, then Sort lowest to highest.


Take a list of integers; cap each value at 10, then Arrange from smallest to largest.


Take a list of integers; clip values at 10, then sort ascending.


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


Take a list of integers; cap each value at 10, then sort ascending.


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


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


Take a list of integers; take the first 3 elements, then increment each value.


Take a list of integers; remove everything after the third, then plus one for all.


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


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


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


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


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


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


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


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


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


Take a list of integers; sort by distance from zero, then get the negative numbers.


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


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


Take a list of integers; drop the zeros, then flip the sign of each.


Take a list of integers; keep only nonzero elements, then turn positives to negatives and vice versa.


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


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


Take a list of integers; sort descending, then multiply each by two.


Take a list of integers; sort largest first, then double each item in the list.


Take a list of integers; sort in descending order, then multiply each by two.


Take a list of integers; sort from greatest to least, then double each item in the list.


Take a list of integers; sort z to a, then multiply each by two.


Take a list of integers; arrange in decreasing order, then double each item in the list.


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


Take a list of integers; sort descending, then double each.


Take a list of integers; negate each, then remove both ends.


Take a list of integers; reverse the signs of everything, then trim the edges.


Take a list of integers; negate each, then trim one element off each end.


Take a list of integers; reverse the signs of everything, then cut off the first and last.


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


Take a list of integers; reverse the signs of everything, then keep only the middle part.


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


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


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


Take a list of integers; convert to absolute value, then Ascending sort.


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


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


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


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


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


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


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


Take a list of integers; each value squared, then remove everything after the third.


Take a list of integers; multiply each value by itself, then truncate to three items.


Take a list of integers; square them all, then show the first three.


Take a list of integers; raise each to the power of two, then take the first three.


Take a list of integers; I need each number multiplied by itself, then keep first 3.


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


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


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


Take a list of integers; keep evens, then remove all negatives at the front.


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


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


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


Take a list of integers; keep evens, then drop negatives from start.


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)):]
    return r


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


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


Take a list of integers; filter out values less than or equal to 5, then sort based on absolute value.


Take a list of integers; keep only numbers above 5, then organize by magnitude.


Take a list of integers; exclude values of 5 and below, then arrange by absolute value ascending.


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


Take a list of integers; filter to keep only values above 5, then sort by absolute value.


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


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


Take a list of integers; add one to each, then drop anything 5 or below.


Take a list of integers; make each one bigger, then keep only numbers greater than 5.


Take a list of integers; add one to each, then filter for numbers above 5.


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


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


Take a list of integers; make each one bigger, then keep values greater than five.


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


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


Take a list of strings; trim whitespace from each, then give the maximum string length.


Take a list of strings; strip whitespace from every element, then max length of all strings.


Take a list of strings; remove surrounding whitespace, then what's the max string length.


Take a list of strings; trim the whitespace off everything, then return the length of the longest string (0 if none).


Take a list of strings; strip spaces from all strings, then how long is the longest string.


Take a list of strings; strip all the strings, then find the longest string length.


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


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


Take a list of integers; negate each, then check if there is an even number.


Take a list of integers; reverse the signs of everything, then find out whether any value is divisible by 2.


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


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


Take a list of people records (name, age); sort records by age, youngest first, then find who is oldest and give their name.


Take a list of people records (name, age); put the youngest at the top, then return oldest person name.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=lambda d: d['age'])
    return max(r, key=lambda d: d['age'])['name'] if r else ''


Take a list of people records (name, age); sort records by age, youngest first, then return the name of the oldest person (empty if none).


Take a list of integers; keep the positive numbers, then check if values are in increasing order.


Take a list of integers; get rid of anything that's not positive, then give me a yes or no if the list is sorted.


Take a list of integers; drop non-positive values, then is this list sorted.


Take a list of integers; drop the negative numbers, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; filter out the negative ones, then tell me if it's sorted ascending.


Take a list of integers; remove all negative values, then return whether the list is sorted ascending.


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


Take a list of integers; keep the positive numbers, then return whether the list is sorted ascending.


Take a list of integers; sort ascending, then drop anything 5 or below.


Take a list of integers; Sort it from low to high, then keep only numbers greater than 5.


Take a list of integers; arrange in increasing order, then filter for numbers above 5.


Take a list of integers; Organize these ascending, then give me values where x is greater than 5.


Take a list of integers; Sort in ascending order, then show me only the values that are bigger than five.


Take a list of integers; I need this sorted ascending, then keep values greater than five.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; take while greater than zero, then add 10 to everything.


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


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 r


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


Take a list of integers; square each, then find the first even number, defaulting to 0.


Take a list of integers; each value squared, then first even value zero if not found.


Take a list of integers; multiply each value by itself, then find the first even number, defaulting to 0.


Take a list of integers; square them all, then first even value zero if not found.


Take a list of integers; raise each to the power of two, then find the first even number, defaulting to 0.


Take a list of integers; I need each number multiplied by itself, then first even value zero if not found.


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


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


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


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


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


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


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


Take a list of integers; take values while positive, then keep values greater than five.


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


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


Take a list of integers; if empty, use a single zero, then check if zero appears.


Take a list of integers; if blank use 0, then find out whether there's a zero in here.


Take a list of integers; default to [0] when there is nothing, then check if zero appears.


Take a list of integers; when the list is empty, substitute a zero value, then find out whether there's a zero in here.


Take a list of integers; replace an empty list with one zero, then check if zero appears.


Take a list of integers; zero it out if it's empty, then find out whether there's a zero in here.


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


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


Take a list of strings; uppercase each string, then keep only strings of length 3 or more.


Take a list of strings; make it all caps, then get rid of short ones.


Take a list of strings; convert each to upper case, then remove strings with less than three characters.


Take a list of strings; change all strings to uppercase, then remove all strings under three characters in length.


Take a list of strings; make every string uppercase, then filter out short strings under three chars.


Take a list of strings; uppercase each one, then drop strings shorter than three characters.


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


Take a list of strings; uppercase each string, then drop strings shorter than three characters.


Take a list of integers; take the absolute value of each, then give the largest value (0 if none).


Take a list of integers; convert to absolute value, then The biggest one, or 0 if it's empty.


Take a list of integers; strip the signs, then Get the maximum value, or zero if there's nothing.


Take a list of integers; take abs of each, then What's the max here.


Take a list of integers; get the absolute value of everything, then Return the max or 0 if empty.


Take a list of integers; apply absolute value to the whole list, then return the maximum (0 if empty).


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


Take a list of integers; take the absolute value of each, then return the maximum (0 if empty).


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


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


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


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


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


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


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


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


Take a list of integers; keep the even numbers, then flip the sign of each.


Take a list of integers; keep evens, then turn positives to negatives and vice versa.


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


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


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


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


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


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


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


Take a list of integers; extract negatives, then Drop each by one.


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


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


Take a list of integers; keep only the last three, then flip the list around.


Take a list of integers; keep the final three items, then flip the order around.


Take a list of integers; take the last three, then put the elements backwards.


Take a list of integers; trim to the last three, then reverse that for me.


Take a list of integers; last three only, then flip it backwards.


Take a list of integers; truncate to the last three items, then make it backwards.


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


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


Take a list of integers; cap each value at 10, then check if zero appears.


Take a list of integers; clip values at 10, then find out whether there's a zero in here.


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


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


Take a list of integers; square each, then flip the list around.


Take a list of integers; each value squared, then flip the order around.


Take a list of integers; multiply each value by itself, then put the elements backwards.


Take a list of integers; square them all, then reverse that for me.


Take a list of integers; raise each to the power of two, then flip it backwards.


Take a list of integers; I need each number multiplied by itself, then make it backwards.


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


Take a list of integers; square each, then reverse the order.


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


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


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


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


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


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


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


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


Take a list of integers; square each, then remove repeated values.


Take a list of integers; each value squared, then unique values preserving order.


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


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


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


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


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


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


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


Take a list of integers; extract negatives, then exclude zeros.


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


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


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


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


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


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


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


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


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


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


Take a list of strings; prefix each with a hash, then keep only non-empty strings.


Take a list of strings; add # to the start of each string, then filter empty strings.


Take a list of strings; prefix each with a hash, then remove empty strings from the list.


Take a list of strings; add # to the start of each string, then clean up empty strings.


Take a list of strings; prefix each with a hash, then delete empty entries.


Take a list of strings; add # to the start of each string, then drop empty strings.


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


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


Take a list of integers; take the absolute value of each, then remove the first item.


Take a list of integers; convert to absolute value, then Remove head.


Take a list of integers; strip the signs, then remove the first item.


Take a list of integers; take abs of each, then Remove head.


Take a list of integers; get the absolute value of everything, then remove the first item.


Take a list of integers; apply absolute value to the whole list, then Remove head.


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


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


Take a list of strings; prefix each with a hash, then give the maximum string length.


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


Take a list of strings; prefix each with a hash, then what's the max string length.


Take a list of strings; add # to the start of each string, then return the length of the longest string (0 if none).


Take a list of strings; prefix each with a hash, then how long is the longest string.


Take a list of strings; add # to the start of each string, then find the longest string length.


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


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


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


Take a list of integers; keep evens, then Ascending sort.


Take a list of integers; keep the even numbers, then Sort this ascending.


Take a list of integers; keep evens, then Sort lowest to highest.


Take a list of integers; keep the even numbers, then Arrange from smallest to largest.


Take a list of integers; keep evens, then sort ascending.


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


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


Take a list of integers; double each, then take the final 3 elements.


Take a list of integers; times two for each item, then drop everything except the final three.


Take a list of integers; double each, then give me the last three elements.


Take a list of integers; times two for each item, then keep only the last three.


Take a list of integers; double each, then keep the final three items.


Take a list of integers; times two for each item, then take the last three.


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


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


Take a list of integers; negate each, then check that there are no duplicates.


Take a list of integers; reverse the signs of everything, then are the values all unique.


Take a list of integers; negate each, then check if all values are unique.


Take a list of integers; reverse the signs of everything, then return whether all values are distinct.


Take a list of integers; negate each, then tell me if values are distinct.


Take a list of integers; reverse the signs of everything, then are all values distinct.


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


Take a list of integers; negate each, then return whether all values are distinct.


Take a list of integers; negate each, then check if every number is above zero.


Take a list of integers; reverse the signs of everything, then verify that all values exceed zero.


Take a list of integers; negate each, then are all values positive.


Take a list of integers; reverse the signs of everything, then are they all above zero.


Take a list of integers; negate each, then tell me if all numbers are greater than zero.


Take a list of integers; reverse the signs of everything, then return whether all values are positive.


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


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


Take a list of strings; drop duplicate strings keeping the first, then check for an empty string.


Take a list of strings; dedupe, then are there empty strings.


Take a list of strings; remove duplicate strings keep first, then is any string empty.


Take a list of strings; remove repeating strings first one stays, then any blanks.


Take a list of strings; delete duplicate strings keep the first one, then do any of the strings have no characters.


Take a list of strings; deduplicate the strings, then return whether any string is empty.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    return any(s == '' for s in r)


Take a list of strings; drop duplicate strings keeping the first, then return whether any string is empty.


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


Take a list of strings; make it all caps, then are there empty strings.


Take a list of strings; convert each to upper case, then is any string empty.


Take a list of strings; change all strings to uppercase, then any blanks.


Take a list of strings; make every string uppercase, then do any of the strings have no characters.


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


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


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


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


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


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


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


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


Take a list of integers; take values while positive, then drop negatives from start.


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 r


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


Take a list of integers; keep multiples of three, then check if values are in increasing order.


Take a list of integers; get rid of non-multiples of three, then give me a yes or no if the list is sorted.


Take a list of integers; keep values divisible by 3, then is this list sorted.


Take a list of integers; keep items where x mod 3 equals zero, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; drop anything not divisible by three, then tell me if it's sorted ascending.


Take a list of integers; filter out everything except multiples of three, then return whether the list is sorted ascending.


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


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


Take a list of integers; keep the odd numbers, then check if there is an even number.


Take a list of integers; odd numbers only, then find out whether any value is divisible by 2.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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 r


Take a list of integers; pad with zeros to at least three elements, then add ten to each.


Take a list of integers; add one to each, then give the smallest value (0 if none).


Take a list of integers; make each one bigger, then what's the smallest element, or 0 if there's nothing.


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


Take a list of integers; make each one bigger, then minimum value, zero otherwise.


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


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


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


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


Take a list of integers; take values while they are positive, then multiply them all together.


Take a list of integers; take positive values then stop, then multiply them all.


Take a list of integers; keep going while positive, then multiply all the numbers together.


Take a list of integers; stop at first non positive, then get the product.


Take a list of integers; take while greater than zero, then find the product of these.


Take a list of integers; take values while positive, then return their product.


def solve(xs):
    r = list(xs)
    r = r[:next((i for i, x in enumerate(r) if x <= 0), len(r))]
    return __import__('math').prod(r)


Take a list of integers; take values while they are positive, then return their product.


Take a list of integers; negate each, then remove repeated values.


Take a list of integers; reverse the signs of everything, then unique values preserving order.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values above zero.


Take a list of integers; add zeros until the list has at least three values, then filter for positive numbers.


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


Take a list of integers; add zeros until the list has at least three values, then keep the positives.


Take a list of integers; pad with zeros to at least three elements, then remove negatives.


Take a list of integers; add zeros until the list has at least three values, then keep the positive numbers.


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


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


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


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


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


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


Take a list of integers; last three only, then clamp each to at most ten.


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


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


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


Take a list of strings; uppercase each string, then count the strings.


Take a list of strings; make it all caps, then return how many strings remain.


Take a list of strings; convert each to upper case, then give me the total number of strings.


Take a list of strings; change all strings to uppercase, then tell me how many strings we have.


Take a list of strings; make every string uppercase, then what's the string count.


Take a list of strings; uppercase each one, then count the remaining strings.


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


Take a list of strings; uppercase each string, then return how many strings remain.


Take a list of integers; sort ascending, then keep only odd values.


Take a list of integers; Sort it from low to high, then eliminate the even numbers.


Take a list of integers; arrange in increasing order, then keep only odd values.


Take a list of integers; Organize these ascending, then eliminate the even numbers.


Take a list of integers; Sort in ascending order, then keep only odd values.


Take a list of integers; I need this sorted ascending, then eliminate the even numbers.


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


Take a list of integers; sort ascending, then keep the odd numbers.


Take a list of integers; sort ascending, then give the largest value (0 if none).


Take a list of integers; Sort it from low to high, then The biggest one, or 0 if it's empty.


Take a list of integers; arrange in increasing order, then Get the maximum value, or zero if there's nothing.


Take a list of integers; Organize these ascending, then What's the max here.


Take a list of integers; Sort in ascending order, then Return the max or 0 if empty.


Take a list of integers; I need this sorted ascending, then return the maximum (0 if empty).


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


Take a list of integers; sort ascending, then return the maximum (0 if empty).


Take a list of integers; keep the even numbers, then extend to length 3 using zeros.


Take a list of integers; keep evens, then pad to 3.


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


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


Take a list of people records (name, age); extract the names, then count the strings.


Take a list of people records (name, age); Give me the names, then return how many strings remain.


Take a list of people records (name, age); pluck the name field from each record, then give me the total number of strings.


Take a list of people records (name, age); Grab the names, then tell me how many strings we have.


Take a list of people records (name, age); keep just each person's name, then what's the string count.


Take a list of people records (name, age); List the names, then count the remaining strings.


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


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


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


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


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


Take a list of integers; add 10 to each item, then unique values preserving order.


Take a list of integers; shift each up by ten, then remove repeated values.


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


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


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


Take a list of strings; keep the first character of each (dropping empties), then give back the lengthiest string.


Take a list of strings; extract initial letters, then Longest string please.


Take a list of strings; take each string's first letter, then give back the lengthiest string.


Take a list of strings; give me the first letter of everything, then Longest string please.


Take a list of strings; reduce each string to its first character, then give back the lengthiest string.


Take a list of strings; take first char drop blanks, then Longest string please.


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


Take a list of strings; keep the first character of each (dropping empties), then return the longest string (empty if none).


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


Take a list of integers; get rid of anything that's not positive, then sort based on absolute value.


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


Take a list of integers; drop the negative numbers, then arrange by absolute value ascending.


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


Take a list of integers; remove all negative values, then sort by absolute value.


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


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


Take a list of integers; if empty, use a single zero, then increment each value.


Take a list of integers; if blank use 0, then plus one for all.


Take a list of integers; default to [0] when there is nothing, then increment each value.


Take a list of integers; when the list is empty, substitute a zero value, then plus one for all.


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


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


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


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


Take a list of people records (name, age); extract the names, then convert each to lower case.


Take a list of people records (name, age); Give me the names, then lowercase each one.


Take a list of people records (name, age); pluck the name field from each record, then convert each to lower case.


Take a list of people records (name, age); Grab the names, then lowercase each one.


Take a list of people records (name, age); keep just each person's name, then convert each to lower case.


Take a list of people records (name, age); List the names, then lowercase each one.


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


Take a list of people records (name, age); extract the names, then lowercase each string.


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


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


Take a list of integers; arrange by magnitude ignoring sign, then take positive values then stop.


Take a list of integers; put them in order by magnitude, then keep going while positive.


Take a list of integers; arrange in order of absolute value, then stop at first non positive.


Take a list of integers; sort by distance from zero, then take while greater than zero.


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


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


Take a list of integers; if empty, use a single zero, then check if values are in increasing order.


Take a list of integers; if blank use 0, then give me a yes or no if the list is sorted.


Take a list of integers; default to [0] when there is nothing, then is this list sorted.


Take a list of integers; when the list is empty, substitute a zero value, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; replace an empty list with one zero, then tell me if it's sorted ascending.


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


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


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


Take a list of integers; reverse the order, then check if there is an even number.


Take a list of integers; reverse, then find out whether any value is divisible by 2.


Take a list of integers; flip the list around, then check if there is an even number.


Take a list of integers; flip the order around, then find out whether any value is divisible by 2.


Take a list of integers; put the elements backwards, then check if there is an even number.


Take a list of integers; reverse that for me, then find out whether any value is divisible by 2.


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


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


Take a list of integers; keep only the first three, then return the length.


Take a list of integers; keep the first 3 items, then count them.


Take a list of integers; take the first 3 elements, then what's the count.


Take a list of integers; remove everything after the third, then return how many remain.


Take a list of integers; truncate to three items, then what's left.


Take a list of integers; show the first three, then how many are left.


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


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


Take a list of integers; drop the first and last elements, then default to [0] when there is nothing.


Take a list of integers; take out the first and last items, then when the list is empty, substitute a zero value.


Take a list of integers; remove both ends, then replace an empty list with one zero.


Take a list of integers; trim the edges, then zero it out if it's empty.


Take a list of integers; trim one element off each end, then use zero if the list is empty.


Take a list of integers; cut off the first and last, then default to zero when empty.


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


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


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


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


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


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


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


Take a list of integers; extract negatives, then delete everything starting with the first 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
    return r


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


Take a list of integers; keep the positive numbers, then check that there are no duplicates.


Take a list of integers; get rid of anything that's not positive, then are the values all unique.


Take a list of integers; drop non-positive values, then check if all values are unique.


Take a list of integers; drop the negative numbers, then return whether all values are distinct.


Take a list of integers; filter out the negative ones, then tell me if values are distinct.


Take a list of integers; remove all negative values, then are all values distinct.


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


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


Take a list of integers; subtract one from each, then check if there is an even number.


Take a list of integers; Decrement all items, then find out whether any value is divisible by 2.


Take a list of integers; decrement each value, then check if there is an even number.


Take a list of integers; Lower each number by one, then find out whether any value is divisible by 2.


Take a list of integers; reduce each by one, then check if there is an even number.


Take a list of integers; Subtract 1 from all, then find out whether any value is divisible by 2.


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


Take a list of integers; subtract one from each, then return whether any value is even.


Take a list of integers; drop the first and last elements, then keep values below zero.


Take a list of integers; take out the first and last items, then get the negative numbers.


Take a list of integers; remove both ends, then keep values below zero.


Take a list of integers; trim the edges, then get the negative numbers.


Take a list of integers; trim one element off each end, then keep values below zero.


Take a list of integers; cut off the first and last, then get the negative numbers.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then add them all up.


Take a list of integers; drop duplicates but keep the first one, then add all those together.


Take a list of integers; drop duplicates keeping first occurrence, then give back the total.


Take a list of integers; drop duplicates but keep the first one, then sum r.


Take a list of integers; drop duplicates keeping first occurrence, then add them up.


Take a list of integers; drop duplicates but keep the first one, then calculate the sum of all elements.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    return sum(r)


Take a list of integers; drop duplicates keeping first occurrence, then return their sum.


Take a list of integers; keep only the last three, then make every value non-negative.


Take a list of integers; keep the final three items, then absolute value for all items.


Take a list of integers; take the last three, then take absolute values.


Take a list of integers; trim to the last three, then turn negatives into positives.


Take a list of integers; last three only, then abs each element.


Take a list of integers; truncate to the last three items, then take the absolute value of each.


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


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


Take a list of integers; keep values greater than five, then keep values above zero.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers.


Take a list of integers; keep only numbers above 5, then keep only positive numbers.


Take a list of integers; exclude values of 5 and below, then keep the positives.


Take a list of integers; remove anything 5 or less, then remove negatives.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the zeros, then return the length.


Take a list of integers; keep only nonzero elements, then count them.


Take a list of integers; drop the zeros, then what's the count.


Take a list of integers; keep only nonzero elements, then return how many remain.


Take a list of integers; drop the zeros, then what's left.


Take a list of integers; keep only nonzero elements, then how many are left.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep only the first three, then increase every value by 10.


Take a list of integers; keep the first 3 items, then add 10 to each item.


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


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


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


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


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


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


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


Take a list of integers; keep the first 3 items, then drop everything except the final three.


Take a list of integers; take the first 3 elements, then give me the last three elements.


Take a list of integers; remove everything after the third, then keep only the last three.


Take a list of integers; truncate to three items, then keep the final three items.


Take a list of integers; show the first three, then take the last three.


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


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


Take a list of integers; drop the leading negative values, then flip the sign of each.


Take a list of integers; cut the leading negatives, then turn positives to negatives and vice versa.


Take a list of integers; skip negatives at the start, then flip the sign of each.


Take a list of integers; remove all negatives at the front, then turn positives to negatives and vice versa.


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


Take a list of integers; strip the front negatives, then turn positives to negatives and vice versa.


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


Take a list of integers; drop the leading negative values, then negate each.


Take a list of integers; pad with zeros to at least three elements, then keep values divisible by 3.


Take a list of integers; add zeros until the list has at least three values, then keep items where x mod 3 equals zero.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then multiples of three only.


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; add one to each, then organize by magnitude.


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


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


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


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


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


Take a list of strings; prefix each with a hash, then count the strings.


Take a list of strings; add # to the start of each string, then return how many strings remain.


Take a list of strings; prefix each with a hash, then give me the total number of strings.


Take a list of strings; add # to the start of each string, then tell me how many strings we have.


Take a list of strings; prefix each with a hash, then what's the string count.


Take a list of strings; add # to the start of each string, then count the remaining strings.


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


Take a list of strings; prefix each with a hash, then return how many strings remain.


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


Take a list of integers; take only what comes before the initial zero, then sort by descending values.


Take a list of integers; cut the list at the first zero, then sort from highest to lowest.


Take a list of integers; cut off after the first zero appears, then sort descending.


Take a list of integers; take values up to (excluding) the first zero, then sort largest first.


Take a list of integers; keep the part before the first 0, then sort in descending order.


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


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then remove the first item.


Take a list of people records (name, age); show me all ages, then Remove head.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item.


Take a list of people records (name, age); get the age field, then Remove head.


Take a list of people records (name, age); keep just each person's age, then remove the first item.


Take a list of people records (name, age); extract age values, then Remove head.


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


Take a list of people records (name, age); extract the ages, then drop the first element.


Take a list of integers; sort by absolute value, then flip the list around.


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


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards.


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


Take a list of integers; arrange in order of absolute value, then flip it backwards.


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


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


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


Take a list of people records (name, age); extract the names, then remove repeated strings.


Take a list of people records (name, age); Give me the names, then keep unique strings first appearance.


Take a list of people records (name, age); pluck the name field from each record, then eliminate repeated strings preserve first occurrence.


Take a list of people records (name, age); Grab the names, then drop duplicate strings keeping the first.


Take a list of people records (name, age); keep just each person's name, then dedupe.


Take a list of people records (name, age); List the names, then remove duplicate strings keep first.


def solve(xs):
    r = list(xs)
    r = [d['name'] for d in r]
    r = list(dict.fromkeys(r))
    return r


Take a list of people records (name, age); extract the names, then drop duplicate strings keeping the first.


Take a list of integers; sort ascending, then remove all zero values.


Take a list of integers; Sort it from low to high, then exclude zeros.


Take a list of integers; arrange in increasing order, then remove all zero values.


Take a list of integers; Organize these ascending, then exclude zeros.


Take a list of integers; Sort in ascending order, then remove all zero values.


Take a list of integers; I need this sorted ascending, then exclude zeros.


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


Take a list of integers; sort ascending, then drop the zeros.


Take a list of integers; double each, then check if values are in increasing order.


Take a list of integers; times two for each item, then give me a yes or no if the list is sorted.


Take a list of integers; double each, then is this list sorted.


Take a list of integers; times two for each item, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; double each, then tell me if it's sorted ascending.


Take a list of integers; times two for each item, then return whether the list is sorted ascending.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; sort ascending, then clamp each to at most ten.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10.


Take a list of integers; arrange in increasing order, then clamp each to at most ten.


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


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


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


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


Take a list of integers; sort ascending, then cap each value at 10.


Take a list of integers; reverse the order, then keep only odd values.


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


Take a list of integers; flip the list around, then keep only odd values.


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


Take a list of integers; put the elements backwards, then keep only odd values.


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


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


Take a list of integers; reverse the order, then keep the odd numbers.


Take a list of integers; keep multiples of three, then remove the first item.


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


Take a list of integers; keep values divisible by 3, then remove the first item.


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


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


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


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


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


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


Take a list of integers; keep evens, then what's the even count.


Take a list of integers; keep the even numbers, then give the number of evens.


Take a list of integers; keep evens, then find how many values are divisible by two.


Take a list of integers; keep the even numbers, then how many are even.


Take a list of integers; keep evens, then get the total number of even values in the list.


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


Take a list of integers; keep the even numbers, then return how many values are even.


Take a list of integers; double each, then check if every number is above zero.


Take a list of integers; times two for each item, then verify that all values exceed zero.


Take a list of integers; double each, then are all values positive.


Take a list of integers; times two for each item, then are they all above zero.


Take a list of integers; double each, then tell me if all numbers are greater than zero.


Take a list of integers; times two for each item, then return whether all values are positive.


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


Take a list of integers; double each, then return whether all values are positive.


Take a list of integers; keep multiples of three, then give the smallest value (0 if none).


Take a list of integers; get rid of non-multiples of three, then what's the smallest element, or 0 if there's nothing.


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


Take a list of integers; keep items where x mod 3 equals zero, then minimum value, zero otherwise.


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


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


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5.


Take a list of integers; skip negatives at the start, then filter for numbers above 5.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five.


Take a list of integers; strip the front negatives, then keep values greater than five.


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


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


Take a list of integers; keep the negative numbers, then multiply each value by itself.


Take a list of integers; extract negatives, then square them all.


Take a list of integers; keep the negative numbers, then raise each to the power of two.


Take a list of integers; extract negatives, then I need each number multiplied by itself.


Take a list of integers; keep the negative numbers, then square all of them.


Take a list of integers; extract negatives, then multiply each element by itself.


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


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


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


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


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


Take a list of strings; change all strings to uppercase, then clean up empty strings.


Take a list of strings; make every string uppercase, then delete empty entries.


Take a list of strings; uppercase each one, then drop empty strings.


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


Take a list of strings; uppercase each string, then drop empty strings.


Take a list of strings; drop duplicate strings keeping the first, then concatenate with commas between.


Take a list of strings; dedupe, then add commas between items.


Take a list of strings; remove duplicate strings keep first, then return them as one comma-separated string.


Take a list of strings; remove repeating strings first one stays, then separate by comma.


Take a list of strings; delete duplicate strings keep the first one, then join with commas.


Take a list of strings; deduplicate the strings, then comma join.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    return ','.join(r)


Take a list of strings; drop duplicate strings keeping the first, then join them with commas.


Take a list of integers; subtract one from each, then keep values divisible by 3.


Take a list of integers; Decrement all items, then keep items where x mod 3 equals zero.


Take a list of integers; decrement each value, then drop anything not divisible by three.


Take a list of integers; Lower each number by one, then filter out everything except multiples of three.


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


Take a list of integers; Subtract 1 from all, then multiples of three only.


def solve(xs):
    r = list(xs)
    r = [x - 1 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 keep multiples of three.


Take a list of integers; keep multiples of three, then check if every number is above zero.


Take a list of integers; get rid of non-multiples of three, then verify that all values exceed zero.


Take a list of integers; keep values divisible by 3, then are all values positive.


Take a list of integers; keep items where x mod 3 equals zero, then are they all above zero.


Take a list of integers; drop anything not divisible by three, then tell me if all numbers are greater than zero.


Take a list of integers; filter out everything except multiples of three, then return whether all values are positive.


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


Take a list of integers; keep multiples of three, then return whether all values are positive.


Take a list of integers; take the absolute value of each, then check that there are no duplicates.


Take a list of integers; convert to absolute value, then are the values all unique.


Take a list of integers; strip the signs, then check if all values are unique.


Take a list of integers; take abs of each, then return whether all values are distinct.


Take a list of integers; get the absolute value of everything, then tell me if values are distinct.


Take a list of integers; apply absolute value to the whole list, then are all values distinct.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; add ten to each, then count the even numbers.


Take a list of integers; bump everything up by 10, then what's the even count.


Take a list of integers; increase every value by 10, then give the number of evens.


Take a list of integers; add 10 to each item, then find how many values are divisible by two.


Take a list of integers; shift each up by ten, then how many are even.


Take a list of integers; increase all numbers by 10, then get the total number of even values in the list.


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


Take a list of integers; add ten to each, then return how many values are even.


Take a list of integers; drop the first element, then check that there are no duplicates.


Take a list of integers; Take everything except the first, then are the values all unique.


Take a list of integers; drop the first element, then check if all values are unique.


Take a list of integers; Take everything except the first, then return whether all values are distinct.


Take a list of integers; drop the first element, then tell me if values are distinct.


Take a list of integers; Take everything except the first, then are all values distinct.


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


Take a list of integers; drop the first element, then return whether all values are distinct.


Take a list of strings; drop empty strings, then take each string's first letter.


Take a list of strings; get rid of blanks, then give me the first letter of everything.


Take a list of strings; remove blanks, then reduce each string to its first character.


Take a list of strings; eliminate empty string values, then take first char drop blanks.


Take a list of strings; filter out blank strings, then keep first letters only.


Take a list of strings; remove strings that are empty, then first letter from each item that isn't empty.


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


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


Take a list of strings; uppercase each string, then order strings from shortest to longest.


Take a list of strings; make it all caps, then shortest to longest.


Take a list of strings; convert each to upper case, then arrange by string length ascending.


Take a list of strings; change all strings to uppercase, then length sort.


Take a list of strings; make every string uppercase, then sort by length shortest first.


Take a list of strings; uppercase each one, then organize by string length least to greatest.


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


Take a list of strings; uppercase each string, then sort by length, shortest first.


Take a list of strings; drop strings shorter than three characters, then give the maximum string length.


Take a list of strings; eliminate strings below length three, then max length of all strings.


Take a list of strings; remove short strings (under 3 chars), then what's the max string length.


Take a list of strings; only keep strings with three or more characters, then return the length of the longest string (0 if none).


Take a list of strings; keep only strings that are at least three characters long, then how long is the longest string.


Take a list of strings; filter strings shorter than 3 chars, then find the longest string length.


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


Take a list of strings; drop strings shorter than three characters, then return the length of the longest string (0 if none).


Take a list of integers; cap each value at 10, then remove all zero values.


Take a list of integers; clip values at 10, then exclude zeros.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; if empty, use a single zero, then multiply each by two.


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


Take a list of integers; default to [0] when there is nothing, then multiply each by two.


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


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


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


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


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


Take a list of integers; drop the first element, then cut the list at the first zero.


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


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


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


Take a list of integers; drop the first element, then truncate at the first zero.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero.


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


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


Take a list of integers; sort ascending, then find the first even number, defaulting to 0.


Take a list of integers; Sort it from low to high, then first even value zero if not found.


Take a list of integers; arrange in increasing order, then find the first even number, defaulting to 0.


Take a list of integers; Organize these ascending, then first even value zero if not found.


Take a list of integers; Sort in ascending order, then find the first even number, defaulting to 0.


Take a list of integers; I need this sorted ascending, then first even value zero if not found.


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


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


Take a list of integers; pad with zeros to at least three elements, then check if there is an even number.


Take a list of integers; add zeros until the list has at least three values, then find out whether any value is divisible by 2.


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


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


Take a list of integers; add ten to each, then give the smallest value (0 if none).


Take a list of integers; bump everything up by 10, then what's the smallest element, or 0 if there's nothing.


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


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


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


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


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


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


Take a list of integers; keep the odd numbers, then order by distance from zero.


Take a list of integers; odd numbers only, then sort based on absolute value.


Take a list of integers; keep the odd numbers, then organize by magnitude.


Take a list of integers; odd numbers only, then arrange by absolute value ascending.


Take a list of integers; keep the odd numbers, then sort from smallest to largest absolute value.


Take a list of integers; odd numbers only, then sort by absolute value.


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


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


Take a list of integers; keep the positive numbers, then check if every number is above zero.


Take a list of integers; get rid of anything that's not positive, then verify that all values exceed zero.


Take a list of integers; drop non-positive values, then are all values positive.


Take a list of integers; drop the negative numbers, then are they all above zero.


Take a list of integers; filter out the negative ones, then tell me if all numbers are greater than zero.


Take a list of integers; remove all negative values, then return whether all values are positive.


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