Uber

Interval List Intersections

Members only

Given two lists of closed intervals, each sorted by start time and pairwise disjoint within a list, return every intersection between the two lists using a two-pointer sweep. A follow-up asks how to h...