3670. Maximum Product of Two Integers With No Common Bits

You are given an integer array nums. Your task is to find two distinct indices i and j such that the product nums[i] * nums[j] is maximized, and the binary representations of nums[i] and nums[j] do not share any common set bits. Return the maximum possible product of such a pair. If no such pair exists, return 0. Example 1: Input: nums = [1,2,3,4,5,6,7] Output: 12 Explanation: The best pa