2D Array Meeting Conflicts | Dataford Interview Questions

Deliverr operations teams may receive a schedule of meetings as a two-dimensional array. Determine whether any two meetings conflict.

Each meeting is represented as [start, end], where start and end are integer time units and start <= end. Two meetings conflict when one begins before the other finishes. Meetings that share only an endpoint do not conflict, so [1, 3] and [3, 5] are compatible.

Implement has_conflict(meetings) and return True if at least one pair of meetings overlaps, otherwise return False.

You may reorder the input while processing it, but the function does not need to preserve the original array.

Constraints

0 <= len(meetings) <= 10^5
Each meeting contains exactly two integers
0 <= start <= end <= 10^9
Meetings sharing only an endpoint do not conflict

Function Signature

def has_conflict(meetings):

Your question is 2D Array Meeting Conflicts. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem