Digits Doublets Digits Doublets
Simple
English DE JA

...'And as for YOU,' she went on, turning fiercely upon the Red Queen, whom she considered as the cause of all the mischief--but the Queen was no longer at her side--she had suddenly dwindled down to the size of a little doll, and was now on the table, merrily running round and round after her own shawl, which was trailing behind her.

At any other time, Alice would have felt surprised at this, but she was far too much excited to be surprised at anything NOW. 'As for YOU,' she repeated, catching hold of the little creature in the very act of jumping over a bottle which had just lighted upon the table, 'I'll shake you into a kitten, that I will!'

CHAPTER X. Shaking

She took her off the table as she spoke, and shook her backwards and forwards with all her might. The Red Queen made no resistance whatever; only her face grew very small, and her eyes got large and green: and still, as Alice went on shaking her, she kept on growing shorter--and fatter--and softer--and rounder--and--

CHAPTER XI. Waking

--and it really WAS a kitten, after all.

"Through the Looking-Glass." Lewis Carroll

Doublets, sometimes known as Word ladder, is a word game invented by Charles Dodgson (aka Lewis Carroll). A doublets puzzle begins with two words. To solve the puzzle one must find a chain of different words to link the two together such that the two adjacent words differ by one letter.

For Example: FLOUR ⇒ FLOOR ⇒ FLOOD ⇒ BLOOD ⇒ BROOD ⇒ BROAD ⇒ BREAD

The Robots like using digits more than letters, so we’ve changed the rules a little. You are given the list of numbers with exactly the same length and you must find the shortest chain of numbers to link the first number to the last like you would with the words.

For Example. There is a list [123, 991, 323, 321, 329, 121, 921, 125, 999]. The shortest way from the first to the last is: 123 ⇒ 121 ⇒ 921 ⇒ 991 ⇒ 999

You should write a function that receives a list of numbers (positive integers) and returns the shortest route as a list of numbers.

Input: Numbers as a list of integers.

Output: The shortest chain from the first to the last number as a list of integers.

Example:

checkio([123, 991, 323, 321, 329, 121, 921, 125, 999]) == [123, 121, 921, 991, 999]
checkio([111, 222, 333, 444, 555, 666, 121, 727, 127, 777]) == [111, 121, 127, 727, 777]
checkio([456, 455, 454, 356, 656, 654]) == [456, 454, 654]  # or [456, 656, 654]
    

How it is used: This task is like pathfinding for numbers. It shows how many things in this world can be represented with mathematics, even words.

Precondition: Numbers have the same length
∀ x ∈ numbers : 100 ≤ x < 1000

Settings
Code:
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

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 Share your own solution
Go to the next mission Back to the list of missions Back to the map