feat:updates hasmap names

Author: PabLim-Par

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

@@ -9,12 +9,12 @@ public class Lesson13 {
    * https://leetcode.com/problems/permutation-difference-between-two-strings
    */
   public int findPermutationDifference(String s, String t) {
-    var bmb = new HashMap<Character, Integer>();
+    var sIndexByChar = new HashMap<Character, Integer>();
     int permDiff = 0;
     for (int i = 0; i < s.length(); i++) {
-      bmb.put(s.charAt(i), i);
+      sIndexByChar.put(s.charAt(i), i);
     }
-    for (char key : bmb.keySet()) {
+    for (char key : sIndexByChar.keySet()) {
       int indexInT = t.indexOf(Character.toString(key));
       permDiff += Math.abs(s.indexOf(key) - indexInT);
     }

lesson_13/maps_ts/src/lesson13.ts

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