1347. Minimum Number of Steps to Make Two Strings Anagram

class Solution {
public:    
    int minSteps(string& s, string& t) {
        int freq[26]={0};
        for(char c: s) freq[c-'a']++;
        for(char c: t) freq[c-'a']--;
        int ans=0;
        for(int i=0; i<26; i++)
            if (freq[i]>0)
                ans+=freq[i];
        return ans;
    }
};

auto init = []()
{ 
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    return 'c';
}();