Beautiful Towers II: coding question

Available question text

Choose heights within [1, maxHeights[i]] that form a mountain (nondecreasing to a single peak then nonincreasing) to maximize the total sum. Core challenge: for each possible peak, compute the best feasible left/right height profiles under the monotonic constraints (commonly done with prefix/suffix scans or monotonic stacks) and take the maximum total.

Continue with questions that share topics or the same question type.

132 Pattern
Coding · Array · Binary Search · Monotonic Stack
Binary Searchable Numbers in an Unsorted Array
Coding · Array · Binary Search · Monotonic Stack
Buildings With an Ocean View
Coding · Array · Monotonic Stack · Stack
Daily Temperatures
Coding · Array · Monotonic Stack · Stack

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Bloomberg
Leetcode 2866. Beautiful Towers II
Reported Sep 15, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Expedia
Beautiful Towers II
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Expedia
Beautiful Towers II
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source

Available question text

Beautiful Towers II

Available question text

Related questions

Beautiful Towers II

Available question text

Related questions