Easy Java Solution || Beats 100% of Java Users . 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int minImpossibleOR(int[] nums) {
        int mask = 0 ;  
        for( int i : nums ){
            if( (i & (i-1)) == 0 ){
                mask |= i ; 
            }
        } 
        int i=0 ; 
        while( mask > 0 ){
            if( (mask&1) == 0 ){
                return 1 << i ; 
            }
            mask >>= 1 ; 
            ++i ; 
        }
        return 1 << i;
    }
}
```
['Array', 'Bit Manipulation', 'Brainteaser', 'Java']