Add solution #1347

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,246 LeetCode solutions in JavaScript
+# 1,247 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1023,6 +1023,7 @@
 1344|[Angle Between Hands of a Clock](./solutions/1344-angle-between-hands-of-a-clock.js)|Medium|
 1345|[Jump Game IV](./solutions/1345-jump-game-iv.js)|Hard|
 1346|[Check If N and Its Double Exist](./solutions/1346-check-if-n-and-its-double-exist.js)|Easy|
+1347|[Minimum Number of Steps to Make Two Strings Anagram](./solutions/1347-minimum-number-of-steps-to-make-two-strings-anagram.js)|Medium|
 1351|[Count Negative Numbers in a Sorted Matrix](./solutions/1351-count-negative-numbers-in-a-sorted-matrix.js)|Easy|
 1352|[Product of the Last K Numbers](./solutions/1352-product-of-the-last-k-numbers.js)|Medium|
 1356|[Sort Integers by The Number of 1 Bits](./solutions/1356-sort-integers-by-the-number-of-1-bits.js)|Easy|

solutions/1347-minimum-number-of-steps-to-make-two-strings-anagram.js

@@ -0,0 +1,34 @@
+/**
+ * 1347. Minimum Number of Steps to Make Two Strings Anagram
+ * https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/
+ * Difficulty: Medium
+ *
+ * You are given two strings of the same length s and t. In one step you can choose any character
+ * of t and replace it with another character.
+ *
+ * Return the minimum number of steps to make t an anagram of s.
+ *
+ * An Anagram of a string is a string that contains the same characters with a different (or the
+ * same) ordering.
+ */
+
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {number}
+ */
+var minSteps = function(s, t) {
+  const charCount = new Array(26).fill(0);
+  let result = 0;
+
+  for (let i = 0; i < s.length; i++) {
+    charCount[s.charCodeAt(i) - 97]++;
+    charCount[t.charCodeAt(i) - 97]--;
+  }
+
+  for (const count of charCount) {
+    if (count > 0) result += count;
+  }
+
+  return result;
+};