OK, I concede to the Suffix Tree solution presented by lima1 ++.
I suspect the best run-time order I could muster is O(nlogn), and worst O(n²).
It was still a fun diversion nonetheless... :-)
In reply to Re^2: Challenge: Fast Common Substrings
by thezip
in thread Challenge: Fast Common Substrings
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |