input: from collections import Counter
  
  def get_min_length_anagram(s: str) -> int:
      """
      Given a string s, which is a concatenation of anagrams of another string t, find the minimum length of string t.
  
      The function should return the minimum possible length of t.
  
      An anagram is created by rearranging the letters of another string. For instance, "abc", "cab", and "bca" are anagrams of "abc".
  
      Examples:
      >>> s = "abba"
      2
      >>> s = "cdef"
      4
  
      Constraints:
      1 <= len(s) <= 100000
      s consists solely of lowercase English letters.
      """
output:     
      counter = Counter(s)
      most_common_count = max(counter.values())
      return len(s) // most_common_count
  