Hashing - I

Anagram Solver Anagram Solver •Definition. Two words are anagrams if one can be formed by permuting the letters in the other. •The Problem. How would you compute all anagram sets in a dictionary of 160,000 English words? Anagram Solver Solution 1: compute all permutations. Solution 2: compare all pairs. Solution 3: use hash tables ................
................