nvm

I still don't understand my solution took me two hours an insanely complicated Xd

Wow now I feel like a beginner again

Really clever solution, i voted clever, but not BestPractices, because for me, i think its quite hard for most developers understand how bitwise works.
But, again, really really clever solution.
Congrats!

My apologies, thank you for your advice!

Please use spoiler flag next time.

🤯

Yes, I did not immediately notice the inaccuracy.
The comment cannot be changed.

Except both 4 and 2 occur odd amount of times, which contradicts the description.

This terrible solution only confuses inexperienced CodeWars members.
Run 4, 4, 4, 2 and watch, or what sLasHee said

There will always be only one integer that appears an odd number of times.

yes! there are many ways if you look for them