Very Easy || JAVA || No Bit Manipulation
Intuition\nTry to find out which all numbers can be formed without it present in the given array using OR operator.\n\n# Approach\nEvery number apart from power
# Intuition\nTry to find out which all numbers can be formed without it present in the given array using OR operator.\n\n# Approach\nEvery number apart from powers of 2 can be formed using OR operator on the existing numbers\n\n# Complexity\n- Time complexity:\n$$O(n)$$\n\n- Space complexity:\n$$O(1)$$\n\n# Code\n```\nclass Solution {\n    public int minImpossibleOR(int[] nums) {\n        HashSet<Integer> set = new HashSet<>();\n        for(int i:nums){\n            set.add(i);\n        }\n        for(int i=1;;i*=2){\n            if(!set.contains(i)){\n                return i;\n            }\n        }\n    }\n}\n```
['Java']