Minimum Number of Steps to Make Two Strings Anagram LeetCode solution in JavaScript

1
var minSteps = function (s, t) {
2
  let hash1 = hash(s);
3
  let hash2 = hash(t);
4
  let steps = 0;
5

6
  for (let key of Object.keys(hash1)) {
7
    if (hash2[key]) {
8
      hash1[key] = hash1[key] - hash2[key];
9
    }
10
    if (hash1[key] > 0) {
11
      steps += hash1[key];
12
    }
13
  }
14

15
  return steps;
16
};
17

18
function hash(str) {
19
  let hash = {};
20
  for (let i = 0; i < str.length; i++) {
21
    let letter = str[i];
22
    if (hash[letter]) {
23
      hash[letter]++;
24
    } else {
25
      hash[letter] = 1;
26
    }
27
  }
28

29
  return hash;
30
}