@Aditya: You probably have to be a bit more careful than that. You can't add the space until both the first part is a word in the dictionary and the rest of the string can also be broken into words in the dictionary. Consider "Ballsareround." Your algorithm seems to put a space after the second "l", but then no initial part of "sareround" may be in your dictionary. In that case, you have to reject that space and continue until you get to a division point such that both the first part is in the dictionary and the second part can be broken into words. Sounds like a good place for recursion.
Dave On Aug 18, 10:52 am, aditya kumar <[email protected]> wrote: > not sure abt the algo but we can think in terms of tokeninzing . ie go for > greedy method . greedy looks for maximum match . extract the token and match > with the dictionary word . if match found then add the additional space else > look for next token . > On Thu, Aug 18, 2011 at 9:10 PM, Navneet Gupta <[email protected]>wrote: > > > > > Given a string containing multiple words such that spaces between words is > > missing. Also, you have a dictionary containing valid words. > > > Ex. "Thatwouldbefantastic" > > > Output a string with proper spaces inserted. > > > Output - "That would be fantastic" > > > The case of words like bandwidth present can be discounted. > > > -- > > Regards, > > Navneet > > > -- > > 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. -- 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.
