clever solution!

Good job!
I also think about using RegExp and match(), but I not so good in it.

I see, thanks.

@Chrono79 - you're half right. Since his solution involves making a set, you have to use .toLowerCase() or else the set will include extra entries when letters appear in multiple cases. However, because you're taking that step anyway, no need for the ignore case regex flag.

It should be one or the other.

dont listen to them, they just envy your one-liner solution

Its great man
but why u lowerCased the string?

Brilliant! Bro, you are using ignore case modifier, could you omit toLowerCase?

I love you too souzooka... discussing this any further is pointless... have a good day!

xoxo!

You aren't your code, man. Voile pointed out an issue with your code, and that knowledge can help you or others in the future. No need for the disrespect.

U MAD, BRO?

and btw it's not out of context, since you come here in my solution and say stuff i didn't even asked or care only cause you have a O(n) solution... who cares dude?... if i could i would make my solutions private so i don't have to put up with things like this... so next time, please refrain from commeting in one of my solutions because unlike you i do this for fun, and don't take yourself so seriously have a laugh once in a while so you might overcome this bitterness of yours...

xoxo!

Quoting Donald Knuth's comment out of context again, huh?

That's so cliche calling it a cliche is not enough at all. I don't feel like linking to the relevent SO answers now, so consider it lucky.

Also, I did not say anything about whether it is good or bad. I'm merely pointing out the fact that it's O(n^2) in case someone cannot see the elephant in the room.

"Premature optimization is the root of all Evil" D.K

Waiting for you solving in reg-way is just awesome

Genius solution!