2446. Determine if Two Events Have Conflict
Read the full problem statement on LeetCode.
Difficulty: easy Acceptance: 52% Topics: Array, String
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(1)
# Space: O(1)
# array
class Solution(object):
def haveConflict(self, event1, event2):
"""
:type event1: List[str]
:type event2: List[str]
:rtype: bool
"""
return max(event1[0], event2[0]) <= min(event1[1], event2[1])
Solution from kamyu104/LeetCode-Solutions · MIT
Similar questions