Given a list of string objects, this algorithm calculates and shows the most common substring found in all its components. It uses set() structure instead of "in" operator.
"in" operator, internally uses a "for" loop. So this algorithm improves the spent time.