You are given two strings s and t such that every character in s is unique and t is a permutation of s.

The permutation difference between s and t is defined as the sum of the absolute differences between the index of each character in s and the index of the identical character in t.

Return the permutation difference between s and t.

Constraints:

• $1 \leq$ s.length $\leq 26$

• Each character occurs at most once in s.

• t is a permutation of s.

• s consists only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.