Study Trie & Then Apply It..It Will Work PS: We already have dictionary congaing all the possible words if its not given then we can make the dictionary & then we can find out the all possible anagram of word in constant time O(K) where K is length of each anagram of word W.
Hope i m correct Thanks Shashank>> " The Best Way to Escape From The Problem is to Solve It" CSE,BIT Mesra -- 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.
