Groups of Special-Equivalent Strings LeetCode solution in C++

1
class Solution {
2
 public:
3
  int numSpecialEquivGroups(vector<string> &words) {
4
    int n = words.size();
5
    vector<pair<string, string>> v;
6
    for (auto it : words) {
7
      string even = "";
8
      string odd = "";
9
      for (int i = 0; i < it.size(); i += 2) even += it[i];
10
      for (int i = 1; i < it.size(); i += 2) odd += it[i];
11
      sort(even.begin(), even.end());
12
      sort(odd.begin(), odd.end());
13
      even += odd;
14
      v.push_back({it, even});
15
    }
16

17
    map<string, int> m;
18
    for (auto it : v) {
19
      m[it.second]++;
20
    }
21

22
    return m.size();
23
  }
24
};