Java Optimized Solution || For Beginners || 5 line code
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        HashSet<Integer> set=new HashSet<>();\n        for(int i=0;i<nums.length;i++)\n            set.add(nums[i]);\n        int i=0;\n        for(i=0;i<32;i++){\n            if(!set.contains((int)Math.pow(2,i)))\n                break;\n        }\n        return (int)Math.pow(2,i);\n    }\n}\n```
['Java']