Easy C++ solution
\n\n# Code\n\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int p=0;\n        int i=0
\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int p=0;\n        int i=0;\n        while(i<nums.size())\n        {\n            int temp=pow(2,p);\n            while(i<nums.size() and nums[i]<temp)\n            {\n                i++;\n            }\n            if(nums[i]!=temp)\n            {\n                return temp;\n            }\n            else\n            {\n                i++;\n                p++;\n            }\n        }\n        return pow(2,p);\n    }\n};\n```
['Array', 'Bit Manipulation', 'Brainteaser', 'C++']