@nitin wat is the complexity ?? can it be done linear ??
On Mon, Aug 31, 2009 at 6:07 PM, nitin mathur <nitinkumar.mat...@gmail.com>wrote: > We can use the concept of longest common substring. For that use following > steps: > 1) take the original string say A. > 2) make a copy of it say B. > 3) find the longest common substring of them. > > Nitin Mathur > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
