Minimum value of K such that Bitwise XOR of K with all array elements is minimum
Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array elements is minimum Input: arr[] 16 12 20 18 Output: 16 Explanation: 16^16+12^16+20^16+18^16 =26 Minimum sum Explanation: Check every bit of the numbers and count number of one and zero For minimum sum,… Read More »