Beautiful!

Great solution: simple, efficient, readable... you taught me a couple of things, thanks!

I have to say, it's far much more nicer to complete this kata now, four years later, when the tycon could loose, than how it'd have been back in 2016. Anyway, great kata Joe Sorbi!

Very readable solution!

Truly beautiful, effective and still readable! Comparing mine solution with yours gets me back at the first days here on Codewars when I had to write 15 lines just for a simple task, then see the other solutions and want to slap my own face.

Nice kata! However (being born on 29/02/1996) I don't life the fact that the alghoritm has to force an 11, a Master number (check out its description in numerology), to become a 2, The Child, which is considered to be, in a way, its shadow, what it becomes when not truly self... Anyway, I've enjoyed it! Thanks!

Very nice kata, creative, for a 8kyu. In one kata you cover primitives, methods of primitives and, especially, the prototype. We should have more kata like this one, it helps the beginners I think. Thanks by the way!

Nice solution docgunthrop! May I just ask for a little clarification? I'll use [longestRepetition('ccccaaabbbbbjjjjjjjjj')] as an example.
I don't fully understand the idea of <<e.length > a[1]>>. What I don't get is, actually, a[i]. Why so? In the example I'm using the first accumulator is 'cccc'; if you'd compare its length with the length of the next element (e) I'd understand, but a[1] == 'c', a string; how can we compare the length of a string with a single character and get true as to return [e[0], e.length]? I really hope my question isn't confusing; thanks for your attention!