input: def calculate_permutation_distance(s: str, t: str) -> int:
      """
      Given two strings, s and t, where each character appears at most once in s, and t is a permutation of s.
  
      The permutation distance between s and t is defined as the sum of the absolute differences between the indices of each character in s and the corresponding character in t.
  
      Return the permutation distance between s and t.
  
      Examples:
      >>> s = "abc", t = "bac"
      2
      >>> s = "abcde", t = "edbac"
      12
  
      Constraints:
      1 <= s.length <= 26
      Each character appears at most once in s.
      t is a permutation of s.
      s consists only of lowercase English letters.
      """
output:     
      index_map = {char: idx for idx, char in enumerate(s)}
      distance = 0
      for i, char in enumerate(t):
          distance += abs(index_map[char] - i)
      return distance
  