Available question text
Given an array of nonnegative integers, compute the sum of Hamming distances over all pairs of numbers. Key idea: for each bit position, count how many numbers have a 1 and how many have a 0, and add ones * zeros for that bit (summed across all bit positions).
Related questions
Continue with questions that share topics or the same question type.
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Evaluate Reverse Polish Notation
Coding · Array · Math · Stack
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 477. Total Hamming Distance
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Apple
Total Hamming Distance
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 63.3. This is not an interview probability.
View source