2536. Determine if Two Events Have Conflict
My accepted Python solution to LeetCode problem 2536, Determine if Two Events Have Conflict, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.1MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.1MB, accepted 2026-01-01.
class Solution:
def haveConflict(self, event1: List[str], event2: List[str]) -> bool:
# Two events conflict if they overlap
return event1[0] <= event2[1] and event2[0] <= event1[1]