Re: [algogeeks] Amazon intern Question

2010-09-01 Thread Chakravarthi Muppalla
@Gene, it isn't about related words, its abt matching words! On Wed, Sep 1, 2010 at 8:26 PM, saurabh singh wrote: > I think DS will be somewhere between suffix and trie DS > > > On Wed, Sep 1, 2010 at 9:35 AM, jaladhi dave wrote: > >> trie >> >> On Wed, Sep 1, 2010 at 5:45 PM, Arun wrote: >> >>>

Re: [algogeeks] Amazon intern Question

2010-09-01 Thread saurabh singh
I think DS will be somewhere between suffix and trie DS On Wed, Sep 1, 2010 at 9:35 AM, jaladhi dave wrote: > trie > > On Wed, Sep 1, 2010 at 5:45 PM, Arun wrote: > >> You are given the amazon.com database which consists of names of >> millions of products. When a user enters a search query for

Re: [algogeeks] Amazon intern Question

2010-09-01 Thread Chakravarthi Muppalla
I guess, you should be using a suffix tree. On Wed, Sep 1, 2010 at 5:45 PM, Arun wrote: > You are given the amazon.com database which consists of names of > millions of products. When a user enters a search query for particular > object with the keyword say "foo" , output all the products which

Re: [algogeeks] Amazon intern Question

2010-09-01 Thread jaladhi dave
trie On Wed, Sep 1, 2010 at 5:45 PM, Arun wrote: > You are given the amazon.com database which consists of names of > millions of products. When a user enters a search query for particular > object with the keyword say "foo" , output all the products which have > names having 50% or more similar

[algogeeks] Amazon intern Question

2010-09-01 Thread Arun
You are given the amazon.com database which consists of names of millions of products. When a user enters a search query for particular object with the keyword say "foo" , output all the products which have names having 50% or more similarity with the given keyword ie "foo" Write the most efficien