Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.