Very interesting way to perform the normal n loop 👏

This is too much discussion about the code that is available to coders that have not solved the kata. Use a spoiler tag in this case (I have already added this tag), thanks.

I tried to solve it rucursively, but couldn't figure out how to express it properly :(
It will be a long journey for me to learn how to solve problems effectively (if ever) but it's fun. (Its kind of a new hobby)

Such clean and elegant solution.

I wonder whether '0' should be treated like isolated case. I stuck there, else all tests passed. I guess not the optimal solution.

That means that too much was printed, try to reduce the number of prints you have.

Hi there, after several attempts, reading and many errors, the code was reduced to O(n) itterations, but now i get "Max Buffer Size Reached (1.5 MiB)" at the last test.
Can someone tell me why is that? Thanks

Really very elegant solution.