I think Gene is right. they are asking more than search here. Thanks to Gene for suggesting this idea :) now the how part, we can have a level of abstraction: no of products matching to name ---> use trie, suffix tree, some genetic algo, string matching, ms tree...... based on products get first abstraction like: category ---> like video, audio, .... and display most preferred products also from that category in sub format .....
On Sep 2, 6:40 am, Gene <gene.ress...@gmail.com> wrote: > Even if you're only matching words, there are different kinds of > similarity. Check out the soundex algorithm, for example. Levenshtein > distance. The Hungarian algorithm. What does "50% similarity" mean > anyway? I know of no accepted meaning. > > My point is that if you're in an interview situation and you ask > intelligent questions about the question you're asked, you are more > likely to get the job. At least I would be more likely to give it to > you. I've been responsible for hiring quite a few people. > > On Sep 1, 11:52 am, Chakravarthi Muppalla <chakri...@gmail.com> wrote: > > > > > @Gene, it isn't about related words, its abt matching words! > > > On Wed, Sep 1, 2010 at 8:26 PM, saurabh singh <saurabh.n...@gmail.com>wrote: > > > > I think DS will be somewhere between suffix and trie DS > > > > On Wed, Sep 1, 2010 at 9:35 AM, jaladhi dave > > > <jaladhi.k.d...@gmail.com>wrote: > > > >> trie > > > >> On Wed, Sep 1, 2010 at 5:45 PM, Arun <yourarunb...@gmail.com> 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 algoge...@googlegroups.com. > > >>> To unsubscribe from this group, send email to > > >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups > > >>> .com> > > >>> . > > >>> For more options, visit this group at > > >>>http://groups.google.com/group/algogeeks?hl=en. > > > >> -- > > >> You received this message because you are subscribed to the Google Groups > > >> "Algorithm Geeks" group. > > >> To post to this group, send email to algoge...@googlegroups.com. > > >> To unsubscribe from this group, send email to > > >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups > > >> .com> > > >> . > > >> For more options, visit this group at > > >>http://groups.google.com/group/algogeeks?hl=en. > > > > -- > > > Thanks & Regards, > > > Saurabh > > > > -- > > > You received this message because you are subscribed to the Google Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to algoge...@googlegroups.com. > > > To unsubscribe from this group, send email to > > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups > > > .com> > > > . > > > For more options, visit this group at > > >http://groups.google.com/group/algogeeks?hl=en. > > > -- > > Thanks & Regards, > > Chakravarthi.- Hide quoted text - > > - Show quoted text - -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
