Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3139. Minimum Cost to Equalize Array
Determine the minimum cost to make all elements equal by choosing a final target value and an optimal mix of single-element (+1 at cost1) and two-element (+1 each at cost2) increments — balancing whether pair operations are cheaper than two singles and respecting per-element increment needs and parity constraints.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.