|Think about Loose Coupling|
Re^2: longest common substring (with needed tweaks)by R56 (Acolyte)
|on Oct 27, 2013 at 14:56 UTC||Need Help??|
1) Yes, it's exactly digit-space-digit, so my regex will work.
2) I can see that's a bit hard to understand. Let me try again. First number tells us how many strings will be considered for comparison. Second number tells us the minimum number of strings where the substring has to appear. For instance:
output will be 'rrr'
output will be 'gggg'
It is a weird filter, I know, but it needs to be that way.
3) Yeah, I already read on the subject but can't seem to figure out how to make the changes. My initial idea was that some clever well-places loops would get me what I wanted, but know I'm starting to see it's not that simple.
Thanks for the help though!