Find Intersections Between Two Interval Lists

Company: Nuro

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Find every non-empty intersection between two sorted lists of disjoint closed intervals. Preserve ascending order and correctly include intersections where intervals meet at a single endpoint.

Read the full Nuro Software Engineer interview experience this question came from