Take a list of integers; cut off after the first zero appears, then extract all even numbers, then drop negatives from start.


Take a list of integers; take values up to (excluding) the first zero, then keep only even values, then strip negative values from the start.


Take a list of integers; keep the part before the first 0, then extract all even numbers, then remove negatives before the first non-negative.


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


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


Take a list of integers; double each, then keep only even values, then replace an empty list with one zero.


Take a list of integers; times two for each item, then extract all even numbers, then zero it out if it's empty.


Take a list of integers; double each, then keep only even values, then use zero if the list is empty.


Take a list of integers; times two for each item, then extract all even numbers, then default to zero when empty.


Take a list of integers; double each, then keep only even values, then if there's nothing, put in a zero.


Take a list of integers; times two for each item, then extract all even numbers, then if no items, add a zero.


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


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


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


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


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


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


Take a list of integers; add ten to each, then keep values divisible by 3, then give the earliest even value or zero.


Take a list of integers; bump everything up by 10, then keep items where x mod 3 equals zero, then fetch the first even element, default to 0.


Take a list of integers; increase every value by 10, then drop anything not divisible by three, then give the earliest even value or zero.


Take a list of integers; add 10 to each item, then filter out everything except multiples of three, then fetch the first even element, default to 0.


Take a list of integers; shift each up by ten, then keep only multiples of three, then give the earliest even value or zero.


Take a list of integers; increase all numbers by 10, then multiples of three only, then fetch the first even element, default to 0.


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


Take a list of integers; add ten to each, then keep multiples of three, then return the first even value (0 if none).


Take a list of integers; take values while they are positive, then sort largest to smallest, then remove the initial run of negative numbers.


Take a list of integers; take positive values then stop, then sort by descending values, then strip the front negatives.


Take a list of integers; keep going while positive, then sort from highest to lowest, then remove leading negative numbers.


Take a list of integers; stop at first non positive, then sort descending, then drop negatives from start.


Take a list of integers; take while greater than zero, then sort largest first, then strip negative values from the start.


Take a list of integers; take values while positive, then sort in descending order, then remove negatives before the first 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, reverse=True)
    r = r[next((i for i, x in enumerate(r) if x >= 0), len(r)):]
    return r


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


Take a list of integers; add ten to each, then keep values above zero, then strip the signs.


Take a list of integers; bump everything up by 10, then filter for positive numbers, then take abs of each.


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


Take a list of integers; add 10 to each item, then keep the positives, then apply absolute value to the whole list.


Take a list of integers; shift each up by ten, then remove negatives, then make them all positive.


Take a list of integers; increase all numbers by 10, then keep the positive numbers, then make every value non-negative.


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


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


Take a list of integers; keep the odd numbers, then keep values below zero, then skip the first one.


Take a list of integers; odd numbers only, then get the negative numbers, then Discard the first element.


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


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


Take a list of integers; double each, then sort smallest to largest, then give back the total.


Take a list of integers; times two for each item, then Ascending sort, then sum r.


Take a list of integers; double each, then Sort this ascending, then add them up.


Take a list of integers; times two for each item, then Sort lowest to highest, then calculate the sum of all elements.


Take a list of integers; double each, then Arrange from smallest to largest, then what's the total.


Take a list of integers; times two for each item, then sort ascending, then what do they add up to.


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


Take a list of integers; double each, then sort ascending, then return their sum.


Take a list of integers; take values while they are positive, then keep only even values, then remove the initial run of negative numbers.


Take a list of integers; take positive values then stop, then extract all even numbers, then strip the front negatives.


Take a list of integers; keep going while positive, then keep only even values, then remove leading negative numbers.


Take a list of integers; stop at first non positive, then extract all even numbers, then drop negatives from start.


Take a list of integers; take while greater than zero, then keep only even values, then strip negative values from the start.


Take a list of integers; take values while positive, then extract all even numbers, then remove negatives before the first non-negative.


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


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


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


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


Take a list of integers; take the last three, then drop anything not divisible by three, then tell me the length.


Take a list of integers; trim to the last three, then filter out everything except multiples of three, then return the length.


Take a list of integers; last three only, then keep only multiples of three, then count them.


Take a list of integers; truncate to the last three items, then multiples of three only, then what's the count.


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


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


Take a list of integers; drop the zeros, then skip negatives at the start, then true if already sorted smallest to largest.


Take a list of integers; keep only nonzero elements, then remove all negatives at the front, then does this list go in ascending order.


Take a list of integers; drop the zeros, then remove the initial run of negative numbers, then check if the list is in ascending order.


Take a list of integers; keep only nonzero elements, then strip the front negatives, then is the list sorted.


Take a list of integers; drop the zeros, then remove leading negative numbers, then is it sorted.


Take a list of integers; keep only nonzero elements, then drop negatives from start, then check if values are in increasing order.


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


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


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


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


Take a list of people records (name, age); pluck the age field from each record, then increment each value, then add them up.


Take a list of people records (name, age); get the age field, then plus one for all, then calculate the sum of all elements.


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


Take a list of people records (name, age); extract age values, then plus one for all, then what do they add up to.


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


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


Take a list of integers; keep only the first three, then sort largest to smallest, then true if already sorted smallest to largest.


Take a list of integers; keep the first 3 items, then sort by descending values, then does this list go in ascending order.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then check if the list is in ascending order.


Take a list of integers; remove everything after the third, then sort descending, then is the list sorted.


Take a list of integers; truncate to three items, then sort largest first, then is it sorted.


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


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


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


Take a list of integers; drop the first element, then order by distance from zero, then drop the even numbers.


Take a list of integers; Take everything except the first, then sort based on absolute value, then strip out the evens.


Take a list of integers; drop the first element, then organize by magnitude, then drop the even numbers.


Take a list of integers; Take everything except the first, then arrange by absolute value ascending, then strip out the evens.


Take a list of integers; drop the first element, then sort from smallest to largest absolute value, then drop the even numbers.


Take a list of integers; Take everything except the first, then sort by absolute value, then strip out the evens.


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


Take a list of integers; drop the first element, then sort by absolute value, then keep the odd numbers.


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


Take a list of integers; keep the first 3 items, then Lower each number by one, then minimum value, zero otherwise.


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


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


Take a list of integers; truncate to three items, then Subtract one from each, then return the smallest number, defaulting to 0.


Take a list of integers; show the first three, then Drop each by one, then return smallest or zero if empty.


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


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


Take a list of integers; keep multiples of three, then remove the first item, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of non-multiples of three, then Remove head, then put them in order by magnitude.


Take a list of integers; keep values divisible by 3, then remove the first item, then arrange in order of absolute value.


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


Take a list of integers; drop anything not divisible by three, then remove the first item, then order by how far from zero.


Take a list of integers; filter out everything except multiples of three, then Remove head, then order by distance from zero.


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


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


Take a list of integers; reverse the order, then keep values divisible by 3, then take values up to (excluding) the first zero.


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


Take a list of integers; flip the list around, then drop anything not divisible by three, then truncate at the first zero.


Take a list of integers; flip the order around, then filter out everything except multiples of three, then delete everything starting with the first zero.


Take a list of integers; put the elements backwards, then keep only multiples of three, then remove from the first zero onwards.


Take a list of integers; reverse that for me, then multiples of three only, then up to but not including the first zero.


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


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


Take a list of integers; square each, then sort largest to smallest, then stop at the first non-positive value.


Take a list of integers; each value squared, then sort by descending values, then keep the leading run of positive numbers.


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then take values while they are positive.


Take a list of integers; square them all, then sort descending, then take positive values then stop.


Take a list of integers; raise each to the power of two, then sort largest first, then keep going while positive.


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then stop at first non positive.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then increase every value by 10, then trim one element off each end.


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


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


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


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


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


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


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


Take a list of integers; keep the odd numbers, then increase every value by 10, then take values up to (excluding) the first zero.


Take a list of integers; odd numbers only, then add 10 to each item, then keep the part before the first 0.


Take a list of integers; keep the odd numbers, then shift each up by ten, then truncate at the first zero.


Take a list of integers; odd numbers only, then increase all numbers by 10, then delete everything starting with the first zero.


Take a list of integers; keep the odd numbers, then add 10 to everything, then remove from the first zero onwards.


Take a list of integers; odd numbers only, then give everything a boost of 10, then up to but not including the first zero.


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


Take a list of integers; keep the odd numbers, then add ten to each, then keep everything before the first zero.


Take a list of integers; keep everything before the first zero, then increment each value, then true if any value equals zero.


Take a list of integers; take only what comes before the initial zero, then plus one for all, then check for zero.


Take a list of integers; cut the list at the first zero, then increment each value, then true if any value equals zero.


Take a list of integers; cut off after the first zero appears, then plus one for all, then check for zero.


Take a list of integers; take values up to (excluding) the first zero, then increment each value, then true if any value equals zero.


Take a list of integers; keep the part before the first 0, then plus one for all, then check for zero.


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 0 in r


Take a list of integers; keep everything before the first zero, then add one to each, then return whether the list contains a zero.


Take a list of integers; sort by absolute value, then clamp each to at most ten, then find the max, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then don't let anything exceed 10, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange by magnitude ignoring sign, then clamp each to at most ten, then What's the highest number in the list.


Take a list of integers; put them in order by magnitude, then don't let anything exceed 10, then Return the greatest value or default to 0.


Take a list of integers; arrange in order of absolute value, then clamp each to at most ten, then Find the largest element, defaulting to zero.


Take a list of integers; sort by distance from zero, then don't let anything exceed 10, then give the largest value (0 if none).


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


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


Take a list of integers; add ten to each, then sort smallest to largest, then trim one element off each end.


Take a list of integers; bump everything up by 10, then Ascending sort, then cut off the first and last.


Take a list of integers; increase every value by 10, then Sort this ascending, then remove the first and last elements.


Take a list of integers; add 10 to each item, then Sort lowest to highest, then keep only the middle part.


Take a list of integers; shift each up by ten, then Arrange from smallest to largest, then drop first and last.


Take a list of integers; increase all numbers by 10, then sort ascending, then eliminate the outermost elements.


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


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


Take a list of integers; sort by absolute value, then keep only even values, then keep only non-zero numbers.


Take a list of integers; rearrange by distance from zero, then extract all even numbers, then strip the zeros.


Take a list of integers; arrange by magnitude ignoring sign, then keep only even values, then keep only non-zero numbers.


Take a list of integers; put them in order by magnitude, then extract all even numbers, then strip the zeros.


Take a list of integers; arrange in order of absolute value, then keep only even values, then keep only non-zero numbers.


Take a list of integers; sort by distance from zero, then extract all even numbers, then strip the zeros.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    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; sort by absolute value, then keep the even numbers, then drop the zeros.


Take a list of integers; negate each, then keep only even values, then arrange in decreasing order.


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


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


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


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


Take a list of integers; reverse the signs of everything, then extract all even numbers, then sort from highest to lowest.


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


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


Take a list of integers; drop the first and last elements, then remove all zero values, then arrange by magnitude ignoring sign.


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


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


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


Take a list of integers; trim one element off each end, then remove all zero values, then order by how far from zero.


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


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


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


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


Take a list of integers; Sort it from low to high, then don't let anything exceed 10, then exclude values of 5 and below.


Take a list of integers; arrange in increasing order, then clamp each to at most ten, then remove anything 5 or less.


Take a list of integers; Organize these ascending, then don't let anything exceed 10, then filter to keep only values above 5.


Take a list of integers; Sort in ascending order, then clamp each to at most ten, then get rid of values that aren't greater than five.


Take a list of integers; I need this sorted ascending, then don't let anything exceed 10, then drop anything 5 or below.


def solve(xs):
    r = list(xs)
    r = sorted(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; sort ascending, then cap each value at 10, then keep values greater than five.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; drop the first element, then take values up to (excluding) the first zero, then keep only multiples of three.


Take a list of integers; Take everything except the first, then keep the part before the first 0, then multiples of three only.


Take a list of integers; drop the first element, then truncate at the first zero, then filter for numbers divisible by three.


Take a list of integers; Take everything except the first, then delete everything starting with the first zero, then give me only the values divisible by three.


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


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


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


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


Take a list of integers; flip the list around, then Sort this ascending, then What's the highest number in the list.


Take a list of integers; flip the order around, then Sort lowest to highest, then Return the greatest value or default to 0.


Take a list of integers; put the elements backwards, then Arrange from smallest to largest, then Find the largest element, defaulting to zero.


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


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


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


Take a list of strings; sort alphabetically, then convert each to upper case, then find the longest one, defaulting to empty.


Take a list of strings; arrange alphabetically, then change all strings to uppercase, then Longest string, or nothing if there isn't one.


Take a list of strings; sort alphabetically, then make every string uppercase, then find the longest one, defaulting to empty.


Take a list of strings; arrange alphabetically, then uppercase each one, then Longest string, or nothing if there isn't one.


Take a list of strings; sort alphabetically, then make all the strings uppercase, then find the longest one, defaulting to empty.


Take a list of strings; arrange alphabetically, then convert all strings to uppercase letters, then Longest string, or nothing if there isn't one.


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


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


Take a list of integers; keep the positive numbers, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; get rid of anything that's not positive, then pad to 3, then check for zero.


Take a list of integers; drop non-positive values, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; drop the negative numbers, then pad to 3, then check for zero.


Take a list of integers; filter out the negative ones, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; remove all negative values, then pad to 3, then check for zero.


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


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


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


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


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


Take a list of integers; flip the order around, then don't let anything exceed 10, then strip the zeros.


Take a list of integers; put the elements backwards, then clamp each to at most ten, then keep only non-zero numbers.


Take a list of integers; reverse that for me, then don't let anything exceed 10, then strip the zeros.


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


Take a list of integers; reverse the order, then cap each value at 10, then drop the zeros.


Take a list of integers; add one to each, then keep values below zero, then limit every value to 10.


Take a list of integers; make each one bigger, then get the negative numbers, then maximum of 10 for all.


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


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


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


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


Take a list of integers; take the first 3 elements, then keep only even values, then Sort in ascending order.


Take a list of integers; remove everything after the third, then extract all even numbers, then I need this sorted ascending.


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


Take a list of integers; show the first three, then extract all even numbers, then sort smallest to largest.


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


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


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


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


Take a list of integers; remove both ends, then replace an empty list with one zero, then multiply each by -1.


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


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


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


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


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


Take a list of integers; take the absolute value of each, then multiply each by two, then keep only numbers above 5.


Take a list of integers; convert to absolute value, then double each item in the list, then exclude values of 5 and below.


Take a list of integers; strip the signs, then multiply each by two, then remove anything 5 or less.


Take a list of integers; take abs of each, then double each item in the list, then filter to keep only values above 5.


Take a list of integers; get the absolute value of everything, then multiply each by two, then get rid of values that aren't greater than five.


Take a list of integers; apply absolute value to the whole list, then double each item in the list, then drop anything 5 or below.


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


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


Take a list of integers; keep the positive numbers, then take the first 3 elements, then true only if all are positive.


Take a list of integers; get rid of anything that's not positive, then remove everything after the third, then do all of these have positive values.


Take a list of integers; drop non-positive values, then truncate to three items, then check if every value is positive.


Take a list of integers; drop the negative numbers, then show the first three, then confirm all values are positive.


Take a list of integers; filter out the negative ones, then take the first three, then all positive.


Take a list of integers; remove all negative values, then keep first 3, then check if every number is above zero.


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then keep only non-zero numbers.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then strip the zeros.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then keep only non-zero numbers.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then strip the zeros.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five, then keep only non-zero numbers.


Take a list of integers; strip the front negatives, then keep values greater than five, then strip the zeros.


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


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


Take a list of integers; sort by absolute value, then multiply each value by itself, then true if every value is unique.


Take a list of integers; rearrange by distance from zero, then square them all, then check for duplicates in the values.


Take a list of integers; arrange by magnitude ignoring sign, then raise each to the power of two, then do all values appear only once.


Take a list of integers; put them in order by magnitude, then I need each number multiplied by itself, then check that there are no duplicates.


Take a list of integers; arrange in order of absolute value, then square all of them, then are the values all unique.


Take a list of integers; sort by distance from zero, then multiply each element by itself, then check if all values are unique.


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


Take a list of integers; sort by absolute value, then square each, then return whether all values are distinct.


Take a list of integers; keep everything before the first zero, then keep the leading run of positive numbers, then true if every value is unique.


Take a list of integers; take only what comes before the initial zero, then take values while they are positive, then check for duplicates in the values.


Take a list of integers; cut the list at the first zero, then take positive values then stop, then do all values appear only once.


Take a list of integers; cut off after the first zero appears, then keep going while positive, then check that there are no duplicates.


Take a list of integers; take values up to (excluding) the first zero, then stop at first non positive, then are the values all unique.


Take a list of integers; keep the part before the first 0, then take while greater than zero, then check if all values are unique.


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


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


Take a list of integers; drop the leading negative values, then default to [0] when there is nothing, then bump each up by one.


Take a list of integers; cut the leading negatives, then when the list is empty, substitute a zero value, then increment each item.


Take a list of integers; skip negatives at the start, then replace an empty list with one zero, then bump each up by one.


Take a list of integers; remove all negatives at the front, then zero it out if it's empty, then increment each item.


Take a list of integers; remove the initial run of negative numbers, then use zero if the list is empty, then bump each up by one.


Take a list of integers; strip the front negatives, then default to zero when empty, then increment each item.


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


Take a list of integers; drop the leading negative values, then if empty, use a single zero, then add one to each.


Take a list of integers; if empty, use a single zero, then multiply each by two, then raise each to the power of two.


Take a list of integers; if blank use 0, then double each item in the list, then I need each number multiplied by itself.


Take a list of integers; default to [0] when there is nothing, then multiply each by two, then square all of them.


Take a list of integers; when the list is empty, substitute a zero value, then double each item in the list, then multiply each element by itself.


Take a list of integers; replace an empty list with one zero, then multiply each by two, then make each one squared.


Take a list of integers; zero it out if it's empty, then double each item in the list, then square each value in the list.


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


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


Take a list of people records (name, age); extract the ages, then remove the first item, then raise each to the power of two.


Take a list of people records (name, age); show me all ages, then Remove head, then I need each number multiplied by itself.


Take a list of people records (name, age); pluck the age field from each record, then remove the first item, then square all of them.


Take a list of people records (name, age); get the age field, then Remove head, then multiply each element by itself.


Take a list of people records (name, age); keep just each person's age, then remove the first item, then make each one squared.


Take a list of people records (name, age); extract age values, then Remove head, then square each value in the list.


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


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


Take a list of integers; take values while they are positive, then keep values divisible by 3, then give the number of evens.


Take a list of integers; take positive values then stop, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


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


Take a list of integers; stop at first non positive, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; take while greater than zero, then keep only multiples of three, then give me the count of even values.


Take a list of integers; take values while positive, then multiples of three only, then I need to know how many of these are even.


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


Take a list of integers; take values while they are positive, then keep multiples of three, then return how many values are even.


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


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


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


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


Take a list of integers; arrange in order of absolute value, then multiply each by two, then truncate to first three.


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


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


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


Take a list of integers; drop the first element, then keep only even values, then trim one element off each end.


Take a list of integers; Take everything except the first, then extract all even numbers, then cut off the first and last.


Take a list of integers; drop the first element, then keep only even values, then remove the first and last elements.


Take a list of integers; Take everything except the first, then extract all even numbers, then keep only the middle part.


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


Take a list of integers; Take everything except the first, then extract all even numbers, then eliminate the outermost elements.


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


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


Take a list of strings; drop duplicate strings keeping the first, then order the strings A to Z, then return the number of strings.


Take a list of strings; dedupe, then make it alphabetical, then count the strings.


Take a list of strings; remove duplicate strings keep first, then order the strings A to Z, then return how many strings remain.


Take a list of strings; remove repeating strings first one stays, then make it alphabetical, then give me the total number of strings.


Take a list of strings; delete duplicate strings keep the first one, then order the strings A to Z, then tell me how many strings we have.


Take a list of strings; deduplicate the strings, then make it alphabetical, then what's the string count.


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


Take a list of strings; drop duplicate strings keeping the first, then sort alphabetically, then return how many strings remain.


Take a list of integers; drop the first element, then multiply each value by itself, then true only if all are positive.


Take a list of integers; Take everything except the first, then square them all, then do all of these have positive values.


Take a list of integers; drop the first element, then raise each to the power of two, then check if every value is positive.


Take a list of integers; Take everything except the first, then I need each number multiplied by itself, then confirm all values are positive.


Take a list of integers; drop the first element, then square all of them, then all positive.


Take a list of integers; Take everything except the first, then multiply each element by itself, then check if every number is above zero.


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


Take a list of integers; drop the first element, then square each, then return whether all values are positive.


Take a list of integers; keep the odd numbers, then increment each value, then multiply each by -1.


Take a list of integers; odd numbers only, then plus one for all, then negate.


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


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


Take a list of people records (name, age); extract the ages, then flip the list around, then find the min, defaulting to 0.


Take a list of people records (name, age); show me all ages, then flip the order around, then minimum value, zero otherwise.


Take a list of people records (name, age); pluck the age field from each record, then put the elements backwards, then get the minimum value or zero if empty.


Take a list of people records (name, age); get the age field, then reverse that for me, then give me the min or 0.


Take a list of people records (name, age); keep just each person's age, then flip it backwards, then return the smallest number, defaulting to 0.


Take a list of people records (name, age); extract age values, then make it backwards, then return smallest or zero if empty.


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


Take a list of people records (name, age); extract the ages, then reverse the order, then return the minimum (0 if empty).


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


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


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


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


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


Take a list of integers; Take everything except the first, then multiples of three only, then check if all values are unique.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then remove the first item, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then Remove head, then check for zero.


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


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


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


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


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


Take a list of integers; stop at first non positive, then show the first three, then multiples of three only.


Take a list of integers; take while greater than zero, then take the first three, then filter for numbers divisible by three.


Take a list of integers; take values while positive, then keep first 3, then give me only the values divisible by three.


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


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


Take a list of integers; drop the first element, then keep only odd values, then find the min, defaulting to 0.


Take a list of integers; Take everything except the first, then eliminate the even numbers, then minimum value, zero otherwise.


Take a list of integers; drop the first element, then keep only odd values, then get the minimum value or zero if empty.


Take a list of integers; Take everything except the first, then eliminate the even numbers, then give me the min or 0.


Take a list of integers; drop the first element, then keep only odd values, then return the smallest number, defaulting to 0.


Take a list of integers; Take everything except the first, then eliminate the even numbers, then return smallest or zero if empty.


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


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


Take a list of integers; keep the odd numbers, then sort smallest to largest, then stop at the first non-positive value.


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


Take a list of integers; keep the odd numbers, then Sort this ascending, then take values while they are positive.


Take a list of integers; odd numbers only, then Sort lowest to highest, then take positive values then stop.


Take a list of integers; keep the odd numbers, then Arrange from smallest to largest, then keep going while positive.


Take a list of integers; odd numbers only, then sort ascending, then stop at first non positive.


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


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


Take a list of integers; reverse the order, then cut the list at the first zero, then arrange by magnitude ignoring sign.


Take a list of integers; reverse, then cut off after the first zero appears, then put them in order by magnitude.


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


Take a list of integers; flip the order around, then keep the part before the first 0, then sort by distance from zero.


Take a list of integers; put the elements backwards, then truncate at the first zero, then order by how far from zero.


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


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then give the number of evens.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then find how many values are divisible by two.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then how many are even.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then get the total number of even values in the list.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five, then give me the count of even values.


Take a list of integers; strip the front negatives, then keep values greater than five, then I need to know how many of these are even.


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


Take a list of integers; drop the leading negative values, then keep values greater than five, then return how many values are even.


Take a list of integers; sort by absolute value, then skip negatives at the start, then drop the odd numbers.


Take a list of integers; rearrange by distance from zero, then remove all negatives at the front, then filter out the odd numbers.


Take a list of integers; arrange by magnitude ignoring sign, then remove the initial run of negative numbers, then drop the odd numbers.


Take a list of integers; put them in order by magnitude, then strip the front negatives, then filter out the odd numbers.


Take a list of integers; arrange in order of absolute value, then remove leading negative numbers, then drop the odd numbers.


Take a list of integers; sort by distance from zero, then drop negatives from start, then filter out the odd numbers.


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


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


Take a list of integers; sort by absolute value, then cut the list at the first zero, then make each twice as big.


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


Take a list of integers; arrange by magnitude ignoring sign, then take values up to (excluding) the first zero, then make each twice as big.


Take a list of integers; put them in order by magnitude, then keep the part before the first 0, then multiply each by 2.


Take a list of integers; arrange in order of absolute value, then truncate at the first zero, then make each twice as big.


Take a list of integers; sort by distance from zero, then delete everything starting with the first zero, then multiply each by 2.


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


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


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


Take a list of integers; take only what comes before the initial zero, then drop everything except the final three, then filter out everything except multiples of three.


Take a list of integers; cut the list at the first zero, then give me the last three elements, then keep only multiples of three.


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


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


Take a list of integers; keep the part before the first 0, then take the last three, then give me only the values divisible by three.


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


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


Take a list of strings; drop empty strings, then order the strings A to Z, then reduce each string to its first character.


Take a list of strings; get rid of blanks, then make it alphabetical, then take first char drop blanks.


Take a list of strings; remove blanks, then order the strings A to Z, then keep first letters only.


Take a list of strings; eliminate empty string values, then make it alphabetical, then first letter from each item that isn't empty.


Take a list of strings; filter out blank strings, then order the strings A to Z, then grab the first char from each.


Take a list of strings; remove strings that are empty, then make it alphabetical, then isolate the first character per entry.


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


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


Take a list of integers; keep the positive numbers, then cut the list at the first zero, then keep only numbers above 5.


Take a list of integers; get rid of anything that's not positive, then cut off after the first zero appears, then exclude values of 5 and below.


Take a list of integers; drop non-positive values, then take values up to (excluding) the first zero, then remove anything 5 or less.


Take a list of integers; drop the negative numbers, then keep the part before the first 0, then filter to keep only values above 5.


Take a list of integers; filter out the negative ones, then truncate at the first zero, then get rid of values that aren't greater than five.


Take a list of integers; remove all negative values, then delete everything starting with the first zero, then drop anything 5 or below.


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


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


Take a list of integers; double each, then increase every value by 10, then multiply each by -1.


Take a list of integers; times two for each item, then add 10 to each item, then negate.


Take a list of integers; double each, then shift each up by ten, then multiply each by -1.


Take a list of integers; times two for each item, then increase all numbers by 10, then negate.


Take a list of integers; double each, then add 10 to everything, then multiply each by -1.


Take a list of integers; times two for each item, then give everything a boost of 10, then negate.


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


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


Take a list of integers; keep values greater than five, then extend to length 3 using zeros, then true if any value equals zero.


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


Take a list of integers; keep only numbers above 5, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; exclude values of 5 and below, then pad to 3, then check for zero.


Take a list of integers; remove anything 5 or less, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; filter to keep only values above 5, then pad to 3, then check for zero.


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


Take a list of integers; keep values greater than five, then pad with zeros to at least three elements, then return whether the list contains a zero.


Take a list of integers; square each, then sort smallest to largest, then reduce each by one.


Take a list of integers; each value squared, then Ascending sort, then Subtract 1 from all.


Take a list of integers; multiply each value by itself, then Sort this ascending, then Subtract one from each.


Take a list of integers; square them all, then Sort lowest to highest, then Drop each by one.


Take a list of integers; raise each to the power of two, then Arrange from smallest to largest, then Decrease all values by one.


Take a list of integers; I need each number multiplied by itself, then sort ascending, then Remove one from each value.


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


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


Take a list of integers; subtract one from each, then remove all zero values, then true if at least one even value.


Take a list of integers; Decrement all items, then exclude zeros, then any even.


Take a list of integers; decrement each value, then remove all zero values, then true if at least one even value.


Take a list of integers; Lower each number by one, then exclude zeros, then any even.


Take a list of integers; reduce each by one, then remove all zero values, then true if at least one even value.


Take a list of integers; Subtract 1 from all, then exclude zeros, then any even.


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


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


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


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


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


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


Take a list of integers; double each, then clamp each to at most ten, then if there's nothing, put in a zero.


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


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then shift each up by ten.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then increase all numbers by 10.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then add 10 to everything.


Take a list of people records (name, age); get the age field, then extract all even numbers, then give everything a boost of 10.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then increment each by ten.


Take a list of people records (name, age); extract age values, then extract all even numbers, then add a constant 10 to each.


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then add ten to each.


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


Take a list of integers; extract negatives, then when the list is empty, substitute a zero value, then put them in order by magnitude.


Take a list of integers; keep the negative numbers, then replace an empty list with one zero, then arrange in order of absolute value.


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


Take a list of integers; keep the negative numbers, then use zero if the list is empty, then order by how far from zero.


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


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


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


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


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


Take a list of integers; multiply each value by itself, then take absolute values, then get the minimum value or zero if empty.


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


Take a list of integers; raise each to the power of two, then abs each element, then return the smallest number, defaulting to 0.


Take a list of integers; I need each number multiplied by itself, then take the absolute value of each, then return smallest or zero if empty.


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


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


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


Take a list of integers; keep only nonzero elements, then Lower each number by one, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; keep only nonzero elements, then Subtract 1 from all, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; keep only nonzero elements, then Drop each by one, then ensure minimum length of three by adding zeros to the end.


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


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


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


Take a list of integers; each value squared, then filter for positive numbers, then Discard the first element.


Take a list of integers; multiply each value by itself, then keep only positive numbers, then skip the first one.


Take a list of integers; square them all, then keep the positives, then Discard the first element.


Take a list of integers; raise each to the power of two, then remove negatives, then skip the first one.


Take a list of integers; I need each number multiplied by itself, then keep the positive numbers, then Discard the first element.


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


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


Take a list of integers; negate each, then multiply each by two, then give the earliest even value or zero.


Take a list of integers; reverse the signs of everything, then double each item in the list, then fetch the first even element, default to 0.


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


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


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


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


Take a list of integers; cut the list at the first zero, then keep only positive numbers, then get the absolute value of everything.


Take a list of integers; cut off after the first zero appears, then keep the positives, then apply absolute value to the whole list.


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


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; double each, then remove repeated values, then strip negative values from the start.


Take a list of integers; times two for each item, then unique values preserving order, then remove negatives before the first non-negative.


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


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


Take a list of integers; sort descending, then keep values divisible by 3, then drop non-positive values.


Take a list of integers; sort largest first, then keep items where x mod 3 equals zero, then drop the negative numbers.


Take a list of integers; sort in descending order, then drop anything not divisible by three, then filter out the negative ones.


Take a list of integers; sort from greatest to least, then filter out everything except multiples of three, then remove all negative values.


Take a list of integers; sort z to a, then keep only multiples of three, then keep positive values only.


Take a list of integers; arrange in decreasing order, then multiples of three only, then keep values above zero.


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


Take a list of integers; sort descending, then keep multiples of three, then keep the positive numbers.


Take a list of integers; drop the zeros, then default to [0] when there is nothing, then keep only numbers above 5.


Take a list of integers; keep only nonzero elements, then when the list is empty, substitute a zero value, then exclude values of 5 and below.


Take a list of integers; drop the zeros, then replace an empty list with one zero, then remove anything 5 or less.


Take a list of integers; keep only nonzero elements, then zero it out if it's empty, then filter to keep only values above 5.


Take a list of integers; drop the zeros, then use zero if the list is empty, then get rid of values that aren't greater than five.


Take a list of integers; keep only nonzero elements, then default to zero when empty, then drop anything 5 or below.


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 if x > 5]
    return r


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


Take a list of integers; drop the zeros, then keep values below zero, then find the min, defaulting to 0.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then minimum value, zero otherwise.


Take a list of integers; drop the zeros, then keep values below zero, then get the minimum value or zero if empty.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then give me the min or 0.


Take a list of integers; drop the zeros, then keep values below zero, then return the smallest number, defaulting to 0.


Take a list of integers; keep only nonzero elements, then get the negative numbers, then return smallest or zero if empty.


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


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


Take a list of strings; trim whitespace from each, then add '#' to the start of each string, then remove short strings (under 3 chars).


Take a list of strings; strip whitespace from every element, then make each one start with a hash, then only keep strings with three or more characters.


Take a list of strings; remove surrounding whitespace, then add '#' to the start of each string, then keep only strings that are at least three characters long.


Take a list of strings; trim the whitespace off everything, then make each one start with a hash, then filter strings shorter than 3 chars.


Take a list of strings; strip spaces from all strings, then add '#' to the start of each string, then drop anything shorter than three characters.


Take a list of strings; strip all the strings, then make each one start with a hash, then keep only strings of length 3 or more.


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


Take a list of strings; trim whitespace from each, then prefix each with a hash, then drop strings shorter than three characters.


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


Take a list of integers; add zeros until the list has at least three values, then Ascending sort, then does this list go in ascending order.


Take a list of integers; pad with zeros to at least three elements, then Sort this ascending, then check if the list is in ascending order.


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


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


Take a list of integers; add zeros until the list has at least three values, then sort ascending, then check if values are in increasing order.


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


Take a list of integers; pad with zeros to at least three elements, then sort ascending, then return whether the list is sorted ascending.


Take a list of integers; sort ascending, then order by distance from zero, then put the elements backwards.


Take a list of integers; Sort it from low to high, then sort based on absolute value, then reverse that for me.


Take a list of integers; arrange in increasing order, then organize by magnitude, then flip it backwards.


Take a list of integers; Organize these ascending, then arrange by absolute value ascending, then make it backwards.


Take a list of integers; Sort in ascending order, then sort from smallest to largest absolute value, then reverse the list.


Take a list of integers; I need this sorted ascending, then sort by absolute value, then invert the sequence.


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


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


Take a list of integers; sort by absolute value, then flip the list around, then reduce each by one.


Take a list of integers; rearrange by distance from zero, then flip the order around, then Subtract 1 from all.


Take a list of integers; arrange by magnitude ignoring sign, then put the elements backwards, then Subtract one from each.


Take a list of integers; put them in order by magnitude, then reverse that for me, then Drop each by one.


Take a list of integers; arrange in order of absolute value, then flip it backwards, then Decrease all values by one.


Take a list of integers; sort by distance from zero, then make it backwards, then Remove one from each value.


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


Take a list of integers; sort by absolute value, then reverse the order, then subtract one from each.


Take a list of integers; sort by absolute value, then default to [0] when there is nothing, then keep only non-zero numbers.


Take a list of integers; rearrange by distance from zero, then when the list is empty, substitute a zero value, then strip the zeros.


Take a list of integers; arrange by magnitude ignoring sign, then replace an empty list with one zero, then keep only non-zero numbers.


Take a list of integers; put them in order by magnitude, then zero it out if it's empty, then strip the zeros.


Take a list of integers; arrange in order of absolute value, then use zero if the list is empty, then keep only non-zero numbers.


Take a list of integers; sort by distance from zero, then default to zero when empty, then strip the zeros.


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


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


Take a list of integers; add one to each, then order by distance from zero, then drop non-negative values.


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


Take a list of integers; add one to each, then organize by magnitude, then drop non-negative values.


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


Take a list of integers; add one to each, then sort from smallest to largest absolute value, then drop non-negative values.


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


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


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


Take a list of integers; drop the first and last elements, then take the final 3 elements, then limit every value to 10.


Take a list of integers; take out the first and last items, then drop everything except the final three, then maximum of 10 for all.


Take a list of integers; remove both ends, then give me the last three elements, then limit every value to 10.


Take a list of integers; trim the edges, then keep only the last three, then maximum of 10 for all.


Take a list of integers; trim one element off each end, then keep the final three items, then limit every value to 10.


Take a list of integers; cut off the first and last, then take the last three, then maximum of 10 for all.


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


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


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


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


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


Take a list of integers; add 10 to each item, then Subtract 1 from all, then give me the min or 0.


Take a list of integers; shift each up by ten, then Subtract one from each, then return the smallest number, defaulting to 0.


Take a list of integers; increase all numbers by 10, then Drop each by one, then return smallest or zero if empty.


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


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


Take a list of integers; negate each, then clamp each to at most ten, then truncate to three items.


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then show the first three.


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


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then keep first 3.


Take a list of integers; negate each, then clamp each to at most ten, then truncate to first three.


Take a list of integers; reverse the signs of everything, then don't let anything exceed 10, then first three.


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


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


Take a list of integers; square each, then extend to length 3 using zeros, then give back the product of all values.


Take a list of integers; each value squared, then pad to 3, then product of the list.


Take a list of integers; multiply each value by itself, then extend to length 3 using zeros, then what's the product.


Take a list of integers; square them all, then pad to 3, then what do they multiply to.


Take a list of integers; raise each to the power of two, then extend to length 3 using zeros, then give me their product.


Take a list of integers; I need each number multiplied by itself, then pad to 3, then multiply them all together.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then drop anything 5 or below, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then keep only numbers greater than 5, then check for zero.


Take a list of integers; drop duplicates keeping first occurrence, then filter for numbers above 5, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then give me values where x is greater than 5, then check for zero.


Take a list of integers; drop duplicates keeping first occurrence, then show me only the values that are bigger than five, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then keep values greater than five, then check for zero.


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values greater than five, then return whether the list contains a zero.


Take a list of integers; drop the zeros, then remove the first item, then stop at the first non-positive value.


Take a list of integers; keep only nonzero elements, then Remove head, then keep the leading run of positive numbers.


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


Take a list of integers; keep only nonzero elements, then Remove head, then take positive values then stop.


Take a list of integers; drop the zeros, then remove the first item, then keep going while positive.


Take a list of integers; keep only nonzero elements, then Remove head, then stop at first non positive.


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


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


Take a list of integers; subtract one from each, then increase every value by 10, then true if every value is unique.


Take a list of integers; Decrement all items, then add 10 to each item, then check for duplicates in the values.


Take a list of integers; decrement each value, then shift each up by ten, then do all values appear only once.


Take a list of integers; Lower each number by one, then increase all numbers by 10, then check that there are no duplicates.


Take a list of integers; reduce each by one, then add 10 to everything, then are the values all unique.


Take a list of integers; Subtract 1 from all, then give everything a boost of 10, then check if all values are unique.


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


Take a list of integers; subtract one from each, then add ten to each, then return whether all values are distinct.


Take a list of integers; cap each value at 10, then keep values divisible by 3, then true if already sorted smallest to largest.


Take a list of integers; clip values at 10, then keep items where x mod 3 equals zero, then does this list go in ascending order.


Take a list of integers; cap each value at 10, then drop anything not divisible by three, then check if the list is in ascending order.


Take a list of integers; clip values at 10, then filter out everything except multiples of three, then is the list sorted.


Take a list of integers; cap each value at 10, then keep only multiples of three, then is it sorted.


Take a list of integers; clip values at 10, then multiples of three only, then check if values are in increasing order.


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


Take a list of integers; cap each value at 10, then keep multiples of three, then return whether the list is sorted ascending.


Take a list of integers; if empty, use a single zero, then take the first 3 elements, then remove the initial run of negative numbers.


Take a list of integers; if blank use 0, then remove everything after the third, then strip the front negatives.


Take a list of integers; default to [0] when there is nothing, then truncate to three items, then remove leading negative numbers.


Take a list of integers; when the list is empty, substitute a zero value, then show the first three, then drop negatives from start.


Take a list of integers; replace an empty list with one zero, then take the first three, then strip negative values from the start.


Take a list of integers; zero it out if it's empty, then keep first 3, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = r if r else [0]
    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; if empty, use a single zero, then keep only the first three, then drop the leading negative values.


Take a list of integers; keep multiples of three, then drop anything 5 or below, then true if at least one even value.


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


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then true if at least one even value.


Take a list of integers; keep items where x mod 3 equals zero, then give me values where x is greater than 5, then any even.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then true if at least one even value.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then any even.


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


Take a list of integers; keep multiples of three, then keep values greater than five, then return whether any value is even.


Take a list of integers; sort ascending, then flip the sign of each, then give the number of evens.


Take a list of integers; Sort it from low to high, then turn positives to negatives and vice versa, then find how many values are divisible by two.


Take a list of integers; arrange in increasing order, then flip the sign of each, then how many are even.


Take a list of integers; Organize these ascending, then turn positives to negatives and vice versa, then get the total number of even values in the list.


Take a list of integers; Sort in ascending order, then flip the sign of each, then give me the count of even values.


Take a list of integers; I need this sorted ascending, then turn positives to negatives and vice versa, then I need to know how many of these are even.


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


Take a list of integers; sort ascending, then negate each, then return how many values are even.


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


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


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


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


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


Take a list of integers; Take everything except the first, then eliminate the even numbers, then invert the sequence.


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


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


Take a list of integers; add ten to each, then remove the first item, then truncate to the last three items.


Take a list of integers; bump everything up by 10, then Remove head, then show only the last three.


Take a list of integers; increase every value by 10, then remove the first item, then remove all but the last three.


Take a list of integers; add 10 to each item, then Remove head, then take the final 3 elements.


Take a list of integers; shift each up by ten, then remove the first item, then drop everything except the final three.


Take a list of integers; increase all numbers by 10, then Remove head, then give me the last three elements.


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


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


Take a list of integers; keep the positive numbers, then keep values divisible by 3, then give the number of evens.


Take a list of integers; get rid of anything that's not positive, then keep items where x mod 3 equals zero, then find how many values are divisible by two.


Take a list of integers; drop non-positive values, then drop anything not divisible by three, then how many are even.


Take a list of integers; drop the negative numbers, then filter out everything except multiples of three, then get the total number of even values in the list.


Take a list of integers; filter out the negative ones, then keep only multiples of three, then give me the count of even values.


Take a list of integers; remove all negative values, then multiples of three only, then I need to know how many of these are even.


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


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


Take a list of integers; sort descending, then remove all zero values, then keep only numbers above 5.


Take a list of integers; sort largest first, then exclude zeros, then exclude values of 5 and below.


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


Take a list of integers; sort from greatest to least, then exclude zeros, then filter to keep only values above 5.


Take a list of integers; sort z to a, then remove all zero values, then get rid of values that aren't greater than five.


Take a list of integers; arrange in decreasing order, then exclude zeros, then drop anything 5 or below.


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


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


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


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


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


Take a list of integers; clip values at 10, then Sort lowest to highest, then apply absolute value to the whole list.


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


Take a list of integers; clip values at 10, then sort ascending, then make every value non-negative.


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


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


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


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


Take a list of integers; keep going while positive, then remove the initial run of negative numbers, then What's the highest number in the list.


Take a list of integers; stop at first non positive, then strip the front negatives, then Return the greatest value or default to 0.


Take a list of integers; take while greater than zero, then remove leading negative numbers, then Find the largest element, defaulting to zero.


Take a list of integers; take values while positive, then drop negatives from start, then give the largest value (0 if none).


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


Take a list of integers; take values while they are positive, then drop the leading negative values, then return the maximum (0 if empty).


Take a list of integers; drop the zeros, then keep only odd values, then true if any value equals zero.


Take a list of integers; keep only nonzero elements, then eliminate the even numbers, then check for zero.


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


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


Take a list of integers; keep multiples of three, then remove the first item, then deduplicate the list.


Take a list of integers; get rid of non-multiples of three, then Remove head, then remove repeats.


Take a list of integers; keep values divisible by 3, then remove the first item, then deduplicate the list.


Take a list of integers; keep items where x mod 3 equals zero, then Remove head, then remove repeats.


Take a list of integers; drop anything not divisible by three, then remove the first item, then deduplicate the list.


Take a list of integers; filter out everything except multiples of three, then Remove head, then remove repeats.