Hey Guys,
My thoughts are it would seem that (n log n) is the winner. Sorting the letters alphabetically and comparing pairs seems pretty simplistic. My other thought would be to move through the letters adding MyHiddenWord[i] to an array[n] and comparing i to n as you go through the word. It seems that is exactly what (n^2 - n)/2 is though. Very intriguing topic!