From 850953c2aad57b510d0c6f1bc7a3fbb7f662a4c7 Mon Sep 17 00:00:00 2001
From: Tony De La Nuez <tony.delanuez@gmail.com>
Date: Sun, 22 Oct 2017 18:06:45 -0500
Subject: [PATCH] Two-sum, common interview problem.

---
 other/two-sum.py | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 other/two-sum.py

diff --git a/other/two-sum.py b/other/two-sum.py
new file mode 100644
index 000000000..4a522b6d4
--- /dev/null
+++ b/other/two-sum.py
@@ -0,0 +1,28 @@
+"""
+Given an array of integers, return indices of the two numbers such that they add up to a specific target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+Example:
+Given nums = [2, 7, 11, 15], target = 9,
+
+Because nums[0] + nums[1] = 2 + 7 = 9,
+return [0, 1].
+"""
+
+def twoSum(nums, target):
+    """
+    :type nums: List[int]
+    :type target: int
+    :rtype: List[int]
+    """
+    chk_map = {}
+    for index, val in enumerate(nums):
+      compl = target - val
+      if compl in chk_map: 
+        indices = [chk_map[compl], index]
+        print(indices)
+        return [indices]
+      else:
+        chk_map[val] = index
+    return False