Python, probably other languages: no actual random tests. The fixed tests are so pathetic that the code only needs 15 cells of memory. This kata needs to be nuked and redone for all languages that have this kind of tests.

Check that you used correct indices. I used indice from out loop in inner loop and spent close to 50 minutes printing everything to see why timeout happens.

BF translation: how many nested loops should the solution support?

i had no idea what i was doing and no way could have figured this out. thanks for reminding me im far from mastering 7 kyu

Очень хорошее Ката. Автор молодец, огромное тебе спасибо. Все удачного кодирования!

The description talks about ASCII-Values for input and output. ASCII has values from 0 to 127. Yet, the last input character of the first test example has a value of 255.
My code looped forever until I figured this out, because that character does not have an ASCII value. [ In Swift: Character(UnicodeScalar(255)).asciiValue == nil ]

Please change the description.

lol!!! I didnt know js has a native method to convert numbers to binary, I coded all the conversion in the function, hahahahha

Merged.

Hey everyone, I am solving this kata using kotlin, and my solution passes all the testcases, but the fibinochi one. In the fibinochi testcase, my program outputs: I7, 1, 2, ..... As you can see that the problem is in the beginning. Does this have happend to anyone?

What you mean by the "content"?

It might be a good idea to include this crucial tip in the instructions for this awesome kata: "Brackets must be matched based on their nesting level. This means you can’t simply jump to the next ]; instead, you need to track the depth of nesting to locate the correct matching bracket.

that's normal,

Can someone summarize the content in 100 words?

Why do I forget about regex?