You are organizing an event. Each attendee's presence is described by a half-open interval [entry, exit), meaning they are present at every integer time t satisfying entry <= t < exit.

Given a list times of [entry, exit] intervals, find the earliest integer time at which the maximum number of attendees are simultaneously present. ...