use maps for implementation of hash table... if no extra memory allowed then no possible solution within o(n) i think.....
On Fri, Aug 5, 2011 at 2:07 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: > First traverse the string and hash each word into a hash table if it is not > present in the hash table. > Then again traverse the string and hash each word. If the word is not > present in the hash table, output it to the console. > > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
