I have used suffix arrays. Its easier to implement than trees.
code here- http://ideone.com/kX8MV
In case u find a test case givin wrong output plz do tell.

On Jun 29, 9:54 pm, 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.

Reply via email to