Very satisfying kata!

You’re not wrong.

What the task description does say, however, is that input strings are actual quotes from Jaden Smith, minus the capitalization. One could argue that those quotes – a finite set of known strings – don’t include chains of two or more consecutive spaces. The test cases seem to confirm that assumption.

Bars in the window

You’re welcome @wkirschbaum, glad to hear you’ve learned a few things on your way!

The crypt_password! method manipulates given.password, replacing its content with the return value of String#crypt.

So by the time the comparison happens, given.password will already contain the cryptographic hash.

It's a bad thing we can't check that coincidence

Nope, that’s absolutely not how it works.

The burden of proof lies entirely with the person who makes the allegations, i. e. you.

So it’s not “a bad thing we can’t check”. The only thing that may be unfortunate here is the fact that you’ve decided to jump to conclusions instead of substantiating your claims.

but the idea of having such problem is to actually code the solution.

So you’re saying the solution is so easy that it constitutes cheating?

Try Googling Rot13 Ruby you'll find exactly the same.

So you’re saying the solution is so difficult that > 100 people can’t possibly have come up with it independently without using Google?

Thank you :)

Perfectly elegant solution and excellent explanation! You’re amazing.

Wow, this is an excellent and clever solution. I hadn’t thought about this particular leak!

Yay! Nice trick @fylooi :)

Congrats for becoming a member of Ruby’s Thirteen! :)

@jhoffner Given Matsumoto is turning 50 a few months from now, you might want to update this kata on April 14? Maybe even make it a featured kata on the codewars.com homepage? xD