CodingMediumcod-g175

Subject Bit manipulationLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

The Hamming distance between two integers is the number of bit positions where they differ. Given an array nums of non-negative integers (each fits in 32 bits), return the sum of Hamming distances over all unordered pairs of elements. There can be up to 10^4 numbers, so an O(n^2) pairwise comparison is too slow.

Implement

total_hamming_distance(nums: list[int]) → int

Examples

in[[4,14,2]]out6

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.