N log n

n is not a viable method as it doesn’t allow to check if the word is an isogram or not, Therefor n log n should provide the fastest result for what we are trying to achieve.