[Python] Simple solution of just checking power of two numbers; Explained
A number can be expressed by some power of two numbers. Thus, we only need to check the power of two numbers in the list, and find the minimum missing one.\n\nT
A number can be expressed by some power of two numbers. Thus, we only need to check the power of two numbers in the list, and find the minimum missing one.\n\nTo check the power of two, we can simply do:\n\n`num == num & (-num)`\n\n\n\n```\nclass Solution:\n    def minImpossibleOR(self, nums: List[int]) -> int:\n        bit_set = set()\n        for num in nums:\n            if num == num & (-num):\n                bit_set.add(num)\n        \n        i = 1\n        while i in bit_set:\n            i = i << 1\n        return i\n```
['Bit Manipulation', 'Python3']