D. J.:

- Added the leetcode problem and solution for 461

Author: nobodyPerfecZ

README.md

@@ -235,6 +235,7 @@
 - [427 Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree/description/)
 - [433 Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/description/)
 - [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/)
 - [502 IPO](https://leetcode.com/problems/ipo/description/)
 - [509 Fibonacci Number](https://leetcode.com/problems/fibonacci-number/description/)

awesome_python_leetcode/_461_hamming_distance.py

@@ -0,0 +1,19 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def hammingDistance(self, x: int, y: int) -> int:
+        """
+        The Hamming distance between two integers is the number of positions at which
+        the corresponding bits are different.
+
+        Given two integers x and y, return the Hamming distance between them.
+        """
+        distance = 0
+        while x > 0 or y > 0:
+            # Get the last bit
+            distance += (x & 1) ^ (y & 1)
+
+            # Shift to the right
+            x >>= 1
+            y >>= 1
+        return distance

tests/test_461_hamming_distance.py

@@ -0,0 +1,16 @@
+import pytest
+
+from awesome_python_leetcode._461_hamming_distance import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["x", "y", "expected"],
+    argvalues=[
+        (1, 4, 2),
+        (3, 1, 1),
+    ],
+)
+def test_func(x: int, y: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    hamming_distance = Solution().hammingDistance(x, y)
+    assert hamming_distance == expected