String.match is disabled
no mention in kata description
NO, mutating your input and using an O(n log n) algorithm when you can do O(n) is not a Best Practice, no matter how short your code is.
O(n log n)
This comment is hidden because it contains spoiler information about the solution
It works only for lowerCase letters
The scary use of dynamic += | it's pretty creative though ;)
it's really cool
It runs in a similar time to mine (I think mine is needlessly verbose but a little bit of a creative solution).
I'm interested in your thoughts on the best sort of solution for this problem. There doesn't seem to be any choice but to traverse the array around arr.length! times.
Nothing. It even has a pretty bad runtime complexity ;-)
You should probably read a few more solution down to see other solutions.
This is very nice but seems hard to read. What makes it a best practice?
typeof e == typeof b You nailed it in one go! :) I did it poorly
typeof e == typeof b