C++ solution bitwise
\n// Please, upvote if you like it. Thanks :-)\nint minImpossibleOR(vector<int>& nums) {\n\tvector<int> bitsSet(32, 0);\n\tfor (int& n : nums)\n\t\tif (__popcou
```\n// Please, upvote if you like it. Thanks :-)\nint minImpossibleOR(vector<int>& nums) {\n\tvector<int> bitsSet(32, 0);\n\tfor (int& n : nums)\n\t\tif (__popcount(n) == 1) {\n\t\t\tint bitNum = 0;\n\t\t\twhile (n >>= 1)\n\t\t\t\tbitNum++;\n\t\t\tbitsSet[bitNum]++;\n\t\t}\n\tfor (int i = 0; i < 32; i++)\n\t\tif (bitsSet[i] == 0)\n\t\t\treturn pow(2, i);\n\treturn 1;\n}\n```
['Bit Manipulation', 'C', 'C++']