title: List of strings, get common substring of n elements, Python
body: <p>My problem is maybe similar to <a href="https://stackoverflow.com/questions/37514193/count-the-number-of-occurrences-of-n-length-not-given-string-in-string-python">this</a>, but another situation. 
  Consider this list in input :</p>
  
  <pre><code>['ACCCACCCGTGG','AATCCC','CCCTGAGG']
  </code></pre>
  
  <p>And the other input is n,n is a number, the dimension of the substring in common in every element of the list. So the output has to be the maximum occorence substring with the number of occorences, similar to this:</p>
  
  <pre><code>{'CCC' : 4}
  </code></pre>
  
  <p><code>4</code> becouse in the first element of list are twice, and one time in the other two strings.<code>CCC</code> becouse is the longhest substring with 3 elements,that repeats at least 1 time per string 
  I started in that way :</p>
  
  <pre><code>def get_n_repeats_list(n,seq_list):
  max_substring={}
  list_seq=list(seq_list)
  for i in range(0,len(list_seq)):
      if i+1&lt;len(list_seq):
          #Idea : to get elements in common,comparing two strings at time
          #in_common=set(list_seq[i])-set(list_seq[i+1])
          #max_substring...       
  return max_substring
  </code></pre>
  
  <p>Maybe here a <a href="https://stackoverflow.com/questions/18715688/find-common-substring-between-two-strings">solution</a> </p>