Leetcode 218. The Skyline Problem

Given a list of rectangular buildings [left, right, height], compute the skyline as the sequence of key points where the maximum building height changes across x; this requires identifying interval endpoints where the current max height rises or falls (commonly solved with a sweep-line + max-heap or divide-and-conquer) and merging any consecutive equal-height segments.