Given an integer array nums, find the maximum product of two distinct elements nums[i] and nums[j] such that nums[i] and nums[j] share no common set bits in their binary representations.

Return the maximum product of such a pair. If no two elements share zero common set bits, return $0$.

Constraints:

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

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

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.