Event Scheduler

Algorithms Data Structures System Design

You are tasked with designing and implementing an event scheduling system. In this system, an event is defined by its start time, end time, and a unique event identifier. All events occur within a single day, and time is represented as minutes from 0 to 1440 (i.e., from midnight to midnight).

Your system should expose at least the following functionalities:

  1. scheduleEvent(startTime, endTime, eventId): Schedule a new event. The event should only be scheduled if it does not conflict with any already scheduled event. Two events conflict if their time intervals overlap.

  2. getEventsAt(time): Given a specific time (in minutes), return a list of eventIds that are active at that time (i.e., events for which startTime <= time < endTime).

Requirements:

  • If an event being added conflicts with an existing event, the scheduleEvent function should indicate failure (you may decide whether to return a boolean, throw an error, etc.).

  • Optimize for efficient event queries and scheduling operations as much as possible.

  • Provide appropriate tests to demonstrate that your system works as expected.

Feel free to use any standard data structures or libraries available in your programming language of choice. Good luck!