# 1347. Minimum Number of Steps to Make Two Strings Anagram
###### tags: `Leetcode` `Medium` `TikTok`
## Code

class Solution:
    def minSteps(self, s: str, t: str) -> int:
        countS = collections.Counter(s)
        countT = collections.Counter(t)
        ans = 0
        for char in countS.keys():
            ans += max(0, countS[char]-countT[char])
        return ans

class Solution {
    public int minSteps(String s, String t) {
        int ans = 0;
        char[] sArray = s.toCharArray();
        char[] tArray = t.toCharArray();
        
        int[] sFreq = new int[26];
        int[] tFreq = new int[26];
        
        for(int i = 0;i < s.length();i++){
            sFreq[sArray[i]-'a']++;
            tFreq[tArray[i]-'a']++;
        }
        
        for(int i = 0;i < 26;i++){
            ans += Math.abs(sFreq[i]-tFreq[i]);
        }
        return ans/2;
    }
}