Status: IN
Moving chips by any even distance is free, so `min_cost_to_move_chips` reduces to `min(count_odd, count_even)` — move the smaller parity group across the boundary at cost 1 each.
Source: entries/2026/06/06/minimum-cost-to-move-chips-to-the-same-position-solution.md