D. J.:

- Added the leetcode problem and solution for 260

Author: nobodyPerfecZ

README.md

@@ -213,6 +213,7 @@
 - [236 Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/)
 - [238 Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/)
 - [242 Valid Anagram](https://leetcode.com/problems/valid-anagram/description/)
+- [260 Single Number III](https://leetcode.com/problems/single-number-iii/description/)
 - [274 H-Index](https://leetcode.com/problems/h-index/description/)
 - [279 Perfect Squares](https://leetcode.com/problems/perfect-squares/description/)
 - [289 Game of Life](https://leetcode.com/problems/game-of-life/description/)

awesome_python_leetcode/_260_single_number_III.py

@@ -0,0 +1,35 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def singleNumber(self, nums: List[int]) -> List[int]:
+        """
+        Given an integer array nums, in which exactly two elements appear only once and
+        all the other elements appear exactly twice. Find the two elements that appear
+        only once. You can return the answer in any order.
+
+        You must write an algorithm that runs in linear runtime complexity and uses
+        only constant extra space.
+        """
+        # Get the XOR product of the two distinct values
+        result = 0
+        for n in nums:
+            result ^= n
+
+        # Get the position of the first 1-bit
+        k = 0
+        while result & 1 == 0:
+            result >>= 1
+            k += 1
+
+        # Group the values according to the first 1-bit
+        num1, num2 = 0, 0
+        for n in nums:
+            if (n & (1 << k)) >> k == 1:
+                num1 ^= n
+            else:
+                num2 ^= n
+
+        return [num1, num2]

tests/test_260_single_number_III.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._260_single_number_III import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 2, 1, 3, 2, 5], [3, 5]),
+        ([-1, 0], [-1, 0]),
+        ([0, 1], [1, 0]),
+    ],
+)
+def test_func(nums: List[int], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    single_numbers = Solution().singleNumber(nums)
+    assert single_numbers == expected