Lowest Missing Bit || Easy & Understandable 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:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>&v) {\n        int i=0,n=v.size();\n        unordered_set<int>s;\n        for(auto x : v)s.insert(x);\n        while(s.find(1<<i)!=s.end())i++;\n        return 1<<i;\n    }\n};\n```
['Ordered Set', 'C++']