InterviewDB
Question
Party Times - Find Overlapping Event Windows Across Guest Schedules
phone
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 accessAbout This Question
This is a reported interview question from a scale ai interview during the phone round.
More Scale AI Interview Questions
1p3a
Scale.ai Backend Practical Interview Experience for Fulltime SDE
1p3a
Scale.ai Enterprise GenAI SDE Fulltime Tech Phone Screen Experience
1p3a
Scale AI Engineering Manager Onsite Interview Preparation Guide
1p3a
Scale AI Product/Software Engineer Onsite Interview Experience
InterviewDB
Another Card Game: Design and Implement a Turn-Based Card Game Engine with OOD