The Skyline Problem · Coding Interview Practice

The Skyline ProblemGiven buildings as [left, right, height], return the skyline formed by them as a list of key points [x, height] sorted by x, where each point is the left end of a horizontal segment. The last point has height 0.Constraints

1 <= buildings.length <= 10^4

0 <= left < right <= 2^31 - 1, 1 <= height <= 2^31 - 1

buildings is sorted by left

Examples

Input: buildings = [[2, 9, 10], [3, 7, 15], [5, 12, 12], [15, 20, 10], [19, 24, 8]] Output: [[2, 10], [3, 15], [7, 12], [12, 0], [15, 10], [20, 8], [24, 0]]

Input: buildings = [[0, 2, 3], [2, 5, 3]] Output: [[0, 3], [5, 0]]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…