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.