v.gr. FirstNonRepeating("s[{\^~|]}treSS")

According to my personal understanding, 'r|32' expression will convert letters with different case to same key value.

But when the param str both contains '^' and '~' character, this solution will fail.

Because '^|32' expression get int 126, same to '~|32' expression.

If the kata wanted a CPU efficient solution it would have run very large data sets as part of the final tests.

Clever - Maybe because your solution was the obvious one and this has fewer lines of code and leverages already available methods?

Best practice? Eh, maybe not, if I were using large data sets this obviously isnt ideal, but for small values of n like this challenge, it doesn't make a lick of difference.

If I wanted something more efficient I would have used a different approach, but it's a kata, not a time sensitive app.

I don't see how this could be considered "Best Practice" or "Clever".
It needs O(n*logn) in time to do something that could be done in O(n)

I don't see how this could be considered "Best Practice" or "Clever".
It needs O(n*logn) in time to do something that could be done in O(n)

@g964 do you have anything else to say. all you say is how many have passed. Many are stuck in this kata.

Wow youre a douchebag

Thanks for finding this issue! I used #reduce incorrectly

It's a broken solution!
MCDXLIII is 1443 but your
solution("MCDXLIII") is 1663
because while reducing, (1000+100)>500 while you thought that 100<500

For 1610 guys result is 80.

As you can see at the top of the page 7365 guys passed the kata and 504 in Ruby.

Here C.
3rd test expects 80 but result is 81.