Event Overlap Detector

You are given a list of events. Each event is represented by a pair of non-negative integers [start, end), where start is inclusive and end is exclusive. Assume that for every event, start < end.

Write a function/method that accepts this list of events and returns a boolean:

• true if there is at least one pair of events that overlap in time, and
• false if no events overlap.

An event A = [startA, endA) is considered to overlap with event B = [startB, endB) if the intervals have any common time, i.e. they share any moment such that:

max(startA, startB) < min(endA, endB)

Note that if one event's end time is equal to another event's start time, they are not overlapping.

Your solution should work efficiently even if the number of events is large. Consider edge cases and be sure to write clean, well-documented code.

You may assume that the input list is not sorted. Feel free to demonstrate the correctness of your solution with example test cases in your code.