Solution

All Implemented Interfaces:
```
public final class Solution

                    
```
3670 - Maximum Product of Two Integers With No Common Bits.
Medium
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 pair is 3 (011) and 4 (100). They share no set bits and 3 * 4 = 12.
Example 2:
Input: nums = 5,6,4
Output: 0
Explanation:
Every pair of numbers has at least one common set bit. Hence, the answer is 0.
Example 3:
Input: nums = 64,8,32
Output: 2048
Explanation:
No pair of numbers share a common bit, so the answer is the product of the two maximum elements, 64 and 32 (64 * 32 = 2048).
Constraints:
- <code>2 <= nums.length <= 10<sup>5</sup></code>
- <code>1 <= numsi<= 10<sup>6</sup></code>

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description

Field Summary

Fields
Modifier and Type	Field	Description

Constructor Summary

Constructors
Constructor	Description
`Solution()`

Enum Constant Summary

Enum Constants
Enum Constant	Description

Method Summary

Modifier and Type	Method	Description
`final Long`	`maxProduct(IntArray nums)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
Solution()
```

Method Detail
- maxProduct
```
 final Long maxProduct(IntArray nums)
```