Unique number 2 problem

#1

i could not understand the editorial solution please explain

#2

firstly take xor of all the values of the array.
now finalxor= xor of those two different values which have occured only once
these two values are diferent so they will differ in at most one bit.
it means that finalxor will have at least one set bit.
find the place of the left most set bit of the finalxor.
now take xor of all the numbers in the array with that one set bit .
the numbers that have appeared twice wont afffect the xor but one of the different numbers will be included in the final xor.

#3

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.