FIND 2^n || C++ || SIMPLE
\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        unordered_set<long long int>s;\n        for(auto &i: nums){\n            s.in
```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        unordered_set<long long int>s;\n        for(auto &i: nums){\n            s.insert(i);\n        }\n        long long int x = 1;\n        while(x<=1000000000L&&s.count(x)){\n            x <<= 1;\n        }\n        return x;\n    }\n};\n```
['Math', 'Bit Manipulation', 'C', 'Ordered Set', 'C++']