Longest common substring from more than two strings
These paired functions will find the longest common string in any arbitrary array of strings: def long_substr(data): substr=”” if len(data) > 1 and len(data[0]) > 0: for i in range(len(data[0])): for j in range(len(data[0])-i+1): if j > len(substr) and is_substr(data[0][i:i+j], data): substr = data[0][i:i+j] return substr def is_substr(find, data): if len(data) < 1 and len(find) … Read more