D. J.:

- Added the leetcode problem and solution for 1 Two Sum

Author: nobodyPerfecZ

README.md

@@ -4,6 +4,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 
 ## Leetcode Problems & Solutions 💻
 
+- [1 Two Sum](https://leetcode.com/problems/two-sum/description/)
 - [26 Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)
 - [27 Remove Element](https://leetcode.com/problems/remove-element/description/)
 - [45 Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)

awesome_python_leetcode/_1_two_sum.py

@@ -0,0 +1,21 @@
+from typing import List
+
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        """
+        Given an array of integers nums and an integer target, return
+        indices of the two numbers such that they add up to target.
+
+        You may assume that each input would have exactly one solution,
+        and you may not use the same element twice.
+
+        You can return the answer in any order.
+        """
+        values = {}
+        for i, n in enumerate(nums):
+            diff = target - n
+            if diff in values:
+                return [values[diff], i]
+            values[n] = i
+        return

tests/test_1_two_sum.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._1_two_sum import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "target", "expected"],
+    argvalues=[
+        ([2, 7, 11, 15], 9, [0, 1]),
+        ([3, 2, 4], 6, [1, 2]),
+        ([3, 3], 6, [0, 1]),
+    ],
+)
+def test_func(nums: List[int], target: int, expected: List[int]):
+    two_sum = Solution().twoSum(nums, target)
+    assert two_sum == expected