nice :)

I was able to get N=2000 here (C++), so you don't need to have any constrains ;) This kata is mostly about how much performance you can squeeze before reaching a timeout.

Great Kata. One of the best ones that I have ever solved (C++)

Couple of issues with this:

1. Sorting string before it goes to the algorithm can pass all tests, when it shouldn't.
2. Explanation is a not clear.
3. In C++ instead of string, should be std::string_view 3:-)