Faire Software Engineer interview experience

The problem was a line-sweep style challenge over events with start and end times plus a capacity value. At first I tried to treat it like an interval-plus-heap situation, but the better approach was to convert it into time points and apply capacity changes directly at each start or end boundary. I ended up with a partially working heap-based solution that felt awkward and bug-prone.

Then came the follow-up, which was the part that really pushed me: not only finding the maximum capacity required to handle all events, but also returning the specific time interval where that peak occurred.