merge

Author: Anubha13kumari

0001/README.md

@@ -0,0 +1,7 @@
+# Two sum
+
+### Problem statemen
+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.

0001/two_sum.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        hash_table = dict()
+
+        # Iterating the list
+        for i, num in enumerate(nums):
+
+            # If the target-num in dict then, we found the solution
+            try:
+                hash_table[target - num]
+                return [hash_table[target - num], i]
+            except KeyError:
+                hash_table[num] = i