I came up with an O(n) algorithm, but the interviewee asked more
Anoniem
4 okt 2012
This can be done optimally in O(n) time by iterating over the string, swapping the character at index i with the character at a random index each time.
Anoniem
1 nov 2017
It's not possible to do asymptotically better than O(n) because on average you'll have to change n-1 of the characters (assuming they're all distinct).