I guess, you should be using a suffix tree. On Wed, Sep 1, 2010 at 5:45 PM, Arun <[email protected]> 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 similarity with the given keyword ie "foo" > > Write the most efficient algorithm for the same. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Thanks & Regards, Chakravarthi. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
