Sort by Removing
Your goal is to create the fastest sorting algorithm ever - Sort By Removing.
You just need to remove all elements from a given array that are in the incorrect order. As always, we have some conditions:
- it's an asc sorting;
- the first element should always stay in the result list;
- the result of an empty list is an empty list;
- the elements are always integers.
Input: A list of ints.
Output: A list of ints.
Example:
sort_by_removing([3, 5, 2, 6]) == [3, 5, 6] sort_by_removing([7, 6, 5, 4, 3, 2, 1]) == [7] sort_by_removing([3, 3, 3, 3]) == [3, 3, 3, 3] sort_by_removing([5, 6, 7, 0, 7, 0, 10]) == [5, 6, 7, 7, 10] sort_by_removing([1, 5, 2, 3, 4, 7, 8]) == [1, 5, 7, 8]
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
checkio sync
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium
Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.
