Given a dictionary containing a large number of words (words are valid) and another word.
Now, find all anagrams of the word which are valid. Needless to say, solution should be efficient in using both space/time. -- Regards, Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
