📌 c++ solution✔ | smallest 2^x which is not present in nums
return smallest 2^x which is not present in nums\n\n\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        unordered_set<int> s(nums
**return smallest 2^x which is not present in nums**\n\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        unordered_set<int> s(nums.begin(), nums.end());\n        \n        int n=1;\n        while(s.count(n)) n<<=1;\n        \n        return n;\n    }\n};\n```
['Bit Manipulation', 'C', 'C++']