Interval problems show up constantly in coding interviews and in real scheduling software. Almost all of them start with the same move: sort by start time.
Merge intervals
Sort by start. Walk the list and keep a current interval. If the next one starts before or at the current end, extend the end to the maximum of both ends. Otherwise, save the current interval and start a new one. O(n log n) for the sort, O(n) for the pass.
Insert interval
Add everything that ends before the new interval, merge everything that overlaps it, then add the rest. No re-sort needed if the input is already sorted.
Meeting rooms
Can one person attend all meetings: sort and check adjacent overlaps. How many rooms are needed: sort start times and end times separately and sweep with two pointers, or push end times into a min-heap and pop whenever a meeting has ended.
Non-overlapping intervals
To remove the fewest intervals, sort by end time and greedily keep the interval that finishes earliest. This greedy choice is worth explaining in the interview, because it is the part interviewers probe.
Edge cases to say out loud
Do touching intervals like [1,2] and [2,3] count as overlapping? Is the input sorted? Can it be empty? Asking these early saves you from rewriting later.
Disclosure: I work on Linkjob AI, which offers real-time interview help for technical rounds.