GoLang Solution For LeetCode Problem: Merge Intervals
Solving Merge Intervals in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a collection of intervals, merge all overlapping intervals.
Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Input: [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.
See the full details of the problem Merge Intervals at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go