Maximum Product of Two Integers With No Common Bits

Find two distinct elements in nums (n up to 1e5, values ≤1e6) whose binary representations share no set bits (nums[i] & nums[j] == 0) and maximize their product, returning 0 if no such pair exists. The core challenge is efficiently searching many numbers under a bitwise-disjointness constraint to compute the maximum product.