Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Find indices of discontinuities and apply slicing solution in Clear category for Reverse Every Ascending by perimeter
def reverse_ascending(items):
# your code here
l = [0] + [idx for idx, (x, y) in enumerate(zip(items, items[1:]), 1 ) if y-x <= 0] + [len(items)]
r = []
for s, e in zip(l, l[1:]):
r += reversed(items[s:e])
return r
if __name__ == '__main__':
print("Example:")
print(reverse_ascending([1, 2, 3, 4, 5]))
# These "asserts" are used for self-checking and not for an auto-testing
assert list(reverse_ascending([1, 2, 3, 4, 5])) == [5, 4, 3, 2, 1]
assert list(reverse_ascending([5, 7, 10, 4, 2, 7, 8, 1, 3])) == [10, 7, 5, 4, 8, 7, 2, 3, 1]
assert list(reverse_ascending([5, 4, 3, 2, 1])) == [5, 4, 3, 2, 1]
assert list(reverse_ascending([])) == []
assert list(reverse_ascending([1])) == [1]
assert list(reverse_ascending([1, 1])) == [1, 1]
assert list(reverse_ascending([1, 1, 2])) == [1, 2, 1]
print("Coding complete? Click 'Check' to earn cool rewards!")
Nov. 11, 2021
