Available question text
Given an n x n grid of building heights, increase building heights without changing the skyline seen from any cardinal direction (i.e., without altering any row or column maximum). The maximum total increase is the sum over all cells of (min(max height in its row, max height in its column) - current height), clamped to nonnegative values.
Related questions
Continue with questions that share topics or the same question type.
- Remove Max Number of Edges to Keep Graph Fully Traversable
Coding
- Avoid Flood in The City
Coding · Array · Binary Search · Greedy
- Count Partitions With Max-Min Difference at Most K
Coding
- Count Subarrays Where Max Element Appears at Least K Times
Coding
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 807. Max Increase to Keep City Skyline
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source