56_Merge_Intervals

Author: Partho Biswas

README.md

@@ -131,7 +131,7 @@ I have solved quite a number of problems from several topics. See the below tabl
 |17| [747. Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/)| [Python](https://tinyurl.com/wu6rdaw/747_Largest_Number_At_Least_Twice_of_Others.py)| |
 |18| [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/solution/)| [Python](https://tinyurl.com/wu6rdaw/581_Shortest_Unsorted_Continuous_Subarray.py)| |
 |19| [904. Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/solution/)| [Python](https://tinyurl.com/wu6rdaw/904_Fruit_Into_Baskets.py)| [Article](https://www.educative.io/courses/grokking-the-coding-interview/Bn2KLlOR0lQ), [Video 1](https://www.youtube.com/watch?v=s_zu2dOkq80), [Video 2](https://www.youtube.com/watch?v=za2YuucS0tw)| Medium | [Sliding Window, Two Pointer](https://github.com/partho-maple/coding-interview-patterns) |
-|20| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Python](https://tinyurl.com/wu6rdaw/56_Merge_Intervals.py)| [Article](https://leetcode.com/problems/merge-intervals/discuss/21227/7-lines-easy-Python)|
+|20| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Python](https://tinyurl.com/wu6rdaw/56_Merge_Intervals.py)| [Article](https://leetcode.com/problems/merge-intervals/discuss/21227/7-lines-easy-Python), [Swift](https://tinyurl.com/wuja3c4/56_Merge_Intervals.swift) |
 |21| [334. Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)| [Python](https://tinyurl.com/wu6rdaw/334_Increasing_Triplet_Subsequence.py)| --- | Medium | --- |
 |22| [792. Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)| [Python](https://tinyurl.com/wu6rdaw/792_Number_of_Matching_Subsequences.py)| **[Official](https://leetcode.com/problems/number-of-matching-subsequences/discuss/117634/Efficient-and-simple-go-through-words-in-parallel-with-explanation/)** | Medium | **Very tricky. Check again** |
 |23| [912. Sort an Array (Merge Sort)](https://leetcode.com/problems/sort-an-array/)| [Python](https://tinyurl.com/wu6rdaw/912_Sort_an_Array_(Merge__Sort).py)|--- | Medium | --- |

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/56_Merge_Intervals.swift

@@ -0,0 +1,25 @@
+import Foundation
+
+class Solution {
+    func merge(_ intervals: [[Int]]) -> [[Int]] {
+        guard intervals.count > 1 else {
+            return intervals
+        }
+        var sortedIntervals: [[Int]] = intervals.sorted { $0[0] < $1[0] } // Sort the intervals by start time
+        print(sortedIntervals)
+        var mergedIntervals = [[Int]]()
+        mergedIntervals.append(sortedIntervals.first!)
+        print(mergedIntervals)
+        for index in 1..<sortedIntervals.count {
+            var previousInterval = mergedIntervals.last!
+            var currentInterval = sortedIntervals[index]
+            if previousInterval[1] >= currentInterval[0] {
+                mergedIntervals.popLast()
+                mergedIntervals.append([min(previousInterval[0], currentInterval[0]), max(previousInterval[1], currentInterval[1])])
+            } else {
+                mergedIntervals.append(currentInterval)
+            }
+        }
+        return mergedIntervals
+    }
+}