[devyejin] WEEK 01 solutions

contains-duplicate/devyejin.py

@@ -0,0 +1,4 @@
+class Solution(object):
+    def containsDuplicate(self, nums):
+        return len(nums) != len(set(nums))
+

two-sum/devyejin.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+
+        nums_tuple = sorted(list(enumerate(nums)), key=lambda x: x[1])
+        left, right = 0, len(nums) - 1
+
+        while left < right:
+            temp_sum = nums_tuple[left][1] + nums_tuple[right][1]
+            if temp_sum == target:
+                return [nums_tuple[left][0], nums_tuple[right][0]]
+            elif temp_sum < target:
+                left += 1
+            else:
+                right -= 1
+
+
+