LeetCode 3141: Maximum Hamming Distances Solution

Master LeetCode problem 3141 (Maximum Hamming Distances), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3141. Maximum Hamming Distances

Hard

Array Bit Manipulation Breadth-First Search

Problem Explanation

Explanation:

To solve this problem, we can iterate over each pair of integers in the given array and calculate the Hamming distance. The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given that the integers are in the range 0 to 10^9, we can compare each bit of the integers by converting them to their binary representation. We then count the number of differing bits to get the Hamming distance.

To find the maximum total Hamming distance, we need to maximize the number of differing bits across all pairs of integers. One way to do this is to iterate over each bit position from right to left and count the number of 0s and 1s at that position. The Hamming distance at that bit position will be the product of the count of 0s and 1s. By summing these products across all bit positions, we can obtain the maximum total Hamming distance. :

Solution Code

class Solution {
    public int maxHammingDistance(int[] nums) {
        int n = nums.length;
        int maxHammingDistance = 0;
        
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                int xor = nums[i] ^ nums[j];
                int hammingDistance = Integer.bitCount(xor);
                maxHammingDistance = Math.max(maxHammingDistance, hammingDistance);
            }
        }
        
        return maxHammingDistance;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3141 (Maximum Hamming Distances)?

This page provides optimized solutions for LeetCode problem 3141 (Maximum Hamming Distances) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3141 (Maximum Hamming Distances)?

The time complexity for LeetCode 3141 (Maximum Hamming Distances) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3141 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3141 in Java, C++, or Python.

Back to LeetCode Solutions