longest common substring problem
hi all;
now i am trying to solve a problem called longest common substring..this problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings.
example: search
researcher
the longest common substring is search..i couldn't find the answer i am doing something wrong but i don't know where..can you help me?
If you post what you have this far, or at least a description of the steps how you would tackle it.can you help me?
I might be wrong.
Quoted more than 1000 times (I hope).Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
i have written some codes but they are useless i think..i just want to learn the way..i don't know trees but i think in this problem i must use trees is there any other way to do it?
I think it would better benefit you if you did it on your own, rather than getting someone else to do it for you. It would certainly help when test time comes around.
A quality job is not necessarily a *good* job. A quality job is, by definition, conformance to requirements. Therefore a *good* job, may not be a quality job.
All the buzzt!
CornedBee
"There is not now, nor has there ever been, nor will there ever be, any programming language in which it is the least bit difficult to write bad code."
- Flon's Law
