building the set of permutations is much more expensive than the search.  Not surprising, since each search should be O(1) for a hash calculation
building the set of permutations is much more expensive than the search.  Not surprising, since each search should be O(1) for a hash calculation

Kamtron/anagram_solver