Merge Overlapping Intervals
Hard Problems: Merge & Intervals DSA practice problem on Onlearn.
Difficulty: medium.
Topics: Merging Overlapping Intervals in an Array, Arrays, Sorting, Time Complexity, Space Complexity, Loops, Conditional Statements, space complexity, greedy algorithm, sorting algorithms, intervals, general programming, algorithm design, time complexity analysis, Interval Merging, Single-Pass Algorithms.
Given an array of intervals, where each interval is represented as [start, end], merge all overlapping intervals and return an array of non overlapping intervals that cover all the intervals in the input. Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Intervals [1,3] and [2,6] overlap, so they are merged to [1,6]. The other intervals are non overlapping. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] overlap at point 4, so they are merged to [1,5].