This question evaluates a candidate's competency in algorithm design and data-structure manipulation, focusing on sorting-based interval merging and handling half-open and contiguous numeric ranges with edge cases such as empty input, nested intervals, and negative coordinates.
Given a list of half-open numeric intervals [start, end), merge all overlapping or contiguous intervals and return a list of non-overlapping intervals sorted by start. Analyze time and space complexity and cover edge cases such as empty input, nested intervals, and negative coordinates.