Available question text
Given n buildings in a line with height1 = 0, nonnegative integer heights, adjacent height differences ≤ 1, and some positions having upper bounds, compute the maximum possible building height. Because n can be huge but restrictions are sparse, the problem reduces to propagating slope constraints between restricted points and computing the highest feasible peak between neighboring restrictions.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1840. Maximum Building Height
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source