Calendar Availability Service
Build a service that ingests user availability intervals and, given a prompt specifying a subset of users and a required duration, returns all time windows where those users are simultaneously available. For example, find all 30-minute windows where user 1 and user 2 are both free. A bonus section asks for an extension or optimization, such as supporting variable worker start/end dates or an efficient BitSet-based representation of minute-by-minute availability.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late August, 2026
Basic boiler plate style meetings question, ingest availability and the produce given a user fed prompt time windows matching the args given in the user fed input. This would like user 1 and user 2 (out of the list of x users) find available time windows of 30 minutes. Then a bonus section was to provide a fun feature or variation to the solution. I provided a few, one was start and end dates for workers, not all workers start at the same time. I also provided an AI generated task plan on how to convert the system to supporting BitSet representation of the minute by minute time windows for the workers. This was not implemented but due to the constraints of single day overall time window per lookup the number of bits and representation was quick. Then we walked through the code another day, and stepped through the logic and where it could be improved and what the logic did.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.