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

1
var minSteps = function (s, t) {
2
  let sFreq = Array(26).fill(0),
3
    tFreq = Array(26).fill(0);
4
  for (let char of s) sFreq[char.charCodeAt() - 97]++;
5
  for (let char of t) tFreq[char.charCodeAt() - 97]++;
6
  let ans = 0;
7
  for (let i = 0; i < 26; i++) {
8
    ans += Math.abs(sFreq[i] - tFreq[i]);
9
  }
10
  return ans;
11
};