Old kata cannot be re-ranked, closing!

Same in javascript. It doesn´t have much complexity in it.

Hi! That's really cool kata! I wanted to make something like that, but it was pretty good to find this one!

As for me sharing knowledge about FSM is a very good idea. I've seen too much code, where status of some entity was distributed between few intertwined fields and updated on ridiciously complicated logic. All of those could be replaced with one well-crafted FSM though (and somewhere I've done it).

Respect to author!

Translation to python has arrived. I expect it to take less than 100 days to be approved (based on discussion below). But I'm not sure :)

P.S. For saint, which will approve this translation:
https://www.codewars.com/kumite/630ee4590289bf14e0db2d95?sel=630ee4590289bf14e0db2d95

Hi,

Sorry it turns out that way... :/
A kata cannot be deleted once an user solved it, so I just unpublished it (nothing more can be done).

Cheers

Okay, I didn't think it worth spending more of yours and my time on this.

Thanks to all, who participate in testing and debugging of this kata. I received a bunch of good advices and will address them in other kata (if I ever decide to write one). I am sorry for spending your time on this. Sorry, I really mean it.

Anybody, that have permissions feel free to delete it. I don't have such permissions

Duplicate.

As pointed out below.

Almost of the solution in the linked kata will easily pass the test, and argument of not stating the intended data structure is not strong enough to establish enough differentiability (otherwise people will start creating kata and just for the sake for avoiding the duplicacy they can give hint or state the data stucture to be used (e.g. use dictionary))

ok, fine by me. Not sure the author of the other kata will agree...

@Blind4Basics: the kata in your link has no performance requirements. Moreover, this kata (Roads on Mars) does not specify which algorithm or data structure should be used to solve it. It is an important skill to be able to find a correct algorithm/data structure to solve a problem.