Greedy Number

Simple+

English

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 digits 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.

Example:

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).

int
parsing

by:

Rating: 8 Login to vote

Solve as a guest
Sign in to your account

Settings

Code:

Auto close brackets and quotes
Highlight the same word

Other:

Auto scroll to the best solutions after successful check
Do not show the best solutions (but those are still available after "View All Solutions" button)

Invalid hot key. Each hot key should be unique and valid

Hot keys:

to Run Code:
to Check Solution:
to Stop:

Save & Reload Close

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)