Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g2501_2600.s2568_minimum_impossible_or.Solution

```
public class Solution
extends Object
```
2568 - Minimum Impossible OR.
Medium

You are given a 0-indexed integer array nums.

We say that an integer x is expressible from nums if there exist some integers 0 <= index₁ < index₂ < … < index_k < nums.length for which nums[index₁] | nums[index₂] | … | nums[index_k] = x. In other words, an integer is expressible if it can be written as the bitwise OR of some subsequence of nums.

Return the minimum positive non-zero integer that is not expressible from nums.

Example 1:

Input: nums = [2,1]

Output: 4

Explanation: 1 and 2 are already present in the array. We know that 3 is expressible, since nums[0] | nums[1] = 2 | 1 = 3. Since 4 is not expressible, we return 4.

Example 2:

Input: nums = [5,3,2]

Output: 1

Explanation: We can show that 1 is the smallest number that is not expressible.

Constraints:
- 1 <= nums.length <= 10⁵
- 1 <= nums[i] <= 10⁹

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int minImpossibleOR(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

minImpossibleOR

public int minImpossibleOR(int[] nums)