Min Ops Make Array XOR = K II

You are given a 0-indexed integer array nums and an integer k. In one operation, replace any element with any non-negative integer. Return the minimum operations needed so that the XOR of all elements equals k. The answer equals the number of bit positions where the overall XOR differs from k.

Examples
Input: [[2,1,3,4],1]
Output: 2
Hints

Min Ops Make Array XOR = K II

You are given a 0-indexed integer array nums and an integer k. In one operation, replace any element with any non-negative integer. Return the minimum operations needed so that the XOR of all elements equals k. The answer equals the number of bit positions where the overall XOR differs from k.