137. Single Number II | Bit Manipulation

[@n0ame1u1]

If each one was repeated only two times it would be easier, since in that case I believe XORing the entire array together would give you the single number

[@deepcodes]

Yes, absolutely!

[@mrityunjoybarman9098]

you can use ans = ans | (setBits

[@deepcodes]

Yes, good thought!

[@roshangupta8161]

Very well explained

[@deepcodes]

Thanks for liking

[@GuruPrasadShukla]

i did this one before but didnt got any clue of how to do it with constant space now i know

[@sauravchandra10]

Instead of calculating pow every time, we can maintain long long shift and multiply it by 2 each time in the loop. It will save time,ig.

[@deepcodes]

Yeah, we can.

[@md.marufurrahmanremon3095]

Could you please explain why you took ans as long?

[@sarvagyasingh924]

will this work on negative numbers ?

[@adityastar9724]

bhaiya kon sa pen tab use karte ho aap

[@deepcodes]

XENX pen tab