484. Sequential Shift Range Merging

Given a list of integer pairs representing start and end points of segments, determine if all segments can be merged into a single continuous range starting from the minimum start value to the maximum end value, with no gaps in between. A gap exists if, after sorting by start time, the next segment's start is strictly greater than the previous segment's maximum end.

Example:
Input: segments = [[1, 2], [3, 4], [2, 3]]
Output: true

Run this challenge interactively in Python or JavaScript when the app loads.