I still don't know what I messed up in the code above but I did solve the kata in the meantime (in 2 lines of code:).

Thanks for this kata. My solution seems to run ok on my environment but fails one of the test when I'm attempting to submit for some reason. I have no visibility on the test case that is failing. I'm kind of stuck here.

Is recursion disallowed? From a comment below, I gather that it is and that one of the test cases fails if the solution includes recursion. My solution indeed does. However, I can't seem to find any trace of this requirement in the instructions. Is that implied somewhere?

My solution is very similar but yours is cleaner.

Hi Adrian, thanks for this kata, I really enjoyed it! I did choose "Very satisfied" but don't have enough honor yet to give a rank assessment.

Sorry, totally agree. I was sure I had clicked on suggestion not issue.

Thanks for this kata! Small typo:

"The function returns a string of the same length with each word reserved reversed, but still in their original order."

Also, perhaps it would be better to put the punctuation consistently to either the end or the beginning of each word in the example.

"reverseSentence("Hello !Nhoj Nhoj! Want to have lunch?")"

Splitting hairs, really!

Pythagoras is your friend:)