Merge Overlapping Closed Intervals into a Sorted Disjoint List
Company: Aim Intelligent Machine
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: A coding problem that asks you to merge a list of closed integer intervals, given in any order, so that every group of overlapping intervals becomes one interval, returned sorted by start. It tests careful interval reasoning, correct handling of shared endpoints versus merely adjacent integers, nested and duplicate intervals, and efficiency on inputs of up to 100,000 intervals.
Read the full Aim Intelligent Machine Software Engineer interview experience this question came from