@dufus but nitis algo is not correct also check the definition of LCS and wat is the probelm given.. comment..
On Tue, Sep 1, 2009 at 1:39 PM, Dufus <[email protected]> wrote: > > @Nitin, your algorithm, as you know takes O(n) extra space. > > Arguably the next step of the interviewer would be to ask for O(1) > space algorithm :D > > _dufus > > > On Aug 31, 5:37 pm, nitin mathur <[email protected]> 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 [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 -~----------~----~----~----~------~----~------~--~---
