My vote is for O(n)

[David_Estes]

I am voting for O(n) because

O(n) is the fastest way to look through all the letters and make sure that none of theme repeat

unlike n log n which sorts and then goes threw them in pairs.