Does it include both overlapping and non-overlapping strings? On 14 December 2010 19:38, aviral gupta <[email protected]> wrote:
> Suffix trees efficiently solves the problem..... > > Regards > Aviral > http://coders-stop.blogspot.com > > On Dec 14, 8:43 pm, divya <[email protected]> wrote: > > Given a string, find the largest substring that occur multiple times > > within the same string. > > Extend your code to find the substring occuring atleast n times. > > > > Perform in linear time and space..... > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- regards, soumya prasad ukil -- 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.
