Meeting Buffer Scheduler

Problem Statement

You are given a list of meetings, where each meeting is represented by a pair of integers [start, end] (both given in minutes from the beginning of the day). In addition, there is a mandatory buffer time (in minutes) that must be observed between any two consecutive meetings when scheduling them in a single room.

Task:

Write a function that takes as input the list of meetings and the required buffer time. Your function should determine if it is possible to schedule all the meetings in a single room in some order such that there is at least the specified buffer time between the end of one meeting and the start of the next. The meetings may be reordered if needed.

Example:

Input: meetings = [[30, 75], [0, 50], [60, 150]], buffer = 10
Output: true

Constraints:

• Each meeting is represented as [start, end] where start < end.
• The list of meetings may be unsorted.
• All times are within the same day.
• The total number of meetings can be as high as 10^5, so efficiency is important.

Notes:

• You can rearrange the meetings in any order to satisfy the buffer requirement.
• Your solution should focus on both correctness and efficiency.