big brain

I think we should all at least thank and at the same time sympathize with the author, for which he had to read Jaden’s Twitter.

Agreed, I spent 10 minutes just hitting test and getting frustrated.

Eventually just said Try and it was okay.

While this is clever and concise, I see a lot of comments from people feeling bad about their solutions. Don't beat yourself up. This is O(n log n) complexity which isnt ideal.

Updated in fork

Sample test is broken in C#

Because words like:
"won't, can't, don't"
will be:
"Won'T, Can'T, Don'T"

I also tried that

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.

Super

Literally had no idea how to even approach this.

Best solution! I hope one day I will understand regexp so that I can write equally elegant solutions.

should check for non string argument

Groovy translation

Same solution as mine, but you have a great use of naming and aliases to make it more readable.