30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 2866. Beautiful Towers II

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.

Asked at:

Bloomberg

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid September, 2025

Bloomberg

Mid-level

https://leetcode.com/problems/beautiful-towers-ii/

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2866. Beautiful Towers II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact