Problem Description
You are given two arrays of strings that represent two inclusive events that happened on the same day, event1 and event2, where event1 = [startTime1, endTime1] and event2 = [startTime2, endTime2]. A conflict happens when two events have some non-empty intersection (i.e., some moment is common to both events). Return true if there is a conflict between two events. Otherwise, return false.
Key Insights
- Events are represented as time intervals with start and end times.
- A conflict occurs if the time intervals overlap.
- To determine overlap, we can check the conditions based on start and end times.
Space and Time Complexity
Time Complexity: O(1)
Space Complexity: O(1)
Solution
To determine if two events conflict, we can use a simple approach by comparing the start and end times of both events. The conditions for overlap can be defined as:
- Event 1 starts before Event 2 ends and Event 1 ends after Event 2 starts.
We can convert the time strings into comparable values (like minutes since midnight) or simply use string comparison since the format is fixed as "HH:MM". This allows us to directly compare the times.