> I was asked the same question in my google interview!! The best
> > solution for this is to use the TRIE data structure!!
> >
> > Google TRIE data structure for more details. It also gives an
> > optimized search complexity.
> >
> > On Nov 8, 2007 11:40 AM, R
Hello,
I was asked this question for MSFT interview.
You are given Symbols for stock ticker application,
All are 4 character , Capital letters only so min is and max is .
for example MSFT, GOOG etcetc
How will you hash it??? complexities for insert, delete and Search ???
*I gave him th
If you have to implement a phone book of 10 millin people in NYC, what
data structure would you use and why ?
Show the implementation if HashTable or Binary Trees?
Thanks,
Raj
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
