Feat: adds Pablo Limon-Paredes Java and TS lesson 13 Permutation Difference with a hashmap

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 sIndexByChar = new HashMap<Character, Integer>();
+    int permDiff = 0;
+    for (int i = 0; i < s.length(); i++) {
+      sIndexByChar.put(s.charAt(i), i);
+    }
+    for (char key : sIndexByChar.keySet()) {
+      int indexInT = t.indexOf(Character.toString(key));
+      permDiff += Math.abs(s.indexOf(key) - indexInT);
+    }
+    return permDiff;
   }
 }

lesson_13/maps_ts/src/lesson13.ts

@@ -3,5 +3,14 @@
  * https://leetcode.com/problems/permutation-difference-between-two-strings
  */
 export function findPermutationDifference(s: string, t: string): number {
-  return 0;
+  const sIndexByChar = new Map<string, number>();
+  let permDiff = 0;
+  for (let i = 0; i < s.length; i++) {
+    sIndexByChar.set(s.charAt(i), i);
+  }
+  for (const key of sIndexByChar.keys()) {
+    const indexInT = t.indexOf(key);
+    permDiff += Math.abs(s.indexOf(key) - indexInT);
+  }
+  return permDiff;
 }