Determine if Two Strings Are Close LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool closeStrings(string word1, string word2) {
4
    set<int> w1_letters, w2_letters, w1_freq, w2_freq;
5
    unordered_map<char, int> w1_m, w2_m;
6

7
    for (auto a : word1) {
8
      w1_letters.insert(a);
9
      w1_m[a]++;
10
    }
11

12
    for (auto a : word2) {
13
      w2_letters.insert(a);
14
      w2_m[a]++;
15
    }
16

17
    for (auto [k, v] : w1_m) w1_freq.insert(v);
18

19
    for (auto [k, v] : w2_m) w2_freq.insert(v);
20

21
    return w1_letters == w2_letters && w1_freq == w2_freq;
22
  }
23
};