add 1347

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) | |Easy|String|
 |1346|[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1346.java) | |Easy|Array|
 |1345|[Jump Game IV](https://leetcode.com/problems/jump-game-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1345.java) | |Hard|BFS|
 |1344|[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1344.java) | |Medium|Math|

src/main/java/com/fishercoder/solutions/_1347.java

@@ -0,0 +1,55 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+/**
+ * 1347. Minimum Number of Steps to Make Two Strings Anagram
+ *
+ * Given two equal-size strings 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.
+ *
+ * Example 1:
+ * Input: s = "bab", t = "aba"
+ * Output: 1
+ * Explanation: Replace the first 'a' in t with b, t = "bba" which is anagram of s.
+ *
+ * Example 2:
+ * Input: s = "leetcode", t = "practice"
+ * Output: 5
+ * Explanation: Replace 'p', 'r', 'a', 'i' and 'c' from t with proper characters to make t anagram of s.
+ *
+ * Example 3:
+ * Input: s = "anagram", t = "mangaar"
+ * Output: 0
+ * Explanation: "anagram" and "mangaar" are anagrams.
+ *
+ * Example 4:
+ * Input: s = "xxyyzz", t = "xxyyzz"
+ * Output: 0
+ *
+ * Example 5:
+ * Input: s = "friend", t = "family"
+ * Output: 4
+ *
+ * Constraints:
+ * 1 <= s.length <= 50000
+ * s.length == t.length
+ * s and t contain lower-case English letters only.
+ * */
+public class _1347 {
+    public static class Solution1 {
+        public int minSteps(String s, String t) {
+            int[] counts = new int[26];
+            for (char c : s.toCharArray()) {
+                counts[c - 'a']++;
+            }
+            for (char c : t.toCharArray()) {
+                if (counts[c - 'a'] > 0) {
+                    counts[c - 'a']--;
+                }
+            }
+            return Arrays.stream(counts).sum();
+        }
+    }
+}

src/test/java/com/fishercoder/_1347Test.java

@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1347;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1347Test {
+    private static _1347.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1347.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minSteps("bab", "aba"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(5, solution1.minSteps("leetcode", "practice"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(0, solution1.minSteps("anagram", "mangaar"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(0, solution1.minSteps("xxyyzz", "xxyyzz"));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(4, solution1.minSteps("friend", "family"));
+    }
+
+}