D. J.:

- Added the leetcode problem and solution for 477

Author: nobodyPerfecZ

README.md

@@ -246,6 +246,7 @@
 - [452 Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/)
 - [461 Hamming Distance](https://leetcode.com/problems/hamming-distance/description/)
 - [474 Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/description/)
+- [477 Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/description/)
 - [502 IPO](https://leetcode.com/problems/ipo/description/)
 - [509 Fibonacci Number](https://leetcode.com/problems/fibonacci-number/description/)
 - [516 Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/description/)

awesome_python_leetcode/_477_total_hamming_distance.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def totalHammingDistance(self, nums: List[int]) -> int:
+        """
+        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.
+        """
+        result = 0
+        for bit in range(32):
+            ones = sum((num >> bit) & 1 for num in nums)
+            zeros = len(nums) - ones
+            result += ones * zeros
+        return result

tests/test_477_total_hamming_distance.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._477_total_hamming_distance import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([4, 14, 2], 6),
+        ([4, 14, 4], 4),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    total_hamming_distance = Solution().totalHammingDistance(nums)
+    assert total_hamming_distance == expected