Get Minimum Moves to Zero

Problem Overview

• Task: Given an even-length integer array, find the minimum number of moves to make all elements zero.
• Operation: Choose a subarray [L, R], compute its bitwise XOR as x, and set every element in that subarray to x; repeat as needed.
• Input/Output: arr[] with 0 ≤ arr[i] < 2^20; return the minimum move count as an integer.
• Context: Array manipulation and bitwise XOR domain; an Amazon interviews coding interview problem and interview question.