lalla..bruteforce na bako.. :P On Tue, Jan 11, 2011 at 6:07 PM, manoj lalavat <manoj.lala...@gmail.com>wrote:
> you can optimize BF > > newspaper > > first word you will search > > n > > then > > ne > > then > > new > > then news..and so on....if at any point of time first word exist in > dictionary then only see whether the word with the remaining characters > exist in the dictionary or not. > > > On Tue, Jan 11, 2011 at 5:57 PM, Vikas Singh <vikas.sing...@gmail.com>wrote: > >> Given a dictionary find out if given word can be made by two words in >> dictionary. For eg. given "newspaper" you have to find if it can be made by >> two words. (news and paper in this case). I cant think of anything but brute >> force. >> >> Thanks, >> Vikas >> >> -- >> 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. >> > > > > -- > -- > Manoj Lalavat > > -- > 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. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
