Calendar Conflict Checker

You are given a list of existing events and a new event request. Each event is represented as an object (or dictionary) with two properties: start and end. These values represent times in minutes from midnight. Your task is to implement a function that determines if the new event can be scheduled without overlapping any of the existing events.

Requirements:

• The function should accept two parameters:
  • existingEvents: a list of event objects, e.g., [{ start: 60, end: 120 }, { start: 150, end: 210 }].
  • newEvent: an event object with properties start and end.
• Two events are considered non-overlapping if one event ends exactly when the other starts. That is, an event ending at time t and another starting at time t do not conflict.
• The function should return a boolean value: true if the new event can be scheduled without any overlap, and false if there is a conflict.
• Consider that the list of existing events may not be sorted by time.

Example:

Assuming:

existingEvents = [ { start: 60, end: 120 }, { start: 150, end: 210 } ]
newEvent = { start: 120, end: 150 }

The new event does not overlap with any existing event, so the function should return true.

Task:

Write code in your preferred programming language to implement the described functionality. Ensure your solution handles unsorted input and has an efficient time complexity. Include comments to explain your logic where necessary.