Python solution TC O(N), SC O(1)
Intuition\n Describe your first thoughts on how to solve this problem. \nProblem states that we have to find minimum possible number such that after doing Bitwi
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nProblem states that we have to find minimum possible number such that after doing Bitwise_OR of each number, we cannot build that number.\n\n\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minImpossibleOR(self, nums: List[int]) -> int:\n        bitwise_or=0\n        for i in nums:\n            if(i&(i-1)==0):\n                bitwise_or=bitwise_or|i\n        for i in range(32):\n            if(bitwise_or&(1<<i)==0):\n                return 1<<i\n        return -1\n```
['Bit Manipulation', 'Python3']