Find lowest Missing Power of 2
\n//  Time Complexity => O(N*32)\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        int n = 1;\n        int i = 0;\n        while
```\n//  Time Complexity => O(N*32)\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        int n = 1;\n        int i = 0;\n        while(i < 32){\n\t\t    // Find each and every power of 2 starting from zero.\n\t\t\t// If you are unable to find a particular power, then, \n\t\t\t// it will be an answer. \n\t\t\t// Since we are starting from zero power, answer will be minimum already.\n            if(find(nums.begin(), nums.end(), n) == nums.end()) break; \n            n <<= 1;\n            i++;\n        }\n        return n;\n    }\n};\n```
['C']