Available question text
Given an array of tower heights where you may only decrease values, reshape it into a mountain (nondecreasing up to one or more equal peak(s), then nonincreasing) to maximize the total sum of heights. The core challenge is, for each candidate peak, to optimally lower elements on both sides (without increasing any) so the sequence is valid and the sum is maximized.
Related questions
Continue with questions that share topics or the same question type.
- Beautiful Towers II
Coding · Array · Monotonic Stack · Stack
- Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
- Beautiful Arrangement II
Coding
- Beautiful Array
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 2865. Beautiful Towers I
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source