Easy C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) \n    {\n       unordered_set<int>st;\n       for (int i=0;i<nums.size();i++)\n       {\n           st.insert(nums[i]);\n       }\n       int ans=1;\n       int pos=0;\n       while(true)\n       {\n           ans=(1<<pos);\n           if (st.find(ans)==st.end()) return ans;\n           pos++;\n       }\n\n    }\n};\n```
['C++']