✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: O(31*n). Space compl
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: $$O(31*n)$$. Space complexity: $$O(1)$$.\n```python3\nclass Solution:\n    def minImpossibleOR(self, a: List[int]) -> int:\n        return next(1<<i for i in range(31) if 1<<i not in a)\n```\n\n# Code #2\nTime complexity: $$O(n)$$. Space complexity: $$O(n)$$.\n```python3\nclass Solution:\n    def minImpossibleOR(self, a: List[int]) -> int:\n        return next((1<<i for i in range(31) if 1<<i not in a),q:={*a})\n```\n\n# Code #3\nTime complexity: $$O(n)$$. Space complexity: $$O(31)$$.\n```python3\nclass Solution:\n    def minImpossibleOR(self, a: List[int]) -> int:\n        return min({1<<i for i in range(31)}-{v for v in a if (v-1)&v==0})\n```\n\n(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be \'true\' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Bit Manipulation', 'Brainteaser', 'Python', 'Python3']