Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Sort by Removing by _Chico_
def sort_by_removing(values: list) -> list:
copy = []
for n in values:
if not copy: copy.append(n)
elif n >= copy[-1]: copy.append(n)
return copy
May 15, 2021
