input: from collections import Counter
  def minimum_operations_to_make_k_periodic(word: str, k: int) -> int:
      """
      You are given a string word of size n, and an integer k such that k divides n.
  
      In one operation, you can pick any two indices i and j, that are divisible by k, then replace the substring of length k starting at i with the substring of length k starting at j. That is, replace the substring word[i..i + k - 1] with the substring word[j..j + k - 1].
  
      Return the minimum number of operations required to make word k-periodic.
  
      We say that word is k-periodic if there is some string s of length k such that word can be obtained by concatenating s an arbitrary number of times. For example, if word == “ababab”, then word is 2-periodic for s = "ab".
      
  
      Examples:
      >>> word = "leetcodeleet", k = 4
      1
      >>> word = "leetcoleet", k = 2
      3
  
      Constraints:
      1 <= n == word.length <= 10^5
      1 <= k <= word.length
      k divides word.length.
      word consists only of lowercase English letters.
      """
  
output: 
      n = len(word)
      segments = [word[i:i+k] for i in range(0, n, k)]
      target = Counter(segments[0])
      operations = 0
      
      for segment in segments:
          current = Counter(segment)
          for char in target:
              if current[char] < target[char]:
                  operations += target[char] - current[char]
      
      return operations
  