2 sum

Author: tech-cow

README.md

@@ -40,9 +40,10 @@
 
 
 
-
-
-
+## Array Easy
+|  #  | Title | Solution | Time | Space | Video|
+| --- | ----- | -------- | ---- | ----- | ---- |
+|1| [Two Sum](https://leetcode.com/problems/two-sum/) | [Python](./array/1.py) | _O(n)_| _O(n)_ |https://www.youtube.com/watch?v=uajne4jeGaA|
 
 
 

array/1.py

@@ -0,0 +1,14 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        dict = {}
+
+        for i , num in enumerate(nums):
+            if target - num in dict:
+                return (i, dict[target- num])
+            else:
+                dict[num] = i

checklist.md

@@ -0,0 +1,8 @@
+What's the motivation behind the problem?
+How could you use it to solve real-world problems?
+What are the insights, the clever observations made on the problem's constraints that make the solution possible?
+What details of the problem does the solution take advantage of to get that extra performance gain / space saving?
+Where does the algorithm / data-structure / solution suck?
+How could you make it better?
+What do you lose and gain by doing so?
+For the specific problem at hand, which solution presents the most acceptable trade-offs?