Anagram Queries using Hashing a rogram which prints out all anagrams of a specified string. Two strings are anagrams of one another if by rearranging letters of one of the strings you can obtain another. For example, the string "stuart" is an anagram of "rattus". For the purpose of this assignment, we are only interested in those anagrams of a given string which appear in the words.txt dictionary.