C++ Hashset Solution
\nI Looked for C++ hashmap/hashset solution but all i found was TRIE so posting a hashmap solution.\nInspired by:tangx668\nclass Solution {\npublic:\n    int fi
```\nI Looked for C++ hashmap/hashset solution but all i found was TRIE so posting a hashmap solution.\nInspired by:tangx668\nclass Solution {\npublic:\n    int findMaximumXOR(vector<int>& nums) {\n        int ans=0,mask=0;\n        unordered_set<int>st;\n        for(int i=31;i>=0;i--){\n            mask|=(1<<i);\n            int temp=ans|(1<<i);\n            for (int j = 0; j < nums.size(); j++) {\n                int num = nums[j] & mask;\n                if (st.find(temp ^ num)!=st.end()) {\n                    ans = temp;\n                    break;\n                }\n                st.insert(num);\n            }\n            st.clear();\n        }\n        return ans;\n    }\n};\n```
['C']