diff --git a/find-minimum-in-rotated-sorted-array/sonjh1217.swift b/find-minimum-in-rotated-sorted-array/sonjh1217.swift
new file mode 100644
index 000000000..8b2dd702f
--- /dev/null
+++ b/find-minimum-in-rotated-sorted-array/sonjh1217.swift
@@ -0,0 +1,26 @@
+class Solution {
+    func findMin(_ nums: [Int]) -> Int {
+        var low = 1
+        var high = nums.count - 1
+        
+        while low <= high {
+            let mid = low + (high - low) / 2
+            
+            if nums[mid] < nums[mid - 1] {
+                return nums[mid]
+            }
+            
+            if nums[mid] > nums[0] {
+                low = mid + 1
+            } else {
+                high = mid - 1
+            }
+        }
+        
+        return nums[0]
+        
+        //시간복잡도 O(logn)
+        //공간복잡도 O(1)
+    }
+}
+
diff --git a/maximum-depth-of-binary-tree/sonjh1217.swift b/maximum-depth-of-binary-tree/sonjh1217.swift
new file mode 100644
index 000000000..57393ddfb
--- /dev/null
+++ b/maximum-depth-of-binary-tree/sonjh1217.swift
@@ -0,0 +1,42 @@
+class Solution {
+    func maxDepthStack(_ root: TreeNode?) -> Int {
+        guard let root = root else {
+            return 0
+        }
+        var searchStack = [(TreeNode, Int)]()
+        searchStack.append((root, 1))
+        var maxDepth = 1
+
+        while searchStack.isEmpty == false {
+            guard let popped = searchStack.popLast() else {
+                break
+            }
+            maxDepth = max(popped.1, maxDepth)
+            
+            if let left = popped.0.left {
+                searchStack.append((left, popped.1 + 1))
+            }
+            
+            if let right = popped.0.right {
+                searchStack.append((right, popped.1 + 1))
+            }
+        }
+        
+        return maxDepth
+        
+        //시간복잡도 O(n)
+        //공간복잡도 O(n)
+    }
+    
+    func maxDepthRecursion(_ root: TreeNode?) -> Int {
+        guard let root = root else {
+            return 0
+        }
+        
+        return max(maxDepth(root.left), maxDepth(root.right)) + 1
+        
+        //시간복잡도 O(n)
+        //공간복잡도 O(n)
+    }
+}
+
diff --git a/merge-two-sorted-lists/sonjh1217.swift b/merge-two-sorted-lists/sonjh1217.swift
new file mode 100644
index 000000000..2a9910036
--- /dev/null
+++ b/merge-two-sorted-lists/sonjh1217.swift
@@ -0,0 +1,56 @@
+class Solution {
+    func mergeTwoListsIterative(_ list1: ListNode?, _ list2: ListNode?) -> ListNode? {
+        var iterList1 = list1
+        var iterList2 = list2
+        
+        var dummy = ListNode()
+        var merged = dummy
+        
+        while iterList1 != nil && iterList2 != nil,
+              let list1 = iterList1,
+              let list2 = iterList2 {
+            if list1.val < list2.val {
+                merged.next = list1
+                iterList1 = list1.next
+            } else {
+                merged.next = list2
+                iterList2 = list2.next
+            }
+            
+            guard let next = merged.next else {
+                break
+            }
+            
+            merged = next
+        }
+        
+        merged.next = iterList1 ?? iterList2
+
+        return dummy.next
+        
+        //시간복잡도 O(m+n)
+        //공간복잡도 O(1)
+    }
+    
+    func mergeTwoListsRecursion(_ list1: ListNode?, _ list2: ListNode?) -> ListNode? {
+        guard var list1 = list1 else {
+            return list2
+        }
+        
+        guard var list2 = list2 else {
+            return list1
+        }
+
+        if list1.val < list2.val {
+            list1.next = mergeTwoListsRecursion(list1.next, list2)
+            return list1
+        } else {
+            list2.next = mergeTwoListsRecursion(list1, list2.next)
+            return list2
+        }
+        
+        //시간 복잡도 O(m+n)
+        //공간 복잡도 O(m+n)
+    }
+}
+