minimum-impossible-or
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> hs = new HashSet<Integer>();\n        for(int i=0;i<nums.length;i++)\n        {\n            hs.add(nums[i]);\n        }\n        int i=0;\n        int a = (int)Math.pow(2,i);\n        while(hs.contains(a))\n        {\n            i++;\n            a = (int)Math.pow(2,i);\n        }\n        return (int)Math.pow(2,i);\n    }\n}\n```
['Java']