Easy C++ Solution
Complexity\n- Time complexity: O(log(n))\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(log(n))\n Add your space complexity here, e.g. O(n
# Complexity\n- Time complexity: $$O(log(n))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(log(n))$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        int n=nums.size();\n        unordered_map<int,int> y;\n        for(int i=0;i<n;i++){\n            if((nums[i]&(nums[i]-1))==0) y[nums[i]]=1;\n        }\n        int i=1;\n        while(true){\n            if(y[i]==0) return i;\n            i*=2;\n        }\n    }\n};\n```
['C++']