Faster and Easy to get solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minImpossibleOR(int[] nums) {\n        Set<Integer> set=new HashSet<>();\n         for(int n : nums)\n          if(n == 1 || (n & 1) == 0) set.add(n); \n\n        int powerOfTwo = 1; \n\n        while(true){\n            if(!set.contains(powerOfTwo)) return powerOfTwo;\n            powerOfTwo *= 2; \n            }\n    }\n}\n```
['Java']