Anagrama

#include 
class Solution {
    public:
    bool isAnagram(string s, string t) {
        map<tchar, int> mapa;
        map<tchar, int> mapa2;
        if (s.length()!=t.length())
        return false;
        for (int i = 0; i<s.length();i++){
            mapa[s[i]]++;
            mapa2[t[i]]++;
        }
        for (int i = 0; i<s.length();i++){
            if (mapa[s[i]]!=mapa2[s[i]])
            return false;
        }
    return true;
    }
};