InterviewDB Question

Party Times - Find Overlapping Event Windows Across Guest Schedules

Question Details

Round 1 - Coding Problem You are organizing a party and have collected availability windows for each guest. Find all time slots where at least k guests are simultaneously available. Follow-ups What is the time complexity of your approach? How would you handle fractional time slots (e.g. 9:30 AM)? Can you solve this using a sweep line? Walk me through the algorithm. What if you need to output the exact guest lists for each slot?

Full Details

🔒

Unlock all Scale AI questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a scale ai interview during the phone round.

It covers the following topics: Coding, Phone .