Well, he does say "other" words. "hippopotamuses" is not made up of other words in the list.
It looks like a recursive procedure would do the trick. It might help to sort the word list into order by length. Then beginning with the longest word, find other words that match the beginning of the word. For each of them, recurse on the rest of the word. If you get to end the word, you've found your answer. Dave On May 20, 3:26 am, anshu <[EMAIL PROTECTED]> wrote: > This question aint clear > So, for example in above list hippopotamuses is also in the list of > word in the file. > So this word includes itself and is 14 characters. > where is a condition that concatenation is a must? > > On May 20, 3:39 am, greg <[EMAIL PROTECTED]> wrote: > > > > > Write a program that reads a file containing a sorted list of > > words (one word per line, no spaces, all lower case), then identifies > > the > > longest word in the file that can be constructed by concatenating > > copies of > > shorter words also found in the file. > > > For example, if the file contained: > > > cat > > cats > > catsdogcats > > catxdogcatsrat > > dog > > dogcatsdog > > hippopotamuses > > rat > > ratcatdogcat > > > The answer would be 'ratcatdogcat' - at 12 letters, it is the longest > > word made up of other words in the list. > > > I'm having trouble coming up with anything other than starting with > > the longest word in the list and checking for each of the other words > > in the list, which seems incredibly inefficient, any ideas or > > suggestions of things to look at?- 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 algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
