C++ || MOST SIMPLE & EASY
GET MINIMUM 2^i THAT NOT PRESENT IN NUM\nTHAT MEAN ith BIT NOT SET & WE NEED TO SET IT\nSO ANS IS 2^i.\n# Code\n\nclass Solution {\npublic:\n    int minImpossib
GET MINIMUM 2^i THAT NOT PRESENT IN NUM\nTHAT MEAN ith BIT NOT SET & WE NEED TO SET IT\nSO ANS IS 2^i.\n# Code\n```\nclass Solution {\npublic:\n    int minImpossibleOR(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int x = 1;\n        for(auto &i: nums){\n            if(i==x){\n                x <<= 1;\n            }\n        }\n        return x;\n    }\n};\n```
['Array', 'Bit Manipulation', 'Brainteaser', 'Sorting', 'C++']