Valid Anagram

 https://leetcode.com/problems/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>m;
        for(int i=0;i<n;i++){
            m[s[i]]++;
            m[t[i]]--;
        }
        for(auto j : m){
            if(j.second){
                return false;
            }
        }
        return true;
    }
};