Add solution #477

Author: JoshCrozier

README.md

@@ -382,6 +382,7 @@
 474|[Ones and Zeroes](./0474-ones-and-zeroes.js)|Medium|
 475|[Heaters](./0475-heaters.js)|Medium|
 476|[Number Complement](./0476-number-complement.js)|Easy|
+477|[Total Hamming Distance](./0477-total-hamming-distance.js)|Medium|
 482|[License Key Formatting](./0482-license-key-formatting.js)|Easy|
 485|[Max Consecutive Ones](./0485-max-consecutive-ones.js)|Easy|
 486|[Predict the Winner](./0486-predict-the-winner.js)|Medium|

solutions/0477-total-hamming-distance.js

@@ -0,0 +1,26 @@
+/**
+ * 477. Total Hamming Distance
+ * https://leetcode.com/problems/total-hamming-distance/
+ * Difficulty: Medium
+ *
+ * The Hamming distance between two integers is the number of positions at which the
+ * corresponding bits are different.
+ *
+ * Given an integer array nums, return the sum of Hamming distances between all the
+ * pairs of the integers in nums.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var totalHammingDistance = function(nums) {
+  let result = 0;
+
+  for (let bit = 0; bit < 32; bit++) {
+    const ones = nums.reduce((count, n) => count + ((n >> bit) & 1), 0);
+    result += ones * (nums.length - ones);
+  }
+
+  return result;
+};