Question

Bob has found an array A of size N.
Now he wants to change the array such that the Bitwise Xor of every K consecutive elements becomes 0.
You need to help Bob find the minimum number of elements he needs to change.​

Answer 1

Answer:

am too finding the answer that too before 12.30 am...