Minimum Deletions to Make Array Beautiful

Delete the fewest elements so the remaining array has even length and every consecutive pair (indices 0&1, 2&3, ...) contains two different values. The core challenge is to form as many non-equal adjacent pairs as possible (via a linear greedy scan) and count the elements that must be removed.