Watch 10 video solutions for Permutation Difference between Two Strings, a easy level problem involving Hash Table, String. This walkthrough by CrioDo has 304,695 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
The permutation difference between s and t is defined as the sum of the absolute difference between the index of the occurrence of each character in s and the index of the occurrence of the same character in t.
Return the permutation difference between s and t.
Example 1:
Input: s = "abc", t = "bac"
Output: 2
Explanation:
For s = "abc" and t = "bac", the permutation difference of s and t is equal to the sum of:
"a" in s and the index of the occurrence of "a" in t."b" in s and the index of the occurrence of "b" in t."c" in s and the index of the occurrence of "c" in t.That is, the permutation difference between s and t is equal to |0 - 1| + |1 - 0| + |2 - 2| = 2.
Example 2:
Input: s = "abcde", t = "edbac"
Output: 12
Explanation: The permutation difference between s and t is equal to |0 - 3| + |1 - 2| + |2 - 4| + |3 - 1| + |4 - 0| = 12.
Constraints:
1 <= s.length <= 26s.t is a permutation of s.s consists only of lowercase English letters.