c++ using hashmap;
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass MagicDictionary {\npublic:\n    unordered_map<string,int>mp;\n    MagicDictionary() {\n        \n    }\n    \n    void buildDict(vector<string> d) {\n        for(auto it:d){\n            mp[it]++;\n        }\n    }\n    \n    bool search(string s) {\n        \n        for(auto it:mp){\n            int count=0;\n            string temp=it.first;\n            if(temp.size()==s.size()){\n                for(int i=0;i<s.size();i++){\n                    if(s[i]!=temp[i]){\n                        count++;\n                    }\n                }\n                if(count==1){\n                    return 1;\n                   \n                }\n            }\n           \n        }\n        return 0;\n    }\n};\n\n/**\n * Your MagicDictionary object will be instantiated and called as such:\n * MagicDictionary* obj = new MagicDictionary();\n * obj->buildDict(dictionary);\n * bool param_2 = obj->search(searchWord);\n */\n```
['Hash Table', 'C++']