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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1229. Meeting Scheduler

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact