Take a list of integers; arrange in decreasing order, then first even value zero if not found.


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


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


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


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


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


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


Take a list of strings; delete duplicate strings keep the first one, then keep first letters only.


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


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


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


Take a list of integers; keep values greater than five, then make every value non-negative.


Take a list of integers; filter out values less than or equal to 5, then absolute value for all items.


Take a list of integers; keep only numbers above 5, then take absolute values.


Take a list of integers; exclude values of 5 and below, then turn negatives into positives.


Take a list of integers; remove anything 5 or less, then abs each element.


Take a list of integers; filter to keep only values above 5, then take the absolute value of each.


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


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


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


Take a list of integers; drop duplicates but keep the first one, then what's the even count.


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


Take a list of integers; drop duplicates but keep the first one, then find how many values are divisible by two.


Take a list of integers; drop duplicates keeping first occurrence, then how many are even.


Take a list of integers; drop duplicates but keep the first one, then get the total number of even values in the list.


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


Take a list of integers; drop duplicates keeping first occurrence, then return how many values are even.


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


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then extract all even numbers.


Take a list of integers; keep values divisible by 3, then keep only even values.


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


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


Take a list of integers; filter out everything except multiples of three, then extract all even numbers.


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


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


Take a list of integers; keep values greater than five, then remove repeated values.


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


Take a list of integers; keep only numbers above 5, then remove repeated values.


Take a list of integers; exclude values of 5 and below, then unique values preserving order.


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


Take a list of integers; filter to keep only values above 5, then unique values preserving order.


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


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


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


Take a list of integers; drop duplicates but keep the first one, then get the negative numbers.


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


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


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


Take a list of integers; odd numbers only, then sort by descending values.


Take a list of integers; keep the odd numbers, then sort from highest to lowest.


Take a list of integers; odd numbers only, then sort descending.


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


Take a list of integers; odd numbers only, then sort in descending order.


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


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


Take a list of integers; pad with zeros to at least three elements, then find the first even number, defaulting to 0.


Take a list of integers; add zeros until the list has at least three values, then first even value zero if not found.


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


Take a list of integers; pad with zeros to at least three elements, then return the first even value (0 if none).


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


Take a list of integers; reverse the signs of everything, then give me a yes or no if the list is sorted.


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


Take a list of integers; reverse the signs of everything, then determine whether the list is sorted in ascending order from smallest to largest value.


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


Take a list of integers; reverse the signs of everything, then return whether the list is sorted ascending.


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


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


Take a list of integers; if empty, use a single zero, then remove repeated values.


Take a list of integers; if blank use 0, then unique values preserving order.


Take a list of integers; default to [0] when there is nothing, then remove repeated values.


Take a list of integers; when the list is empty, substitute a zero value, then unique values preserving order.


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


Take a list of integers; zero it out if it's empty, then unique values preserving order.


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


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


Take a list of integers; keep the odd numbers, then give the smallest value (0 if none).


Take a list of integers; odd numbers only, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; keep the odd numbers, then find the min, defaulting to 0.


Take a list of integers; odd numbers only, then minimum value, zero otherwise.


Take a list of integers; keep the odd numbers, then get the minimum value or zero if empty.


Take a list of integers; odd numbers only, then give me the min or 0.


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


Take a list of integers; keep the odd numbers, then return the minimum (0 if empty).


Take a list of strings; uppercase each string, then give back the lengthiest string.


Take a list of strings; make it all caps, then Longest string please.


Take a list of strings; convert each to upper case, then give back the lengthiest string.


Take a list of strings; change all strings to uppercase, then Longest string please.


Take a list of strings; make every string uppercase, then give back the lengthiest string.


Take a list of strings; uppercase each one, then Longest string please.


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


Take a list of strings; uppercase each string, then return the longest string (empty if none).


Take a list of integers; drop the first element, then multiply each by two.


Take a list of integers; Take everything except the first, then double each item in the list.


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


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


Take a list of integers; if empty, use a single zero, then flip the list around.


Take a list of integers; if blank use 0, then flip the order around.


Take a list of integers; default to [0] when there is nothing, then put the elements backwards.


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


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


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


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


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


Take a list of integers; drop the first element, then increase every value by 10.


Take a list of integers; Take everything except the first, then add 10 to each item.


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


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


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


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


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


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


Take a list of integers; add ten to each, then skip negatives at the start.


Take a list of integers; bump everything up by 10, then remove all negatives at the front.


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


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


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


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


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


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


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


Take a list of integers; reverse the signs of everything, then The biggest one, or 0 if it's empty.


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


Take a list of integers; reverse the signs of everything, then What's the max here.


Take a list of integers; negate each, then Return the max or 0 if empty.


Take a list of integers; reverse the signs of everything, then return the maximum (0 if empty).


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


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


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


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


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


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


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


Take a list of integers; strip the front negatives, then get the negative 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]
    return r


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


Take a list of integers; double each, then multiply them all together.


Take a list of integers; times two for each item, then multiply them all.


Take a list of integers; double each, then multiply all the numbers together.


Take a list of integers; times two for each item, then get the product.


Take a list of integers; double each, then find the product of these.


Take a list of integers; times two for each item, then return their product.


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


Take a list of integers; double each, then return their product.


Take a list of integers; drop duplicates keeping first occurrence, then check if zero appears.


Take a list of integers; drop duplicates but keep the first one, then find out whether there's a zero in here.


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


Take a list of integers; drop duplicates keeping first occurrence, then return whether the list contains a zero.


Take a list of integers; sort descending, then add them all up.


Take a list of integers; sort largest first, then add all those together.


Take a list of integers; sort in descending order, then give back the total.


Take a list of integers; sort from greatest to least, then sum r.


Take a list of integers; sort z to a, then add them up.


Take a list of integers; arrange in decreasing order, then calculate the sum of all elements.


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


Take a list of integers; sort descending, then return their sum.


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


Take a list of integers; keep the first 3 items, then turn positives to negatives and vice versa.


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


Take a list of integers; remove everything after the third, then turn positives to negatives and vice versa.


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


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then Lower each number by one.


Take a list of integers; drop duplicates keeping first occurrence, then reduce each by one.


Take a list of integers; drop duplicates but keep the first one, then Subtract 1 from all.


Take a list of integers; drop duplicates keeping first occurrence, then Subtract one from each.


Take a list of integers; drop duplicates but keep the first one, then Drop each by one.


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


Take a list of integers; drop duplicates keeping first occurrence, then subtract one from each.


Take a list of integers; cap each value at 10, then check that there are no duplicates.


Take a list of integers; clip values at 10, then are the values all unique.


Take a list of integers; cap each value at 10, then check if all values are unique.


Take a list of integers; clip values at 10, then return whether all values are distinct.


Take a list of integers; cap each value at 10, then tell me if values are distinct.


Take a list of integers; clip values at 10, then are all values distinct.


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


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


Take a list of integers; drop the zeros, then remove both ends.


Take a list of integers; keep only nonzero elements, then trim the edges.


Take a list of integers; drop the zeros, then trim one element off each end.


Take a list of integers; keep only nonzero elements, then cut off the first and last.


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


Take a list of integers; keep only nonzero elements, then keep only the middle part.


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


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


Take a list of integers; keep values greater than five, then take the final 3 elements.


Take a list of integers; filter out values less than or equal to 5, then drop everything except the final three.


Take a list of integers; keep only numbers above 5, then give me the last three elements.


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


Take a list of integers; remove anything 5 or less, then keep the final three items.


Take a list of integers; filter to keep only values above 5, then take the last three.


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


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


Take a list of integers; keep everything before the first zero, then multiply them all together.


Take a list of integers; take only what comes before the initial zero, then multiply them all.


Take a list of integers; cut the list at the first zero, then multiply all the numbers together.


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


Take a list of integers; take values up to (excluding) the first zero, then find the product of these.


Take a list of integers; keep the part before the first 0, then return their product.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then plus one for all.


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


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


Take a list of integers; sort by absolute value, then check if values are in increasing order.


Take a list of integers; rearrange by distance from zero, then give me a yes or no if the list is sorted.


Take a list of integers; arrange by magnitude ignoring sign, then is this list sorted.


Take a list of integers; put them in order by magnitude, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; arrange in order of absolute value, then tell me if it's sorted ascending.


Take a list of integers; sort by distance from zero, then return whether the list is sorted ascending.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    return r == sorted(r)


Take a list of integers; sort by absolute value, then return whether the list is sorted ascending.


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


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


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


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


Take a list of integers; sort descending, then order by distance from zero.


Take a list of integers; sort largest first, then sort based on absolute value.


Take a list of integers; sort in descending order, then organize by magnitude.


Take a list of integers; sort from greatest to least, then arrange by absolute value ascending.


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


Take a list of integers; arrange in decreasing order, then sort by absolute value.


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


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply all the numbers together.


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


Take a list of integers; drop duplicates keeping first occurrence, then find the product of these.


Take a list of integers; drop duplicates but keep the first one, then return their product.


def solve(xs):
    r = list(xs)
    r = list(dict.fromkeys(r))
    return __import__('math').prod(r)


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


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


Take a list of integers; Sort it from low to high, then take values while they are positive.


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


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


Take a list of integers; Sort in ascending order, then stop at first non positive.


Take a list of integers; I need this sorted ascending, then take while greater than zero.


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


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


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


Take a list of integers; rearrange by distance from zero, then exclude zeros.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; arrange in order of absolute value, then abs each element.


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


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


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


Take a list of integers; keep only the first three, then keep values divisible by 3.


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


Take a list of integers; take the first 3 elements, then drop anything not divisible by three.


Take a list of integers; remove everything after the third, then filter out everything except multiples of three.


Take a list of integers; truncate to three items, then keep only multiples of three.


Take a list of integers; show the first three, then multiples of three only.


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


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


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


Take a list of integers; convert to absolute value, then what's the even count.


Take a list of integers; strip the signs, then give the number of evens.


Take a list of integers; take abs of each, then find how many values are divisible by two.


Take a list of integers; get the absolute value of everything, then how many are even.


Take a list of integers; apply absolute value to the whole list, then get the total number of even values in the list.


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


Take a list of integers; take the absolute value of each, then return how many values are even.


Take a list of integers; add one to each, then flip the list around.


Take a list of integers; make each one bigger, then flip the order around.


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


Take a list of integers; make each one bigger, then reverse that for me.


Take a list of integers; add one to each, then flip it backwards.


Take a list of integers; make each one bigger, then make it backwards.


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


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


Take a list of strings; keep the first character of each (dropping empties), then concatenate with commas between.


Take a list of strings; extract initial letters, then add commas between items.


Take a list of strings; take each string's first letter, then return them as one comma-separated string.


Take a list of strings; give me the first letter of everything, then separate by comma.


Take a list of strings; reduce each string to its first character, then join with commas.


Take a list of strings; take first char drop blanks, then comma join.


def solve(xs):
    r = list(xs)
    r = [s[0] for s in r if s]
    return ','.join(r)


Take a list of strings; keep the first character of each (dropping empties), then join them with commas.


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


Take a list of integers; times two for each item, then sort based on absolute value.


Take a list of integers; double each, then organize by magnitude.


Take a list of integers; times two for each item, then arrange by absolute value ascending.


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


Take a list of integers; times two for each item, then sort by absolute value.


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


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


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


Take a list of integers; rearrange by distance from zero, then The biggest one, or 0 if it's empty.


Take a list of integers; arrange by magnitude ignoring sign, then Get the maximum value, or zero if there's nothing.


Take a list of integers; put them in order by magnitude, then What's the max here.


Take a list of integers; arrange in order of absolute value, then Return the max or 0 if empty.


Take a list of integers; sort by distance from zero, then return the maximum (0 if empty).


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


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


Take a list of integers; keep only the last three, then check if there is an even number.


Take a list of integers; keep the final three items, then find out whether any value is divisible by 2.


Take a list of integers; take the last three, then check if there is an even number.


Take a list of integers; trim to the last three, then find out whether any value is divisible by 2.


Take a list of integers; last three only, then check if there is an even number.


Take a list of integers; truncate to the last three items, then find out whether any value is divisible by 2.


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


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


Take a list of integers; reverse the order, then count the even numbers.


Take a list of integers; reverse, then what's the even count.


Take a list of integers; flip the list around, then give the number of evens.


Take a list of integers; flip the order around, then find how many values are divisible by two.


Take a list of integers; put the elements backwards, then how many are even.


Take a list of integers; reverse that for me, then get the total number of even values in the list.


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


Take a list of integers; reverse the order, then return how many values are even.


Take a list of integers; keep the negative numbers, then check if every number is above zero.


Take a list of integers; extract negatives, then verify that all values exceed zero.


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


Take a list of integers; extract negatives, then are they all above zero.


Take a list of integers; keep the negative numbers, then tell me if all numbers are greater than zero.


Take a list of integers; extract negatives, then return whether all values are positive.


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


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


Take a list of integers; sort ascending, then take the first 3 elements.


Take a list of integers; Sort it from low to high, then remove everything after the third.


Take a list of integers; arrange in increasing order, then truncate to three items.


Take a list of integers; Organize these ascending, then show the first three.


Take a list of integers; Sort in ascending order, then take the first three.


Take a list of integers; I need this sorted ascending, then keep first 3.


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


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


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


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


Take a list of integers; strip the signs, then remove repeated values.


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


Take a list of integers; get the absolute value of everything, then remove repeated values.


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


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


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


Take a list of integers; double each, then keep values above zero.


Take a list of integers; times two for each item, then filter for positive numbers.


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then check that there are no duplicates.


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


Take a list of integers; pad with zeros to at least three elements, then check if all values are unique.


Take a list of integers; add zeros until the list has at least three values, then return whether all values are distinct.


Take a list of integers; pad with zeros to at least three elements, then tell me if values are distinct.


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


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


Take a list of integers; pad with zeros to at least three elements, then return whether all values are distinct.


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


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


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


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


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


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


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


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


Take a list of integers; take values while they are positive, then remove all zero values.


Take a list of integers; take positive values then stop, then exclude zeros.


Take a list of integers; keep going while positive, then remove all zero values.


Take a list of integers; stop at first non positive, then exclude zeros.


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


Take a list of integers; take values while positive, then exclude zeros.


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


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


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


Take a list of strings; make it all caps, then give me the first letter of everything.


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


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


Take a list of strings; make every string uppercase, then keep first letters only.


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


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


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


Take a list of integers; keep values greater than five, then sort largest to smallest.


Take a list of integers; filter out values less than or equal to 5, then sort by descending values.


Take a list of integers; keep only numbers above 5, then sort from highest to lowest.


Take a list of integers; exclude values of 5 and below, then sort descending.


Take a list of integers; remove anything 5 or less, then sort largest first.


Take a list of integers; filter to keep only values above 5, then sort in descending order.


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


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


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


Take a list of integers; keep only nonzero elements, then find out whether any value is divisible by 2.


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


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


Take a list of integers; double each, then check if zero appears.


Take a list of integers; times two for each item, then find out whether there's a zero in here.


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


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


Take a list of integers; drop the first and last elements, then skip negatives at the start.


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


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


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


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


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


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 r


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


Take a list of integers; keep multiples of three, then check that there are no duplicates.


Take a list of integers; get rid of non-multiples of three, then are the values all unique.


Take a list of integers; keep values divisible by 3, then check if all values are unique.


Take a list of integers; keep items where x mod 3 equals zero, then return whether all values are distinct.


Take a list of integers; drop anything not divisible by three, then tell me if values are distinct.


Take a list of integers; filter out everything except multiples of three, then are all values distinct.


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


Take a list of integers; keep multiples of three, then return whether all values are distinct.


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


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


Take a list of integers; keep the negative numbers, then sort from highest to lowest.


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


Take a list of integers; keep the negative numbers, then sort largest first.


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


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


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


Take a list of integers; add one to each, then add them all up.


Take a list of integers; make each one bigger, then add all those together.


Take a list of integers; add one to each, then give back the total.


Take a list of integers; make each one bigger, then sum r.


Take a list of integers; add one to each, then add them up.


Take a list of integers; make each one bigger, then calculate the sum of all elements.


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


Take a list of integers; add one to each, then return their sum.


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


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


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


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


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


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


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


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


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


Take a list of integers; keep evens, then give me a yes or no if the list is sorted.


Take a list of integers; keep the even numbers, then is this list sorted.


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


Take a list of integers; keep the even numbers, then tell me if it's sorted ascending.


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


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


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


Take a list of integers; drop the first and last elements, then drop anything 5 or below.


Take a list of integers; take out the first and last items, then keep only numbers greater than 5.


Take a list of integers; remove both ends, then filter for numbers above 5.


Take a list of integers; trim the edges, then give me values where x is greater than 5.


Take a list of integers; trim one element off each end, then show me only the values that are bigger than five.


Take a list of integers; cut off the first and last, then keep values greater than five.


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


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


Take a list of strings; sort by length, shortest first, then give back the lengthiest string.


Take a list of strings; sort ascending by length, then Longest string please.


Take a list of strings; order strings from shortest to longest, then give back the lengthiest string.


Take a list of strings; shortest to longest, then Longest string please.


Take a list of strings; arrange by string length ascending, then give back the lengthiest string.


Take a list of strings; length sort, then Longest string please.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=len)
    return max(r, key=len) if r else ''


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


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


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


Take a list of integers; take the first 3 elements, then organize by magnitude.


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


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


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


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


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


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


Take a list of integers; get rid of anything that's not positive, then count them.


Take a list of integers; drop non-positive values, then what's the count.


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


Take a list of integers; filter out the negative ones, then what's left.


Take a list of integers; remove all negative values, then how many are left.


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


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


Take a list of integers; sort descending, then remove all zero values.


Take a list of integers; sort largest first, then exclude zeros.


Take a list of integers; sort in descending order, then remove all zero values.


Take a list of integers; sort from greatest to least, then exclude zeros.


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


Take a list of integers; arrange in decreasing order, then exclude zeros.


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


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


Take a list of strings; keep the first character of each (dropping empties), then keep only non-empty strings.


Take a list of strings; extract initial letters, then filter empty strings.


Take a list of strings; take each string's first letter, then remove empty strings from the list.


Take a list of strings; give me the first letter of everything, then clean up empty strings.


Take a list of strings; reduce each string to its first character, then delete empty entries.


Take a list of strings; take first char drop blanks, then drop empty strings.


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


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


Take a list of integers; keep only the last three, then keep values below zero.


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


Take a list of integers; take the last three, then keep values below zero.


Take a list of integers; trim to the last three, then get the negative numbers.


Take a list of integers; last three only, then keep values below zero.


Take a list of integers; truncate to the last three items, then get the negative numbers.


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


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


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


Take a list of integers; clip values at 10, then when the list is empty, substitute a zero value.


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


Take a list of integers; clip values at 10, then zero it out if it's empty.


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


Take a list of integers; clip values at 10, then default to zero when empty.


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


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


Take a list of integers; drop the leading negative values, then keep values divisible by 3.


Take a list of integers; cut the leading negatives, then keep items where x mod 3 equals zero.


Take a list of integers; skip negatives at the start, then drop anything not divisible by three.


Take a list of integers; remove all negatives at the front, then filter out everything except multiples of three.


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


Take a list of integers; strip the front negatives, then multiples of three only.


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


Take a list of integers; drop the leading negative values, then keep multiples of three.


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


Take a list of integers; make each one bigger, then give me a yes or no if the list is sorted.


Take a list of integers; add one to each, then is this list sorted.


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


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


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


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


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


Take a list of integers; double each, then clamp each to at most ten.


Take a list of integers; times two for each item, then don't let anything exceed 10.


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


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


Take a list of integers; drop the first and last elements, then sort smallest to largest.


Take a list of integers; take out the first and last items, then Ascending sort.


Take a list of integers; remove both ends, then Sort this ascending.


Take a list of integers; trim the edges, then Sort lowest to highest.


Take a list of integers; trim one element off each end, then Arrange from smallest to largest.


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


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


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


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


Take a list of integers; clip values at 10, then plus one for all.


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


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


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


Take a list of integers; reverse the signs of everything, then extract all even numbers.


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


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


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


Take a list of integers; times two for each item, then find out whether any value is divisible by 2.


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


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


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


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


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


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


Take a list of integers; drop the leading negative values, then check if values are in increasing order.


Take a list of integers; cut the leading negatives, then give me a yes or no if the list is sorted.


Take a list of integers; skip negatives at the start, then is this list sorted.


Take a list of integers; remove all negatives at the front, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; remove the initial run of negative numbers, then tell me if it's sorted ascending.


Take a list of integers; strip the front negatives, then return whether the list is sorted ascending.


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


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


Take a list of integers; drop the first and last elements, then return the length.


Take a list of integers; take out the first and last items, then count them.


Take a list of integers; remove both ends, then what's the count.


Take a list of integers; trim the edges, then return how many remain.


Take a list of integers; trim one element off each end, then what's left.


Take a list of integers; cut off the first and last, then how many are left.


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


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


Take a list of integers; sort descending, then keep values below zero.


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


Take a list of integers; sort in descending order, then keep values below zero.


Take a list of integers; sort from greatest to least, then get the negative numbers.


Take a list of integers; sort z to a, then keep values below zero.


Take a list of integers; arrange in decreasing order, then get the negative numbers.


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


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


Take a list of strings; prefix each with a hash, then convert each to lower case.


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


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


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


Take a list of people records (name, age); extract the ages, then add them all up.


Take a list of people records (name, age); show me all ages, then add all those together.


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


Take a list of people records (name, age); get the age field, then sum r.


Take a list of people records (name, age); keep just each person's age, then add them up.


Take a list of people records (name, age); extract age values, then calculate the sum of all elements.


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


Take a list of people records (name, age); extract the ages, then return their sum.


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


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


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


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


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


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


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


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


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


Take a list of integers; get rid of non-multiples of three, then count them.


Take a list of integers; keep values divisible by 3, then what's the count.


Take a list of integers; keep items where x mod 3 equals zero, then return how many remain.


Take a list of integers; drop anything not divisible by three, then what's left.


Take a list of integers; filter out everything except multiples of three, then how many are left.


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


Take a list of integers; keep multiples of three, then return how many remain.


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


Take a list of integers; Decrement all items, then turn positives to negatives and vice versa.


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


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


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


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


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


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


Take a list of strings; drop duplicate strings keeping the first, then add '#' to the start of each string.


Take a list of strings; dedupe, then make each one start with a hash.


Take a list of strings; remove duplicate strings keep first, then add '#' to the start of each string.


Take a list of strings; remove repeating strings first one stays, then make each one start with a hash.


Take a list of strings; delete duplicate strings keep the first one, then add '#' to the start of each string.


Take a list of strings; deduplicate the strings, then make each one start with a hash.


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


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


Take a list of integers; keep only the first three, then multiply them all together.


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


Take a list of integers; take the first 3 elements, then multiply all the numbers together.


Take a list of integers; remove everything after the third, then get the product.


Take a list of integers; truncate to three items, then find the product of these.


Take a list of integers; show the first three, then return their product.


def solve(xs):
    r = list(xs)
    r = r[:3]
    return __import__('math').prod(r)


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


Take a list of integers; sort descending, then check if values are in increasing order.


Take a list of integers; sort largest first, then give me a yes or no if the list is sorted.


Take a list of integers; sort in descending order, then is this list sorted.


Take a list of integers; sort from greatest to least, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; sort z to a, then tell me if it's sorted ascending.


Take a list of integers; arrange in decreasing order, then return whether the list is sorted ascending.


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


Take a list of integers; sort descending, then return whether the list is sorted ascending.


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


Take a list of integers; clip values at 10, then remove everything after the third.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then keep only odd values.


Take a list of integers; filter out values less than or equal to 5, then eliminate the even numbers.


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


Take a list of integers; exclude values of 5 and below, then eliminate the even numbers.


Take a list of integers; remove anything 5 or less, then keep only odd values.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; times two for each item, then make it backwards.


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


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


Take a list of integers; reverse the order, then take the final 3 elements.


Take a list of integers; reverse, then drop everything except the final three.


Take a list of integers; flip the list around, then give me the last three elements.


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


Take a list of integers; put the elements backwards, then keep the final three items.


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


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


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


Take a list of integers; square each, then add them all up.


Take a list of integers; each value squared, then add all those together.


Take a list of integers; multiply each value by itself, then give back the total.


Take a list of integers; square them all, then sum r.


Take a list of integers; raise each to the power of two, then add them up.


Take a list of integers; I need each number multiplied by itself, then calculate the sum of all elements.


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


Take a list of integers; square each, then return their sum.


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


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


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


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


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


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


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


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


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


Take a list of integers; Decrement all items, then what's the even count.


Take a list of integers; decrement each value, then give the number of evens.


Take a list of integers; Lower each number by one, then find how many values are divisible by two.


Take a list of integers; reduce each by one, then how many are even.


Take a list of integers; Subtract 1 from all, then get the total number of even values in the list.


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


Take a list of integers; subtract one from each, then return how many values are even.


Take a list of integers; subtract one from each, then remove repeated values.


Take a list of integers; Decrement all items, then unique values preserving order.


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


Take a list of integers; Lower each number by one, then unique values preserving order.


Take a list of integers; reduce each by one, then remove repeated values.


Take a list of integers; Subtract 1 from all, then unique values preserving order.


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


Take a list of integers; subtract one from each, then drop duplicates keeping first occurrence.


Take a list of integers; sort ascending, then keep values divisible by 3.


Take a list of integers; Sort it from low to high, then keep items where x mod 3 equals zero.


Take a list of integers; arrange in increasing order, then drop anything not divisible by three.


Take a list of integers; Organize these ascending, then filter out everything except multiples of three.


Take a list of integers; Sort in ascending order, then keep only multiples of three.


Take a list of integers; I need this sorted ascending, then multiples of three only.


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


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


Take a list of integers; negate each, then keep only odd values.


Take a list of integers; reverse the signs of everything, then eliminate the even numbers.


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


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


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


Take a list of integers; keep evens, then sort by descending values.


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


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


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


Take a list of integers; keep evens, then sort in descending order.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; Decrement all items, then keep only numbers greater than 5.


Take a list of integers; decrement each value, then filter for numbers above 5.


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


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


Take a list of integers; Subtract 1 from all, then keep values greater than five.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then sort by descending values.


Take a list of integers; pad with zeros to at least three elements, then sort from highest to lowest.


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


Take a list of integers; pad with zeros to at least three elements, then sort largest first.


Take a list of integers; add zeros until the list has at least three values, then sort in descending order.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep only nonzero elements, then first even value zero if not found.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the leading negative values, then cut the list at the first zero.


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


Take a list of integers; skip negatives at the start, then take values up to (excluding) the first zero.


Take a list of integers; remove all negatives at the front, then keep the part before the first 0.


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


Take a list of integers; strip the front negatives, then delete everything starting with 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 = r[:r.index(0)] if 0 in r else r
    return r


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


Take a list of integers; if empty, use a single zero, then check if there is an even number.


Take a list of integers; if blank use 0, then find out whether any value is divisible by 2.


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


Take a list of integers; when the list is empty, substitute a zero value, then find out whether any value is divisible by 2.


Take a list of integers; replace an empty list with one zero, then check if there is an even number.


Take a list of integers; zero it out if it's empty, then find out whether any value is divisible by 2.


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


Take a list of integers; if empty, use a single zero, then return whether any value is even.


Take a list of people records (name, age); sort records by age, youngest first, then count the records.


Take a list of people records (name, age); put the youngest at the top, then Get the length of records.


Take a list of people records (name, age); sort records by age, youngest first, then How many records are left.


Take a list of people records (name, age); put the youngest at the top, then Display the number of remaining records.


Take a list of people records (name, age); sort records by age, youngest first, then Show me the total number of records.


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


def solve(xs):
    r = list(xs)
    r = sorted(r, key=lambda d: d['age'])
    return len(r)


Take a list of people records (name, age); sort records by age, youngest first, then return how many records remain.


Take a list of people records (name, age); extract the ages, then check if every number is above zero.


Take a list of people records (name, age); show me all ages, then verify that all values exceed zero.


Take a list of people records (name, age); pluck the age field from each record, then are all values positive.


Take a list of people records (name, age); get the age field, then are they all above zero.


Take a list of people records (name, age); keep just each person's age, then tell me if all numbers are greater than zero.


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


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


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


Take a list of integers; keep the negative numbers, then give the smallest value (0 if none).


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


Take a list of integers; keep the negative numbers, then find the min, defaulting to 0.


Take a list of integers; extract negatives, then minimum value, zero otherwise.


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


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


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


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


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


Take a list of integers; bump everything up by 10, then first even value zero if not found.


Take a list of integers; increase every value by 10, then find the first even number, defaulting to 0.


Take a list of integers; add 10 to each item, then first even value zero if not found.


Take a list of integers; shift each up by ten, then find the first even number, defaulting to 0.


Take a list of integers; increase all numbers by 10, then first even value zero if not found.


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


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


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


Take a list of integers; get rid of anything that's not positive, then sort by descending values.


Take a list of integers; drop non-positive values, then sort from highest to lowest.


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


Take a list of integers; filter out the negative ones, then sort largest first.


Take a list of integers; remove all negative values, then sort in descending order.


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


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


Take a list of people records (name, age); extract the ages, then take the first 3 elements.


Take a list of people records (name, age); show me all ages, then remove everything after the third.


Take a list of people records (name, age); pluck the age field from each record, then truncate to three items.


Take a list of people records (name, age); get the age field, then show the first three.


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


Take a list of people records (name, age); extract age values, then keep first 3.


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


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


Take a list of integers; drop the leading negative values, then add them all up.


Take a list of integers; cut the leading negatives, then add all those together.


Take a list of integers; skip negatives at the start, then give back the total.


Take a list of integers; remove all negatives at the front, then sum r.


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


Take a list of integers; strip the front negatives, then calculate the sum of all elements.


def solve(xs):
    r = list(xs)
    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 leading negative values, then return their sum.


Take a list of integers; take the absolute value of each, then flip the sign of each.


Take a list of integers; convert to absolute value, then turn positives to negatives and vice versa.


Take a list of integers; strip the signs, then flip the sign of each.


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


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


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


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


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


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


Take a list of integers; filter out values less than or equal to 5, then give me a yes or no if the list is sorted.


Take a list of integers; keep only numbers above 5, then is this list sorted.


Take a list of integers; exclude values of 5 and below, then determine whether the list is sorted in ascending order from smallest to largest value.


Take a list of integers; remove anything 5 or less, then tell me if it's sorted ascending.


Take a list of integers; filter to keep only values above 5, then return whether the list is sorted ascending.


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


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


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


Take a list of integers; bump everything up by 10, then absolute value for all items.


Take a list of integers; increase every value by 10, then take absolute values.


Take a list of integers; add 10 to each item, then turn negatives into positives.


Take a list of integers; shift each up by ten, then abs each element.


Take a list of integers; increase all numbers by 10, then take the absolute value of each.


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


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


Take a list of integers; drop the zeros, then keep only even values.


Take a list of integers; keep only nonzero elements, then extract all even numbers.


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


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


Take a list of integers; keep the odd numbers, then give the largest value (0 if none).


Take a list of integers; odd numbers only, then The biggest one, or 0 if it's empty.


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


Take a list of integers; odd numbers only, then What's the max here.


Take a list of integers; keep the odd numbers, then Return the max or 0 if empty.


Take a list of integers; odd numbers only, then return the maximum (0 if empty).


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


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


Take a list of integers; negate each, then add them all up.


Take a list of integers; reverse the signs of everything, then add all those together.


Take a list of integers; negate each, then give back the total.


Take a list of integers; reverse the signs of everything, then sum r.


Take a list of integers; negate each, then add them up.


Take a list of integers; reverse the signs of everything, then calculate the sum of all elements.


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


Take a list of integers; negate each, then return their sum.


Take a list of people records (name, age); extract the ages, then keep values above zero.


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


Take a list of people records (name, age); pluck the age field from each record, then keep only positive numbers.


Take a list of people records (name, age); get the age field, then keep the positives.


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


Take a list of people records (name, age); extract age values, then keep the positive numbers.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d 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 keep the positive numbers.


Take a list of integers; keep values greater than five, then flip the list around.


Take a list of integers; filter out values less than or equal to 5, then flip the order around.


Take a list of integers; keep only numbers above 5, then put the elements backwards.


Take a list of integers; exclude values of 5 and below, then reverse that for me.


Take a list of integers; remove anything 5 or less, then flip it backwards.


Take a list of integers; filter to keep only values above 5, then make it backwards.


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


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


Take a list of integers; drop the zeros, then skip negatives at the start.


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


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


Take a list of integers; keep only nonzero elements, then strip the front negatives.


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


Take a list of integers; keep only nonzero elements, then drop negatives from start.


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


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


Take a list of integers; keep values greater than five, then multiply each value by itself.


Take a list of integers; filter out values less than or equal to 5, then square them all.


Take a list of integers; keep only numbers above 5, then raise each to the power of two.


Take a list of integers; exclude values of 5 and below, then I need each number multiplied by itself.


Take a list of integers; remove anything 5 or less, then square all of them.


Take a list of integers; filter to keep only values above 5, then multiply each element by itself.


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


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


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


Take a list of integers; clip values at 10, then trim the edges.


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


Take a list of integers; clip values at 10, then cut off the first and last.


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


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


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


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


Take a list of integers; drop the zeros, then increase every value by 10.


Take a list of integers; keep only nonzero elements, then add 10 to each item.


Take a list of integers; drop the zeros, then shift each up by ten.


Take a list of integers; keep only nonzero elements, then increase all numbers by 10.


Take a list of integers; drop the zeros, then add 10 to everything.


Take a list of integers; keep only nonzero elements, then give everything a boost of 10.


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


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


Take a list of integers; pad with zeros to at least three elements, then default to [0] when there is nothing.


Take a list of integers; add zeros until the list has at least three values, then when the list is empty, substitute a zero value.


Take a list of integers; pad with zeros to at least three elements, then replace an empty list with one zero.


Take a list of integers; add zeros until the list has at least three values, then zero it out if it's empty.


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


Take a list of integers; add zeros until the list has at least three values, then default to zero when empty.


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


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


Take a list of integers; keep values greater than five, then take the first 3 elements.


Take a list of integers; filter out values less than or equal to 5, then remove everything after the third.


Take a list of integers; keep only numbers above 5, then truncate to three items.


Take a list of integers; exclude values of 5 and below, then show the first three.


Take a list of integers; remove anything 5 or less, then take the first three.


Take a list of integers; filter to keep only values above 5, then keep first 3.


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


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


Take a list of integers; double each, then increase every value by 10.


Take a list of integers; times two for each item, then add 10 to each item.


Take a list of integers; double each, then shift each up by ten.


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


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


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


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


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


Take a list of integers; keep everything before the first zero, then give the smallest value (0 if none).


Take a list of integers; take only what comes before the initial zero, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; cut the list at the first zero, then find the min, defaulting to 0.


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


Take a list of integers; take values up to (excluding) the first zero, then get the minimum value or zero if empty.


Take a list of integers; keep the part before the first 0, then give me the min or 0.


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


Take a list of integers; keep everything before the first zero, then return the minimum (0 if empty).


Take a list of integers; add ten to each, then clamp each to at most ten.


Take a list of integers; bump everything up by 10, then don't let anything exceed 10.


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


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


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


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10.


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


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


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


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


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


Take a list of integers; drop duplicates but keep the first one, then keep going while positive.


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive.


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


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


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


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


Take a list of integers; filter out values less than or equal to 5, then what's the smallest element, or 0 if there's nothing.


Take a list of integers; keep only numbers above 5, then find the min, defaulting to 0.


Take a list of integers; exclude values of 5 and below, then minimum value, zero otherwise.


Take a list of integers; remove anything 5 or less, then get the minimum value or zero if empty.


Take a list of integers; filter to keep only values above 5, then give me the min or 0.


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


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


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


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


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


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


Take a list of integers; keep only the last three, then multiply each value by itself.


Take a list of integers; keep the final three items, then square them all.


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


Take a list of integers; trim to the last three, then I need each number multiplied by itself.


Take a list of integers; last three only, then square all of them.


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


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


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


Take a list of strings; lowercase each string, then concatenate with commas between.


Take a list of strings; change to lowercase, then add commas between items.


Take a list of strings; lowercase each string, then return them as one comma-separated string.


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


Take a list of strings; lowercase each string, then join with commas.


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


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


Take a list of strings; lowercase each string, then join them with commas.


Take a list of integers; negate each, then multiply them all together.


Take a list of integers; reverse the signs of everything, then multiply them all.


Take a list of integers; negate each, then multiply all the numbers together.


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


Take a list of integers; negate each, then find the product of these.


Take a list of integers; reverse the signs of everything, then return their product.


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


Take a list of integers; negate each, then return their product.


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


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


Take a list of integers; drop non-positive values, then keep only odd values.


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


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


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


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


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


Take a list of integers; sort ascending, then order by distance from zero.


Take a list of integers; Sort it from low to high, then sort based on absolute value.


Take a list of integers; arrange in increasing order, then organize by magnitude.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending.


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


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


def solve(xs):
    r = list(xs)
    r = sorted(r)
    r = sorted(r, key=abs)
    return r


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


Take a list of strings; prefix each with a hash, then convert each to upper case.


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


Take a list of strings; prefix each with a hash, then make every string uppercase.


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


Take a list of strings; prefix each with a hash, then make all the strings uppercase.


Take a list of strings; add # to the start of each string, then convert all strings to uppercase letters.


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


Take a list of strings; prefix each with a hash, then uppercase each string.


Take a list of people records (name, age); extract the ages, then check if there is an even number.


Take a list of people records (name, age); show me all ages, then find out whether any value is divisible by 2.


Take a list of people records (name, age); pluck the age field from each record, then check if there is an even number.


Take a list of people records (name, age); get the age field, then find out whether any value is divisible by 2.


Take a list of people records (name, age); keep just each person's age, then check if there is an even number.


Take a list of people records (name, age); extract age values, then find out whether any value is divisible by 2.


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


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


Take a list of integers; keep multiples of three, then sort largest to smallest.


Take a list of integers; get rid of non-multiples of three, then sort by descending values.


Take a list of integers; keep values divisible by 3, then sort from highest to lowest.


Take a list of integers; keep items where x mod 3 equals zero, then sort descending.


Take a list of integers; drop anything not divisible by three, then sort largest first.


Take a list of integers; filter out everything except multiples of three, then sort in descending order.


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


Take a list of integers; keep multiples of three, then sort descending.


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


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


Take a list of integers; sort in descending order, then check if there is an even number.


Take a list of integers; sort from greatest to least, then find out whether any value is divisible by 2.


Take a list of integers; sort z to a, then check if there is an even number.


Take a list of integers; arrange in decreasing order, then find out whether any value is divisible by 2.


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


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


Take a list of integers; drop the first and last elements, then check that there are no duplicates.


Take a list of integers; take out the first and last items, then are the values all unique.


Take a list of integers; remove both ends, then check if all values are unique.


Take a list of integers; trim the edges, then return whether all values are distinct.