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


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


Take a list of integers; bump everything up by 10, then Lower each number by one, then I need each number multiplied by itself.


Take a list of integers; increase every value by 10, then reduce each by one, then square all of them.


Take a list of integers; add 10 to each item, then Subtract 1 from all, then multiply each element by itself.


Take a list of integers; shift each up by ten, then Subtract one from each, then make each one squared.


Take a list of integers; increase all numbers by 10, then Drop each by one, then square each value in the list.


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


Take a list of integers; add ten to each, then subtract one from each, then square each.


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


Take a list of integers; keep evens, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; keep the even numbers, then keep only positive numbers, then check if every value is positive.


Take a list of integers; keep evens, then keep the positives, then confirm all values are positive.


Take a list of integers; keep the even numbers, then remove negatives, then all positive.


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


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


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


Take a list of integers; if empty, use a single zero, then remove all zero values, then keep only numbers above 5.


Take a list of integers; if blank use 0, then exclude zeros, then exclude values of 5 and below.


Take a list of integers; default to [0] when there is nothing, then remove all zero values, then remove anything 5 or less.


Take a list of integers; when the list is empty, substitute a zero value, then exclude zeros, then filter to keep only values above 5.


Take a list of integers; replace an empty list with one zero, then remove all zero values, then get rid of values that aren't greater than five.


Take a list of integers; zero it out if it's empty, then exclude zeros, then drop anything 5 or below.


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


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


Take a list of integers; keep values greater than five, then remove the first item, then count the elements.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then how many items remain.


Take a list of integers; keep only numbers above 5, then remove the first item, then tell me the length.


Take a list of integers; exclude values of 5 and below, then Remove head, then return the length.


Take a list of integers; remove anything 5 or less, then remove the first item, then count them.


Take a list of integers; filter to keep only values above 5, then Remove head, then what's the count.


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


Take a list of integers; keep values greater than five, then drop the first element, then return how many remain.


Take a list of integers; drop the first and last elements, then keep values above zero, then true only if all are positive.


Take a list of integers; take out the first and last items, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; remove both ends, then keep only positive numbers, then check if every value is positive.


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


Take a list of integers; trim one element off each end, then remove negatives, then all positive.


Take a list of integers; cut off the first and last, then keep the positive numbers, then check if every number is above zero.


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


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


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


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


Take a list of integers; flip the list around, then multiply each by two, then filter out the negative ones.


Take a list of integers; flip the order around, then double each item in the list, then remove all negative values.


Take a list of integers; put the elements backwards, then multiply each by two, then keep positive values only.


Take a list of integers; reverse that for me, then double each item in the list, then keep values above zero.


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 positive numbers.


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


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


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


Take a list of integers; square them all, then show the first three, then give everything a boost of 10.


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


Take a list of integers; I need each number multiplied by itself, then keep first 3, then add a constant 10 to each.


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


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


Take a list of integers; keep the odd numbers, then keep values above zero, then drop anything not divisible by three.


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


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


Take a list of integers; odd numbers only, then keep the positives, then multiples of three only.


Take a list of integers; keep the odd numbers, then remove negatives, then filter for numbers divisible by three.


Take a list of integers; odd numbers only, then keep the positive numbers, then give me only the values divisible by three.


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 % 3 == 0]
    return r


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


Take a list of integers; add one to each, then clamp each to at most ten, then trim one element off each end.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then cut off the first and last.


Take a list of integers; add one to each, then clamp each to at most ten, then remove the first and last elements.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then keep only the middle part.


Take a list of integers; add one to each, then clamp each to at most ten, then drop first and last.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then eliminate the outermost elements.


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


Take a list of integers; add one to each, then cap each value at 10, then drop the first and last elements.


Take a list of integers; square each, then keep the leading run of positive numbers, then drop non-positive values.


Take a list of integers; each value squared, then take values while they are positive, then drop the negative numbers.


Take a list of integers; multiply each value by itself, then take positive values then stop, then filter out the negative ones.


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


Take a list of integers; raise each to the power of two, then stop at first non positive, then keep positive values only.


Take a list of integers; I need each number multiplied by itself, then take while greater than zero, then keep values above zero.


def solve(xs):
    r = list(xs)
    r = [x * 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; square each, then take values while they are positive, then keep the positive numbers.


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


Take a list of integers; keep the final three items, then cut off after the first zero appears, then product of the list.


Take a list of integers; take the last three, then take values up to (excluding) the first zero, then what's the product.


Take a list of integers; trim to the last three, then keep the part before the first 0, then what do they multiply to.


Take a list of integers; last three only, then truncate at the first zero, then give me their product.


Take a list of integers; truncate to the last three items, then delete everything starting with the first zero, then multiply them all together.


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


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


Take a list of integers; keep the odd numbers, then flip the sign of each, then take values up to (excluding) the first zero.


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


Take a list of integers; keep the odd numbers, then flip the sign of each, then truncate at the first zero.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then delete everything starting with the first zero.


Take a list of integers; keep the odd numbers, then flip the sign of each, then remove from the first zero onwards.


Take a list of integers; odd numbers only, then turn positives to negatives and vice versa, then up to but not including the first zero.


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


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


Take a list of people records (name, age); extract the ages, then keep only even values, then truncate to the last three items.


Take a list of people records (name, age); show me all ages, then extract all even numbers, then show only the last three.


Take a list of people records (name, age); pluck the age field from each record, then keep only even values, then remove all but the last three.


Take a list of people records (name, age); get the age field, then extract all even numbers, then take the final 3 elements.


Take a list of people records (name, age); keep just each person's age, then keep only even values, then drop everything except the final three.


Take a list of people records (name, age); extract age values, then extract all even numbers, then give me the last three elements.


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


Take a list of people records (name, age); extract the ages, then keep the even numbers, then keep only the last three.


Take a list of integers; cap each value at 10, then keep values below zero, then ensure at least three items by appending zeros.


Take a list of integers; clip values at 10, then get the negative numbers, then ensure minimum length of three by adding zeros to the end.


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 + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; cap each value at 10, then order by distance from zero, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then sort based on absolute value, then fetch the first even element, default to 0.


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


Take a list of integers; clip values at 10, then arrange by absolute value ascending, then fetch the first even element, default to 0.


Take a list of integers; cap each value at 10, then sort from smallest to largest absolute value, then give the earliest even value or zero.


Take a list of integers; clip values at 10, then sort by absolute value, then fetch the first even element, default to 0.


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


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


Take a list of integers; negate each, then sort smallest to largest, then count the elements.


Take a list of integers; reverse the signs of everything, then Ascending sort, then how many items remain.


Take a list of integers; negate each, then Sort this ascending, then tell me the length.


Take a list of integers; reverse the signs of everything, then Sort lowest to highest, then return the length.


Take a list of integers; negate each, then Arrange from smallest to largest, then count them.


Take a list of integers; reverse the signs of everything, then sort ascending, then what's the count.


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


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


Take a list of integers; keep the positive numbers, then remove repeated values, then arrange by magnitude ignoring sign.


Take a list of integers; get rid of anything that's not positive, then unique values preserving order, then put them in order by magnitude.


Take a list of integers; drop non-positive values, then remove repeated values, then arrange in order of absolute value.


Take a list of integers; drop the negative numbers, then unique values preserving order, then sort by distance from zero.


Take a list of integers; filter out the negative ones, then remove repeated values, then order by how far from zero.


Take a list of integers; remove all negative values, then unique values preserving order, then order by distance from zero.


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


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


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


Take a list of integers; get rid of non-multiples of three, then eliminate the even numbers, then negate.


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


Take a list of integers; keep items where x mod 3 equals zero, then eliminate the even numbers, then negate.


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


Take a list of integers; filter out everything except multiples of three, then eliminate the even numbers, then negate.


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


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


Take a list of integers; take values while they are positive, then remove both ends, then drop the even numbers.


Take a list of integers; take positive values then stop, then trim the edges, then strip out the evens.


Take a list of integers; keep going while positive, then trim one element off each end, then drop the even numbers.


Take a list of integers; stop at first non positive, then cut off the first and last, then strip out the evens.


Take a list of integers; take while greater than zero, then remove the first and last elements, then drop the even numbers.


Take a list of integers; take values while positive, then keep only the middle part, then strip out the evens.


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


Take a list of integers; take values while they are positive, then drop the first and last elements, then keep the odd numbers.


Take a list of integers; keep the positive numbers, then make every value non-negative, then shift each up by ten.


Take a list of integers; get rid of anything that's not positive, then absolute value for all items, then increase all numbers by 10.


Take a list of integers; drop non-positive values, then take absolute values, then add 10 to everything.


Take a list of integers; drop the negative numbers, then turn negatives into positives, then give everything a boost of 10.


Take a list of integers; filter out the negative ones, then abs each element, then increment each by ten.


Take a list of integers; remove all negative values, then take the absolute value of each, then add a constant 10 to each.


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


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


Take a list of integers; reverse the order, then multiply each value by itself, then reduce each by one.


Take a list of integers; reverse, then square them all, then Subtract 1 from all.


Take a list of integers; flip the list around, then raise each to the power of two, then Subtract one from each.


Take a list of integers; flip the order around, then I need each number multiplied by itself, then Drop each by one.


Take a list of integers; put the elements backwards, then square all of them, then Decrease all values by one.


Take a list of integers; reverse that for me, then multiply each element by itself, then Remove one from each value.


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


Take a list of integers; reverse the order, then square each, then subtract one from each.


Take a list of strings; prefix each with a hash, then order strings from shortest to longest, then reduce each string to its first character.


Take a list of strings; add # to the start of each string, then shortest to longest, then take first char drop blanks.


Take a list of strings; prefix each with a hash, then arrange by string length ascending, then keep first letters only.


Take a list of strings; add # to the start of each string, then length sort, then first letter from each item that isn't empty.


Take a list of strings; prefix each with a hash, then sort by length shortest first, then grab the first char from each.


Take a list of strings; add # to the start of each string, then organize by string length least to greatest, then isolate the first character per entry.


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


Take a list of strings; prefix each with a hash, then sort by length, shortest first, then keep the first character of each (dropping empties).


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


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


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


Take a list of strings; change all strings to uppercase, then take first char drop blanks, then organize by string length least to greatest.


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


Take a list of strings; uppercase each one, then first letter from each item that isn't empty, then i want them ordered by how short they are.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; square each, then default to [0] when there is nothing, then trim one element off each end.


Take a list of integers; each value squared, then when the list is empty, substitute a zero value, then cut off the first and last.


Take a list of integers; multiply each value by itself, then replace an empty list with one zero, then remove the first and last elements.


Take a list of integers; square them all, then zero it out if it's empty, then keep only the middle part.


Take a list of integers; raise each to the power of two, then use zero if the list is empty, then drop first and last.


Take a list of integers; I need each number multiplied by itself, then default to zero when empty, then eliminate the outermost elements.


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


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


Take a list of integers; sort ascending, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; Sort it from low to high, then pad to 3, then check for zero.


Take a list of integers; arrange in increasing order, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; Organize these ascending, then pad to 3, then check for zero.


Take a list of integers; Sort in ascending order, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; I need this sorted ascending, then pad to 3, then check for zero.


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


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


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


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


Take a list of integers; double each, then organize by magnitude, then get the absolute value of everything.


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


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


Take a list of integers; times two for each item, then sort by absolute value, then make every value non-negative.


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


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


Take a list of integers; reverse the order, then extend to length 3 using zeros, then stop at the first non-positive value.


Take a list of integers; reverse, then pad to 3, then keep the leading run of positive numbers.


Take a list of integers; flip the list around, then extend to length 3 using zeros, then take values while they are positive.


Take a list of integers; flip the order around, then pad to 3, then take positive values then stop.


Take a list of integers; put the elements backwards, then extend to length 3 using zeros, then keep going while positive.


Take a list of integers; reverse that for me, then pad to 3, then stop at first non positive.


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


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


Take a list of integers; keep values greater than five, then keep values above zero, then trim one element off each end.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then cut off the first and last.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then remove the first and last elements.


Take a list of integers; exclude values of 5 and below, then keep the positives, then keep only the middle part.


Take a list of integers; remove anything 5 or less, then remove negatives, then drop first and last.


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


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


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


Take a list of integers; double each, then make every value non-negative, then stop at the first non-positive value.


Take a list of integers; times two for each item, then absolute value for all items, then keep the leading run of positive numbers.


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


Take a list of integers; times two for each item, then turn negatives into positives, then take positive values then stop.


Take a list of integers; double each, then abs each element, then keep going while positive.


Take a list of integers; times two for each item, then take the absolute value of each, then stop at first non positive.


def solve(xs):
    r = list(xs)
    r = [x * 2 for x in r]
    r = [abs(x) 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; double each, then take the absolute value of each, then take values while they are positive.


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


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


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


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


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


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


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


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


Take a list of integers; reverse the order, then increase every value by 10, then give back the product of all values.


Take a list of integers; reverse, then add 10 to each item, then product of the list.


Take a list of integers; flip the list around, then shift each up by ten, then what's the product.


Take a list of integers; flip the order around, then increase all numbers by 10, then what do they multiply to.


Take a list of integers; put the elements backwards, then add 10 to everything, then give me their product.


Take a list of integers; reverse that for me, then give everything a boost of 10, then multiply them all together.


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


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


Take a list of integers; square each, then take the final 3 elements, then keep only non-zero numbers.


Take a list of integers; each value squared, then drop everything except the final three, then strip the zeros.


Take a list of integers; multiply each value by itself, then give me the last three elements, then keep only non-zero numbers.


Take a list of integers; square them all, then keep only the last three, then strip the zeros.


Take a list of integers; raise each to the power of two, then keep the final three items, then keep only non-zero numbers.


Take a list of integers; I need each number multiplied by itself, then take the last three, then strip the zeros.


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


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


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


Take a list of integers; keep the final three items, then pad to 3, then check for zero.


Take a list of integers; take the last three, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; trim to the last three, then pad to 3, then check for zero.


Take a list of integers; last three only, then extend to length 3 using zeros, then true if any value equals zero.


Take a list of integers; truncate to the last three items, then pad to 3, then check for zero.


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


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


Take a list of integers; drop the zeros, then multiply each by two, then arrange in increasing order.


Take a list of integers; keep only nonzero elements, then double each item in the list, then Organize these ascending.


Take a list of integers; drop the zeros, then multiply each by two, then Sort in ascending order.


Take a list of integers; keep only nonzero elements, then double each item in the list, then I need this sorted ascending.


Take a list of integers; drop the zeros, then multiply each by two, then Put these in ascending order.


Take a list of integers; keep only nonzero elements, then double each item in the list, then sort smallest to largest.


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


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


Take a list of integers; reverse the order, then keep values divisible by 3, then limit every value to 10.


Take a list of integers; reverse, then keep items where x mod 3 equals zero, then maximum of 10 for all.


Take a list of integers; flip the list around, then drop anything not divisible by three, then limit every value to 10.


Take a list of integers; flip the order around, then filter out everything except multiples of three, then maximum of 10 for all.


Take a list of integers; put the elements backwards, then keep only multiples of three, then limit every value to 10.


Take a list of integers; reverse that for me, then multiples of three only, then maximum of 10 for all.


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


Take a list of integers; reverse the order, then keep multiples of three, then cap each value at 10.


Take a list of people records (name, age); extract the ages, then remove repeated values, then find the max, defaulting to 0.


Take a list of people records (name, age); show me all ages, then unique values preserving order, then Give me the maximum, but 0 if there are no items.


Take a list of people records (name, age); pluck the age field from each record, then remove repeated values, then What's the highest number in the list.


Take a list of people records (name, age); get the age field, then unique values preserving order, then Return the greatest value or default to 0.


Take a list of people records (name, age); keep just each person's age, then remove repeated values, then Find the largest element, defaulting to zero.


Take a list of people records (name, age); extract age values, then unique values preserving order, then give the largest value (0 if none).


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


Take a list of people records (name, age); extract the ages, then drop duplicates keeping first occurrence, then return the maximum (0 if empty).


Take a list of integers; keep the odd numbers, then keep values above zero, then truncate to the last three items.


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


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


Take a list of integers; odd numbers only, then keep the positives, then take the final 3 elements.


Take a list of integers; keep the odd numbers, then remove negatives, then drop everything except the final three.


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


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


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


Take a list of integers; pad with zeros to at least three elements, then keep values above zero, then arrange in increasing order.


Take a list of integers; add zeros until the list has at least three values, then filter for positive numbers, then Organize these ascending.


Take a list of integers; pad with zeros to at least three elements, then keep only positive numbers, then Sort in ascending order.


Take a list of integers; add zeros until the list has at least three values, then keep the positives, then I need this sorted ascending.


Take a list of integers; pad with zeros to at least three elements, then remove negatives, then Put these in ascending order.


Take a list of integers; add zeros until the list has at least three values, then keep the positive numbers, then sort smallest to largest.


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


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


Take a list of integers; take values while they are positive, then remove repeated values, then true if already sorted smallest to largest.


Take a list of integers; take positive values then stop, then unique values preserving order, then does this list go in ascending order.


Take a list of integers; keep going while positive, then remove repeated values, then check if the list is in ascending order.


Take a list of integers; stop at first non positive, then unique values preserving order, then is the list sorted.


Take a list of integers; take while greater than zero, then remove repeated values, then is it sorted.


Take a list of integers; take values while positive, then unique values preserving order, then check if values are in increasing order.


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


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


Take a list of integers; drop duplicates keeping first occurrence, then multiply each value by itself, then make each twice as big.


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


Take a list of integers; drop duplicates keeping first occurrence, then raise each to the power of two, then make each twice as big.


Take a list of integers; drop duplicates but keep the first one, then I need each number multiplied by itself, then multiply each by 2.


Take a list of integers; drop duplicates keeping first occurrence, then square all of them, then make each twice as big.


Take a list of integers; drop duplicates but keep the first one, then multiply each element by itself, then multiply each by 2.


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


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


Take a list of integers; sort by absolute value, then skip negatives at the start, then trim one element off each end.


Take a list of integers; rearrange by distance from zero, then remove all negatives at the front, then cut off the first and last.


Take a list of integers; arrange by magnitude ignoring sign, then remove the initial run of negative numbers, then remove the first and last elements.


Take a list of integers; put them in order by magnitude, then strip the front negatives, then keep only the middle part.


Take a list of integers; arrange in order of absolute value, then remove leading negative numbers, then drop first and last.


Take a list of integers; sort by distance from zero, then drop negatives from start, then eliminate the outermost elements.


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


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


Take a list of integers; keep everything before the first zero, then extend to length 3 using zeros, then reduce each by one.


Take a list of integers; take only what comes before the initial zero, then pad to 3, then Subtract 1 from all.


Take a list of integers; cut the list at the first zero, then extend to length 3 using zeros, then Subtract one from each.


Take a list of integers; cut off after the first zero appears, then pad to 3, then Drop each by one.


Take a list of integers; take values up to (excluding) the first zero, then extend to length 3 using zeros, then Decrease all values by one.


Take a list of integers; keep the part before the first 0, then pad to 3, then Remove one from each value.


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


Take a list of integers; keep everything before the first zero, then pad with zeros to at least three elements, then subtract one from each.


Take a list of integers; take values while they are positive, then keep values above zero, then find the min, defaulting to 0.


Take a list of integers; take positive values then stop, then filter for positive numbers, then minimum value, zero otherwise.


Take a list of integers; keep going while positive, then keep only positive numbers, then get the minimum value or zero if empty.


Take a list of integers; stop at first non positive, then keep the positives, then give me the min or 0.


Take a list of integers; take while greater than zero, then remove negatives, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then keep the positive numbers, then return smallest or zero if empty.


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


Take a list of integers; take values while they are positive, then keep the positive numbers, then return the minimum (0 if empty).


Take a list of integers; keep everything before the first zero, then remove the first item, then find the min, defaulting to 0.


Take a list of integers; take only what comes before the initial zero, then Remove head, then minimum value, zero otherwise.


Take a list of integers; cut the list at the first zero, then remove the first item, then get the minimum value or zero if empty.


Take a list of integers; cut off after the first zero appears, then Remove head, then give me the min or 0.


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


Take a list of integers; keep the part before the first 0, then Remove head, 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[1:]
    return min(r) if r else 0


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


Take a list of integers; take values while they are positive, then remove all zero values, then find the min, defaulting to 0.


Take a list of integers; take positive values then stop, then exclude zeros, then minimum value, zero otherwise.


Take a list of integers; keep going while positive, then remove all zero values, then get the minimum value or zero if empty.


Take a list of integers; stop at first non positive, then exclude zeros, then give me the min or 0.


Take a list of integers; take while greater than zero, then remove all zero values, then return the smallest number, defaulting to 0.


Take a list of integers; take values while positive, then exclude zeros, then return smallest or zero if empty.


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


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


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


Take a list of integers; make each one bigger, then get the negative numbers, then put them in order by magnitude.


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


Take a list of integers; make each one bigger, then get the negative numbers, then sort by distance from zero.


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


Take a list of integers; make each one bigger, then get the negative numbers, then order by distance from zero.


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


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


Take a list of integers; keep the odd numbers, then remove all zero values, then give the number of evens.


Take a list of integers; odd numbers only, then exclude zeros, then find how many values are divisible by two.


Take a list of integers; keep the odd numbers, then remove all zero values, then how many are even.


Take a list of integers; odd numbers only, then exclude zeros, then get the total number of even values in the list.


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


Take a list of integers; odd numbers only, then exclude zeros, then I need to know how many of these are even.


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


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


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


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


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


Take a list of integers; cut off after the first zero appears, then keep the positives, then remove repeats.


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


Take a list of integers; keep the part before the first 0, then keep the positive numbers, then remove repeats.


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 = list(dict.fromkeys(r))
    return r


Take a list of integers; keep everything before the first zero, then keep the positive numbers, then drop duplicates keeping first occurrence.


Take a list of integers; drop the zeros, then cut the list at the first zero, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then cut off after the first zero appears, then fetch the first even element, default to 0.


Take a list of integers; drop the zeros, then take values up to (excluding) the first zero, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then keep the part before the first 0, then fetch the first even element, default to 0.


Take a list of integers; drop the zeros, then truncate at the first zero, then give the earliest even value or zero.


Take a list of integers; keep only nonzero elements, then delete everything starting with the first zero, then fetch the first even element, default to 0.


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
    return next((x for x in r if x % 2 == 0), 0)


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


Take a list of integers; add one to each, then clamp each to at most ten, then drop the even numbers.


Take a list of integers; make each one bigger, then don't let anything exceed 10, then strip out the evens.


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


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


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


Take a list of integers; clip values at 10, then exclude zeros, then keep the part before the first 0.


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


Take a list of integers; clip values at 10, then exclude zeros, then delete everything starting with the first zero.


Take a list of integers; cap each value at 10, then remove all zero values, then remove from the first zero onwards.


Take a list of integers; clip values at 10, then exclude zeros, then up to but not including the first zero.


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[:r.index(0)] if 0 in r else r
    return r


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


Take a list of integers; keep the odd numbers, then take the first 3 elements, then true if already sorted smallest to largest.


Take a list of integers; odd numbers only, then remove everything after the third, then does this list go in ascending order.


Take a list of integers; keep the odd numbers, then truncate to three items, then check if the list is in ascending order.


Take a list of integers; odd numbers only, then show the first three, then is the list sorted.


Take a list of integers; keep the odd numbers, then take the first three, then is it sorted.


Take a list of integers; odd numbers only, then keep first 3, then check if values are in increasing order.


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


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


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


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


Take a list of integers; take the first 3 elements, then give me the last three elements, then remove leading negative numbers.


Take a list of integers; remove everything after the third, then keep only the last three, then drop negatives from start.


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


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


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


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


Take a list of integers; subtract one from each, then flip the list around, then take values up to (excluding) the first zero.


Take a list of integers; Decrement all items, then flip the order around, then keep the part before the first 0.


Take a list of integers; decrement each value, then put the elements backwards, then truncate at the first zero.


Take a list of integers; Lower each number by one, then reverse that for me, then delete everything starting with the first zero.


Take a list of integers; reduce each by one, then flip it backwards, then remove from the first zero onwards.


Take a list of integers; Subtract 1 from all, then make it backwards, then up to but not including the first zero.


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


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


Take a list of integers; subtract one from each, then remove repeated values, then true if already sorted smallest to largest.


Take a list of integers; Decrement all items, then unique values preserving order, then does this list go in ascending order.


Take a list of integers; decrement each value, then remove repeated values, then check if the list is in ascending order.


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


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


Take a list of integers; Subtract 1 from all, then unique values preserving order, then check if values are in increasing order.


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


Take a list of integers; subtract one from each, then drop duplicates keeping first occurrence, then return whether the list is sorted ascending.


Take a list of integers; subtract one from each, then sort smallest to largest, then ensure at least three items by appending zeros.


Take a list of integers; Decrement all items, then Ascending sort, then ensure minimum length of three by adding zeros to the end.


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


Take a list of integers; Lower each number by one, then Sort lowest to highest, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; reduce each by one, then Arrange from smallest to largest, then ensure at least three items by appending zeros.


Take a list of integers; Subtract 1 from all, then sort ascending, 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 = sorted(r)
    r = r + [0] * (3 - len(r)) if len(r) < 3 else r
    return r


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


Take a list of integers; drop the first and last elements, then multiply each by two, then arrange by magnitude ignoring sign.


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


Take a list of integers; remove both ends, then multiply each by two, then arrange in order of absolute value.


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


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


Take a list of integers; cut off the first and last, then double each item in the list, then order by distance from zero.


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


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


Take a list of integers; keep the even numbers, then drop anything 5 or below, then make each twice as big.


Take a list of integers; keep evens, then keep only numbers greater than 5, then multiply each by 2.


Take a list of integers; keep the even numbers, then filter for numbers above 5, then make each twice as big.


Take a list of integers; keep evens, then give me values where x is greater than 5, then multiply each by 2.


Take a list of integers; keep the even numbers, then show me only the values that are bigger than five, then make each twice as big.


Take a list of integers; keep evens, then keep values greater than five, then multiply each by 2.


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


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


Take a list of integers; keep the odd numbers, then multiply each value by itself, then find the min, defaulting to 0.


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


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


Take a list of integers; odd numbers only, then I need each number multiplied by itself, then give me the min or 0.


Take a list of integers; keep the odd numbers, then square all of them, then return the smallest number, defaulting to 0.


Take a list of integers; odd numbers only, then multiply each element by itself, then return smallest or zero if empty.


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


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


Take a list of integers; keep values greater than five, then keep values above zero, then give the earliest even value or zero.


Take a list of integers; filter out values less than or equal to 5, then filter for positive numbers, then fetch the first even element, default to 0.


Take a list of integers; keep only numbers above 5, then keep only positive numbers, then give the earliest even value or zero.


Take a list of integers; exclude values of 5 and below, then keep the positives, then fetch the first even element, default to 0.


Take a list of integers; remove anything 5 or less, then remove negatives, then give the earliest even value or zero.


Take a list of integers; filter to keep only values above 5, then keep the positive numbers, then fetch the first even element, default to 0.


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


Take a list of integers; keep values greater than five, then keep the positive numbers, then return the first even value (0 if none).


Take a list of integers; keep the even numbers, then remove the first item, then take values up to (excluding) the first zero.


Take a list of integers; keep evens, then Remove head, then keep the part before the first 0.


Take a list of integers; keep the even numbers, then remove the first item, then truncate at the first zero.


Take a list of integers; keep evens, then Remove head, then delete everything starting with the first zero.


Take a list of integers; keep the even numbers, then remove the first item, then remove from the first zero onwards.


Take a list of integers; keep evens, then Remove head, then up to but not including the first zero.


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


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


Take a list of integers; keep only the first three, then take the final 3 elements, then true if any value equals zero.


Take a list of integers; keep the first 3 items, then drop everything except the final three, then check for zero.


Take a list of integers; take the first 3 elements, then give me the last three elements, then true if any value equals zero.


Take a list of integers; remove everything after the third, then keep only the last three, then check for zero.


Take a list of integers; truncate to three items, then keep the final three items, then true if any value equals zero.


Take a list of integers; show the first three, then take the last three, then check for zero.


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


Take a list of integers; keep only the first three, then keep only the last three, then return whether the list contains a zero.


Take a list of integers; drop the leading negative values, then drop anything 5 or below, then find the max, defaulting to 0.


Take a list of integers; cut the leading negatives, then keep only numbers greater than 5, then Give me the maximum, but 0 if there are no items.


Take a list of integers; skip negatives at the start, then filter for numbers above 5, then What's the highest number in the list.


Take a list of integers; remove all negatives at the front, then give me values where x is greater than 5, then Return the greatest value or default to 0.


Take a list of integers; remove the initial run of negative numbers, then show me only the values that are bigger than five, then Find the largest element, defaulting to zero.


Take a list of integers; strip the front negatives, then keep values greater than five, then give the largest value (0 if none).


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


Take a list of integers; drop the leading negative values, then keep values greater than five, then return the maximum (0 if empty).


Take a list of integers; add one to each, then take the final 3 elements, then true if already sorted smallest to largest.


Take a list of integers; make each one bigger, then drop everything except the final three, then does this list go in ascending order.


Take a list of integers; add one to each, then give me the last three elements, then check if the list is in ascending order.


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


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


Take a list of integers; make each one bigger, then take the last three, then check if values are in increasing order.


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


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


Take a list of integers; drop the zeros, then sort smallest to largest, then replace an empty list with one zero.


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


Take a list of integers; drop the zeros, then Sort this ascending, then use zero if the list is empty.


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


Take a list of integers; drop the zeros, then Arrange from smallest to largest, then if there's nothing, put in a zero.


Take a list of integers; keep only nonzero elements, then sort ascending, then if no items, add a zero.


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


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


Take a list of integers; sort descending, then flip the sign of each, then ensure at least three items by appending zeros.


Take a list of integers; sort largest first, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort in descending order, then flip the sign of each, then ensure at least three items by appending zeros.


Take a list of integers; sort from greatest to least, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


Take a list of integers; sort z to a, then flip the sign of each, then ensure at least three items by appending zeros.


Take a list of integers; arrange in decreasing order, then turn positives to negatives and vice versa, then ensure minimum length of three by adding zeros to the end.


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


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


Take a list of integers; sort by absolute value, then drop anything 5 or below, then find the max, defaulting to 0.


Take a list of integers; rearrange by distance from zero, then keep only numbers greater than 5, then Give me the maximum, but 0 if there are no items.


Take a list of integers; arrange by magnitude ignoring sign, then filter for numbers above 5, then What's the highest number in the list.


Take a list of integers; put them in order by magnitude, then give me values where x is greater than 5, then Return the greatest value or default to 0.


Take a list of integers; arrange in order of absolute value, then show me only the values that are bigger than five, then Find the largest element, defaulting to zero.


Take a list of integers; sort by distance from zero, then keep values greater than five, then give the largest value (0 if none).


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


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


Take a list of integers; drop the leading negative values, then increment each value, then arrange in increasing order.


Take a list of integers; cut the leading negatives, then plus one for all, then Organize these ascending.


Take a list of integers; skip negatives at the start, then increment each value, then Sort in ascending order.


Take a list of integers; remove all negatives at the front, then plus one for all, then I need this sorted ascending.


Take a list of integers; remove the initial run of negative numbers, then increment each value, then Put these in ascending order.


Take a list of integers; strip the front negatives, then plus one for all, then sort smallest to largest.


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


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


Take a list of integers; take values while they are positive, then keep values below zero, then give back the product of all values.


Take a list of integers; take positive values then stop, then get the negative numbers, then product of the list.


Take a list of integers; keep going while positive, then keep values below zero, then what's the product.


Take a list of integers; stop at first non positive, then get the negative numbers, then what do they multiply to.


Take a list of integers; take while greater than zero, then keep values below zero, then give me their product.


Take a list of integers; take values while positive, then get the negative numbers, then multiply them all together.


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


Take a list of integers; take values while they are positive, then keep the negative numbers, then return their product.


Take a list of integers; sort descending, then clamp each to at most ten, then multiply each by -1.


Take a list of integers; sort largest first, then don't let anything exceed 10, then negate.


Take a list of integers; sort in descending order, then clamp each to at most ten, then multiply each by -1.


Take a list of integers; sort from greatest to least, then don't let anything exceed 10, then negate.


Take a list of integers; sort z to a, then clamp each to at most ten, then multiply each by -1.


Take a list of integers; arrange in decreasing order, then don't let anything exceed 10, then negate.


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


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


Take a list of integers; take values while they are positive, then drop anything 5 or below, then trim one element off each end.


Take a list of integers; take positive values then stop, then keep only numbers greater than 5, then cut off the first and last.


Take a list of integers; keep going while positive, then filter for numbers above 5, then remove the first and last elements.


Take a list of integers; stop at first non positive, then give me values where x is greater than 5, then keep only the middle part.


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


Take a list of integers; take values while positive, then keep values greater than five, 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 > 5]
    r = r[1:-1]
    return r


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


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


Take a list of integers; each value squared, then sort by descending values, then cut off the first and last.


Take a list of integers; multiply each value by itself, then sort from highest to lowest, then remove the first and last elements.


Take a list of integers; square them all, then sort descending, then keep only the middle part.


Take a list of integers; raise each to the power of two, then sort largest first, then drop first and last.


Take a list of integers; I need each number multiplied by itself, then sort in descending order, then eliminate the outermost elements.


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


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


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


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


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


Take a list of integers; keep only nonzero elements, then filter out everything except multiples of three, then negate.


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


Take a list of integers; keep only nonzero elements, then multiples of three only, then negate.


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


Take a list of integers; drop the zeros, then keep multiples of three, then negate each.


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


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


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


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


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


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


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


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


Take a list of integers; keep values greater than five, then remove the first item, then multiply each by -1.


Take a list of integers; filter out values less than or equal to 5, then Remove head, then negate.


Take a list of integers; keep only numbers above 5, then remove the first item, then multiply each by -1.


Take a list of integers; exclude values of 5 and below, then Remove head, then negate.


Take a list of integers; remove anything 5 or less, then remove the first item, then multiply each by -1.


Take a list of integers; filter to keep only values above 5, then Remove head, then negate.


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


Take a list of integers; keep values greater than five, then drop the first element, then negate each.


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


Take a list of integers; cut the leading negatives, then extract all even numbers, then exclude values of 5 and below.


Take a list of integers; skip negatives at the start, then keep only even values, then remove anything 5 or less.


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


Take a list of integers; remove the initial run of negative numbers, then keep only even values, then get rid of values that aren't greater than five.


Take a list of integers; strip the front negatives, then extract all even numbers, 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 for x in r if x % 2 == 0]
    r = [x for x in r if x > 5]
    return r


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


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


Take a list of integers; if blank use 0, then don't let anything exceed 10, then take abs of each.


Take a list of integers; default to [0] when there is nothing, then clamp each to at most ten, then get the absolute value of everything.


Take a list of integers; when the list is empty, substitute a zero value, then don't let anything exceed 10, then apply absolute value to the whole list.


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


Take a list of integers; zero it out if it's empty, then don't let anything exceed 10, then make every value non-negative.


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


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


Take a list of integers; cap each value at 10, then keep values above zero, then true if any value equals zero.


Take a list of integers; clip values at 10, then filter for positive numbers, then check for zero.


Take a list of integers; cap each value at 10, then keep only positive numbers, then true if any value equals zero.


Take a list of integers; clip values at 10, then keep the positives, then check for zero.


Take a list of integers; cap each value at 10, then remove negatives, then true if any value equals zero.


Take a list of integers; clip values at 10, then keep the positive numbers, then check for zero.


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


Take a list of integers; cap each value at 10, then keep the positive numbers, then return whether the list contains a zero.


Take a list of integers; keep multiples of three, then keep the leading run of positive numbers, then arrange in increasing order.


Take a list of integers; get rid of non-multiples of three, then take values while they are positive, then Organize these ascending.


Take a list of integers; keep values divisible by 3, then take positive values then stop, then Sort in ascending order.


Take a list of integers; keep items where x mod 3 equals zero, then keep going while positive, then I need this sorted ascending.


Take a list of integers; drop anything not divisible by three, then stop at first non positive, then Put these in ascending order.


Take a list of integers; filter out everything except multiples of three, then take while greater than zero, then sort smallest to largest.


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


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


Take a list of integers; keep values greater than five, then remove both ends, then strip the signs.


Take a list of integers; filter out values less than or equal to 5, then trim the edges, then take abs of each.


Take a list of integers; keep only numbers above 5, then trim one element off each end, then get the absolute value of everything.


Take a list of integers; exclude values of 5 and below, then cut off the first and last, then apply absolute value to the whole list.


Take a list of integers; remove anything 5 or less, then remove the first and last elements, then make them all positive.


Take a list of integers; filter to keep only values above 5, then keep only the middle part, then make every value non-negative.


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


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


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


Take a list of integers; get rid of anything that's not positive, then sort by descending values, then multiply each by 2.


Take a list of integers; drop non-positive values, then sort from highest to lowest, then make each twice as big.


Take a list of integers; drop the negative numbers, then sort descending, then multiply each by 2.


Take a list of integers; filter out the negative ones, then sort largest first, then make each twice as big.


Take a list of integers; remove all negative values, then sort in descending order, then multiply each by 2.


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


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


Take a list of integers; take the absolute value of each, then keep values above zero, then true only if all are positive.


Take a list of integers; convert to absolute value, then filter for positive numbers, then do all of these have positive values.


Take a list of integers; strip the signs, then keep only positive numbers, then check if every value is positive.


Take a list of integers; take abs of each, then keep the positives, then confirm all values are positive.


Take a list of integers; get the absolute value of everything, then remove negatives, then all positive.


Take a list of integers; apply absolute value to the whole list, then keep the positive numbers, then check if every number is above zero.


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


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


Take a list of integers; subtract one from each, then skip negatives at the start, then strip the signs.


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


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


Take a list of integers; Lower each number by one, then strip the front negatives, then apply absolute value to the whole list.


Take a list of integers; reduce each by one, then remove leading negative numbers, then make them all positive.


Take a list of integers; Subtract 1 from all, then drop negatives from start, then make every value non-negative.


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)):]
    r = [abs(x) for x in r]
    return r


Take a list of integers; subtract one from each, then drop the leading negative values, then take the absolute value of each.


Take a list of integers; keep the negative numbers, then take the first 3 elements, then give back the product of all values.


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


Take a list of integers; keep the negative numbers, then truncate to three items, then what's the product.


Take a list of integers; extract negatives, then show the first three, then what do they multiply to.


Take a list of integers; keep the negative numbers, then take the first three, then give me their product.


Take a list of integers; extract negatives, then keep first 3, then multiply them all together.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; add ten to each, then cut the list at the first zero, then give the number of evens.


Take a list of integers; bump everything up by 10, then cut off after the first zero appears, then find how many values are divisible by two.


Take a list of integers; increase every value by 10, then take values up to (excluding) the first zero, then how many are even.


Take a list of integers; add 10 to each item, then keep the part before the first 0, then get the total number of even values in the list.


Take a list of integers; shift each up by ten, then truncate at the first zero, then give me the count of even values.


Take a list of integers; increase all numbers by 10, then delete everything starting with the first zero, then I need to know how many of these are even.


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


Take a list of integers; add ten to each, then keep everything before the first zero, then return how many values are even.


Take a list of integers; if empty, use a single zero, then flip the sign of each, then truncate to the last three items.


Take a list of integers; if blank use 0, then turn positives to negatives and vice versa, then show only the last three.


Take a list of integers; default to [0] when there is nothing, then flip the sign of each, then remove all but the last three.


Take a list of integers; when the list is empty, substitute a zero value, then turn positives to negatives and vice versa, then take the final 3 elements.


Take a list of integers; replace an empty list with one zero, then flip the sign of each, then drop everything except the final three.


Take a list of integers; zero it out if it's empty, then turn positives to negatives and vice versa, then give me the last three elements.


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


Take a list of integers; if empty, use a single zero, then negate each, then keep only the last three.


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


Take a list of integers; clip values at 10, then sort by descending values, then how many items remain.


Take a list of integers; cap each value at 10, then sort from highest to lowest, then tell me the length.


Take a list of integers; clip values at 10, then sort descending, then return the length.


Take a list of integers; cap each value at 10, then sort largest first, then count them.


Take a list of integers; clip values at 10, then sort in descending order, then what's the count.


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


Take a list of integers; cap each value at 10, then sort descending, then return how many remain.


Take a list of integers; take the absolute value of each, then sort largest to smallest, then true if any value equals zero.


Take a list of integers; convert to absolute value, then sort by descending values, then check for zero.


Take a list of integers; strip the signs, then sort from highest to lowest, then true if any value equals zero.


Take a list of integers; take abs of each, then sort descending, then check for zero.


Take a list of integers; get the absolute value of everything, then sort largest first, then true if any value equals zero.


Take a list of integers; apply absolute value to the whole list, then sort in descending order, then check for zero.


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


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


Take a list of integers; keep the even numbers, then keep the leading run of positive numbers, then limit every value to 10.


Take a list of integers; keep evens, then take values while they are positive, then maximum of 10 for all.


Take a list of integers; keep the even numbers, then take positive values then stop, then limit every value to 10.


Take a list of integers; keep evens, then keep going while positive, then maximum of 10 for all.


Take a list of integers; keep the even numbers, then stop at first non positive, then limit every value to 10.


Take a list of integers; keep evens, then take while greater than zero, then maximum of 10 for all.


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


Take a list of integers; keep the even numbers, then take values while they are positive, then cap each value at 10.


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


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


Take a list of integers; cut the list at the first zero, then increment each value, then what's the product.


Take a list of integers; cut off after the first zero appears, then plus one for all, then what do they multiply to.


Take a list of integers; take values up to (excluding) the first zero, then increment each value, then give me their product.


Take a list of integers; keep the part before the first 0, then plus one for all, then multiply them all together.


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


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


Take a list of strings; sort alphabetically, then remove repeated strings, then true if a blank string is present.


Take a list of strings; arrange alphabetically, then keep unique strings first appearance, then check for empty strings in the list.


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


Take a list of strings; arrange alphabetically, then drop duplicate strings keeping the first, then does the collection contain an empty string value somewhere.


Take a list of strings; sort alphabetically, then dedupe, then whether any element is blank.


Take a list of strings; arrange alphabetically, then remove duplicate strings keep first, then check for an empty string.


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


Take a list of strings; sort alphabetically, then drop duplicate strings keeping the first, then return whether any string is empty.


Take a list of integers; take the absolute value of each, then flip the list around, then stop at the first non-positive value.


Take a list of integers; convert to absolute value, then flip the order around, then keep the leading run of positive numbers.


Take a list of integers; strip the signs, then put the elements backwards, then take values while they are positive.


Take a list of integers; take abs of each, then reverse that for me, then take positive values then stop.


Take a list of integers; get the absolute value of everything, then flip it backwards, then keep going while positive.


Take a list of integers; apply absolute value to the whole list, then make it backwards, then stop at first non positive.


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


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


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


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


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


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


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


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


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


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


Take a list of integers; keep the even numbers, then increment each value, then arrange by magnitude ignoring sign.


Take a list of integers; keep evens, then plus one for all, then put them in order by magnitude.


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


Take a list of integers; keep evens, then plus one for all, then sort by distance from zero.


Take a list of integers; keep the even numbers, then increment each value, then order by how far from zero.


Take a list of integers; keep evens, then plus one for all, then order by distance from zero.


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


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


Take a list of people records (name, age); extract the ages, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of people records (name, age); show me all ages, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); pluck the age field from each record, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of people records (name, age); get the age field, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


Take a list of people records (name, age); keep just each person's age, then multiply each by two, then ensure at least three items by appending zeros.


Take a list of people records (name, age); extract age values, then double each item in the list, then ensure minimum length of three by adding zeros to the end.


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


Take a list of people records (name, age); extract the ages, then double each, then pad with zeros to at least three elements.


Take a list of integers; take the absolute value of each, then remove both ends, then deduplicate the list.


Take a list of integers; convert to absolute value, then trim the edges, then remove repeats.


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


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


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


Take a list of integers; apply absolute value to the whole list, then keep only the middle part, then remove repeats.


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


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


Take a list of integers; keep values greater than five, then sort largest to smallest, then make each twice as big.


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


Take a list of integers; keep only numbers above 5, then sort from highest to lowest, then make each twice as big.


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


Take a list of integers; remove anything 5 or less, then sort largest first, then make each twice as big.


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


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


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


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


Take a list of integers; take positive values then stop, then cut off after the first zero appears, then exclude values of 5 and below.


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


Take a list of integers; stop at first non positive, then keep the part before the first 0, then filter to keep only values above 5.


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


Take a list of integers; take values while positive, then delete everything starting with the first zero, 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 = r[:r.index(0)] if 0 in r else r
    r = [x for x in r if x > 5]
    return r


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


Take a list of integers; keep everything before the first zero, then multiply each value by itself, then give the number of evens.


Take a list of integers; take only what comes before the initial zero, then square them all, then find how many values are divisible by two.


Take a list of integers; cut the list at the first zero, then raise each to the power of two, then how many are even.


Take a list of integers; cut off after the first zero appears, then I need each number multiplied by itself, then get the total number of even values in the list.


Take a list of integers; take values up to (excluding) the first zero, then square all of them, then give me the count of even values.


Take a list of integers; keep the part before the first 0, then multiply each element by itself, then I need to know how many of these are even.


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


Take a list of integers; keep everything before the first zero, then square each, then return how many values are even.


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


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


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


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


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


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


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


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


Take a list of strings; trim whitespace from each, then remove repeated strings, then find the longest one, defaulting to empty.


Take a list of strings; strip whitespace from every element, then keep unique strings first appearance, then Longest string, or nothing if there isn't one.


Take a list of strings; remove surrounding whitespace, then eliminate repeated strings preserve first occurrence, then find the longest one, defaulting to empty.


Take a list of strings; trim the whitespace off everything, then drop duplicate strings keeping the first, then Longest string, or nothing if there isn't one.


Take a list of strings; strip spaces from all strings, then dedupe, then find the longest one, defaulting to empty.