Calendar Conflict Detector

You are given an array of calendar events. Each event is represented as an object or struct with three properties:

• id: A unique identifier for the event
• start: An integer representing the start time (in minutes from a fixed reference point)
• end: An integer representing the end time (in minutes from the same reference point)

Two events are said to conflict if their time intervals overlap (i.e., one event starts before the other ends and vice versa). Importantly, conflicts are transitive. For example, if event A conflicts with event B, and event B conflicts with event C, then events A, B, and C should appear in the same conflict group.

Your task is to write a function that takes the array of events as input and returns a list (or array) of conflict groups. Each conflict group should be a list (or array) of events (using their ids, or the full event objects) that conflict with one another.

The input events may not be sorted. Your solution should account for that.

Design your solution to be efficient and well-structured. You can assume a reasonable number of events (say, up to a few thousand) while focusing on correctness and clarity of the algorithm.

Example Input (for clarification purposes only):

[
  { id: 1, start: 30, end: 150 },
  { id: 2, start: 120, end: 180 },
  { id: 3, start: 200, end: 240 },
  { id: 4, start: 170, end: 300 }
]

In the example above, events 1 and 2 conflict, events 2 and 4 conflict, so events 1, 2, and 4 should be grouped together. Event 3 does not conflict with any of the others and should be in its own group.

Implement your solution in the programming language of your choice. Be sure to include clear code and brief comments where necessary.