"longest common substring in the given string". If i get it right. You need two strings to find a common subsequence.
We use DP for it. 2010/8/18 ♪ ѕяiηivαѕαη ♪ <21.sr...@gmail.com> > Example: > If my sequence is ABC..the longest common subsequence is > AC,BC,AB. > It is a very common problem... > > > On Wed, Aug 18, 2010 at 11:58 AM, vinodh kumar <vinodh...@gmail.com>wrote: > >> heh could u explain the question with a example..??!! >> >> On Aug 18, 8:47 pm, ♪ ѕяiηivαѕαη ♪ <21.sr...@gmail.com> wrote: >> > Hi.. >> > Can anyone here explain me /provide me with an algorithm/source code in >> C >> > which efficiently finds out the *longest common substring in the given >> > string??* >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> 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 algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > Please access the attached hyperlink for an important electronic communications disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
