You are given an integer array nums.

A positive integer is considered expressible if there exists at least one non empty subsequence of nums such that the bitwise OR of all its elements equals that integer.

Return the minimum positive integer that is not expressible by any subsequence of nums.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Input: nums = [4,6,12]-List[int]
Output: 1-int
Explanation: No non-empty subsequence has a bitwise OR equal to 1, so the minimum positive integer that is not expressible is 1.

Input: nums = [1,2,4,8]-List[int]
Output: 16-int
Explanation: By choosing subsequences of the powers of two, every positive integer from 1 through 15 can be formed. The next integer, 16, cannot be expressed.

Input: nums = [1,1,2,2,4,4,10]-List[int]
Output: 8-int
Explanation: The values 1, 2, and 4 allow every positive integer below 8 to be formed. The only value containing the bit for 8 is 10, which also contains the bit for 2, so an OR equal to exactly 8 is impossible.

Input: nums = [1,3,5,9,17]-List[int]
Output: 2-int
Explanation: The integer 1 is expressible using the subsequence containing 1. Any subsequence that includes the bit for 2 also includes another set bit, so no subsequence has an OR equal to exactly 2.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.