How does natural join work?

The procedural way

This solution is awesome

Hint: operator overloading

Clever solution indeed!

The guy is a time traveler

Beautiful solution! :D

Thank you Chrono79, I never realized my update was wrong because of a off-by-one error :O

The update wasn't working and the translation was rejected, so I forked it and fixed it.

okey xD

If you're gonna claim something like this, at least explain why

The translation has been updated to guarantee that lowercase letters will appear no more than 9 times

Yeah, you're right, I might have forgotten to read that part. I'll edit the solution to comply with that requirement

Note: You can assume that each lowercase letter will appears a maximum of 9 times in the input string.

Random tests do not guarantee this.