[jeongyunjae] WEEK 01 solutions

contains-duplicate/jeongyunjae.py

@@ -0,0 +1,3 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(list(set(nums))) != len(nums)

two-sum/jeongyunjae.py

@@ -0,0 +1,11 @@
+class Solution:
+
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        my_dict = {}
+
+        for i in range(len(nums)):
+            remaining = target - nums[i]
+            if remaining not in my_dict:
+                my_dict[nums[i]] = i
+            else:
+                return [my_dict[remaining], i]