Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
What is the runtime complexity for this algorithm?
Wouldn't using
frequenciesinstead ofsortbe better in terms of runtime complexity? It is my understanding thatsortuses tim-sort---and thus is in O(n * log(n))---whilefrequenciesis in O(n).A reference solution.
The problem with this solution (performance-wise) is that you "iterate" over the number of characters instead of the number of indexes to change. Therefore, for a very large string, you would be doing a lot of operations, even if the number of indexes to change is low.