HackWithInfy• Prep
Merge Intervals
Difficulty
MediumAcceptance Rate
51.2%Problem Statement
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the 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: Since intervals [1,3] and [2,6] overlap, merge them into [1,6].
Example 2:
Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.
Example 3:
Input: intervals = [[4,7],[1,4]] Output: [[1,7]] Explanation: Intervals [1,4] and [4,7] are considered overlapping.
Constraints:
1 <= intervals.length <= 104intervals[i].length == 20 <= starti <= endi <= 104
Similar Questions
Insert IntervalMediumMeeting RoomsEasyMeeting Rooms IIMediumTeemo AttackingEasyAdd Bold Tag in StringMediumRange ModuleHardEmployee Free TimeHardPartition LabelsMediumInterval List IntersectionsMediumAmount of New Area Painted Each DayHardLongest Substring of One Repeating CharacterHardCount Integers in IntervalsHardDivide Intervals Into Minimum Number of GroupsMediumDetermine if Two Events Have ConflictEasyCount Ways to Group Overlapping RangesMediumPoints That Intersect With CarsEasyCount Days Without MeetingsMediumMinimize Connected Groups by Inserting IntervalMedium