Merge pull request #1985 from sonjh1217/main

[sonjh1217] WEEK 01 solutions

Author: sonjh1217

contains-duplicate/sonjh1217.swift

@@ -0,0 +1,14 @@
+class Solution {
+    // time O(n) / space O(n)
+    func containsDuplicate(_ nums: [Int]) -> Bool {
+        var numSet = Set<Int>()
+        for num in nums {
+            if numSet.contains(num) {
+                return true
+            }
+            numSet.insert(num)
+        }
+
+        return false
+    }
+}

two-sum/sonjh1217.swift

@@ -0,0 +1,15 @@
+class Solution {
+    // time O(n) / space O(n)
+    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
+        var indicesByCounters = [Int: Int]()
+        for (i, num) in nums.enumerated() { 
+            if let index = indicesByCounters[num] {
+                return [index, i]
+            }
+
+            indicesByCounters[target - num] = i
+        }
+
+        return []
+    }
+}