C++ basic solution | Hash Map
```\nint numUniqueEmails(vector &emails) {\n    // can use a hashset too\n\tunordered_map cnt;\n\n    for (int i = 0; i < emails.size(); i++) {\n        \n     
```\nint numUniqueEmails(vector<string> &emails) {\n    // can use a hashset too\n\tunordered_map<string, int> cnt;\n\n    for (int i = 0; i < emails.size(); i++) {\n        \n        string temp = "";\n        string now = emails[i];\n\n        for (int j = 0; now[j] != \'@\'; j++) {\n            \n            if (now[j] == \'+\')\n                break;\n            \n            if (now[j] == \'.\')\n                continue;\n            \n            temp.push_back(now[j]);\n        }\n        \n        int index = now.find(\'@\');\n        \n        while (index < now.size()) {\n            temp.push_back(now[index++]);\n        }\n        \n        cnt[temp]++;\n    }\n\n  return cnt.size();\n\n}\n
['C', 'C++']