Practise_Codes/valid_anagram.cpp at main · srushti-learner/Practise_Codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
class Solution {
public:
    bool isAnagram(string s, string t) {
        if(s.size()==t.size())
        {

        unordered_map<char,int> umap;
        for(int i = 0;i<s.size();i++)
        {
            umap[s[i]]++;
        }
        for(int i = 0 ;i<t.size();i++)
        {
            auto key = t[i];
            auto itr = umap.find(key);
            if(itr!=umap.end() && itr->second>0)
            {
                itr->second--;
            }
            else
            {
                return false;
            }
        }
            return true;
        }
        else
        {
            return false;
        }

    }
};