Given a list of start and end times, how would you find the maximum number of meetings that overlap at one time?
Represent each meeting as [start, end] and treat intervals as half-open, so a meeting ending at time t does not overlap one starting at t. Implement max_overlapping_meetings(meetings) to return the maximum simultaneous meeting count.
def max_overlapping_meetings(meetings):