O(n^2) and O(n^3) respectively. On Jun 30, 3:47 am, Dumanshu <duman...@gmail.com> wrote: > if the output for the input "doomdoomdoom" is 8 then refer > tohttp://ideone.com/kX8MV > else if the output is 4 then refer tohttp://ideone.com/3tAKN > the second one is having a higher complexity. > ny suggestions? > > On Jun 29, 9:54 pm, Swathi <chukka.swa...@gmail.com> 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
