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


Take a list of integers; sort ascending, then clamp each to at most ten, then take values up to (excluding) the first zero.


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then keep the part before the first 0.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then truncate at the first zero.


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then delete everything starting with the first zero.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then remove from the first zero onwards.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then up to but not including the first zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then give the number of evens.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then find how many values are divisible by two.


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then how many are even.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then get the total number of even values in the list.


Take a list of integers; pad with zeros to at least three elements, then keep values below zero, then give me the count of even values.


Take a list of integers; add zeros until the list has at least three values, then get the negative numbers, then I need to know how many of these are even.


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


Take a list of integers; pad with zeros to at least three elements, then keep the negative numbers, then return how many values are even.


Take a list of integers; keep multiples of three, then order by distance from zero, then reduce each by one.


Take a list of integers; get rid of non-multiples of three, then sort based on absolute value, then Subtract 1 from all.


Take a list of integers; keep values divisible by 3, then organize by magnitude, then Subtract one from each.


Take a list of integers; keep items where x mod 3 equals zero, then arrange by absolute value ascending, then Drop each by one.


Take a list of integers; drop anything not divisible by three, then sort from smallest to largest absolute value, then Decrease all values by one.


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


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


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


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then truncate to the last three items.


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


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then remove all but the last three.


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


Take a list of integers; drop duplicates keeping first occurrence, then increment each value, then drop everything except the final three.


Take a list of integers; drop duplicates but keep the first one, then plus one for all, then give me the last three elements.


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


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


Take a list of integers; double each, then increase every value by 10, then skip the first one.


Take a list of integers; times two for each item, then add 10 to each item, then Discard the first element.


Take a list of integers; double each, then shift each up by ten, then skip the first one.


Take a list of integers; times two for each item, then increase all numbers by 10, then Discard the first element.


Take a list of integers; double each, then add 10 to everything, then skip the first one.


Take a list of integers; times two for each item, then give everything a boost of 10, then Discard the first element.


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


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


Take a list of people records (name, age); extract the ages, then remove the first item, then replace an empty list with one zero.


Take a list of people records (name, age); show me all ages, then Remove head, then zero it out if it's empty.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item, then use zero if the list is empty.


Take a list of people records (name, age); get the age field, then Remove head, then default to zero when empty.


Take a list of people records (name, age); keep just each person's age, then remove the first item, then if there's nothing, put in a zero.


Take a list of people records (name, age); extract age values, then Remove head, then if no items, add a zero.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then remove all zero values, then shift each up by ten.


Take a list of integers; filter out values less than or equal to 5, then exclude zeros, then increase all numbers by 10.


Take a list of integers; keep only numbers above 5, then remove all zero values, then add 10 to everything.


Take a list of integers; exclude values of 5 and below, then exclude zeros, then give everything a boost of 10.


Take a list of integers; remove anything 5 or less, then remove all zero values, then increment each by ten.


Take a list of integers; filter to keep only values above 5, then exclude zeros, then add a constant 10 to each.


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


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


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


Take a list of integers; keep the final three items, then absolute value for all items, then exclude values of 5 and below.


Take a list of integers; take the last three, then take absolute values, then remove anything 5 or less.


Take a list of integers; trim to the last three, then turn negatives into positives, then filter to keep only values above 5.


Take a list of integers; last three only, then abs each element, then get rid of values that aren't greater than five.


Take a list of integers; truncate to the last three items, then take the absolute value of each, then drop anything 5 or below.


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


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


Take a list of integers; sort by absolute value, then make every value non-negative, then true only if all are positive.


Take a list of integers; rearrange by distance from zero, then absolute value for all items, then do all of these have positive values.


Take a list of integers; arrange by magnitude ignoring sign, then take absolute values, then check if every value is positive.


Take a list of integers; put them in order by magnitude, then turn negatives into positives, then confirm all values are positive.


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


Take a list of integers; sort by distance from zero, then take the absolute value of each, then check if every number is above zero.


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


Take a list of integers; sort by absolute value, then take the absolute value of each, then return whether all values are positive.


Take a list of integers; keep the negative numbers, then sort smallest to largest, then make each twice as big.


Take a list of integers; extract negatives, then Ascending sort, then multiply each by 2.


Take a list of integers; keep the negative numbers, then Sort this ascending, then make each twice as big.


Take a list of integers; extract negatives, then Sort lowest to highest, then multiply each by 2.


Take a list of integers; keep the negative numbers, then Arrange from smallest to largest, then make each twice as big.


Take a list of integers; extract negatives, then sort ascending, then multiply each by 2.


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


Take a list of integers; keep the negative numbers, then sort ascending, then double each.


Take a list of integers; keep only the last three, then extend to length 3 using zeros, then put the elements backwards.


Take a list of integers; keep the final three items, then pad to 3, then reverse that for me.


Take a list of integers; take the last three, then extend to length 3 using zeros, then flip it backwards.


Take a list of integers; trim to the last three, then pad to 3, then make it backwards.


Take a list of integers; last three only, then extend to length 3 using zeros, then reverse the list.


Take a list of integers; truncate to the last three items, then pad to 3, then invert the sequence.


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


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


Take a list of integers; subtract one from each, then sort smallest to largest, then limit every value to 10.


Take a list of integers; Decrement all items, then Ascending sort, then maximum of 10 for all.


Take a list of integers; decrement each value, then Sort this ascending, then limit every value to 10.


Take a list of integers; Lower each number by one, then Sort lowest to highest, then maximum of 10 for all.


Take a list of integers; reduce each by one, then Arrange from smallest to largest, then limit every value to 10.


Take a list of integers; Subtract 1 from all, then sort ascending, then maximum of 10 for all.


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


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


Take a list of integers; take the absolute value of each, then keep the leading run of positive numbers, then ensure at least three items by appending zeros.


Take a list of integers; convert to absolute value, then take values while they are positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; strip the signs, then take positive values then stop, then ensure at least three items by appending zeros.


Take a list of integers; take abs of each, then keep going while positive, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; get the absolute value of everything, then stop at first non positive, then ensure at least three items by appending zeros.


Take a list of integers; apply absolute value to the whole list, then take while greater than zero, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of strings; drop duplicate strings keeping the first, then convert each to upper case, then prepend a hash mark to each.


Take a list of strings; dedupe, then change all strings to uppercase, then prefix all with #.


Take a list of strings; remove duplicate strings keep first, then make every string uppercase, then prepend a hash mark to each.


Take a list of strings; remove repeating strings first one stays, then uppercase each one, then prefix all with #.


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


Take a list of strings; deduplicate the strings, then convert all strings to uppercase letters, then prefix all with #.


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


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


Take a list of integers; sort by absolute value, then remove repeated values, then truncate to the last three items.


Take a list of integers; rearrange by distance from zero, then unique values preserving order, then show only the last three.


Take a list of integers; arrange by magnitude ignoring sign, then remove repeated values, then remove all but the last three.


Take a list of integers; put them in order by magnitude, then unique values preserving order, then take the final 3 elements.


Take a list of integers; arrange in order of absolute value, then remove repeated values, then drop everything except the final three.


Take a list of integers; sort by distance from zero, then unique values preserving order, then give me the last three elements.


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


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


Take a list of integers; double each, then decrement each value, then keep only numbers above 5.


Take a list of integers; times two for each item, then Lower each number by one, then exclude values of 5 and below.


Take a list of integers; double each, then reduce each by one, then remove anything 5 or less.


Take a list of integers; times two for each item, then Subtract 1 from all, then filter to keep only values above 5.


Take a list of integers; double each, then Subtract one from each, then get rid of values that aren't greater than five.


Take a list of integers; times two for each item, then Drop each by one, then drop anything 5 or below.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then give the earliest even value or zero.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then fetch the first even element, default to 0.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then give the earliest even value or zero.


Take a list of people records (name, age); get the age field, then extract all even numbers, then fetch the first even element, default to 0.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then give the earliest even value or zero.


Take a list of people records (name, age); extract age values, then extract all even numbers, then fetch the first even element, default to 0.


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then return the first even value (0 if none).


Take a list of integers; double each, then default to [0] when there is nothing, then drop the odd numbers.


Take a list of integers; times two for each item, then when the list is empty, substitute a zero value, then filter out the odd numbers.


Take a list of integers; double each, then replace an empty list with one zero, then drop the odd numbers.


Take a list of integers; times two for each item, then zero it out if it's empty, then filter out the odd numbers.


Take a list of integers; double each, then use zero if the list is empty, then drop the odd numbers.


Take a list of integers; times two for each item, then default to zero when empty, then filter out the odd numbers.


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


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


Take a list of integers; sort descending, then remove repeated values, then give back the product of all values.


Take a list of integers; sort largest first, then unique values preserving order, then product of the list.


Take a list of integers; sort in descending order, then remove repeated values, then what's the product.


Take a list of integers; sort from greatest to least, then unique values preserving order, then what do they multiply to.


Take a list of integers; sort z to a, then remove repeated values, then give me their product.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then multiply them all together.


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


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


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


Take a list of integers; keep the first 3 items, then eliminate the even numbers, then drop the negative numbers.


Take a list of integers; take the first 3 elements, then keep only odd values, then filter out the negative ones.


Take a list of integers; remove everything after the third, then eliminate the even numbers, then remove all negative values.


Take a list of integers; truncate to three items, then keep only odd values, then keep positive values only.


Take a list of integers; show the first three, then eliminate the even numbers, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = r[:3]
    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 only the first three, then keep the odd numbers, then keep the positive numbers.


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


Take a list of integers; odd numbers only, then flip the order around, then remove repeats.


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


Take a list of integers; odd numbers only, then reverse that for me, then remove repeats.


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


Take a list of integers; odd numbers only, then make it backwards, then remove repeats.


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


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


Take a list of integers; drop the zeros, then keep values divisible by 3, then true if every value is unique.


Take a list of integers; keep only nonzero elements, then keep items where x mod 3 equals zero, then check for duplicates in the values.


Take a list of integers; drop the zeros, then drop anything not divisible by three, then do all values appear only once.


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then check that there are no duplicates.


Take a list of integers; drop the zeros, then keep only multiples of three, then are the values all unique.


Take a list of integers; keep only nonzero elements, then multiples of three only, then check if all values are unique.


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


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


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then negate.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then zero it out if it's empty, then negate.


Take a list of integers; drop the zeros, then use zero if the list is empty, then multiply each by -1.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then negate.


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


Take a list of integers; drop the zeros, then if empty, use a single zero, then negate each.


Take a list of integers; keep everything before the first zero, then decrement each value, then true if already sorted smallest to largest.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then does this list go in ascending order.


Take a list of integers; cut the list at the first zero, then reduce each by one, then check if the list is in ascending order.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then is the list sorted.


Take a list of integers; take values up to (excluding) the first zero, then Subtract one from each, then is it sorted.


Take a list of integers; keep the part before the first 0, then Drop each by one, then check if values are in increasing order.


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


Take a list of integers; keep everything before the first zero, then subtract one from each, then return whether the list is sorted ascending.


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


Take a list of integers; drop duplicates but keep the first one, then keep items where x mod 3 equals zero, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; drop duplicates keeping first occurrence, then drop anything not divisible by three, then ensure at least three items by appending zeros.


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


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


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


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


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


Take a list of people records (name, age); extract the ages, then flip the list around, then drop non-positive values.


Take a list of people records (name, age); show me all ages, then flip the order around, then drop the negative numbers.


Take a list of people records (name, age); pluck the age field from each record, then put the elements backwards, then filter out the negative ones.


Take a list of people records (name, age); get the age field, then reverse that for me, then remove all negative values.


Take a list of people records (name, age); keep just each person's age, then flip it backwards, then keep positive values only.


Take a list of people records (name, age); extract age values, then make it backwards, then keep values above zero.


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


Take a list of people records (name, age); extract the ages, then reverse the order, then keep the positive numbers.


Take a list of integers; sort by absolute value, then cut the list at the first zero, then strip the signs.


Take a list of integers; rearrange by distance from zero, then cut off after the first zero appears, then take abs of each.


Take a list of integers; arrange by magnitude ignoring sign, then take values up to (excluding) the first zero, then get the absolute value of everything.


Take a list of integers; put them in order by magnitude, then keep the part before the first 0, then apply absolute value to the whole list.


Take a list of integers; arrange in order of absolute value, then truncate at the first zero, then make them all positive.


Take a list of integers; sort by distance from zero, then delete everything starting with the first zero, then make every value non-negative.


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


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


Take a list of integers; negate each, then remove both ends, then give the number of evens.


Take a list of integers; reverse the signs of everything, then trim the edges, then find how many values are divisible by two.


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


Take a list of integers; reverse the signs of everything, then cut off the first and last, then get the total number of even values in the list.


Take a list of integers; negate each, then remove the first and last elements, then give me the count of even values.


Take a list of integers; reverse the signs of everything, then keep only the middle part, then I need to know how many of these are even.


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


Take a list of integers; negate each, then drop the first and last elements, then return how many values are even.


Take a list of integers; reverse the order, then remove all zero values, then stop at the first non-positive value.


Take a list of integers; reverse, then exclude zeros, then keep the leading run of positive numbers.


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


Take a list of integers; flip the order around, then exclude zeros, then take positive values then stop.


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


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


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


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


Take a list of integers; keep the positive numbers, then flip the sign of each, then arrange in decreasing order.


Take a list of integers; get rid of anything that's not positive, then turn positives to negatives and vice versa, then arrange in descending order.


Take a list of integers; drop non-positive values, then flip the sign of each, then reverse sort.


Take a list of integers; drop the negative numbers, then turn positives to negatives and vice versa, then sort largest to smallest.


Take a list of integers; filter out the negative ones, then flip the sign of each, then sort by descending values.


Take a list of integers; remove all negative values, then turn positives to negatives and vice versa, then sort from highest to lowest.


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


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


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


Take a list of integers; take out the first and last items, then flip the order around, then how many items remain.


Take a list of integers; remove both ends, then put the elements backwards, then tell me the length.


Take a list of integers; trim the edges, then reverse that for me, then return the length.


Take a list of integers; trim one element off each end, then flip it backwards, then count them.


Take a list of integers; cut off the first and last, then make it backwards, then what's the count.


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


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


Take a list of strings; trim whitespace from each, then remove repeated strings, then true if a blank string is present.


Take a list of strings; strip whitespace from every element, then keep unique strings first appearance, then check for empty strings in the list.


Take a list of strings; remove surrounding whitespace, then eliminate repeated strings preserve first occurrence, then check if there's an empty string.


Take a list of strings; trim the whitespace off everything, then drop duplicate strings keeping the first, then does the collection contain an empty string value somewhere.


Take a list of strings; strip spaces from all strings, then dedupe, then whether any element is blank.


Take a list of strings; strip all the strings, then remove duplicate strings keep first, then check for an empty string.


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


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


Take a list of integers; take values while they are positive, then extend to length 3 using zeros, then true if already sorted smallest to largest.


Take a list of integers; take positive values then stop, then pad to 3, then does this list go in ascending order.


Take a list of integers; keep going while positive, then extend to length 3 using zeros, then check if the list is in ascending order.


Take a list of integers; stop at first non positive, then pad to 3, then is the list sorted.


Take a list of integers; take while greater than zero, then extend to length 3 using zeros, then is it sorted.


Take a list of integers; take values while positive, then pad to 3, then check if values are in increasing order.


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


Take a list of integers; take values while they are positive, then pad with zeros to at least three elements, then return whether the list is sorted ascending.


Take a list of integers; keep the odd numbers, then make every value non-negative, then true only if all are positive.


Take a list of integers; odd numbers only, then absolute value for all items, then do all of these have positive values.


Take a list of integers; keep the odd numbers, then take absolute values, then check if every value is positive.


Take a list of integers; odd numbers only, then turn negatives into positives, then confirm all values are positive.


Take a list of integers; keep the odd numbers, then abs each element, then all positive.


Take a list of integers; odd numbers only, then take the absolute value of each, then check if every number is above zero.


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


Take a list of integers; keep the odd numbers, then take the absolute value of each, then return whether all values are positive.


Take a list of integers; double each, then remove both ends, then true if every value is unique.


Take a list of integers; times two for each item, then trim the edges, then check for duplicates in the values.


Take a list of integers; double each, then trim one element off each end, then do all values appear only once.


Take a list of integers; times two for each item, then cut off the first and last, then check that there are no duplicates.


Take a list of integers; double each, then remove the first and last elements, then are the values all unique.


Take a list of integers; times two for each item, then keep only the middle part, then check if all values are unique.


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


Take a list of integers; double each, then drop the first and last elements, then return whether all values are distinct.


Take a list of integers; keep multiples of three, then increment each value, then count the elements.


Take a list of integers; get rid of non-multiples of three, then plus one for all, then how many items remain.


Take a list of integers; keep values divisible by 3, then increment each value, then tell me the length.


Take a list of integers; keep items where x mod 3 equals zero, then plus one for all, then return the length.


Take a list of integers; drop anything not divisible by three, then increment each value, then count them.


Take a list of integers; filter out everything except multiples of three, then plus one for all, then what's the count.


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


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


Take a list of integers; sort descending, then keep only odd values, then give the number of evens.


Take a list of integers; sort largest first, then eliminate the even numbers, then find how many values are divisible by two.


Take a list of integers; sort in descending order, then keep only odd values, then how many are even.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then get the total number of even values in the list.


Take a list of integers; sort z to a, then keep only odd values, then give me the count of even values.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then I need to know how many of these are even.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then Lower each number by one, then how many items remain.


Take a list of integers; pad with zeros to at least three elements, then reduce each by one, then tell me the length.


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


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


Take a list of integers; add zeros until the list has at least three values, then Drop each by one, then what's the count.


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 len(r)


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


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


Take a list of integers; keep only nonzero elements, then remove everything after the third, then strip out the evens.


Take a list of integers; drop the zeros, then truncate to three items, then drop the even numbers.


Take a list of integers; keep only nonzero elements, then show the first three, then strip out the evens.


Take a list of integers; drop the zeros, then take the first three, then drop the even numbers.


Take a list of integers; keep only nonzero elements, then keep first 3, then strip out the evens.


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


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


Take a list of integers; keep the even numbers, then clamp each to at most ten, then give back the total.


Take a list of integers; keep evens, then don't let anything exceed 10, then sum r.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then add them up.


Take a list of integers; keep evens, then don't let anything exceed 10, then calculate the sum of all elements.


Take a list of integers; keep the even numbers, then clamp each to at most ten, then what's the total.


Take a list of integers; keep evens, then don't let anything exceed 10, then what do they add up to.


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


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


Take a list of integers; drop the leading negative values, then remove the first item, then count the elements.


Take a list of integers; cut the leading negatives, then Remove head, then how many items remain.


Take a list of integers; skip negatives at the start, then remove the first item, then tell me the length.


Take a list of integers; remove all negatives at the front, then Remove head, then return the length.


Take a list of integers; remove the initial run of negative numbers, then remove the first item, then count them.


Take a list of integers; strip the front negatives, then Remove head, then what's the count.


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


Take a list of integers; drop the leading negative values, then drop the first element, then return how many remain.


Take a list of integers; reverse the order, then sort largest to smallest, then drop non-negative values.


Take a list of integers; reverse, then sort by descending values, then drop all positive numbers.


Take a list of integers; flip the list around, then sort from highest to lowest, then drop non-negative values.


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


Take a list of integers; put the elements backwards, then sort largest first, then drop non-negative values.


Take a list of integers; reverse that for me, then sort in descending order, then drop all positive numbers.


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


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


Take a list of integers; take values while they are positive, then extend to length 3 using zeros, then take values up to (excluding) the first zero.


Take a list of integers; take positive values then stop, then pad to 3, then keep the part before the first 0.


Take a list of integers; keep going while positive, then extend to length 3 using zeros, then truncate at the first zero.


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


Take a list of integers; take while greater than zero, then extend to length 3 using zeros, then remove from the first zero onwards.


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


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


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


Take a list of integers; take values while they are positive, then remove both ends, then shift each up by ten.


Take a list of integers; take positive values then stop, then trim the edges, then increase all numbers by 10.


Take a list of integers; keep going while positive, then trim one element off each end, then add 10 to everything.


Take a list of integers; stop at first non positive, then cut off the first and last, then give everything a boost of 10.


Take a list of integers; take while greater than zero, then remove the first and last elements, then increment each by ten.


Take a list of integers; take values while positive, then keep only the middle part, then add a constant 10 to each.


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


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


Take a list of integers; if empty, use a single zero, then keep values divisible by 3, then reduce each by one.


Take a list of integers; if blank use 0, then keep items where x mod 3 equals zero, then Subtract 1 from all.


Take a list of integers; default to [0] when there is nothing, then drop anything not divisible by three, then Subtract one from each.


Take a list of integers; when the list is empty, substitute a zero value, then filter out everything except multiples of three, then Drop each by one.


Take a list of integers; replace an empty list with one zero, then keep only multiples of three, then Decrease all values by one.


Take a list of integers; zero it out if it's empty, then multiples of three only, then Remove one from each value.


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


Take a list of integers; if empty, use a single zero, then keep multiples of three, then subtract one from each.


Take a list of integers; add one to each, then increase every value by 10, then find the min, defaulting to 0.


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


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


Take a list of integers; make each one bigger, then increase all numbers by 10, then give me the min or 0.


Take a list of integers; add one to each, then add 10 to everything, then return the smallest number, defaulting to 0.


Take a list of integers; make each one bigger, then give everything a boost of 10, then return smallest or zero if empty.


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


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


Take a list of integers; keep only the last three, then take the first 3 elements, then remove the initial run of negative numbers.


Take a list of integers; keep the final three items, then remove everything after the third, then strip the front negatives.


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


Take a list of integers; trim to the last three, then show the first three, then drop negatives from start.


Take a list of integers; last three only, then take the first three, then strip negative values from the start.


Take a list of integers; truncate to the last three items, then keep first 3, then remove negatives before the first non-negative.


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


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


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


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


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


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


Take a list of integers; cap each value at 10, then make every value non-negative, then keep only numbers above 5.


Take a list of integers; clip values at 10, then absolute value for all items, then exclude values of 5 and below.


Take a list of integers; cap each value at 10, then take absolute values, then remove anything 5 or less.


Take a list of integers; clip values at 10, then turn negatives into positives, then filter to keep only values above 5.


Take a list of integers; cap each value at 10, then abs each element, then get rid of values that aren't greater than five.


Take a list of integers; clip values at 10, then take the absolute value of each, then drop anything 5 or below.


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


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


Take a list of integers; double each, then multiply each value by itself, then arrange in decreasing order.


Take a list of integers; times two for each item, then square them all, then arrange in descending order.


Take a list of integers; double each, then raise each to the power of two, then reverse sort.


Take a list of integers; times two for each item, then I need each number multiplied by itself, then sort largest to smallest.


Take a list of integers; double each, then square all of them, then sort by descending values.


Take a list of integers; times two for each item, then multiply each element by itself, then sort from highest to lowest.


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


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


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


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


Take a list of integers; keep only numbers above 5, then Sort this ascending, then drop non-negative values.


Take a list of integers; exclude values of 5 and below, then Sort lowest to highest, then drop all positive numbers.


Take a list of integers; remove anything 5 or less, then Arrange from smallest to largest, then drop non-negative values.


Take a list of integers; filter to keep only values above 5, then sort ascending, then drop all positive numbers.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then drop everything except the final three, then keep the part before the first 0.


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


Take a list of integers; add zeros until the list has at least three values, then keep only the last three, then delete everything starting with the first zero.


Take a list of integers; pad with zeros to at least three elements, then keep the final three items, then remove from the first zero onwards.


Take a list of integers; add zeros until the list has at least three values, then take the last three, then up to but not including the first zero.


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


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


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


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


Take a list of integers; arrange in increasing order, then increment each value, then use zero if the list is empty.


Take a list of integers; Organize these ascending, then plus one for all, then default to zero when empty.


Take a list of integers; Sort in ascending order, then increment each value, then if there's nothing, put in a zero.


Take a list of integers; I need this sorted ascending, then plus one for all, then if no items, add a zero.


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


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


Take a list of people records (name, age); extract the ages, then keep values above zero, then make each twice as big.


Take a list of people records (name, age); show me all ages, then filter for positive numbers, then multiply each by 2.


Take a list of people records (name, age); pluck the age field from each record, then keep only positive numbers, then make each twice as big.


Take a list of people records (name, age); get the age field, then keep the positives, then multiply each by 2.


Take a list of people records (name, age); keep just each person's age, then remove negatives, then make each twice as big.


Take a list of people records (name, age); extract age values, then keep the positive numbers, then multiply each by 2.


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


Take a list of people records (name, age); extract the ages, then keep the positive numbers, then double each.


Take a list of integers; sort descending, then remove repeated values, then true if every value is unique.


Take a list of integers; sort largest first, then unique values preserving order, then check for duplicates in the values.


Take a list of integers; sort in descending order, then remove repeated values, then do all values appear only once.


Take a list of integers; sort from greatest to least, then unique values preserving order, then check that there are no duplicates.


Take a list of integers; sort z to a, then remove repeated values, then are the values all unique.


Take a list of integers; arrange in decreasing order, then unique values preserving order, then check if all values are unique.


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


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


Take a list of integers; if empty, use a single zero, then cut the list at the first zero, then arrange in increasing order.


Take a list of integers; if blank use 0, then cut off after the first zero appears, then Organize these ascending.


Take a list of integers; default to [0] when there is nothing, then take values up to (excluding) the first zero, then Sort in ascending order.


Take a list of integers; when the list is empty, substitute a zero value, then keep the part before the first 0, then I need this sorted ascending.


Take a list of integers; replace an empty list with one zero, then truncate at the first zero, then Put these in ascending order.


Take a list of integers; zero it out if it's empty, then delete everything starting with the first zero, then sort smallest to largest.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the even numbers, then increment each value, then drop non-negative values.


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


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


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


Take a list of integers; keep everything before the first zero, then flip the sign of each, then truncate to the last three items.


Take a list of integers; take only what comes before the initial zero, then turn positives to negatives and vice versa, then show only the last three.


Take a list of integers; cut the list at the first zero, then flip the sign of each, then remove all but the last three.


Take a list of integers; cut off after the first zero appears, then turn positives to negatives and vice versa, then take the final 3 elements.


Take a list of integers; take values up to (excluding) the first zero, then flip the sign of each, then drop everything except the final three.


Take a list of integers; keep the part before the first 0, then turn positives to negatives and vice versa, then give me the last three elements.


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


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


Take a list of integers; sort ascending, then drop anything 5 or below, then shift each up by ten.


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


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


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


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


Take a list of integers; I need this sorted ascending, then keep values greater than five, then add a constant 10 to each.


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


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


Take a list of integers; negate each, then cut the list at the first zero, then skip the first one.


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


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


Take a list of integers; reverse the signs of everything, then keep the part before the first 0, then Discard the first element.


Take a list of integers; negate each, then truncate at the first zero, then skip the first one.


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


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


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


Take a list of integers; add one to each, then keep values divisible by 3, then arrange in decreasing order.


Take a list of integers; make each one bigger, then keep items where x mod 3 equals zero, then arrange in descending order.


Take a list of integers; add one to each, then drop anything not divisible by three, then reverse sort.


Take a list of integers; make each one bigger, then filter out everything except multiples of three, then sort largest to smallest.


Take a list of integers; add one to each, then keep only multiples of three, then sort by descending values.


Take a list of integers; make each one bigger, then multiples of three only, then sort from highest to lowest.


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


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


Take a list of integers; keep everything before the first zero, then keep values above zero, then true only if all are positive.


Take a list of integers; take only what comes before the initial zero, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; cut the list at the first zero, then keep only positive numbers, then check if every value is positive.


Take a list of integers; cut off after the first zero appears, then keep the positives, then confirm all values are positive.


Take a list of integers; take values up to (excluding) the first zero, then remove negatives, then all positive.


Take a list of integers; keep the part before the first 0, then keep the positive numbers, then check if every number is above zero.


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


Take a list of integers; keep everything before the first zero, then keep the positive numbers, then return whether all values are positive.


Take a list of integers; keep everything before the first zero, then decrement each value, then true if at least one even value.


Take a list of integers; take only what comes before the initial zero, then Lower each number by one, then any even.


Take a list of integers; cut the list at the first zero, then reduce each by one, then true if at least one even value.


Take a list of integers; cut off after the first zero appears, then Subtract 1 from all, then any even.


Take a list of integers; take values up to (excluding) the first zero, then Subtract one from each, then true if at least one even value.


Take a list of integers; keep the part before the first 0, then Drop each by one, then any even.


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


Take a list of integers; keep everything before the first zero, then subtract one from each, then return whether any value is even.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then strip the signs.


Take a list of integers; extract negatives, then don't let anything exceed 10, then take abs of each.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then get the absolute value of everything.


Take a list of integers; extract negatives, then don't let anything exceed 10, then apply absolute value to the whole list.


Take a list of integers; keep the negative numbers, then clamp each to at most ten, then make them all positive.


Take a list of integers; extract negatives, then don't let anything exceed 10, then make every value non-negative.


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


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


Take a list of integers; drop the leading negative values, then sort smallest to largest, then strip the signs.


Take a list of integers; cut the leading negatives, then Ascending sort, then take abs of each.


Take a list of integers; skip negatives at the start, then Sort this ascending, then get the absolute value of everything.


Take a list of integers; remove all negatives at the front, then Sort lowest to highest, then apply absolute value to the whole list.


Take a list of integers; remove the initial run of negative numbers, then Arrange from smallest to largest, then make them all positive.


Take a list of integers; strip the front negatives, then sort ascending, then make every value non-negative.


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


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


Take a list of integers; pad with zeros to at least three elements, then drop anything 5 or below, then strip the signs.


Take a list of integers; add zeros until the list has at least three values, then keep only numbers greater than 5, then take abs of each.


Take a list of integers; pad with zeros to at least three elements, then filter for numbers above 5, then get the absolute value of everything.


Take a list of integers; add zeros until the list has at least three values, then give me values where x is greater than 5, then apply absolute value to the whole list.


Take a list of integers; pad with zeros to at least three elements, then show me only the values that are bigger than five, then make them all positive.


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


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


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


Take a list of integers; keep the negative numbers, then flip the sign of each, then shift each up by ten.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then increase all numbers by 10.


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


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


Take a list of integers; keep the negative numbers, then flip the sign of each, then increment each by ten.


Take a list of integers; extract negatives, then turn positives to negatives and vice versa, then add a constant 10 to each.


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


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


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


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


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


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


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


Take a list of integers; make each one bigger, then keep values greater than five, then what's the count.


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


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


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


Take a list of integers; sort largest first, then eliminate the even numbers, then remove repeats.


Take a list of integers; sort in descending order, then keep only odd values, then deduplicate the list.


Take a list of integers; sort from greatest to least, then eliminate the even numbers, then remove repeats.


Take a list of integers; sort z to a, then keep only odd values, then deduplicate the list.


Take a list of integers; arrange in decreasing order, then eliminate the even numbers, then remove repeats.


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


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


Take a list of integers; drop the first and last elements, then remove the first item, then multiply each by -1.


Take a list of integers; take out the first and last items, then Remove head, then negate.


Take a list of integers; remove both ends, then remove the first item, then multiply each by -1.


Take a list of integers; trim the edges, then Remove head, then negate.


Take a list of integers; trim one element off each end, then remove the first item, then multiply each by -1.


Take a list of integers; cut off the first and last, then Remove head, then negate.


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


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


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


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


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


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


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


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


def solve(xs):
    r = list(xs)
    r = r[1:-1]
    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 first and last elements, then keep the negative numbers, then keep the even numbers.


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


Take a list of integers; make each one bigger, then remove everything after the third, then negate.


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


Take a list of integers; make each one bigger, then show the first three, then negate.


Take a list of integers; add one to each, then take the first three, then multiply each by -1.


Take a list of integers; make each one bigger, then keep first 3, then negate.


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


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


Take a list of integers; keep the positive numbers, then drop anything 5 or below, then drop anything not divisible by three.


Take a list of integers; get rid of anything that's not positive, then keep only numbers greater than 5, then filter out everything except multiples of three.


Take a list of integers; drop non-positive values, then filter for numbers above 5, then keep only multiples of three.


Take a list of integers; drop the negative numbers, then give me values where x is greater than 5, then multiples of three only.


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


Take a list of integers; remove all negative values, then keep values greater than five, then give me only the values divisible by three.


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


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


Take a list of integers; keep multiples of three, then flip the sign of each, then bump each up by one.


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


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


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


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


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


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


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


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


Take a list of integers; keep the first 3 items, then double each item in the list, then put them in order by magnitude.


Take a list of integers; take the first 3 elements, then multiply each by two, then arrange in order of absolute value.


Take a list of integers; remove everything after the third, then double each item in the list, then sort by distance from zero.


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


Take a list of integers; show the first three, then double each item in the list, then order by distance from zero.


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


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


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


Take a list of integers; Take everything except the first, then extract all even numbers, then keep the leading run of positive numbers.


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


Take a list of integers; Take everything except the first, then extract all even numbers, then take positive values then stop.


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


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


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


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


Take a list of strings; lowercase each string, then order the strings A to Z, then deduplicate the strings.


Take a list of strings; change to lowercase, then make it alphabetical, then filter out duplicate strings retain first.


Take a list of strings; lowercase each string, then order the strings A to Z, then strip duplicates preserve order.


Take a list of strings; change to lowercase, then make it alphabetical, then remove repeated strings.


Take a list of strings; lowercase each string, then order the strings A to Z, then keep unique strings first appearance.


Take a list of strings; change to lowercase, then make it alphabetical, then eliminate repeated strings preserve first occurrence.


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


Take a list of strings; lowercase each string, then sort alphabetically, then drop duplicate strings keeping the first.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then keep only the last three, then filter out the odd numbers.


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


Take a list of integers; add zeros until the list has at least three values, then take the last three, then filter out the odd numbers.


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


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


Take a list of integers; sort by absolute value, then remove the first item, then put the elements backwards.


Take a list of integers; rearrange by distance from zero, then Remove head, then reverse that for me.


Take a list of integers; arrange by magnitude ignoring sign, then remove the first item, then flip it backwards.


Take a list of integers; put them in order by magnitude, then Remove head, then make it backwards.


Take a list of integers; arrange in order of absolute value, then remove the first item, then reverse the list.


Take a list of integers; sort by distance from zero, then Remove head, then invert the sequence.


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


Take a list of integers; sort by absolute value, then drop the first element, then reverse the order.


Take a list of integers; keep the positive numbers, then multiply each value by itself, then shift each up by ten.


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


Take a list of integers; drop non-positive values, then raise each to the power of two, then add 10 to everything.


Take a list of integers; drop the negative numbers, then I need each number multiplied by itself, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then square all of them, then increment each by ten.


Take a list of integers; remove all negative values, then multiply each element by itself, then add a constant 10 to each.


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


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


Take a list of strings; keep the first character of each (dropping empties), then add '#' to the start of each string, then make every string lowercase.


Take a list of strings; extract initial letters, then make each one start with a hash, then make it all lowercase.


Take a list of strings; take each string's first letter, then add '#' to the start of each string, then make every string lowercase.


Take a list of strings; give me the first letter of everything, then make each one start with a hash, then make it all lowercase.


Take a list of strings; reduce each string to its first character, then add '#' to the start of each string, then make every string lowercase.


Take a list of strings; take first char drop blanks, then make each one start with a hash, then make it all lowercase.


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


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


Take a list of integers; keep the odd numbers, then keep values divisible by 3, then multiply each by -1.


Take a list of integers; odd numbers only, then keep items where x mod 3 equals zero, then negate.


Take a list of integers; keep the odd numbers, then drop anything not divisible by three, then multiply each by -1.


Take a list of integers; odd numbers only, then filter out everything except multiples of three, then negate.


Take a list of integers; keep the odd numbers, then keep only multiples of three, then multiply each by -1.


Take a list of integers; odd numbers only, then multiples of three only, then negate.


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


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


Take a list of integers; keep only the last three, then take the first 3 elements, then stop at the first non-positive value.


Take a list of integers; keep the final three items, then remove everything after the third, then keep the leading run of positive numbers.


Take a list of integers; take the last three, then truncate to three items, then take values while they are positive.


Take a list of integers; trim to the last three, then show the first three, then take positive values then stop.


Take a list of integers; last three only, then take the first three, then keep going while positive.


Take a list of integers; truncate to the last three items, then keep first 3, then stop at first non positive.


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


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


Take a list of integers; reverse the order, then order by distance from zero, then count the elements.


Take a list of integers; reverse, then sort based on absolute value, then how many items remain.


Take a list of integers; flip the list around, then organize by magnitude, then tell me the length.


Take a list of integers; flip the order around, then arrange by absolute value ascending, then return the length.


Take a list of integers; put the elements backwards, then sort from smallest to largest absolute value, then count them.


Take a list of integers; reverse that for me, then sort by absolute value, then what's the count.


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


Take a list of integers; reverse the order, then sort by absolute value, then return how many remain.


Take a list of strings; lowercase each string, then strip spaces around each string, then return them as one comma-separated string.


Take a list of strings; change to lowercase, then remove leading and trailing spaces, then separate by comma.


Take a list of strings; lowercase each string, then remove whitespace from each item, then join with commas.


Take a list of strings; change to lowercase, then clean whitespace from each entry, then comma join.


Take a list of strings; lowercase each string, then trim each string, then combine using commas.


Take a list of strings; change to lowercase, then trim whitespace from each, then connect with commas between each item.


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


Take a list of strings; lowercase each string, then trim whitespace from each, then join them with commas.


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


Take a list of integers; convert to absolute value, then remove everything after the third, then remove repeats.


Take a list of integers; strip the signs, then truncate to three items, then deduplicate the list.


Take a list of integers; take abs of each, then show the first three, then remove repeats.


Take a list of integers; get the absolute value of everything, then take the first three, then deduplicate the list.


Take a list of integers; apply absolute value to the whole list, then keep first 3, then remove repeats.


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


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


Take a list of integers; keep everything before the first zero, then take the final 3 elements, then arrange in decreasing order.


Take a list of integers; take only what comes before the initial zero, then drop everything except the final three, then arrange in descending order.


Take a list of integers; cut the list at the first zero, then give me the last three elements, then reverse sort.


Take a list of integers; cut off after the first zero appears, then keep only the last three, then sort largest to smallest.


Take a list of integers; take values up to (excluding) the first zero, then keep the final three items, then sort by descending values.


Take a list of integers; keep the part before the first 0, then take the last three, then sort from highest to lowest.


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


Take a list of integers; keep everything before the first zero, then keep only the last three, then sort descending.


Take a list of integers; keep everything before the first zero, then drop anything 5 or below, then give back the total.


Take a list of integers; take only what comes before the initial zero, then keep only numbers greater than 5, then sum r.


Take a list of integers; cut the list at the first zero, then filter for numbers above 5, then add them up.


Take a list of integers; cut off after the first zero appears, then give me values where x is greater than 5, then calculate the sum of all elements.


Take a list of integers; take values up to (excluding) the first zero, then show me only the values that are bigger than five, then what's the total.


Take a list of integers; keep the part before the first 0, then keep values greater than five, then what do they add up to.


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


Take a list of integers; keep everything before the first zero, then keep values greater than five, then return their sum.


Take a list of people records (name, age); extract the ages, then take the final 3 elements, then keep only numbers above 5.


Take a list of people records (name, age); show me all ages, then drop everything except the final three, then exclude values of 5 and below.


Take a list of people records (name, age); pluck the age field from each record, then give me the last three elements, then remove anything 5 or less.


Take a list of people records (name, age); get the age field, then keep only the last three, then filter to keep only values above 5.


Take a list of people records (name, age); keep just each person's age, then keep the final three items, then get rid of values that aren't greater than five.


Take a list of people records (name, age); extract age values, then take the last three, then drop anything 5 or below.


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


Take a list of people records (name, age); extract the ages, then keep only the last three, then keep values greater than five.


Take a list of integers; drop the first and last elements, then extend to length 3 using zeros, then arrange by magnitude ignoring sign.


Take a list of integers; take out the first and last items, then pad to 3, then put them in order by magnitude.


Take a list of integers; remove both ends, then extend to length 3 using zeros, then arrange in order of absolute value.


Take a list of integers; trim the edges, then pad to 3, then sort by distance from zero.


Take a list of integers; trim one element off each end, then extend to length 3 using zeros, then order by how far from zero.


Take a list of integers; cut off the first and last, then pad to 3, then order by distance from zero.


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


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


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


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


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


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


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


Take a list of integers; keep evens, then turn positives to negatives and vice versa, then what's the count.


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


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


Take a list of integers; keep only the first three, then take the final 3 elements, then ensure at least three items by appending zeros.


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


Take a list of integers; take the first 3 elements, then give me the last three elements, then ensure at least three items by appending zeros.


Take a list of integers; remove everything after the third, then keep only the last three, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; truncate to three items, then keep the final three items, then ensure at least three items by appending zeros.


Take a list of integers; show the first three, then take the last three, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort ascending, then multiply each by two, then strip the signs.


Take a list of integers; Sort it from low to high, then double each item in the list, then take abs of each.


Take a list of integers; arrange in increasing order, then multiply each by two, then get the absolute value of everything.


Take a list of integers; Organize these ascending, then double each item in the list, then apply absolute value to the whole list.


Take a list of integers; Sort in ascending order, then multiply each by two, then make them all positive.


Take a list of integers; I need this sorted ascending, then double each item in the list, then make every value non-negative.


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


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


Take a list of integers; keep everything before the first zero, then flip the sign of each, then trim one element off each end.


Take a list of integers; take only what comes before the initial zero, then turn positives to negatives and vice versa, then cut off the first and last.


Take a list of integers; cut the list at the first zero, then flip the sign of each, then remove the first and last elements.


Take a list of integers; cut off after the first zero appears, then turn positives to negatives and vice versa, then keep only the middle part.


Take a list of integers; take values up to (excluding) the first zero, then flip the sign of each, then drop first and last.


Take a list of integers; keep the part before the first 0, then turn positives to negatives and vice versa, then eliminate the outermost elements.


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


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


Take a list of integers; double each, then keep values below zero, then put the elements backwards.


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


Take a list of integers; double each, then keep values below zero, then flip it backwards.


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


Take a list of integers; double each, then keep values below zero, then reverse the list.


Take a list of integers; times two for each item, then get the negative numbers, then invert the sequence.


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


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


Take a list of people records (name, age); extract the ages, then multiply each value by itself, then give back the total.


Take a list of people records (name, age); show me all ages, then square them all, then sum r.


Take a list of people records (name, age); pluck the age field from each record, then raise each to the power of two, then add them up.


Take a list of people records (name, age); get the age field, then I need each number multiplied by itself, then calculate the sum of all elements.


Take a list of people records (name, age); keep just each person's age, then square all of them, then what's the total.


Take a list of people records (name, age); extract age values, then multiply each element by itself, then what do they add up to.


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


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


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


Take a list of integers; Decrement all items, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of integers; decrement each value, then clamp each to at most ten, then remove anything 5 or less.


Take a list of integers; Lower each number by one, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; reduce each by one, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; Subtract 1 from all, then don't let anything exceed 10, then drop anything 5 or below.


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


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


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


Take a list of integers; take out the first and last items, then cut off after the first zero appears, then zero it out if it's empty.


Take a list of integers; remove both ends, then take values up to (excluding) the first zero, then use zero if the list is empty.


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


Take a list of integers; trim one element off each end, then truncate at the first zero, then if there's nothing, put in a zero.


Take a list of integers; cut off the first and last, then delete everything starting with the first zero, then if no items, add a zero.


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


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


Take a list of strings; drop duplicate strings keeping the first, then convert each to lower case, then arrange in lexicographic order.


Take a list of strings; dedupe, then lowercase each one, then sort by letter.


Take a list of strings; remove duplicate strings keep first, then convert each to lower case, then arrange in lexicographic order.


Take a list of strings; remove repeating strings first one stays, then lowercase each one, then sort by letter.


Take a list of strings; delete duplicate strings keep the first one, then convert each to lower case, then arrange in lexicographic order.


Take a list of strings; deduplicate the strings, then lowercase each one, then sort by letter.


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


Take a list of strings; drop duplicate strings keeping the first, then lowercase each string, then sort alphabetically.


Take a list of integers; keep the even numbers, then skip negatives at the start, then multiply each by -1.


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


Take a list of integers; keep the even numbers, then remove the initial run of negative numbers, then multiply each by -1.


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


Take a list of integers; keep the even numbers, then remove leading negative numbers, then multiply each by -1.


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


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


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


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


Take a list of integers; extract negatives, then sort by descending values, then does this list go in ascending order.


Take a list of integers; keep the negative numbers, then sort from highest to lowest, then check if the list is in ascending order.


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


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


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


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


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