Leetcode 1229. Meeting Scheduler

Given two people's lists of available time intervals and a required meeting duration, find the earliest time interval where both are free for at least that duration. This is an interval-intersection problem typically solved by scanning the sorted lists with a two-pointer sweep to locate the first overlapping slot of sufficient length.