242. Valid Anagram

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length()) return false;
        int n = s.length();
        unordered_map<char, int> counts;
        for (int i = 0; i < n; i++) {
            counts[s[i]]++;
            counts[t[i]]--;
        }
        for (auto count : counts)
            if (count.second) return false;
        return true;
    }
};

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length()) return false;
        int n = s.length();
        int counts[26] = {0};
        for (int i = 0; i < n; i++) { 
            counts[s[i] - 'a']++;
            counts[t[i] - 'a']--;
        }
        for (int i = 0; i < 26; i++)
            if (counts[i]) return false;
        return true;
    }
};

class Solution {
public:
    bool isAnagram(string s, string t) { 
        sort(s.begin(), s.end());
        sort(t.begin(), t.end());
        return s == t; 
    }
};

class Solution {
public:
    bool isAnagram(string s, string t) {
        if(s.size()!=t.size())
            return false;
        int i=0;
        int j=0;
        map<char,int> smap;
        map<char,int> tmap;
        while(i<s.size()&&j<t.size())
        {
            smap[s[i++]]++;
            tmap[t[j++]]++;
        }
        for(auto siter=smap.begin(),titer=tmap.begin();siter!=smap.end()&&titer!=tmap.end();siter++,titer++)
        {
            if(siter->first!=titer->first||siter->second!=titer->second)
                return false;
        }
        return true;
        /*int i=0;
        int j=0;
        map<char,int> smap;
        map<char,int> tmap;
        while(i<s.size()&&j<t.size())
        {
            smap[s[i++]]++;
            tmap[t[j++]]++;
        }
        if(i==s.size()&&j==t.size())
        {
            for(auto siter=smap.begin(),titer=tmap.begin();siter!=smap.end()&&titer!=tmap.end();siter++,titer++)
            {
                if(siter->first!=titer->first||siter->second!=titer->second)
                    return false;
            }
            return true;
        }
        else
            return false;*/
    }
};