Has anybody tested the performance of this ? it feels to me like recursivity would be less efficient than a regular loop here

This kata is great ! i scratched my head so hard trying to code a simple addition xD

I have the same problem... I can pass an average of 30-40 tests but some of them I can't. The ones I get wrong, have a difference of one position in the alphabet compared to the "correct solution".

Is it possible to get a hint or something like that?? I wouldn't like to skip the Kata

all right, quite interesting, thank you !

Wrote an explanation above 😊

Oh, I should explain a bit. This version handles emojis and especially ZWJ sequences of emojis correctly.

For example, this family emoji 👨‍👨‍👧‍👧 is in fact there four emojis joined 👨👨👧👧. And each emoji is two bytes.

[...'👨‍👨‍👧‍👧'].length
// -> 7
'👨‍👨‍👧‍👧'.length
// -> 11
'👨‍👨‍👧‍👧' === '\uD83D\uDC68\u200D\uD83D\uDC68\u200D\uD83D\uDC67\u200D\uD83D\uDC67'
// -> true

I don't really understand

I didn't get it at first but that multibyte character handling is really neat. thanks

100 %

That's just great !

Well, maybe i'll re-write it as a kumite and see what you guys thinks before posting then. Thanks for your help.

A kata cannot be unretired. If you are sure you solved all the issues with it (including random tests, and it being a duplicate), then you can create a new kata and copy paste your work over. But I strongly suggest you visit the Codewars Discord, we have a channel specifically for helping people author kata and can help make sure your next kata will survive beta (or tell you if we think it wont), before you publish it.

True, i fixed it. thanks. How do i un-retire this kata ?

kata was retired

sample tests uses different function name