you shouldnt codde like this, lisibility comes first.

I coded something similar but I am curious about this also.

.sort alone I believe is O(log(n)) so it at least has to be that, but idk how much worse it is.

Thanks for this reply.

As soon as I read it I figured out what I was doing wrong.

I agree to an extent.

I think this is def harder then a 7kyu for most, but I can only imagine this becomeing second nature once learned.
So idk how you would really rank this. It's probably too easy for anyone higher in rank but is harder for anyone lower.

I personally had some trouble with it and only slightly knew how to achieve it due to being exposed to it a bit in eloquent javascript.

Thanks for explaining the regex.

Will this capture all repeating letters in a word, or only the first, or only the last?

For example bookkeeper

Not kata-related.

Awesome. I was looking for something like this. I figured reduce may be possible to use but I still don't understand high-order function well enough to think of these at random.

I'm going to resubmit with this so I have a copy in my solutions section to study.

Thanks!

I like this code. In particular the for loop is very nice imo. I would have made an array for the score but besides that I like the single iteration.