Java Solution using HashSet, faster than 96.31%
\nclass Solution {\n    public int numUniqueEmails(String[] emails) {\n        String[] copy = new String[emails.length];\n        HashSet<String> set = new Has
```\nclass Solution {\n    public int numUniqueEmails(String[] emails) {\n        String[] copy = new String[emails.length];\n        HashSet<String> set = new HashSet<>();\n        for(String email: emails){\n            StringBuilder localName = new StringBuilder();\n            boolean local = true;\n            int index = -1;\n            for(char c: email.toCharArray()){\n                index++;\n                if(c == \'.\')\n                    continue;\n                if(c == \'+\'){\n                    local = false;\n                    continue;\n                }\n                if(c == \'@\')\n                    break;\n                else if(local)\n                    localName.append(c);\n            }\n            set.add(localName.toString() + email.substring(index));\n        }\n        return set.size();\n    }\n}\n```
['Ordered Set', 'Java']