feat: Adds Zion's LeetCode PermutationDifference method to Lesson_13 hw

lesson_13/maps_java/maps_app/src/main/java/com/codedifferently/lesson13/Lesson13.java

@@ -1,12 +1,23 @@
 package com.codedifferently.lesson13;
 
+import java.util.HashMap;
+
 public class Lesson13 {
 
   /**
    * Provide the solution to LeetCode 3146 here:
    * https://leetcode.com/problems/permutation-difference-between-two-strings
    */
   public int findPermutationDifference(String s, String t) {
-    return 0;
+    var charLocation = new HashMap<Character, Integer>();
+    int charSum = 0;
+    for (int i = 0; i < s.length(); i++) {
+      charLocation.put(s.charAt(i), i);
+    }
+    for (int i = 0; i < t.length(); i++) {
+      int charResult = charLocation.get(t.charAt(i));
+      charSum += Math.abs(charResult - i);
+    }
+    return charSum;
   }
 }

lesson_13/maps_ts/src/lesson13.ts

@@ -3,5 +3,16 @@
  * https://leetcode.com/problems/permutation-difference-between-two-strings
  */
 export function findPermutationDifference(s: string, t: string): number {
-  return 0;
+  const charLocation = new Map<string, number>();
+  let charSum = 0;
+  for (let i = 0; i < s.length; i++) {
+    charLocation.set(s[i], i);
+  }
+  for (let i = 0; i < t.length; i++) {
+    const charResult = charLocation.get(t.charAt(i));
+    if (charResult !== undefined) {
+      charSum += Math.abs(charResult - i);
+    }
+  }
+  return charSum;
 }