Hi,
Following question was asked in MS writtentest today in Bangalore(off
campus)
Give an algo to count the occurances of all words in a document. You
are
given a method chat * GetNextWord, that returns the next word from the
document.
1. Which Data Structure will you use so that the algo is
@ankit, rajeev
even I wrote hashtable as the answer ..
but which would be faster? Hashtabel or Trie?
--
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
