Available question text
Given an array of existing power stations where each station powers cities within radius r and k extra stations can be placed anywhere, maximize the minimum total power any city receives. With n up to 1e5 and k up to 1e9, this is typically solved by binary-searching the target minimum power and using a sliding-window/greedy (difference-array) feasibility check to see if k stations suffice.
Related questions
Continue with questions that share topics or the same question type.
- Maximize the Minimum Game Score
Coding
- Minimum Cost to Reach City With Discounts
Coding
- Minimum Increase to Maximize Special Indices
Coding · Array · Dynamic Programming · Greedy
- Minimum Operations to Maximize Last Elements in Arrays
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 2528. Maximize the Minimum Powered City
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source