Search
⌘K
Get Premium
Leetcode 3670. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.