a_list = ['1', '110']

Nice, I didn't know you could use += to push to a string in rust. Even now, I cannot find it anywhere in the documentation.

Funny how your perception of difficulty is completely different from mine. I found it hard to convert the "terrible" recursive algorithm to an iterative algorithm that runs in linear time. That took me a while. Afterwards, writing the fraction_to_promenade function was quite trivial. Interesting how it's the other way around for you (and quite a few other people). Realizing this, I do understand why you find the description confusing. I'll edit it.

That's a good point, I'll review the order in which information is presented in the description. I've also changed the settings so that users can edit the kata.

Well, it's pretty much the description from the British Informatics Olympiad. I thought about changing it but it's kinda hard to word it any other way. Unless you have a suggestion...

Thank you, it worked.

I'd like to add a Python 3.4.3 and a Python 3.6.0 version too, but how do I do that?

Thank you! I learned pathfinding from MIT 6.034 lecture series on YouTube and the '\n' thing was my little idea :-)

Edit: Thank you, this worked. Cheers!

Nice kata. For a second I thought it would be two for the price of one (recycling the code from the other battleship kata), but this one requires a completely different approach.

Is it true that this is an NP problem?

Yeah. Doing that hurt a little.

Yes you're a fraud.

Just kidding. There's often more than one way to solve a kata, yours sounds perfectly valid.