Hey.
I wondered, lets say I have 2 strings:
1) "ABBACCCCABCCABAAAACBBA"
2) "CABACAAABACCABBAAACBBA"

and I wanna know the max common string between them,
how do I do it?
I dont want the function to have a run time of more than O(n*n).

In other words, I need a very efficient algorythm.
I dont want the simple solve of a double-loop. its too easy and too moron. I need something brilliant & efficient.