Common Intervals From Two Arrays | Dataford Interview Questions

Tekion Automotive Retail Cloud may represent availability windows from two scheduling sources as sorted, non-overlapping intervals. Given two arrays of sorted and disjoint closed intervals, return every interval where the two arrays overlap.

Use the format [start, end] for each interval. The output must contain intersections in ascending order, without merging separate results.

Formal Specification

Implement common_intervals(first, second):

first and second are arrays of integer intervals.
Each input array is sorted by interval start.
Intervals within either input array do not overlap.
Intervals are closed, so an endpoint shared by both intervals is included.
Return an array containing every non-empty intersection, also sorted by start.

Constraints

0 <= len(first), len(second) <= 10^5
Each interval contains exactly two integers
The start of every interval is less than or equal to its end
Each input array is sorted by interval start
Intervals within either input array are disjoint
-10^9 <= interval endpoint <= 10^9

Function Signature

def common_intervals(first, second):

Your question is Common Intervals From Two Arrays. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem