Loading the journal
Day 12Medium
LeetCodeRelated practice
LeetCodeRelated practiceMerge Intervals
Interval Management / SortingSolved Nov 9, 2025
Loading the journal
LeetCodeRelated practiceInterval Management / SortingSolved Nov 9, 2025
12 in the last 6 months
Community-reported company tags from leetcode-company-wise-problems (updated 2026-10-08). Bar shows how often each company asks it.
Problem
Given an array of intervals, where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · step-by-step visual · solution code
Watch walkthrough