Easy C++ Solution using Unordered Map and Bit Manipulation | O(n) Time Complexity
Complexity\n- Time complexity:\nO(n), where n is size of nums vector\n\n# Code\n\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n     
# Complexity\n- Time complexity:\nO(n), where n is size of nums vector\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        unordered_map<int,int>m;\n        for(int &i:nums){\n            m[i]++;\n        }\n        for(int i = 0;i<32;i++){\n            if(!m.count(1<<i)){\n                return 1<<i;\n            }\n        }\n        return 1<<32;\n    }\n};\n```
['C++']