C++ || Hash table || Easy approach
Here is my c++ code for this problem.\n\n# Code\n\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        sort(nums.begin(), nums.end(
Here is my c++ code for this problem.\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        sort(nums.begin(), nums.end());\n        map<int, int>s;\n        int k=1, chk=1;\n        for(int i=0; i<nums.size(); i++){\n            //s.insert(nums[i-1]);\n            s[nums[i]]++;\n            //s.insert(nums[i-1]|nums[i]);\n        }\n        while(1){\n        //for(auto it: s){\n            if(s.find(k)==s.end()){\n                //k++;\n                return k;\n            }\n            k*=2;\n        //}\n        }\n        return k;\n        \n    }\n};\n```
['Hash Table', 'C++']