Use a set since they don't allow for duplicates and have arbitrary order. Implement the set using a hashtable for constant time checks to see if the word is already in it.

Sort the array, and then loop through each loop. This should result in a O(n) + O(n) vs O(n^2)

In python you could do this with Def interview(x): #[str] -> [str] Return set(x) Could also use collections.Counter Then loop through key value pairs

C#, put them into a SortedSet. It will only show the distinct ones.

I was interviewed today and they asked this question, so you can probably expect it! My solution was to use a linked list to store the words, and with every new word you would conduct a linear search and discard it if it was a duplicate. Horribly inefficient and I am pinching myself for not remember my hashtables :(