Given an array of positive integers nums.

Determine whether it is possible to select at least $2$ elements from nums such that the bitwise OR of the selected elements contains at least $1$ trailing zero in its binary representation.

Return true if it is possible to select such elements, and false otherwise.

Constraints:

• $2 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

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.