You don't have to hyper-optimize 5 kyu katas, my friend.

i have been wondering how the this code works for some time. thank you for a great explanation

ХЗ, я в функкии каждому нулевому элементу давал индекс 1. и через key он ставил нуди в конец

Thank you so much for the explanation.

Thanks for explain. I didn't figure out by my self

thank you a bunch'

actually thos solution from SO. and there you had to check for bool because that array contained bools in it .

why check for bool?

sorted isn't best practice it is O(n log n) there are better ways

thank you very much for your explanation ,it was very helpful

Fantastic solution and great explanation. It was a joy to read.

Thanks for taking the time to explain. I'm finding this a really good way to learn new functions and your example spawned a VERY late night of reading on sort() and lambda.
Very much appreciated.

I like that solution too, nice option with sorted and key!!! learnt it here a bit, thanks

Fun Fact: This type of bi-directional writing is called "Boostrophedon"!

Thank you for the deatiled explanation, it helped me a lot in understaing the sorted function