this was crazy difficult and all the answers are outrageously different. not sure I learned anything from this besides cracking codes is really hard.

работает!

O(N * log N) though it should be just O(N)

I'm shocked, never knew it could be done in 1 line! Very smart, kudos from me

In the description, you wrote:

• The reinforces strings consist of only small letters.

Although, as we can see in the examples, it can also include digits.

Also, "reinforces" is a verb only. The correct noun is "reinforcements".

why s.slice(1) 2 times?

thanks!

Its more like 6kyu

Are you human? 🤣🤣🤣

Haskell translation

"I will take away their harvest" declares the Lord. 0.0

It is incredibly hard to check for test cases as well.
All of them do work upon manual logging.

JS tests are not valid, I think.
Same issues as xp3 had.

I was not able to replicate the problem, the reference solution returns false for 72 and other non-powers multiples of 4 such as 20, 44, etc. Nevertheless, I added those as fixed tests and upgraded the C# random tests to improve coverage. This kata still has a poor design in C# due to the parameter being an object and the input validation, which is already not a good idea, is underspecified and not toroughly tested.