two sum solution

Author: jiunshinn

two-sum/jiunshinn.py

@@ -0,0 +1,12 @@
+# time complexity : o(n)
+# space complexity : o(n)
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        hashmap = {}
+
+        for i, n in enumerate(nums):
+            diff = target - n
+            if diff in hashmap:
+                return [i, hashmap[diff]]
+            else:
+                hashmap[n] = i