Hacker News Reader

If dictionary lookup is O(1), we could just make a dictionary of all the doubled words? Now the whole problem is O(1)!

But making that is O(n^2) time and space, where n is the size of the dictionary