Take a list of integers; cap each value at 10, then remove the first item, then make each one squared.


Take a list of integers; clip values at 10, then Remove head, then square each value in the list.


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


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


Take a list of integers; add one to each, then remove repeated values, then true if every value is unique.


Take a list of integers; make each one bigger, then unique values preserving order, then check for duplicates in the values.


Take a list of integers; add one to each, then remove repeated values, then do all values appear only once.


Take a list of integers; make each one bigger, then unique values preserving order, then check that there are no duplicates.


Take a list of integers; add one to each, then remove repeated values, then are the values all unique.


Take a list of integers; make each one bigger, then unique values preserving order, then check if all values are unique.


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


Take a list of integers; add one to each, then drop duplicates keeping first occurrence, then return whether all values are distinct.


Take a list of people records (name, age); extract the ages, then keep values below zero, then give back the total.


Take a list of people records (name, age); show me all ages, then get the negative numbers, then sum r.


Take a list of people records (name, age); pluck the age field from each record, then keep values below zero, then add them up.


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


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


Take a list of people records (name, age); extract age values, then get the negative numbers, then what do they add up to.


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


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


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


Take a list of integers; reverse, then plus one for all, then minimum value, zero otherwise.


Take a list of integers; flip the list around, then increment each value, then get the minimum value or zero if empty.


Take a list of integers; flip the order around, then plus one for all, then give me the min or 0.


Take a list of integers; put the elements backwards, then increment each value, then return the smallest number, defaulting to 0.


Take a list of integers; reverse that for me, then plus one for all, then return smallest or zero if empty.


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


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


Take a list of integers; drop the zeros, then flip the sign of each, then arrange in increasing order.


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


Take a list of integers; drop the zeros, then flip the sign of each, then Sort in ascending order.


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


Take a list of integers; drop the zeros, then flip the sign of each, then Put these in ascending order.


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


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


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


Take a list of integers; drop the zeros, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; keep only nonzero elements, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; drop the zeros, then filter for numbers above 5, then arrange in order of absolute value.


Take a list of integers; keep only nonzero elements, then give me values where x is greater than 5, then sort by distance from zero.


Take a list of integers; drop the zeros, then show me only the values that are bigger than five, then order by how far from zero.


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


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


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


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


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


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


Take a list of integers; cut off after the first zero appears, then turn positives to negatives and vice versa, then any even.


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


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


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


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


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


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


Take a list of integers; negate each, then replace an empty list with one zero, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then zero it out if it's empty, then strip the zeros.


Take a list of integers; negate each, then use zero if the list is empty, then keep only non-zero numbers.


Take a list of integers; reverse the signs of everything, then default to zero when empty, then strip the zeros.


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


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


Take a list of people records (name, age); extract the ages, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of people records (name, age); show me all ages, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of people records (name, age); pluck the age field from each record, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of people records (name, age); get the age field, then don't let anything exceed 10, then fetch the first even element, default to 0.


Take a list of people records (name, age); keep just each person's age, then clamp each to at most ten, then give the earliest even value or zero.


Take a list of people records (name, age); extract age values, then don't let anything exceed 10, then fetch the first even element, default to 0.


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


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


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then deduplicate the strings.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then filter out duplicate strings retain first.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then strip duplicates preserve order.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then remove repeated strings.


Take a list of strings; sort alphabetically, then add '#' to the start of each string, then keep unique strings first appearance.


Take a list of strings; arrange alphabetically, then make each one start with a hash, then eliminate repeated strings preserve first occurrence.


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


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


Take a list of integers; cap each value at 10, then remove all zero values, then truncate to the last three items.


Take a list of integers; clip values at 10, then exclude zeros, then show only the last three.


Take a list of integers; cap each value at 10, then remove all zero values, then remove all but the last three.


Take a list of integers; clip values at 10, then exclude zeros, then take the final 3 elements.


Take a list of integers; cap each value at 10, then remove all zero values, then drop everything except the final three.


Take a list of integers; clip values at 10, then exclude zeros, then give me the last three elements.


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


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


Take a list of integers; sort by absolute value, then take the final 3 elements, then drop anything not divisible by three.


Take a list of integers; rearrange by distance from zero, then drop everything except the final three, then filter out everything except multiples of three.


Take a list of integers; arrange by magnitude ignoring sign, then give me the last three elements, then keep only multiples of three.


Take a list of integers; put them in order by magnitude, then keep only the last three, then multiples of three only.


Take a list of integers; arrange in order of absolute value, then keep the final three items, then filter for numbers divisible by three.


Take a list of integers; sort by distance from zero, then take the last three, then give me only the values divisible by three.


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


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


Take a list of integers; keep the positive numbers, then flip the sign of each, then find the max, defaulting to 0.


Take a list of integers; get rid of anything that's not positive, then turn positives to negatives and vice versa, then Give me the maximum, but 0 if there are no items.


Take a list of integers; drop non-positive values, then flip the sign of each, then What's the highest number in the list.


Take a list of integers; drop the negative numbers, then turn positives to negatives and vice versa, then Return the greatest value or default to 0.


Take a list of integers; filter out the negative ones, then flip the sign of each, then Find the largest element, defaulting to zero.


Take a list of integers; remove all negative values, then turn positives to negatives and vice versa, then give the largest value (0 if none).


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


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


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


Take a list of integers; Decrement all items, then plus one for all, then maximum of 10 for all.


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


Take a list of integers; Lower each number by one, then plus one for all, then maximum of 10 for all.


Take a list of integers; reduce each by one, then increment each value, then limit every value to 10.


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


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


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


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


Take a list of integers; cut the leading negatives, then eliminate the even numbers, then cut off the first and last.


Take a list of integers; skip negatives at the start, then keep only odd values, then remove the first and last elements.


Take a list of integers; remove all negatives at the front, then eliminate the even numbers, then keep only the middle part.


Take a list of integers; remove the initial run of negative numbers, then keep only odd values, then drop first and last.


Take a list of integers; strip the front negatives, then eliminate the even numbers, then eliminate the outermost elements.


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


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


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


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


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


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


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


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


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


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


Take a list of strings; drop strings shorter than three characters, then convert each to lower case, then return them as one comma-separated string.


Take a list of strings; eliminate strings below length three, then lowercase each one, then separate by comma.


Take a list of strings; remove short strings (under 3 chars), then convert each to lower case, then join with commas.


Take a list of strings; only keep strings with three or more characters, then lowercase each one, then comma join.


Take a list of strings; keep only strings that are at least three characters long, then convert each to lower case, then combine using commas.


Take a list of strings; filter strings shorter than 3 chars, then lowercase each one, then connect with commas between each item.


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


Take a list of strings; drop strings shorter than three characters, then lowercase each string, then join them with commas.


Take a list of people records (name, age); extract the ages, then remove repeated values, then put the elements backwards.


Take a list of people records (name, age); show me all ages, then unique values preserving order, then reverse that for me.


Take a list of people records (name, age); pluck the age field from each record, then remove repeated values, then flip it backwards.


Take a list of people records (name, age); get the age field, then unique values preserving order, then make it backwards.


Take a list of people records (name, age); keep just each person's age, then remove repeated values, then reverse the list.


Take a list of people records (name, age); extract age values, then unique values preserving order, then invert the sequence.


def solve(xs):
    r = list(xs)
    r = [d['age'] for d in r]
    r = list(dict.fromkeys(r))
    r = list(reversed(r))
    return r


Take a list of people records (name, age); extract the ages, then drop duplicates keeping first occurrence, then reverse the order.


Take a list of integers; keep the negative numbers, then keep only odd values, then ensure at least three items by appending zeros.


Take a list of integers; extract negatives, then eliminate the even numbers, 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 for x in r if x % 2 != 0]
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; drop duplicates keeping first occurrence, then order by distance from zero, then give back the product of all values.


Take a list of integers; drop duplicates but keep the first one, then sort based on absolute value, then product of the list.


Take a list of integers; drop duplicates keeping first occurrence, then organize by magnitude, then what's the product.


Take a list of integers; drop duplicates but keep the first one, then arrange by absolute value ascending, then what do they multiply to.


Take a list of integers; drop duplicates keeping first occurrence, then sort from smallest to largest absolute value, then give me their product.


Take a list of integers; drop duplicates but keep the first one, then sort by absolute value, then multiply them all together.


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


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


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


Take a list of integers; take positive values then stop, then exclude zeros, then drop the negative numbers.


Take a list of integers; keep going while positive, then remove all zero values, then filter out the negative ones.


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


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


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


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


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


Take a list of integers; drop the first element, then extend to length 3 using zeros, then give back the total.


Take a list of integers; Take everything except the first, then pad to 3, then sum r.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then add them up.


Take a list of integers; Take everything except the first, then pad to 3, then calculate the sum of all elements.


Take a list of integers; drop the first element, then extend to length 3 using zeros, then what's the total.


Take a list of integers; Take everything except the first, then pad to 3, then what do they add up to.


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


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


Take a list of integers; drop the first and last elements, then take the first 3 elements, then true if every value is unique.


Take a list of integers; take out the first and last items, then remove everything after the third, then check for duplicates in the values.


Take a list of integers; remove both ends, then truncate to three items, then do all values appear only once.


Take a list of integers; trim the edges, then show the first three, then check that there are no duplicates.


Take a list of integers; trim one element off each end, then take the first three, then are the values all unique.


Take a list of integers; cut off the first and last, then keep first 3, then check if all values are unique.


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


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


Take a list of strings; uppercase each string, then convert each to lower case, then return the number of strings.


Take a list of strings; make it all caps, then lowercase each one, then count the strings.


Take a list of strings; convert each to upper case, then convert each to lower case, then return how many strings remain.


Take a list of strings; change all strings to uppercase, then lowercase each one, then give me the total number of strings.


Take a list of strings; make every string uppercase, then convert each to lower case, then tell me how many strings we have.


Take a list of strings; uppercase each one, then lowercase each one, then what's the string count.


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


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


Take a list of integers; keep the even numbers, then multiply each value by itself, then true if at least one even value.


Take a list of integers; keep evens, then square them all, then any even.


Take a list of integers; keep the even numbers, then raise each to the power of two, then true if at least one even value.


Take a list of integers; keep evens, then I need each number multiplied by itself, then any even.


Take a list of integers; keep the even numbers, then square all of them, then true if at least one even value.


Take a list of integers; keep evens, then multiply each element by itself, then any even.


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


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


Take a list of integers; add one to each, then increase every value by 10, then limit every value to 10.


Take a list of integers; make each one bigger, then add 10 to each item, then maximum of 10 for all.


Take a list of integers; add one to each, then shift each up by ten, then limit every value to 10.


Take a list of integers; make each one bigger, then increase all numbers by 10, then maximum of 10 for all.


Take a list of integers; add one to each, then add 10 to everything, then limit every value to 10.


Take a list of integers; make each one bigger, then give everything a boost of 10, then maximum of 10 for all.


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


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


Take a list of integers; drop the first and last elements, then sort largest to smallest, then true only if all are positive.


Take a list of integers; take out the first and last items, then sort by descending values, then do all of these have positive values.


Take a list of integers; remove both ends, then sort from highest to lowest, then check if every value is positive.


Take a list of integers; trim the edges, then sort descending, then confirm all values are positive.


Take a list of integers; trim one element off each end, then sort largest first, then all positive.


Take a list of integers; cut off the first and last, then sort in descending order, then check if every number is above zero.


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


Take a list of integers; drop the first and last elements, then sort descending, then return whether all values are positive.


Take a list of integers; if empty, use a single zero, then increase every value by 10, then stop at the first non-positive value.


Take a list of integers; if blank use 0, then add 10 to each item, then keep the leading run of positive numbers.


Take a list of integers; default to [0] when there is nothing, then shift each up by ten, then take values while they are positive.


Take a list of integers; when the list is empty, substitute a zero value, then increase all numbers by 10, then take positive values then stop.


Take a list of integers; replace an empty list with one zero, then add 10 to everything, then keep going while positive.


Take a list of integers; zero it out if it's empty, then give everything a boost of 10, then stop at first non positive.


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


Take a list of integers; if empty, use a single zero, then add ten to each, then take values while they are positive.


Take a list of integers; keep multiples of three, then make every value non-negative, then take values up to (excluding) the first zero.


Take a list of integers; get rid of non-multiples of three, then absolute value for all items, then keep the part before the first 0.


Take a list of integers; keep values divisible by 3, then take absolute values, then truncate at the first zero.


Take a list of integers; keep items where x mod 3 equals zero, then turn negatives into positives, then delete everything starting with the first zero.


Take a list of integers; drop anything not divisible by three, then abs each element, then remove from the first zero onwards.


Take a list of integers; filter out everything except multiples of three, then take the absolute value of each, then up to but not including the first zero.


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


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


Take a list of integers; add one to each, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; make each one bigger, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; take values while they are positive, then multiply each by two, then bump each up by one.


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


Take a list of integers; keep going while positive, then multiply each by two, then bump each up by one.


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


Take a list of integers; take while greater than zero, then multiply each by two, then bump each up by one.


Take a list of integers; take values while positive, then double each item in the list, 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 = [x * 2 for x in r]
    r = [x + 1 for x in r]
    return r


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


Take a list of integers; cap each value at 10, then make every value non-negative, then arrange in increasing order.


Take a list of integers; clip values at 10, then absolute value for all items, then Organize these ascending.


Take a list of integers; cap each value at 10, then take absolute values, then Sort in ascending order.


Take a list of integers; clip values at 10, then turn negatives into positives, then I need this sorted ascending.


Take a list of integers; cap each value at 10, then abs each element, then Put these in ascending order.


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


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


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


Take a list of integers; keep values greater than five, then remove both ends, then remove the initial run of negative numbers.


Take a list of integers; filter out values less than or equal to 5, then trim the edges, then strip the front negatives.


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


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


Take a list of integers; remove anything 5 or less, then remove the first and last elements, then strip negative values from the start.


Take a list of integers; filter to keep only values above 5, then keep only the middle part, then remove negatives before the first non-negative.


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


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


Take a list of integers; keep everything before the first zero, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; take only what comes before the initial zero, then sort based on absolute value, then fetch the first even element, default to 0.


Take a list of integers; cut the list at the first zero, then organize by magnitude, then give the earliest even value or zero.


Take a list of integers; cut off after the first zero appears, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; take values up to (excluding) the first zero, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; keep the part before the first 0, then sort by absolute value, then fetch the first even element, default to 0.


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


Take a list of integers; keep everything before the first zero, then sort by absolute value, then return the first even value (0 if none).


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


Take a list of integers; keep evens, then drop everything except the final three, then strip the front negatives.


Take a list of integers; keep the even numbers, then give me the last three elements, then remove leading negative numbers.


Take a list of integers; keep evens, then keep only the last three, then drop negatives from start.


Take a list of integers; keep the even numbers, then keep the final three items, then strip negative values from the start.


Take a list of integers; keep evens, then take the last three, then remove negatives before the first non-negative.


def solve(xs):
    r = list(xs)
    r = [x for x in r if x % 2 == 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; keep the even numbers, then keep only the last three, then drop the leading negative values.


Take a list of integers; drop duplicates keeping first occurrence, then multiply each by two, then true if any value equals zero.


Take a list of integers; drop duplicates but keep the first one, then double each item in the list, then check for zero.


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


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


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


Take a list of integers; take out the first and last items, then Ascending sort, then find how many values are divisible by two.


Take a list of integers; remove both ends, then Sort this ascending, then how many are even.


Take a list of integers; trim the edges, then Sort lowest to highest, then get the total number of even values in the list.


Take a list of integers; trim one element off each end, then Arrange from smallest to largest, then give me the count of even values.


Take a list of integers; cut off the first and last, then sort ascending, then I need to know how many of these are even.


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


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


Take a list of integers; reverse the order, then skip negatives at the start, then strip the signs.


Take a list of integers; reverse, then remove all negatives at the front, then take abs of each.


Take a list of integers; flip the list around, then remove the initial run of negative numbers, then get the absolute value of everything.


Take a list of integers; flip the order around, then strip the front negatives, then apply absolute value to the whole list.


Take a list of integers; put the elements backwards, then remove leading negative numbers, then make them all positive.


Take a list of integers; reverse that for me, then drop negatives from start, then make every value non-negative.


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


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


Take a list of integers; take the absolute value of each, then flip the list around, then count the elements.


Take a list of integers; convert to absolute value, then flip the order around, then how many items remain.


Take a list of integers; strip the signs, then put the elements backwards, then tell me the length.


Take a list of integers; take abs of each, then reverse that for me, then return the length.


Take a list of integers; get the absolute value of everything, then flip it backwards, then count them.


Take a list of integers; apply absolute value to the whole list, then make it backwards, then what's the count.


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


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


Take a list of integers; reverse the order, then multiply each by two, then drop non-negative values.


Take a list of integers; reverse, then double each item in the list, then drop all positive numbers.


Take a list of integers; flip the list around, then multiply each by two, then drop non-negative values.


Take a list of integers; flip the order around, then double each item in the list, then drop all positive numbers.


Take a list of integers; put the elements backwards, then multiply each by two, then drop non-negative values.


Take a list of integers; reverse that for me, then double each item in the list, then drop all positive numbers.


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


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


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


Take a list of integers; reverse the signs of everything, then absolute value for all items, then do all of these have positive values.


Take a list of integers; negate each, then take absolute values, then check if every value is positive.


Take a list of integers; reverse the signs of everything, then turn negatives into positives, then confirm all values are positive.


Take a list of integers; negate each, then abs each element, then all positive.


Take a list of integers; reverse the signs of everything, then take the absolute value of each, then check if every number is above zero.


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


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


Take a list of integers; square each, then multiply each by two, then limit every value to 10.


Take a list of integers; each value squared, then double each item in the list, then maximum of 10 for all.


Take a list of integers; multiply each value by itself, then multiply each by two, then limit every value to 10.


Take a list of integers; square them all, then double each item in the list, then maximum of 10 for all.


Take a list of integers; raise each to the power of two, then multiply each by two, then limit every value to 10.


Take a list of integers; I need each number multiplied by itself, then double each item in the list, then maximum of 10 for all.


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


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


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


Take a list of integers; cut the leading negatives, then plus one for all, then drop all positive numbers.


Take a list of integers; skip negatives at the start, then increment each value, then drop non-negative values.


Take a list of integers; remove all negatives at the front, then plus one for all, then drop all positive numbers.


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


Take a list of integers; strip the front negatives, then plus one for all, then drop all positive numbers.


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


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


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


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


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


Take a list of integers; odd numbers only, then exclude zeros, then drop negatives from start.


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


Take a list of integers; odd numbers only, then exclude zeros, then remove negatives before the first non-negative.


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[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 drop the zeros, then drop the leading negative values.


Take a list of integers; keep the negative numbers, then cut the list at the first zero, then limit every value to 10.


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


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


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


Take a list of integers; keep the negative numbers, then truncate at the first zero, then limit every value to 10.


Take a list of integers; extract negatives, then delete everything starting with the first zero, then maximum of 10 for all.


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 = [min(x, 10) for x in r]
    return r


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


Take a list of integers; sort by absolute value, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then Remove head, then minimum value, zero otherwise.


Take a list of integers; arrange by magnitude ignoring sign, then remove the first item, then get the minimum value or zero if empty.


Take a list of integers; put them in order by magnitude, then Remove head, then give me the min or 0.


Take a list of integers; arrange in order of absolute value, then remove the first item, then return the smallest number, defaulting to 0.


Take a list of integers; sort by distance from zero, then Remove head, then return smallest or zero if empty.


def solve(xs):
    r = list(xs)
    r = sorted(r, key=abs)
    r = r[1:]
    return min(r) if r else 0


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


Take a list of integers; if empty, use a single zero, then decrement each value, then make each twice as big.


Take a list of integers; if blank use 0, then Lower each number by one, then multiply each by 2.


Take a list of integers; default to [0] when there is nothing, then reduce each by one, then make each twice as big.


Take a list of integers; when the list is empty, substitute a zero value, then Subtract 1 from all, then multiply each by 2.


Take a list of integers; replace an empty list with one zero, then Subtract one from each, then make each twice as big.


Take a list of integers; zero it out if it's empty, then Drop each by one, then multiply each by 2.


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


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


Take a list of integers; keep everything before the first zero, then keep only odd values, then bump each up by one.


Take a list of integers; take only what comes before the initial zero, then eliminate the even numbers, then increment each item.


Take a list of integers; cut the list at the first zero, then keep only odd values, then bump each up by one.


Take a list of integers; cut off after the first zero appears, then eliminate the even numbers, then increment each item.


Take a list of integers; take values up to (excluding) the first zero, then keep only odd values, then bump each up by one.


Take a list of integers; keep the part before the first 0, then eliminate the even numbers, then increment each item.


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 = [x + 1 for x in r]
    return r


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


Take a list of integers; drop the zeros, then sort smallest to largest, then shift each up by ten.


Take a list of integers; keep only nonzero elements, then Ascending sort, then increase all numbers by 10.


Take a list of integers; drop the zeros, then Sort this ascending, then add 10 to everything.


Take a list of integers; keep only nonzero elements, then Sort lowest to highest, then give everything a boost of 10.


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then increment each by ten.


Take a list of integers; keep only nonzero elements, then sort ascending, then add a constant 10 to each.


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


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


Take a list of integers; keep only the first three, then sort largest to smallest, then find the max, defaulting to 0.


Take a list of integers; keep the first 3 items, then sort by descending values, then Give me the maximum, but 0 if there are no items.


Take a list of integers; take the first 3 elements, then sort from highest to lowest, then What's the highest number in the list.


Take a list of integers; remove everything after the third, then sort descending, then Return the greatest value or default to 0.


Take a list of integers; truncate to three items, then sort largest first, then Find the largest element, defaulting to zero.


Take a list of integers; show the first three, then sort in descending order, then give the largest value (0 if none).


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


Take a list of integers; keep only the first three, then sort descending, then return the maximum (0 if empty).


Take a list of integers; drop the first element, then make every value non-negative, then truncate to three items.


Take a list of integers; Take everything except the first, then absolute value for all items, then show the first three.


Take a list of integers; drop the first element, then take absolute values, then take the first three.


Take a list of integers; Take everything except the first, then turn negatives into positives, then keep first 3.


Take a list of integers; drop the first element, then abs each element, then truncate to first three.


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


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


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


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


Take a list of integers; Sort it from low to high, then cut off after the first zero appears, then take abs of each.


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


Take a list of integers; Organize these ascending, then keep the part before the first 0, then apply absolute value to the whole list.


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


Take a list of integers; I need this sorted ascending, then delete everything starting with the first zero, then make every value non-negative.


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


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


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


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


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


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


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


Take a list of people records (name, age); extract age values, then plus one for all, then strip the zeros.


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


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


Take a list of integers; sort by absolute value, then default to [0] when there is nothing, then multiply each by -1.


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


Take a list of integers; arrange by magnitude ignoring sign, then replace an empty list with one zero, then multiply each by -1.


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


Take a list of integers; arrange in order of absolute value, then use zero if the list is empty, then multiply each by -1.


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


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


Take a list of integers; sort by absolute value, then if empty, use a single zero, then negate each.


Take a list of integers; negate each, then remove the first item, then drop non-positive values.


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


Take a list of integers; negate each, then remove the first item, then filter out the negative ones.


Take a list of integers; reverse the signs of everything, then Remove head, then remove all negative values.


Take a list of integers; negate each, then remove the first item, then keep positive values only.


Take a list of integers; reverse the signs of everything, then Remove head, then keep values above zero.


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


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


Take a list of integers; pad with zeros to at least three elements, then sort largest to smallest, then true only if all are positive.


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


Take a list of integers; pad with zeros to at least three elements, then sort from highest to lowest, then check if every value is positive.


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


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


Take a list of integers; add zeros until the list has at least three values, then sort in descending order, then check if every number is above zero.


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


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


Take a list of integers; drop the first element, then remove both ends, then drop anything not divisible by three.


Take a list of integers; Take everything except the first, then trim the edges, then filter out everything except multiples of three.


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


Take a list of integers; Take everything except the first, then cut off the first and last, then multiples of three only.


Take a list of integers; drop the first element, then remove the first and last elements, then filter for numbers divisible by three.


Take a list of integers; Take everything except the first, then keep only the middle part, then give me only the values divisible by three.


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


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


Take a list of integers; keep everything before the first zero, then take the final 3 elements, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then drop everything except the final three, then minimum value, zero otherwise.


Take a list of integers; cut the list at the first zero, then give me the last three elements, then get the minimum value or zero if empty.


Take a list of integers; cut off after the first zero appears, then keep only the last three, then give me the min or 0.


Take a list of integers; take values up to (excluding) the first zero, then keep the final three items, then return the smallest number, defaulting to 0.


Take a list of integers; keep the part before the first 0, then take the last three, then return smallest or zero if empty.


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


Take a list of integers; keep everything before the first zero, then keep only the last three, then return the minimum (0 if empty).


Take a list of integers; pad with zeros to at least three elements, then skip negatives at the start, then trim one element off each end.


Take a list of integers; add zeros until the list has at least three values, then remove all negatives at the front, then cut off the first and last.


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


Take a list of integers; add zeros until the list has at least three values, then strip the front negatives, then keep only the middle part.


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


Take a list of integers; add zeros until the list has at least three values, then drop negatives from start, then eliminate the outermost elements.


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


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


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


Take a list of integers; clip values at 10, then take values while they are positive, then remove repeats.


Take a list of integers; cap each value at 10, then take positive values then stop, then deduplicate the list.


Take a list of integers; clip values at 10, then keep going while positive, then remove repeats.


Take a list of integers; cap each value at 10, then stop at first non positive, then deduplicate the list.


Take a list of integers; clip values at 10, then take while greater than zero, then remove repeats.


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


Take a list of integers; cap each value at 10, then take values while they are positive, then drop duplicates keeping first occurrence.


Take a list of integers; drop the leading negative values, then clamp each to at most ten, then shift each up by ten.


Take a list of integers; cut the leading negatives, then don't let anything exceed 10, then increase all numbers by 10.


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


Take a list of integers; remove all negatives at the front, then don't let anything exceed 10, then give everything a boost of 10.


Take a list of integers; remove the initial run of negative numbers, then clamp each to at most ten, then increment each by ten.


Take a list of integers; strip the front negatives, then don't let anything exceed 10, then add a constant 10 to each.


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


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


Take a list of integers; sort by absolute value, then multiply each by two, then true if any value equals zero.


Take a list of integers; rearrange by distance from zero, then double each item in the list, then check for zero.


Take a list of integers; arrange by magnitude ignoring sign, then multiply each by two, then true if any value equals zero.


Take a list of integers; put them in order by magnitude, then double each item in the list, then check for zero.


Take a list of integers; arrange in order of absolute value, then multiply each by two, then true if any value equals zero.


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


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


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


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


Take a list of integers; odd numbers only, then flip the order around, then how many items remain.


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


Take a list of integers; odd numbers only, then reverse that for me, then return the length.


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


Take a list of integers; odd numbers only, then make it backwards, then what's the count.


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


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


Take a list of integers; keep values greater than five, then keep the leading run of positive numbers, then give back the product of all values.


Take a list of integers; filter out values less than or equal to 5, then take values while they are positive, then product of the list.


Take a list of integers; keep only numbers above 5, then take positive values then stop, then what's the product.


Take a list of integers; exclude values of 5 and below, then keep going while positive, then what do they multiply to.


Take a list of integers; remove anything 5 or less, then stop at first non positive, then give me their product.


Take a list of integers; filter to keep only values above 5, then take while greater than zero, then multiply them all together.


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


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


Take a list of integers; add ten to each, then clamp each to at most ten, then reduce each by one.


Take a list of integers; bump everything up by 10, then don't let anything exceed 10, then Subtract 1 from all.


Take a list of integers; increase every value by 10, then clamp each to at most ten, then Subtract one from each.


Take a list of integers; add 10 to each item, then don't let anything exceed 10, then Drop each by one.


Take a list of integers; shift each up by ten, then clamp each to at most ten, then Decrease all values by one.


Take a list of integers; increase all numbers by 10, then don't let anything exceed 10, then Remove one from each value.


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


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


Take a list of integers; subtract one from each, then keep only odd values, then true only if all are positive.


Take a list of integers; Decrement all items, then eliminate the even numbers, then do all of these have positive values.


Take a list of integers; decrement each value, then keep only odd values, then check if every value is positive.


Take a list of integers; Lower each number by one, then eliminate the even numbers, then confirm all values are positive.


Take a list of integers; reduce each by one, then keep only odd values, then all positive.


Take a list of integers; Subtract 1 from all, then eliminate the even numbers, then check if every number is above zero.


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


Take a list of integers; subtract one from each, then keep the odd numbers, then return whether all values are positive.


Take a list of integers; keep multiples of three, then drop anything 5 or below, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of non-multiples of three, then keep only numbers greater than 5, then put them in order by magnitude.


Take a list of integers; keep values divisible by 3, then filter for numbers above 5, then arrange in order of absolute 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 sort by distance from zero.


Take a list of integers; drop anything not divisible by three, then show me only the values that are bigger than five, then order by how far from zero.


Take a list of integers; filter out everything except multiples of three, then keep values greater than five, then order by distance from zero.


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]
    r = sorted(r, key=abs)
    return r


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


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


Take a list of integers; rearrange by distance from zero, then Ascending sort, then filter out everything except multiples of three.


Take a list of integers; arrange by magnitude ignoring sign, then Sort this ascending, then keep only multiples of three.


Take a list of integers; put them in order by magnitude, then Sort lowest to highest, then multiples of three only.


Take a list of integers; arrange in order of absolute value, then Arrange from smallest to largest, then filter for numbers divisible by three.


Take a list of integers; sort by distance from zero, then sort ascending, then give me only the values divisible by three.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep the leading run of positive numbers, then true if already sorted smallest to largest.


Take a list of integers; drop duplicates but keep the first one, then take values while they are positive, then does this list go in ascending order.


Take a list of integers; drop duplicates keeping first occurrence, then take positive values then stop, then check if the list is in ascending order.


Take a list of integers; drop duplicates but keep the first one, then keep going while positive, then is the list sorted.


Take a list of integers; drop duplicates keeping first occurrence, then stop at first non positive, then is it sorted.


Take a list of integers; drop duplicates but keep the first one, then take while greater than zero, then check if values are in increasing order.


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


Take a list of integers; drop duplicates keeping first occurrence, then take values while they are positive, then return whether the list is sorted ascending.


Take a list of integers; keep multiples of three, then flip the list around, then skip the first one.


Take a list of integers; get rid of non-multiples of three, then flip the order around, then Discard the first element.


Take a list of integers; keep values divisible by 3, then put the elements backwards, then skip the first one.


Take a list of integers; keep items where x mod 3 equals zero, then reverse that for me, then Discard the first element.


Take a list of integers; drop anything not divisible by three, then flip it backwards, then skip the first one.


Take a list of integers; filter out everything except multiples of three, then make it backwards, then Discard the first element.


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


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


Take a list of strings; prefix each with a hash, then take each string's first letter, then find the longest one, defaulting to empty.


Take a list of strings; add # to the start of each string, then give me the first letter of everything, then Longest string, or nothing if there isn't one.


Take a list of strings; prefix each with a hash, then reduce each string to its first character, then find the longest one, defaulting to empty.


Take a list of strings; add # to the start of each string, then take first char drop blanks, then Longest string, or nothing if there isn't one.


Take a list of strings; prefix each with a hash, then keep first letters only, then find the longest one, defaulting to empty.


Take a list of strings; add # to the start of each string, then first letter from each item that isn't empty, then Longest string, or nothing if there isn't one.


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


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


Take a list of integers; keep everything before the first zero, then remove all zero values, then truncate to three items.


Take a list of integers; take only what comes before the initial zero, then exclude zeros, then show the first three.


Take a list of integers; cut the list at the first zero, then remove all zero values, then take the first three.


Take a list of integers; cut off after the first zero appears, then exclude zeros, then keep first 3.


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


Take a list of integers; keep the part before the first 0, then exclude zeros, then first three.


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 = r[:3]
    return r


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


Take a list of integers; keep the negative numbers, then keep values divisible by 3, then true only if all are positive.


Take a list of integers; extract negatives, then keep items where x mod 3 equals zero, then do all of these have positive values.


Take a list of integers; keep the negative numbers, then drop anything not divisible by three, then check if every value is positive.


Take a list of integers; extract negatives, then filter out everything except multiples of three, then confirm all values are positive.


Take a list of integers; keep the negative numbers, then keep only multiples of three, then all positive.


Take a list of integers; extract negatives, then multiples of three only, then check if every number is above zero.


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 all(x > 0 for x in r)


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


Take a list of integers; if empty, use a single zero, then sort smallest to largest, then true if any value equals zero.


Take a list of integers; if blank use 0, then Ascending sort, then check for zero.


Take a list of integers; default to [0] when there is nothing, then Sort this ascending, then true if any value equals zero.


Take a list of integers; when the list is empty, substitute a zero value, then Sort lowest to highest, then check for zero.


Take a list of integers; replace an empty list with one zero, then Arrange from smallest to largest, then true if any value equals zero.


Take a list of integers; zero it out if it's empty, then sort ascending, then check for zero.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then trim one element off each end.


Take a list of integers; Sort it from low to high, then pad to 3, then cut off the first and last.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then remove the first and last elements.


Take a list of integers; Organize these ascending, then pad to 3, then keep only the middle part.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then drop first and last.


Take a list of integers; I need this sorted ascending, then pad to 3, then eliminate the outermost elements.


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


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


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


Take a list of integers; odd numbers only, then exclude zeros, then drop all positive numbers.


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


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


Take a list of integers; keep the positive numbers, then decrement each value, then count the elements.


Take a list of integers; get rid of anything that's not positive, then Lower each number by one, then how many items remain.


Take a list of integers; drop non-positive values, then reduce each by one, then tell me the length.


Take a list of integers; drop the negative numbers, then Subtract 1 from all, then return the length.


Take a list of integers; filter out the negative ones, then Subtract one from each, then count them.


Take a list of integers; remove all negative values, then Drop each by one, then what's the count.


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


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


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


Take a list of integers; keep evens, then Remove head, then put them in order by magnitude.


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


Take a list of integers; keep evens, then Remove head, then sort by distance from zero.


Take a list of integers; keep the even numbers, then remove the first item, then order by how far from zero.


Take a list of integers; keep evens, then Remove head, then order by distance from zero.


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


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


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


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


Take a list of integers; multiply each value by itself, then put the elements backwards, then remove all but the last three.


Take a list of integers; square them all, then reverse that for me, then take the final 3 elements.


Take a list of integers; raise each to the power of two, then flip it backwards, then drop everything except the final three.


Take a list of integers; I need each number multiplied by itself, then make it backwards, then give me the last three elements.


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


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


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then strip the signs.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then take abs of each.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then get the absolute value of everything.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then apply absolute value to the whole 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 make them all positive.


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


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


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


Take a list of integers; drop the leading negative values, then keep only even values, then shift each up by ten.


Take a list of integers; cut the leading negatives, then extract all even numbers, then increase all numbers by 10.


Take a list of integers; skip negatives at the start, then keep only even values, then add 10 to everything.


Take a list of integers; remove all negatives at the front, then extract all even numbers, then give everything a boost of 10.


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then increment each by ten.


Take a list of integers; strip the front negatives, then extract all even numbers, then add a constant 10 to each.


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


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


Take a list of integers; double each, then clamp each to at most ten, then drop non-negative values.


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


def solve(xs):
    r = list(xs)
    r = [x * 2 for x in 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; double each, then cap each value at 10, then keep the negative numbers.


Take a list of integers; drop the first and last elements, then keep values divisible by 3, then give back the product of all values.


Take a list of integers; take out the first and last items, then keep items where x mod 3 equals zero, then product of the list.


Take a list of integers; remove both ends, then drop anything not divisible by three, then what's the product.


Take a list of integers; trim the edges, then filter out everything except multiples of three, then what do they multiply to.


Take a list of integers; trim one element off each end, then keep only multiples of three, then give me their product.


Take a list of integers; cut off the first and last, then multiples of three only, then multiply them all together.


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


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


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


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


Take a list of integers; keep the even numbers, then remove repeated values, then use zero if the list is empty.


Take a list of integers; keep evens, then unique values preserving order, then default to zero when empty.


Take a list of integers; keep the even numbers, then remove repeated values, then if there's nothing, put in a zero.


Take a list of integers; keep evens, then unique values preserving order, then if no items, add a zero.


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


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


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


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


Take a list of integers; take the first 3 elements, then replace an empty list with one zero, then flip it backwards.


Take a list of integers; remove everything after the third, then zero it out if it's empty, then make it backwards.


Take a list of integers; truncate to three items, then use zero if the list is empty, then reverse the list.


Take a list of integers; show the first three, then default to zero when empty, then invert the sequence.


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


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


Take a list of integers; take the absolute value of each, then keep the leading run of positive numbers, then keep only non-zero numbers.


Take a list of integers; convert to absolute value, then take values while they are positive, then strip the zeros.


Take a list of integers; strip the signs, then take positive values then stop, then keep only non-zero numbers.


Take a list of integers; take abs of each, then keep going while positive, then strip the zeros.


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


Take a list of integers; apply absolute value to the whole list, then take while greater than zero, then strip the zeros.


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


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


Take a list of integers; drop the first element, then sort largest to smallest, then strip the signs.


Take a list of integers; Take everything except the first, then sort by descending values, then take abs of each.


Take a list of integers; drop the first element, then sort from highest to lowest, then get the absolute value of everything.


Take a list of integers; Take everything except the first, then sort descending, then apply absolute value to the whole list.


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


Take a list of integers; Take everything except the first, then sort in descending order, then make every value non-negative.


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


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


Take a list of integers; drop the leading negative values, then flip the list around, then true only if all are positive.


Take a list of integers; cut the leading negatives, then flip the order around, then do all of these have positive values.


Take a list of integers; skip negatives at the start, then put the elements backwards, then check if every value is positive.


Take a list of integers; remove all negatives at the front, then reverse that for me, then confirm all values are positive.


Take a list of integers; remove the initial run of negative numbers, then flip it backwards, then all positive.


Take a list of integers; strip the front negatives, then make it backwards, then check if every number is above zero.


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


Take a list of integers; drop the leading negative values, then reverse the order, then return whether all values are positive.


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


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


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


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


Take a list of integers; drop the first element, then remove repeated values, then Decrease all values by one.


Take a list of integers; Take everything except the first, then unique values preserving order, then Remove one from each value.


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


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


Take a list of integers; add one to each, then keep the leading run of positive numbers, then true only if all are positive.


Take a list of integers; make each one bigger, then take values while they are positive, then do all of these have positive values.


Take a list of integers; add one to each, then take positive values then stop, then check if every value is positive.


Take a list of integers; make each one bigger, then keep going while positive, then confirm all values are positive.


Take a list of integers; add one to each, then stop at first non positive, then all positive.


Take a list of integers; make each one bigger, then take while greater than zero, then check if every number is above zero.


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


Take a list of integers; add one to each, then take values while they are positive, then return whether all values are positive.


Take a list of integers; drop the leading negative values, then increase every value by 10, then keep only numbers above 5.


Take a list of integers; cut the leading negatives, then add 10 to each item, then exclude values of 5 and below.


Take a list of integers; skip negatives at the start, then shift each up by ten, then remove anything 5 or less.


Take a list of integers; remove all negatives at the front, then increase all numbers by 10, then filter to keep only values above 5.


Take a list of integers; remove the initial run of negative numbers, then add 10 to everything, then get rid of values that aren't greater than five.


Take a list of integers; strip the front negatives, then give everything a boost of 10, then drop anything 5 or below.


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


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


Take a list of integers; add ten to each, then remove all zero values, then replace an empty list with one zero.


Take a list of integers; bump everything up by 10, then exclude zeros, then zero it out if it's empty.


Take a list of integers; increase every value by 10, then remove all zero values, then use zero if the list is empty.


Take a list of integers; add 10 to each item, then exclude zeros, then default to zero when empty.


Take a list of integers; shift each up by ten, then remove all zero values, then if there's nothing, put in a zero.


Take a list of integers; increase all numbers by 10, then exclude zeros, then if no items, add a zero.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then keep values below zero, then multiply each by -1.


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


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


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


Take a list of integers; cap each value at 10, then cut the list at the first zero, then truncate to the last three items.


Take a list of integers; clip values at 10, then cut off after the first zero appears, then show only the last three.


Take a list of integers; cap each value at 10, then take values up to (excluding) the first zero, then remove all but the last three.


Take a list of integers; clip values at 10, then keep the part before the first 0, then take the final 3 elements.


Take a list of integers; cap each value at 10, then truncate at the first zero, then drop everything except the final three.


Take a list of integers; clip values at 10, then delete everything starting with the first zero, then give me the last three elements.


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


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


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


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


Take a list of integers; pad with zeros to at least three elements, then filter for numbers above 5, then remove leading negative numbers.


Take a list of integers; add zeros until the list has at least three values, then give me values where x is greater than 5, then drop negatives from start.


Take a list of integers; pad with zeros to at least three elements, then show me only the values that are bigger than five, then strip negative values from the start.


Take a list of integers; add zeros until the list has at least three values, then keep values greater than five, then remove negatives before the first non-negative.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; Sort it from low to high, then add 10 to each item, then filter out everything except multiples of three.


Take a list of integers; arrange in increasing order, then shift each up by ten, then keep only multiples of three.


Take a list of integers; Organize these ascending, then increase all numbers by 10, then multiples of three only.


Take a list of integers; Sort in ascending order, then add 10 to everything, then filter for numbers divisible by three.


Take a list of integers; I need this sorted ascending, then give everything a boost of 10, then give me only the values divisible by three.


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


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


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


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


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


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


Take a list of integers; negate each, then square all of them, then truncate to first three.


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


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then decrement each value, then strip the signs.


Take a list of integers; filter out values less than or equal to 5, then Lower each number by one, then take abs of each.


Take a list of integers; keep only numbers above 5, then reduce each by one, then get the absolute value of everything.


Take a list of integers; exclude values of 5 and below, then Subtract 1 from all, then apply absolute value to the whole list.


Take a list of integers; remove anything 5 or less, then Subtract one from each, then make them all positive.


Take a list of integers; filter to keep only values above 5, then Drop each by one, then make every value non-negative.


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


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


Take a list of integers; keep the positive numbers, then keep only even values, then put the elements backwards.


Take a list of integers; get rid of anything that's not positive, then extract all even numbers, then reverse that for me.


Take a list of integers; drop non-positive values, then keep only even values, then flip it backwards.


Take a list of integers; drop the negative numbers, then extract all even numbers, then make it backwards.


Take a list of integers; filter out the negative ones, then keep only even values, then reverse the list.


Take a list of integers; remove all negative values, then extract all even numbers, then invert the sequence.


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


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


Take a list of integers; keep multiples of three, then cut the list at the first zero, then give back the product of all values.


Take a list of integers; get rid of non-multiples of three, then cut off after the first zero appears, then product of the list.


Take a list of integers; keep values divisible by 3, then take values up to (excluding) the first zero, then what's the product.


Take a list of integers; keep items where x mod 3 equals zero, then keep the part before the first 0, then what do they multiply to.


Take a list of integers; drop anything not divisible by three, then truncate at the first zero, then give me their product.


Take a list of integers; filter out everything except multiples of three, then delete everything starting with the first zero, then multiply them all together.


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


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


Take a list of integers; keep everything before the first zero, then flip the list around, then give back the product of all values.


Take a list of integers; take only what comes before the initial zero, then flip the order around, then product of the list.


Take a list of integers; cut the list at the first zero, then put the elements backwards, then what's the product.


Take a list of integers; cut off after the first zero appears, then reverse that for me, then what do they multiply to.


Take a list of integers; take values up to (excluding) the first zero, then flip it backwards, then give me their product.


Take a list of integers; keep the part before the first 0, then make it backwards, then multiply them all together.


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


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


Take a list of integers; reverse the order, then sort largest to smallest, then give the number of evens.


Take a list of integers; reverse, then sort by descending values, then find how many values are divisible by two.


Take a list of integers; flip the list around, then sort from highest to lowest, then how many are even.


Take a list of integers; flip the order around, then sort descending, then get the total number of even values in the list.


Take a list of integers; put the elements backwards, then sort largest first, then give me the count of even values.


Take a list of integers; reverse that for me, then sort in descending order, then I need to know how many of these are even.


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


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


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


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then find how many values are divisible by two.


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


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


Take a list of integers; pad with zeros to at least three elements, then increment each value, then give me the count of even values.


Take a list of integers; add zeros until the list has at least three values, then plus one for all, then I need to know how many of these are even.


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


Take a list of integers; pad with zeros to at least three elements, then add one to each, then return how many values are even.


Take a list of integers; keep multiples of three, then skip negatives at the start, then find the max, defaulting to 0.