How is it work?
Where is the cycle?

Checking the last index is a creative idea, but slow since you could be checking the whole string for every character.

This is O(n^2), not best practice.

♥️

no, as strings are immutable in JS

Does this alter the original word?

perhaps the only one too

I'm a big fan of regexp

I really like this solution.
It uses common well known funcitons and still results in short understandable code :)

Hey--thanks for letting me know! ^^

I must revisit here to say thank you, it has opened my mind about regexes, you links are really helpful!
Keep up the good work!

I am very confused about the linked list thingy. Can you show me the code for preloaded function so I can try it on DEV C++?
Many thanks!

Currently Codewars platform has lots of issues. It's not a problem of this kata.

https://github.com/Codewars/codewars.com/issues/893

I passed 13/13 java tests and it said failed 0 but there is no SUBMIT button.
The same goes for my C solution, why is that?

I encountered this problem though it worked well on my DEV C++. I googled some and they all set about "free" function using malloc but I made use of none in my code. Can anyone tell me what's the problem here? Thank you!
*** Error in `/home/codewarrior/solution': munmap_chunk(): invalid pointer: 0x00007ffde2f0ee40 ***