Yea, there was some sort of mixup with the relative ranking of this kata when they went and revised a lot of historical rankings way back, as evidenced by the direct sequel having a lower kyu rating: https://www.codewars.com/kata/52d2e2be94d26fc622000735

So the intended problem and solution definition of this kata is unacceptable to you, because some valid solutions are considered lesser by you. That's all I can really take away from this.

Me from ten years ago (because Codewars doesn't appear to allow you to link to comments from more than three years ago for some reason):

It's really only convert the strings provided as test cases to how Jaden Smith originally typed them, so I wouldn't consider anything else a requirement. Of course the Java and Haskell translations included other requirements (Java has some weird null cases, and Haskell implemented what appears to be random lower-case strings). I should have looked into how translations worked earlier so that I could have requested more homogeneity there before the test cases were locked.

The ignored sequel still in beta I decided to make earlier this year: https://www.codewars.com/kata/6752602505407ee57996cf85/solutions/javascript

@massey-n, the tests were intended to be exclusively Jaden tweets. I didn't author or approve the translations that have random tests, I originally stopped using Codewars because I was quite frustrated with the translations functionality as it was 10+ years ago. That said, the kata definition is Jaden tweets with capitalization as originally typed based on the provided test cases, which, at least for the Javascript implementation, was very intentional in allowing the solution of ignoring everything past the first character of a word or word contraction.

Your task is to convert strings to how they would be written by Jaden Smith. The strings are actual quotes from Jaden Smith, but they are not capitalized in the same way he originally typed them.

I like the encapsulation of the normalization function in your solution.

I invalidated this one, but not some other solutions that I could easily invalidate (this is because I like seeing creative solutions).

You inspired me to create a new spin-off.

Like that? Meanwhile, gotta get to bed. Thank you for the feedback.

The real question to be asking in this scenario is "What Would Jaden Do?"

And in that sense, all of the original test cases are literal Jaden Smith quotes and the objective is to restore altered Jaden Smith quotes to their original letter-case, and everything else can be assumed not to have been altered.

Some other folks who made different translations decided to include random test cases, somewhat missing the original spirit of the kata. The original spirit of the kata was not to test returned values against an emulation of Jaden Smith, but to test the returned values against the real Jaden Smith.

This would eliminate the alternative solutions like those that may be performing various text distance calculations against a known database of Jaden Smith quotes--although, unfortunately, many language variations of this kata have test cases which include random tests and assume the answer must be uniform based on criteria that has never been formally defined by Jaden Smith.

Sorry, forgot to mark I was responding to @Smcgb.

Also, @1axcoder, there are many approaches, the test cases are supposd to be easy to pass with a simple solution, and maybe you can revisit this kata after exploring other kata that manipulate text data.