I agree, having more examples would help with decoding while not taking away from the problem.
True -- feel free to fork it :-)
This comment is hidden because it contains spoiler information about the solution
Agreed, I initially implemented a recursive function (in C++) and had to back away from it because of the strange edge case.
Added "Can someone explain" to the end ~half the time. Also added case sensitivity ('can someone explain' appears randomly), and a test for the suggestion above ("Can someone explainable", e.g. is invalid).
Now this is programming.
The function is powered by Fermat's little theorem, making it potentially faster (though less accurate) than a sieve. Adding tests on 5 and 7 will make this work up to 10^4
I feel you should add "PUZZLE" tag to this Kata because there is guesswork invoved due to the ambiguous example tests.
This may be me solving this later in the evening, but the example test cases imply that it is the last letter of the word that is being repeated twice and then has "k" added.
You may want to consider adding a test case which makes the actual rule more obvious. :)
I laughed very hard about this ine!