Greedy Number Greedy Number

Your mission here is to find the biggest possible number using specific rules.

  • The number has a specific length, passed through the second argument.
  • The number consists of digests passed through the first argument.
  • Every digit can be used only once.
  • The order of the digits remains the same.
  • It is always enough digits for the resulting number.

Input: Two arguments. String and Integer

Output: String.


assert greedy_number('571', 2) == '71'
assert greedy_number('12', 1) == '2'
assert greedy_number('763832', 3) == '832'
assert greedy_number('4368534743453', 5) == '87453'

Precondition: length of the string(1st argument) is bigger or equal integer(2nd argument).

Become Awesome

  • No Ads
  • No Limits
  • More Content
CheckiO Extensions

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.

<< <
> >>
exec show

Whats Next?

Free accounts will see Best CheckiO solutions with some delay.
Best Solutions will be opened in
Become Awesome and Don't wait
The next stage is ""
Will be activated in
View More Solutions Random Review Solutions Go to the next mission