Take a list of strings; strip all the strings, then remove duplicate strings keep first, then Longest string, or nothing if there isn't one.


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


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


Take a list of integers; keep only the last three, then keep only even values, then arrange in increasing order.


Take a list of integers; keep the final three items, then extract all even numbers, then Organize these ascending.


Take a list of integers; take the last three, then keep only even values, then Sort in ascending order.


Take a list of integers; trim to the last three, then extract all even numbers, then I need this sorted ascending.


Take a list of integers; last three only, then keep only even values, then Put these in ascending order.


Take a list of integers; truncate to the last three items, then extract all even numbers, then sort smallest to largest.


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


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


Take a list of integers; keep the negative numbers, then make every value non-negative, then find the min, defaulting to 0.


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


Take a list of integers; keep the negative numbers, then take absolute values, then get the minimum value or zero if empty.


Take a list of integers; extract negatives, then turn negatives into positives, then give me the min or 0.


Take a list of integers; keep the negative numbers, then abs each element, then return the smallest number, defaulting to 0.


Take a list of integers; extract negatives, then take the absolute value of each, then return smallest or zero if empty.


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


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


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


Take a list of integers; times two for each item, then absolute value for all items, then strip out the evens.


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


Take a list of integers; times two for each item, then turn negatives into positives, then strip out the evens.


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


Take a list of integers; times two for each item, then take the absolute value of each, then strip out the evens.


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


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


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


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


Take a list of integers; remove both ends, then extend to length 3 using zeros, then get the absolute value of everything.


Take a list of integers; trim the edges, then pad to 3, then apply absolute value to the whole list.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then make them all positive.


Take a list of integers; cut off the first and last, then pad to 3, then make every value non-negative.


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


Take a list of integers; drop the first and last elements, then pad with zeros to at least three elements, then take the absolute value of each.


Take a list of people records (name, age); extract the ages, then decrement each value, then keep only non-zero numbers.


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


Take a list of people records (name, age); pluck the age field from each record, then reduce each by one, then keep only non-zero numbers.


Take a list of people records (name, age); get the age field, then Subtract 1 from all, then strip the zeros.


Take a list of people records (name, age); keep just each person's age, then Subtract one from each, then keep only non-zero numbers.


Take a list of people records (name, age); extract age values, then Drop each by one, then strip the zeros.


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


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


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


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


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


Take a list of people records (name, age); put the youngest at the top, then extract age values, then drop negatives from start.


Take a list of people records (name, age); sort records by age, youngest first, then get all the ages, then strip negative values from the start.


Take a list of people records (name, age); put the youngest at the top, then what are the ages, then remove negatives before the first non-negative.


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


Take a list of people records (name, age); sort records by age, youngest first, then extract the ages, then drop the leading negative values.


Take a list of integers; keep only the first three, then sort largest to smallest, then bump each up by one.


Take a list of integers; keep the first 3 items, then sort by descending values, then increment each item.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then bump each up by one.


Take a list of integers; remove everything after the third, then sort descending, then increment each item.


Take a list of integers; truncate to three items, then sort largest first, then bump each up by one.


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


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


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


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


Take a list of integers; extract negatives, then sort by descending values, then negate.


Take a list of integers; keep the negative numbers, then sort from highest to lowest, then multiply each by -1.


Take a list of integers; extract negatives, then sort descending, then negate.


Take a list of integers; keep the negative numbers, then sort largest first, then multiply each by -1.


Take a list of integers; extract negatives, then sort in descending order, then negate.


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


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


Take a list of integers; drop the first and last elements, then multiply each by two, then truncate to three items.


Take a list of integers; take out the first and last items, then double each item in the list, then show the first three.


Take a list of integers; remove both ends, then multiply each by two, then take the first three.


Take a list of integers; trim the edges, then double each item in the list, then keep first 3.


Take a list of integers; trim one element off each end, then multiply each by two, then truncate to first three.


Take a list of integers; cut off the first and last, then double each item in the list, then first three.


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


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


Take a list of integers; drop the first and last elements, then flip the sign of each, then shift each up by ten.


Take a list of integers; take out the first and last items, then turn positives to negatives and vice versa, then increase all numbers by 10.


Take a list of integers; remove both ends, then flip the sign of each, then add 10 to everything.


Take a list of integers; trim the edges, then turn positives to negatives and vice versa, then give everything a boost of 10.


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


Take a list of integers; cut off the first and last, then turn positives to negatives and vice versa, then add a constant 10 to each.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then replace an empty list with one zero.


Take a list of integers; keep evens, then keep only numbers greater than 5, then zero it out if it's empty.


Take a list of integers; keep the even numbers, then filter for numbers above 5, then use zero if the list is empty.


Take a list of integers; keep evens, then give me values where x is greater than 5, then default to zero when empty.


Take a list of integers; keep the even numbers, then show me only the values that are bigger than five, then if there's nothing, put in a zero.


Take a list of integers; keep evens, then keep values greater than five, then if no items, add a zero.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; reverse the order, then keep the leading run of positive numbers, then truncate to three items.


Take a list of integers; reverse, then take values while they are positive, then show the first three.


Take a list of integers; flip the list around, then take positive values then stop, then take the first three.


Take a list of integers; flip the order around, then keep going while positive, then keep first 3.


Take a list of integers; put the elements backwards, then stop at first non positive, then truncate to first three.


Take a list of integers; reverse that for me, then take while greater than zero, then first three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; drop duplicates but keep the first one, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; drop duplicates keeping first occurrence, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; drop duplicates but keep the first one, then zero it out if it's empty, then increment each item.


Take a list of integers; drop duplicates keeping first occurrence, then use zero if the list is empty, then bump each up by one.


Take a list of integers; drop duplicates but keep the first one, then default to zero when empty, then increment each item.


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


Take a list of integers; drop duplicates keeping first occurrence, then if empty, use a single zero, then add one to each.


Take a list of integers; subtract one from each, then sort smallest to largest, then drop the odd numbers.


Take a list of integers; Decrement all items, then Ascending sort, then filter out the odd numbers.


Take a list of integers; decrement each value, then Sort this ascending, then drop the odd numbers.


Take a list of integers; Lower each number by one, then Sort lowest to highest, then filter out the odd numbers.


Take a list of integers; reduce each by one, then Arrange from smallest to largest, then drop the odd numbers.


Take a list of integers; Subtract 1 from all, then sort ascending, then filter out the odd numbers.


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


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


Take a list of integers; sort descending, then keep the leading run of positive numbers, then replace an empty list with one zero.


Take a list of integers; sort largest first, then take values while they are positive, then zero it out if it's empty.


Take a list of integers; sort in descending order, then take positive values then stop, then use zero if the list is empty.


Take a list of integers; sort from greatest to least, then keep going while positive, then default to zero when empty.


Take a list of integers; sort z to a, then stop at first non positive, then if there's nothing, put in a zero.


Take a list of integers; arrange in decreasing order, then take while greater than zero, then if no items, add a zero.


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


Take a list of integers; sort descending, then take values while they are positive, then if empty, use a single zero.


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


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


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


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


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


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


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


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


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


Take a list of integers; sort largest first, then Ascending sort, then reverse that for me.


Take a list of integers; sort in descending order, then Sort this ascending, then flip it backwards.


Take a list of integers; sort from greatest to least, then Sort lowest to highest, then make it backwards.


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


Take a list of integers; arrange in decreasing order, then sort ascending, then invert the sequence.


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


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


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


Take a list of integers; drop duplicates but keep the first one, then add 10 to each item, then fetch the first even element, default to 0.


Take a list of integers; drop duplicates keeping first occurrence, then shift each up by ten, then give the earliest even value or zero.


Take a list of integers; drop duplicates but keep the first one, then increase all numbers by 10, then fetch the first even element, default to 0.


Take a list of integers; drop duplicates keeping first occurrence, then add 10 to everything, then give the earliest even value or zero.


Take a list of integers; drop duplicates but keep the first one, then give everything a boost of 10, then fetch the first even element, default to 0.


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


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


Take a list of people records (name, age); extract the names, then keep only non-empty strings, then find how long the longest string is.


Take a list of people records (name, age); Give me the names, then filter empty strings, then give the length of the longest string in the list.


Take a list of people records (name, age); pluck the name field from each record, then remove empty strings from the list, then get me the longest string's length.


Take a list of people records (name, age); Grab the names, then clean up empty strings, then give the maximum string length.


Take a list of people records (name, age); keep just each person's name, then delete empty entries, then max length of all strings.


Take a list of people records (name, age); List the names, then drop empty strings, then what's the max string length.


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


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


Take a list of integers; keep only the last three, then remove all zero values, then true only if all are positive.


Take a list of integers; keep the final three items, then exclude zeros, then do all of these have positive values.


Take a list of integers; take the last three, then remove all zero values, then check if every value is positive.


Take a list of integers; trim to the last three, then exclude zeros, then confirm all values are positive.


Take a list of integers; last three only, then remove all zero values, then all positive.


Take a list of integers; truncate to the last three items, then exclude zeros, then check if every number is above zero.


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


Take a list of integers; keep only the last three, then drop the zeros, then return whether all values are positive.


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


Take a list of integers; keep evens, then unique values preserving order, then strip out the evens.


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


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


Take a list of strings; sort by length, shortest first, then strip spaces around each string, then return the number of strings.


Take a list of strings; sort ascending by length, then remove leading and trailing spaces, then count the strings.


Take a list of strings; order strings from shortest to longest, then remove whitespace from each item, then return how many strings remain.


Take a list of strings; shortest to longest, then clean whitespace from each entry, then give me the total number of strings.


Take a list of strings; arrange by string length ascending, then trim each string, then tell me how many strings we have.


Take a list of strings; length sort, then trim whitespace from each, then what's the string count.


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


Take a list of strings; sort by length, shortest first, then trim whitespace from each, then return how many strings remain.


Take a list of integers; add one to each, then clamp each to at most ten, then make each twice as big.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then multiply each by 2.


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


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


Take a list of integers; drop the leading negative values, then remove both ends, then give back the product of all values.


Take a list of integers; cut the leading negatives, then trim the edges, then product of the list.


Take a list of integers; skip negatives at the start, then trim one element off each end, then what's the product.


Take a list of integers; remove all negatives at the front, then cut off the first and last, then what do they multiply to.


Take a list of integers; remove the initial run of negative numbers, then remove the first and last elements, then give me their product.


Take a list of integers; strip the front negatives, then keep only the middle part, then multiply them all together.


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


Take a list of integers; drop the leading negative values, then drop the first and last elements, then return their product.


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


Take a list of integers; reverse the signs of everything, then plus one for all, then Give me the maximum, but 0 if there are no items.


Take a list of integers; negate each, then increment each value, then What's the highest number in the list.


Take a list of integers; reverse the signs of everything, then plus one for all, then Return the greatest value or default to 0.


Take a list of integers; negate each, then increment each value, then Find the largest element, defaulting to zero.


Take a list of integers; reverse the signs of everything, then plus one for all, then give the largest value (0 if none).


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


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


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


Take a list of integers; extract negatives, then pad to 3, then put them in order by magnitude.


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then arrange in order of absolute value.


Take a list of integers; extract negatives, then pad to 3, then sort by distance from zero.


Take a list of integers; keep the negative numbers, then extend to length 3 using zeros, then order by how far from zero.


Take a list of integers; extract negatives, then pad to 3, then order by distance from zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then sort smallest to largest, then trim one element off each end.


Take a list of integers; add zeros until the list has at least three values, then Ascending sort, then cut off the first and last.


Take a list of integers; pad with zeros to at least three elements, then Sort this ascending, then remove the first and last elements.


Take a list of integers; add zeros until the list has at least three values, then Sort lowest to highest, then keep only the middle part.


Take a list of integers; pad with zeros to at least three elements, then Arrange from smallest to largest, then drop first and last.


Take a list of integers; add zeros until the list has at least three values, then sort ascending, then eliminate the outermost elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then flip the list around, then find the min, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then flip the order around, then minimum value, zero otherwise.


Take a list of integers; drop duplicates keeping first occurrence, then put the elements backwards, then get the minimum value or zero if empty.


Take a list of integers; drop duplicates but keep the first one, then reverse that for me, then give me the min or 0.


Take a list of integers; drop duplicates keeping first occurrence, then flip it backwards, then return the smallest number, defaulting to 0.


Take a list of integers; drop duplicates but keep the first one, then make it backwards, then return smallest or zero if empty.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    r = list(reversed(r))
    return min(r) if r else 0


Take a list of integers; drop duplicates keeping first occurrence, then reverse the order, then return the minimum (0 if empty).


Take a list of integers; keep values greater than five, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; keep only numbers above 5, then remove the first item, then ensure at least three items by appending zeros.


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


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


Take a list of integers; filter to keep only values above 5, then Remove head, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; odd numbers only, then remove all negatives at the front, then filter out the odd numbers.


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


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


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


Take a list of integers; odd numbers only, then drop negatives from start, then filter out the odd numbers.


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


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


Take a list of integers; take the absolute value of each, then remove both ends, then true if already sorted smallest to largest.


Take a list of integers; convert to absolute value, then trim the edges, then does this list go in ascending order.


Take a list of integers; strip the signs, then trim one element off each end, then check if the list is in ascending order.


Take a list of integers; take abs of each, then cut off the first and last, then is the list sorted.


Take a list of integers; get the absolute value of everything, then remove the first and last elements, then is it sorted.


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then check if values are in increasing order.


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


Take a list of integers; take the absolute value of each, then drop the first and last elements, then return whether the list is sorted ascending.


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


Take a list of integers; keep the first 3 items, then filter for positive numbers, then Discard the first element.


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


Take a list of integers; remove everything after the third, then keep the positives, then Discard the first element.


Take a list of integers; truncate to three items, then remove negatives, then skip the first one.


Take a list of integers; show the first three, then keep the positive numbers, then Discard the first element.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; reverse the order, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; reverse, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; flip the list around, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; flip the order around, then Remove head, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; put the elements backwards, then remove the first item, then ensure at least three items by appending zeros.


Take a list of integers; reverse that for me, then Remove head, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; drop the zeros, then keep only odd values, then arrange in decreasing order.


Take a list of integers; keep only nonzero elements, then eliminate the even numbers, then arrange in descending order.


Take a list of integers; drop the zeros, then keep only odd values, then reverse sort.


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


Take a list of integers; drop the zeros, then keep only odd values, then sort by descending values.


Take a list of integers; keep only nonzero elements, then eliminate the even numbers, then sort from highest to lowest.


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


Take a list of integers; drop the zeros, then keep the odd numbers, then sort descending.


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


Take a list of strings; make it all caps, then make each one start with a hash, then give the length of the longest string in the list.


Take a list of strings; convert each to upper case, then add '#' to the start of each string, then get me the longest string's length.


Take a list of strings; change all strings to uppercase, then make each one start with a hash, then give the maximum string length.


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


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


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


Take a list of strings; uppercase each string, then 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 keep only odd values, then limit every value to 10.


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


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


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


Take a list of integers; sort descending, then decrement each value, then multiply each by -1.


Take a list of integers; sort largest first, then Lower each number by one, then negate.


Take a list of integers; sort in descending order, then reduce each by one, then multiply each by -1.


Take a list of integers; sort from greatest to least, then Subtract 1 from all, then negate.


Take a list of integers; sort z to a, then Subtract one from each, then multiply each by -1.


Take a list of integers; arrange in decreasing order, then Drop each by one, then negate.


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


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


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


Take a list of integers; times two for each item, then unique values preserving order, then filter out the odd numbers.


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


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


Take a list of integers; keep the even numbers, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; keep evens, then square them all, then Organize these ascending.


Take a list of integers; keep the even numbers, then raise each to the power of two, then Sort in ascending order.


Take a list of integers; keep evens, then I need each number multiplied by itself, then I need this sorted ascending.


Take a list of integers; keep the even numbers, then square all of them, then Put these in ascending order.


Take a list of integers; keep evens, then multiply each element by itself, then sort smallest to largest.


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


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


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


Take a list of integers; take out the first and last items, then turn positives to negatives and vice versa, then take abs of each.


Take a list of integers; remove both ends, then flip the sign of each, then get the absolute value of everything.


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


Take a list of integers; trim one element off each end, then flip the sign of each, then make them all positive.


Take a list of integers; cut off the first and last, then turn positives to negatives and vice versa, then make every value non-negative.


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


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


Take a list of integers; subtract one from each, then take the final 3 elements, then make each twice as big.


Take a list of integers; Decrement all items, then drop everything except the final three, then multiply each by 2.


Take a list of integers; decrement each value, then give me the last three elements, then make each twice as big.


Take a list of integers; Lower each number by one, then keep only the last three, then multiply each by 2.


Take a list of integers; reduce each by one, then keep the final three items, then make each twice as big.


Take a list of integers; Subtract 1 from all, then take the last three, then multiply each by 2.


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


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


Take a list of integers; drop the first and last elements, then keep the leading run of positive numbers, then give back the total.


Take a list of integers; take out the first and last items, then take values while they are positive, then sum r.


Take a list of integers; remove both ends, then take positive values then stop, then add them up.


Take a list of integers; trim the edges, then keep going while positive, then calculate the sum of all elements.


Take a list of integers; trim one element off each end, then stop at first non positive, then what's the total.


Take a list of integers; cut off the first and last, then take while greater than zero, then what do they add up to.


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


Take a list of integers; drop the first and last elements, then take values while they are positive, then return their sum.


Take a list of integers; keep values greater than five, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; filter out values less than or equal to 5, then pad to 3, then maximum of 10 for all.


Take a list of integers; keep only numbers above 5, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; exclude values of 5 and below, then pad to 3, then maximum of 10 for all.


Take a list of integers; remove anything 5 or less, then extend to length 3 using zeros, then limit every value to 10.


Take a list of integers; filter to keep only values above 5, then pad to 3, then maximum of 10 for all.


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


Take a list of integers; keep values greater than five, then pad with zeros to at least three elements, then cap each value at 10.


Take a list of integers; keep the even numbers, then multiply each value by itself, then true if every value is unique.


Take a list of integers; keep evens, then square them all, then check for duplicates in the values.


Take a list of integers; keep the even numbers, then raise each to the power of two, then do all values appear only once.


Take a list of integers; keep evens, then I need each number multiplied by itself, then check that there are no duplicates.


Take a list of integers; keep the even numbers, then square all of them, then are the values all unique.


Take a list of integers; keep evens, then multiply each element by itself, then check if all values are unique.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; negate each, then increase every value by 10, then drop anything not divisible by three.


Take a list of integers; reverse the signs of everything, then add 10 to each item, then filter out everything except multiples of three.


Take a list of integers; negate each, then shift each up by ten, then keep only multiples of three.


Take a list of integers; reverse the signs of everything, then increase all numbers by 10, then multiples of three only.


Take a list of integers; negate each, then add 10 to everything, then filter for numbers divisible by three.


Take a list of integers; reverse the signs of everything, then give everything a boost of 10, then give me only the values divisible by three.


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


Take a list of integers; negate each, then add ten to each, then keep multiples of three.


Take a list of integers; pad with zeros to at least three elements, then take the final 3 elements, then strip the signs.


Take a list of integers; add zeros until the list has at least three values, then drop everything except the final three, then take abs of each.


Take a list of integers; pad with zeros to at least three elements, then give me the last three elements, then get the absolute value of everything.


Take a list of integers; add zeros until the list has at least three values, then keep only the last three, then apply absolute value to the whole list.


Take a list of integers; pad with zeros to at least three elements, then keep the final three items, then make them all positive.


Take a list of integers; add zeros until the list has at least three values, then take the last three, then make every value non-negative.


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


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


Take a list of integers; sort ascending, then remove both ends, then arrange in decreasing order.


Take a list of integers; Sort it from low to high, then trim the edges, then arrange in descending order.


Take a list of integers; arrange in increasing order, then trim one element off each end, then reverse sort.


Take a list of integers; Organize these ascending, then cut off the first and last, then sort largest to smallest.


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


Take a list of integers; I need this sorted ascending, then keep only the middle part, then sort from highest to lowest.


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


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


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


Take a list of integers; get rid of non-multiples of three, then don't let anything exceed 10, then remove repeats.


Take a list of integers; keep values divisible by 3, then clamp each to at most ten, then deduplicate the list.


Take a list of integers; keep items where x mod 3 equals zero, then don't let anything exceed 10, then remove repeats.


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


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


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


Take a list of integers; keep multiples of three, then cap each value at 10, then drop duplicates keeping first occurrence.


Take a list of integers; subtract one from each, then cut the list at the first zero, then keep only non-zero numbers.


Take a list of integers; Decrement all items, then cut off after the first zero appears, then strip the zeros.


Take a list of integers; decrement each value, then take values up to (excluding) the first zero, then keep only non-zero numbers.


Take a list of integers; Lower each number by one, then keep the part before the first 0, then strip the zeros.


Take a list of integers; reduce each by one, then truncate at the first zero, then keep only non-zero numbers.


Take a list of integers; Subtract 1 from all, then delete everything starting with the first zero, then strip the zeros.


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


Take a list of integers; subtract one from each, then keep everything before the first zero, then drop the zeros.


Take a list of integers; subtract one from each, then keep values above zero, then truncate to the last three items.


Take a list of integers; Decrement all items, then filter for positive numbers, then show only the last three.


Take a list of integers; decrement each value, then keep only positive numbers, then remove all but the last three.


Take a list of integers; Lower each number by one, then keep the positives, then take the final 3 elements.


Take a list of integers; reduce each by one, then remove negatives, then drop everything except the final three.


Take a list of integers; Subtract 1 from all, then keep the positive numbers, then give me the last three elements.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values divisible by 3, then true if every value is unique.


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then check for duplicates in the values.


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then do all values appear only once.


Take a list of integers; drop duplicates but keep the first one, then filter out everything except multiples of three, then check that there are no duplicates.


Take a list of integers; drop duplicates keeping first occurrence, then keep only multiples of three, then are the values all unique.


Take a list of integers; drop duplicates but keep the first one, then multiples of three only, then check if all values are unique.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep multiples of three, then return whether all values are distinct.


Take a list of integers; keep the negative numbers, then keep values above zero, then bump each up by one.


Take a list of integers; extract negatives, then filter for positive numbers, then increment each item.


Take a list of integers; keep the negative numbers, then keep only positive numbers, then bump each up by one.


Take a list of integers; extract negatives, then keep the positives, then increment each item.


Take a list of integers; keep the negative numbers, then remove negatives, then bump each up by one.


Take a list of integers; extract negatives, then keep the positive numbers, then increment each item.


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


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


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


Take a list of integers; take out the first and last items, then unique values preserving order, then zero it out if it's empty.


Take a list of integers; remove both ends, then remove repeated values, then use zero if the list is empty.


Take a list of integers; trim the edges, then unique values preserving order, then default to zero when empty.


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


Take a list of integers; cut off the first and last, then unique values preserving order, then if no items, add a zero.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then remove all negatives at the front, then strip out the evens.


Take a list of integers; pad with zeros to at least three elements, then remove the initial run of negative numbers, then drop the even numbers.


Take a list of integers; add zeros until the list has at least three values, then strip the front negatives, then strip out the evens.


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


Take a list of integers; add zeros until the list has at least three values, then drop negatives from start, then strip out the evens.


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


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


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


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


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


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


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


Take a list of integers; extract negatives, then delete everything starting with the first zero, then Discard the first element.


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


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


Take a list of people records (name, age); extract the names, then order strings from shortest to longest, then prepend a hash mark to each.


Take a list of people records (name, age); Give me the names, then shortest to longest, then prefix all with #.


Take a list of people records (name, age); pluck the name field from each record, then arrange by string length ascending, then prepend a hash mark to each.


Take a list of people records (name, age); Grab the names, then length sort, then prefix all with #.


Take a list of people records (name, age); keep just each person's name, then sort by length shortest first, then prepend a hash mark to each.


Take a list of people records (name, age); List the names, then organize by string length least to greatest, then prefix all with #.


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


Take a list of people records (name, age); extract the names, then sort by length, shortest first, then prefix each with a hash.


Take a list of integers; sort descending, then sort smallest to largest, then find the max, defaulting to 0.


Take a list of integers; sort largest first, then Ascending sort, then Give me the maximum, but 0 if there are no items.


Take a list of integers; sort in descending order, then Sort this ascending, then What's the highest number in the list.


Take a list of integers; sort from greatest to least, then Sort lowest to highest, then Return the greatest value or default to 0.


Take a list of integers; sort z to a, then Arrange from smallest to largest, then Find the largest element, defaulting to zero.


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


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


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


Take a list of integers; double each, then keep only odd values, then true if any value equals zero.


Take a list of integers; times two for each item, then eliminate the even numbers, then check for zero.


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


Take a list of integers; double each, then keep the odd numbers, then return whether the list contains a zero.


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


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


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


Take a list of integers; keep items where x mod 3 equals zero, then extract all even numbers, then take positive values then stop.


Take a list of integers; drop anything not divisible by three, then keep only even values, then keep going while positive.


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


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 3 == 0]
    r = [x for x in r if x % 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 multiples of three, then keep the even numbers, then take values while they are positive.


Take a list of integers; add one to each, then take the final 3 elements, then put the elements backwards.


Take a list of integers; make each one bigger, then drop everything except the final three, then reverse that for me.


Take a list of integers; add one to each, then give me the last three elements, then flip it backwards.


Take a list of integers; make each one bigger, then keep only the last three, then make it backwards.


Take a list of integers; add one to each, then keep the final three items, then reverse the list.


Take a list of integers; make each one bigger, then take the last three, then invert the sequence.


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


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


Take a list of integers; add one to each, then remove all zero values, then strip the signs.


Take a list of integers; make each one bigger, then exclude zeros, then take abs of each.


Take a list of integers; add one to each, then remove all zero values, then get the absolute value of everything.


Take a list of integers; make each one bigger, then exclude zeros, then apply absolute value to the whole list.


Take a list of integers; add one to each, then remove all zero values, then make them all positive.


Take a list of integers; make each one bigger, then exclude zeros, then make every value non-negative.


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


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


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


Take a list of integers; get rid of non-multiples of three, then trim the edges, then show only the last three.


Take a list of integers; keep values divisible by 3, then trim one element off each end, then remove all but the last three.


Take a list of integers; keep items where x mod 3 equals zero, then cut off the first and last, then take the final 3 elements.


Take a list of integers; drop anything not divisible by three, then remove the first and last elements, then drop everything except the final three.


Take a list of integers; filter out everything except multiples of three, then keep only the middle part, then give me the last three elements.


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


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


Take a list of integers; keep only the first three, then keep only odd values, then make each twice as big.


Take a list of integers; keep the first 3 items, then eliminate the even numbers, then multiply each by 2.


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


Take a list of integers; remove everything after the third, then eliminate the even numbers, then multiply each by 2.


Take a list of integers; truncate to three items, then keep only odd values, then make each twice as big.


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


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


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


Take a list of integers; keep only the first three, then make every value non-negative, then arrange by magnitude ignoring sign.


Take a list of integers; keep the first 3 items, then absolute value for all items, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then take absolute values, then arrange in order of absolute value.


Take a list of integers; remove everything after the third, then turn negatives into positives, then sort by distance from zero.


Take a list of integers; truncate to three items, then abs each element, then order by how far from zero.


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


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


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


Take a list of integers; keep only the first three, then multiply each by two, then multiply each by -1.


Take a list of integers; keep the first 3 items, then double each item in the list, then negate.


Take a list of integers; take the first 3 elements, then multiply each by two, then multiply each by -1.


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


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


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


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


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


Take a list of integers; negate each, then drop anything 5 or below, then drop anything not divisible by three.


Take a list of integers; reverse the signs of everything, then keep only numbers greater than 5, then filter out everything except multiples of three.


Take a list of integers; negate each, then filter for numbers above 5, then keep only multiples of three.


Take a list of integers; reverse the signs of everything, then give me values where x is greater than 5, then multiples of three only.


Take a list of integers; negate each, then show me only the values that are bigger than five, then filter for numbers divisible by three.


Take a list of integers; reverse the signs of everything, then keep values greater than five, then give me only the values divisible by three.


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


Take a list of integers; negate each, then keep values greater than five, then keep multiples of three.


Take a list of integers; take the absolute value of each, then decrement each value, then raise each to the power of two.


Take a list of integers; convert to absolute value, then Lower each number by one, then I need each number multiplied by itself.


Take a list of integers; strip the signs, then reduce each by one, then square all of them.


Take a list of integers; take abs of each, then Subtract 1 from all, then multiply each element by itself.


Take a list of integers; get the absolute value of everything, then Subtract one from each, then make each one squared.


Take a list of integers; apply absolute value to the whole list, then Drop each by one, then square each value in the list.


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


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


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


Take a list of integers; Decrement all items, then pad to 3, then strip the front negatives.


Take a list of integers; decrement each value, then extend to length 3 using zeros, then remove leading negative numbers.


Take a list of integers; Lower each number by one, then pad to 3, then drop negatives from start.


Take a list of integers; reduce each by one, then extend to length 3 using zeros, then strip negative values from the start.


Take a list of integers; Subtract 1 from all, then pad to 3, then remove negatives before the first non-negative.


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


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


Take a list of integers; add one to each, then remove all zero values, then arrange by magnitude ignoring sign.


Take a list of integers; make each one bigger, then exclude zeros, then put them in order by magnitude.


Take a list of integers; add one to each, then remove all zero values, then arrange in order of absolute value.


Take a list of integers; make each one bigger, then exclude zeros, then sort by distance from zero.


Take a list of integers; add one to each, then remove all zero values, then order by how far from zero.


Take a list of integers; make each one bigger, then exclude zeros, then order by distance from zero.


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


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


Take a list of strings; drop strings shorter than three characters, then add '#' to the start of each string, then return the number of strings.


Take a list of strings; eliminate strings below length three, then make each one start with a hash, then count the strings.


Take a list of strings; remove short strings (under 3 chars), then add '#' to the start of each string, then return how many strings remain.


Take a list of strings; only keep strings with three or more characters, then make each one start with a hash, then give me the total number of strings.


Take a list of strings; keep only strings that are at least three characters long, then add '#' to the start of each string, then tell me how many strings we have.


Take a list of strings; filter strings shorter than 3 chars, then make each one start with a hash, then what's the string count.


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


Take a list of strings; drop strings shorter than three characters, then prefix each with a hash, then return how many strings remain.


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


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


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then sort smallest to largest, then put the elements backwards.


Take a list of integers; add zeros until the list has at least three values, then Ascending sort, then reverse that for me.


Take a list of integers; pad with zeros to at least three elements, then Sort this ascending, then flip it backwards.


Take a list of integers; add zeros until the list has at least three values, then Sort lowest to highest, then make it backwards.


Take a list of integers; pad with zeros to at least three elements, then Arrange from smallest to largest, then reverse the list.


Take a list of integers; add zeros until the list has at least three values, then sort ascending, then invert the sequence.


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


Take a list of integers; pad with zeros to at least three elements, then sort ascending, then reverse the order.


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


Take a list of integers; cut the leading negatives, then get the negative numbers, then filter out the odd numbers.


Take a list of integers; skip negatives at the start, then keep values below zero, then drop the odd numbers.


Take a list of integers; remove all negatives at the front, then get the negative numbers, then filter out the odd numbers.


Take a list of integers; remove the initial run of negative numbers, then keep values below zero, then drop the odd numbers.


Take a list of integers; strip the front negatives, then get the negative numbers, then filter out the odd numbers.


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


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


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


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


Take a list of integers; remove both ends, then increment each value, then drop the even numbers.


Take a list of integers; trim the edges, then plus one for all, then strip out the evens.


Take a list of integers; trim one element off each end, then increment each value, then drop the even numbers.


Take a list of integers; cut off the first and last, then plus one for all, then strip out the evens.


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


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


Take a list of integers; sort ascending, then order by distance from zero, then trim one element off each end.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then cut off the first and last.


Take a list of integers; arrange in increasing order, then organize by magnitude, then remove the first and last elements.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then keep only the middle part.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then drop first and last.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then eliminate the outermost elements.


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


Take a list of integers; sort ascending, then sort by absolute value, then drop the first and last elements.


Take a list of integers; add one to each, then remove both ends, then deduplicate the list.


Take a list of integers; make each one bigger, then trim the edges, then remove repeats.


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


Take a list of integers; make each one bigger, then cut off the first and last, then remove repeats.


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


Take a list of integers; make each one bigger, then keep only the middle part, then remove repeats.


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


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


Take a list of integers; take values while they are positive, then take the first 3 elements, then arrange in increasing order.


Take a list of integers; take positive values then stop, then remove everything after the third, then Organize these ascending.


Take a list of integers; keep going while positive, then truncate to three items, then Sort in ascending order.


Take a list of integers; stop at first non positive, then show the first three, then I need this sorted ascending.


Take a list of integers; take while greater than zero, then take the first three, then Put these in ascending order.


Take a list of integers; take values while positive, then keep first 3, then sort smallest to largest.


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


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


Take a list of integers; keep only the first three, then order by distance from zero, then truncate to the last three items.


Take a list of integers; keep the first 3 items, then sort based on absolute value, then show only the last three.


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


Take a list of integers; remove everything after the third, then arrange by absolute value ascending, then take the final 3 elements.


Take a list of integers; truncate to three items, then sort from smallest to largest absolute value, then drop everything except the final three.


Take a list of integers; show the first three, then sort by absolute value, then give me the last three elements.


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


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


Take a list of integers; drop the zeros, then decrement each value, then make each twice as big.


Take a list of integers; keep only nonzero elements, then Lower each number by one, then multiply each by 2.


Take a list of integers; drop the zeros, then reduce each by one, then make each twice as big.


Take a list of integers; keep only nonzero elements, then Subtract 1 from all, then multiply each by 2.


Take a list of integers; drop the zeros, then Subtract one from each, then make each twice as big.


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


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


Take a list of integers; drop the zeros, then subtract one from each, then double each.


Take a list of integers; add ten to each, then remove all zero values, then multiply each by -1.


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


Take a list of integers; increase every value by 10, then remove all zero values, then multiply each by -1.


Take a list of integers; add 10 to each item, then exclude zeros, then negate.


Take a list of integers; shift each up by ten, then remove all zero values, then multiply each by -1.


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


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


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


Take a list of integers; take values while they are positive, then keep values above zero, then take values up to (excluding) the first zero.


Take a list of integers; take positive values then stop, then filter for positive numbers, then keep the part before the first 0.


Take a list of integers; keep going while positive, then keep only positive numbers, then truncate at the first zero.


Take a list of integers; stop at first non positive, then keep the positives, then delete everything starting with the first zero.


Take a list of integers; take while greater than zero, then remove negatives, then remove from the first zero onwards.


Take a list of integers; take values while positive, then keep the positive numbers, then up to but not including the first zero.


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


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


Take a list of integers; keep the positive numbers, then take the first 3 elements, then drop the even numbers.


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then strip out the evens.


Take a list of integers; drop non-positive values, then truncate to three items, then drop the even numbers.


Take a list of integers; drop the negative numbers, then show the first three, then strip out the evens.


Take a list of integers; filter out the negative ones, then take the first three, then drop the even numbers.


Take a list of integers; remove all negative values, then keep first 3, then strip out the evens.


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


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


Take a list of integers; cap each value at 10, then cut the list at the first zero, then drop non-negative values.


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


Take a list of integers; cap each value at 10, then take values up to (excluding) the first zero, then drop non-negative values.


Take a list of integers; clip values at 10, then keep the part before the first 0, then drop all positive numbers.


Take a list of integers; cap each value at 10, then truncate at the first zero, then drop non-negative values.


Take a list of integers; clip values at 10, then delete everything starting with the first zero, then drop all positive numbers.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then flip the sign of each, then shift each up by ten.


Take a list of integers; filter out values less than or equal to 5, then turn positives to negatives and vice versa, then increase all numbers by 10.


Take a list of integers; keep only numbers above 5, then flip the sign of each, then add 10 to everything.


Take a list of integers; exclude values of 5 and below, then turn positives to negatives and vice versa, then give everything a boost of 10.


Take a list of integers; remove anything 5 or less, then flip the sign of each, then increment each by ten.


Take a list of integers; filter to keep only values above 5, then turn positives to negatives and vice versa, then add a constant 10 to each.


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


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


Take a list of integers; reverse the order, then increment each value, then give back the product of all values.


Take a list of integers; reverse, then plus one for all, then product of the list.


Take a list of integers; flip the list around, then increment each value, then what's the product.


Take a list of integers; flip the order around, then plus one for all, then what do they multiply to.


Take a list of integers; put the elements backwards, then increment each value, then give me their product.


Take a list of integers; reverse that for me, then plus one for all, then multiply them all together.


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


Take a list of integers; reverse the order, then add one to each, then return their product.


Take a list of integers; keep multiples of three, then multiply each value by itself, then arrange in increasing order.


Take a list of integers; get rid of non-multiples of three, then square them all, then Organize these ascending.


Take a list of integers; keep values divisible by 3, then raise each to the power of two, then Sort in ascending order.


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


Take a list of integers; drop anything not divisible by three, then square all of them, then Put these in ascending order.


Take a list of integers; filter out everything except multiples of three, then multiply each element by itself, then sort smallest to largest.


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


Take a list of integers; keep multiples of three, then square each, then sort ascending.


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


Take a list of integers; extract negatives, then drop everything except the final three, then how many items remain.


Take a list of integers; keep the negative numbers, then give me the last three elements, then tell me the length.


Take a list of integers; extract negatives, then keep only the last three, then return the length.


Take a list of integers; keep the negative numbers, then keep the final three items, then count them.


Take a list of integers; extract negatives, then take the last three, then what's the count.


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


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


Take a list of integers; take values while they are positive, then multiply each by two, then truncate to three items.


Take a list of integers; take positive values then stop, then double each item in the list, then show the first three.


Take a list of integers; keep going while positive, then multiply each by two, then take the first three.


Take a list of integers; stop at first non positive, then double each item in the list, then keep first 3.


Take a list of integers; take while greater than zero, then multiply each by two, then truncate to first three.


Take a list of integers; take values while positive, then double each item in the list, then first three.


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


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


Take a list of integers; drop the first and last elements, then skip negatives at the start, then true if at least one even value.


Take a list of integers; take out the first and last items, then remove all negatives at the front, then any even.


Take a list of integers; remove both ends, then remove the initial run of negative numbers, then true if at least one even value.


Take a list of integers; trim the edges, then strip the front negatives, then any even.


Take a list of integers; trim one element off each end, then remove leading negative numbers, then true if at least one even value.


Take a list of integers; cut off the first and last, then drop negatives from start, then any even.


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


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


Take a list of integers; keep the even numbers, then keep values above zero, then give the number of evens.


Take a list of integers; keep evens, then filter for positive numbers, then find how many values are divisible by two.


Take a list of integers; keep the even numbers, then keep only positive numbers, then how many are even.


Take a list of integers; keep evens, then keep the positives, then get the total number of even values in the list.


Take a list of integers; keep the even numbers, then remove negatives, then give me the count of even values.


Take a list of integers; keep evens, then keep the positive numbers, then I need to know how many of these are even.


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


Take a list of integers; keep the even numbers, then keep the positive numbers, then return how many values are even.


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


Take a list of integers; clip values at 10, then Remove head, then strip the front negatives.


Take a list of integers; cap each value at 10, then remove the first item, then remove leading negative numbers.


Take a list of integers; clip values at 10, then Remove head, then drop negatives from start.


Take a list of integers; cap each value at 10, then remove the first item, then strip negative values from the start.


Take a list of integers; clip values at 10, then Remove head, then remove negatives before the first non-negative.


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


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


Take a list of integers; add ten to each, then take the final 3 elements, then reduce each by one.


Take a list of integers; bump everything up by 10, then drop everything except the final three, then Subtract 1 from all.


Take a list of integers; increase every value by 10, then give me the last three elements, then Subtract one from each.


Take a list of integers; add 10 to each item, then keep only the last three, then Drop each by one.


Take a list of integers; shift each up by ten, then keep the final three items, then Decrease all values by one.


Take a list of integers; increase all numbers by 10, then take the last three, then Remove one from each value.


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


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


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


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


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


Take a list of integers; Organize these ascending, then Subtract 1 from all, then any even.


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


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


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


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


Take a list of integers; sort ascending, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; Sort it from low to high, then unique values preserving order, then fetch the first even element, default to 0.


Take a list of integers; arrange in increasing order, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; Organize these ascending, then unique values preserving order, then fetch the first even element, default to 0.


Take a list of integers; Sort in ascending order, then remove repeated values, then give the earliest even value or zero.


Take a list of integers; I need this sorted ascending, then unique values preserving order, then fetch the first even element, default to 0.


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


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


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


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


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


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


Take a list of integers; raise each to the power of two, then add 10 to everything, then make each twice as big.


Take a list of integers; I need each number multiplied by itself, then give everything a boost of 10, then multiply each by 2.


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


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


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


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


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


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


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


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


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


Take a list of integers; take values while they are positive, then keep values greater than five, then drop duplicates keeping first occurrence.


Take a list of integers; keep only the first three, then make every value non-negative, then drop anything not divisible by three.


Take a list of integers; keep the first 3 items, then absolute value for all items, then filter out everything except multiples of three.


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


Take a list of integers; remove everything after the third, then turn negatives into positives, then multiples of three only.


Take a list of integers; truncate to three items, then abs each element, then filter for numbers divisible by three.


Take a list of integers; show the first three, then take the absolute value of each, then give me only the values divisible by three.


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


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


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


Take a list of people records (name, age); show me all ages, then absolute value for all items, then negate.


Take a list of people records (name, age); pluck the age field from each record, then take absolute values, then multiply each by -1.


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


Take a list of people records (name, age); keep just each person's age, then abs each element, then multiply each by -1.


Take a list of people records (name, age); extract age values, then take the absolute value of each, then negate.


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


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


Take a list of integers; reverse the order, then order by distance from zero, then truncate to three items.


Take a list of integers; reverse, then sort based on absolute value, then show the first three.


Take a list of integers; flip the list around, then organize by magnitude, then take the first three.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then keep first 3.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then truncate to first three.


Take a list of integers; reverse that for me, then sort by absolute value, then first three.


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


Take a list of integers; reverse the order, then sort by absolute value, then keep only the first three.


Take a list of strings; keep the first character of each (dropping empties), then convert each to lower case, then return the number of strings.


Take a list of strings; extract initial letters, then lowercase each one, then count the strings.


Take a list of strings; take each string's first letter, then convert each to lower case, then return how many strings remain.


Take a list of strings; give me the first letter of everything, then lowercase each one, then give me the total number of strings.


Take a list of strings; reduce each string to its first character, then convert each to lower case, then tell me how many strings we have.


Take a list of strings; take first char drop blanks, then lowercase each one, then what's the string count.


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


Take a list of strings; keep the first character of each (dropping empties), then lowercase each string, then return how many strings remain.


Take a list of integers; square each, then flip the sign of each, then keep only numbers above 5.


Take a list of integers; each value squared, then turn positives to negatives and vice versa, then exclude values of 5 and below.


Take a list of integers; multiply each value by itself, then flip the sign of each, then remove anything 5 or less.


Take a list of integers; square them all, then turn positives to negatives and vice versa, then filter to keep only values above 5.


Take a list of integers; raise each to the power of two, then flip the sign of each, then get rid of values that aren't greater than five.


Take a list of integers; I need each number multiplied by itself, then turn positives to negatives and vice versa, then drop anything 5 or below.


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


Take a list of integers; square each, then negate each, then keep values greater than five.


Take a list of integers; keep the odd numbers, then keep only even values, then reduce each by one.


Take a list of integers; odd numbers only, then extract all even numbers, then Subtract 1 from all.


Take a list of integers; keep the odd numbers, then keep only even values, then Subtract one from each.


Take a list of integers; odd numbers only, then extract all even numbers, then Drop each by one.


Take a list of integers; keep the odd numbers, then keep only even values, then Decrease all values by one.


Take a list of integers; odd numbers only, then extract all even numbers, then Remove one from each value.