This example demonstrates an algorithm that merges overlapping calendar appointments into non-overlapping time blocks, showing how a list of meetings with start and end times can be reduced to a concise schedule. The code implements a pure JavaScript function that sorts the input array, iterates through each meeting, and conditionally combines it with the previous entry when their time ranges intersect. It uses standard array methods like `sort` and `reduce`, along with helper functions for checking overlaps and updating the merged list, with the final result logged via `console.log`. The data consists of hardcoded meeting objects with numeric `startTime` and `endTime` properties.