Skip to content

2568. Minimum Impossible OR 👍

  • Time: $O(n + 32) = O(n)$
  • Space: $O(n)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution {
 public:
  int minImpossibleOR(vector<int>& nums) {
    int ans = 1;
    const unordered_set<int> numsSet{nums.begin(), nums.end()};

    while (numsSet.count(ans))
      ans <<= 1;

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution {
  public int minImpossibleOR(int[] nums) {
    int ans = 1;
    Set<Integer> numsSet = Arrays.stream(nums).boxed().collect(Collectors.toSet());

    while (numsSet.contains(ans))
      ans <<= 1;

    return ans;
  }
}

1
2
3
4
5
6
7
8
9
class Solution:
  def minImpossibleOR(self, nums: List[int]) -> int:
    ans = 1
    numsSet = set(nums)

    while ans in numsSet:
      ans <<= 1

    return ans