It does but i am asked to code.. if you know the code for suffix tree then please provide..
On Wed, Jun 29, 2011 at 10:30 PM, Piyush Sinha <[email protected]>wrote: > i think suffix tres will do the job if i have not misunderstood the > question... > > On 6/29/11, Swathi <[email protected]> wrote: > > Given a string (assume there no spaces or punctuations), write a code > that > > returns the max. length of the string that has repeated more than once. > > > > Thanks, > > Swathi > > > > -- > > 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. > > > > > > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-8792136657* > *+91-7483122727* > *https://www.facebook.com/profile.php?id=100000655377926 * > > -- > 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.
