Python 2 lines with intuition. O(n) time, O(1) memory.
Intuition\nIf an integer is not expressible, then some bit in that integer cannot be set to 1. Since we are looking for the minimum positive non-expressible int
# Intuition\nIf an integer is not expressible, then some bit in that integer cannot be set to 1. Since we are looking for the minimum positive non-expressible integer, we just need to know the lowest bit that we can\'t get from any num in nums. Therefore, we just return the smallest power of 2 that is not found in nums.  \n\n\n# Complexity\n- Time complexity:\nO(n) because we check if a number is in nums 32 times, and each lookup is O(n).\n\n- Space complexity:\nO(1) \n\n# Code\n```\nclass Solution:\n    def minImpossibleOR(self, nums: List[int]) -> int:\n        for i in range(32):\n            if 1 << i not in nums: return 1 << i\n```
['Python3']