But then all these words ta, om ,....., amoma all should be available in the dictionary i.e they should be valid words.
On Jun 5, 11:32 am, partha sarathi Mohanty <partha.mohanty2...@gmail.com> wrote: > no > if ta/om/to/am/ba/batot/amoma are words then it should be the one. no???? > 5*2 > 3*3 > > > > > > > > On Tue, Jun 5, 2012 at 7:45 PM, Gene <gene.ress...@gmail.com> wrote: > > Does this sufficae? > > > Suppose you were using a dictionary from the frapplewonk language, > > which has only 5 words: > > > tab > > oma > > to > > am > > ba > > > Then the biggest rectangle is clearly > > > tab > > oma > > > On Jun 4, 10:39 pm, Ashish Goel <ashg...@gmail.com> wrote: > > > preparing a sample itself is a great problem here, that is why i called > > it > > > hard > > > > all words in the rectangle horizontally as well as vertically needs to be > > > valid dictionary words > > > > Ashish > > > Hassan > > > > say this rectangle AH,SA,HS,IS,SA,HN should also be valid dictonary > > words, > > > indeed they are not.. > > > > definitely we will need a multimap to have words of same length forming a > > > bucket..not able to think beyond this > > > > Best Regards > > > Ashish Goel > > > "Think positive and find fuel in failure" > > > +919985813081 > > > +919966006652 > > > > On Mon, Jun 4, 2012 at 6:38 PM, Hassan Monfared <hmonfa...@gmail.com> > > wrote: > > > > Give a sample please > > > > > On Mon, Jun 4, 2012 at 5:34 PM, Ashish Goel <ashg...@gmail.com> wrote: > > > > >> Given a dictionary of millions of words, give an algorithm to find the > > > >> largest possible rectangle of letter that every row forms a > > word(reading > > > >> left to right) and every column forms a word(reading from top to > > bottom). > > > > >> Best Regards > > > >> Ashish Goel > > > >> "Think positive and find fuel in failure" > > > >> +919985813081 > > > >> +919966006652 > > > > >> -- > > > >> 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 group, send email to > > > >> algogeeks+unsubscr...@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 algogeeks@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. > > > -- > > 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 group, send email to > > algogeeks+unsubscr...@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 algogeeks@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.
