A dynamic programming problem .

Sanju
:)



On Tue, Sep 13, 2011 at 9:34 AM, prasanth n <[email protected]> wrote:

> use dynamic programming..
>
>
> On Sun, Sep 4, 2011 at 6:46 PM, aditya kumar <[email protected]
> > wrote:
>
>> How to find longest common substring in two strings ?
>> i want efficent code and iff possible any method other than using suffix
>> tree .
>>
>> --
>> 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.
>>
>
>
>
> --
> *prasanth*
>
> --
> 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.

Reply via email to