-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAnagram.cpp
50 lines (37 loc) · 968 Bytes
/
Anagram.cpp
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Function is to check whether two strings are anagram of each other or not.
bool areAnagrams(string& s1, string& s2) {
// Your code here
unordered_map<char,int>mapping;
for(auto i : s1) mapping[i]++;
for(auto i : s2){
if(mapping.find(i) == mapping.end()) return false;
else{
mapping[i]--;
if(mapping[i] == 0) mapping.erase(i);
}
}
return true;
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
string c, d;
cin >> c >> d;
Solution obj;
if (obj.areAnagrams(c, d))
cout << "true" << endl;
else
cout << "false" << endl;
cout << "~" << endl;
}
}
// } Driver Code Ends