D. J.:

- Added the leetcode problem and solution for 371

Author: nobodyPerfecZ

README.md

@@ -229,6 +229,7 @@
 - [338 Counting Bits](https://leetcode.com/problems/counting-bits/description/)
 - [342 Power of Four](https://leetcode.com/problems/power-of-four/description/)
 - [354 Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/description/)
+- [371 Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/)
 - [373 Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/description/)
 - [377 Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/description/)
 - [380 Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/description/)

awesome_python_leetcode/_371_sum_of_two_integers.py

@@ -0,0 +1,20 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def getSum(self, a: int, b: int) -> int:
+        """
+        Given two integers a and b, return the sum of the two integers without using
+        the operators + and -.
+        """
+        MASK = 0xFFFFFFFF  # Mask to get last 32 bits
+        MAX_INT = 0x7FFFFFFF  # Max positive 32-bit integer
+
+        a &= MASK
+        b &= MASK
+
+        while b != 0:
+            carry = (a & b) << 1
+            a = a ^ b
+            b = carry & MASK
+
+        return a if a <= MAX_INT else ~(a ^ MASK)

tests/test_371_sum_of_two_integers.py

@@ -0,0 +1,16 @@
+import pytest
+
+from awesome_python_leetcode._371_sum_of_two_integers import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["a", "b", "expected"],
+    argvalues=[
+        (1, 2, 3),
+        (2, 3, 5),
+    ],
+)
+def test_func(a: int, b: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    sum = Solution().getSum(a, b)
+    assert sum == expected