XOR-Sum 1 of DCB i couldn't understand the quest

#1

i couldnt understand the problem statement please explain

#2

@Aditikumari
Please send question link from hackerblocks

#3

https://hack.codingblocks.com/app/dcb/541

#4

@Aditikumari
So you have an array
You can pick any index i from it
Lets say A[i] = X
You can add Y to A[i] where -X <= Y <= X
Now you need to add such a Y to any index i such that resulting xor of all elements of array is maximum

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.