Different Bits Sum Pairwise | InterviewBit Solution | Algorithm Explanation by alGOds!!

[@alGOds99]

Join this telegram channel for regular updates : t.me/alGOdsKZbin Join this telegram channel for doubts and discussions : t.me/joinchat/PqjeMhz0MBR-tg31OK2Dsg

[@Venkatesh54629]

Very good explanation, you are awesome bro

[@aniketsriwastva6345]

Nice explaination

[@alGOds99]

Thanks!! Do share our channel among your friends and college mates if you found our content useful😊

[@PaAGadirajuSanjayVarma]

Thank you so much

[@alGOds99]

Thanks!!! Do share our channel among your friends and college mates😊

[@nigampratap2466]

every google ques is amazing

[@VinothiniAnabayan]

good explanation,. thank you so much.

[@RaviKiran_Me]

shouldn't the equation for bit be, bit = (Aj >> 1) % 2 instead of just (Aj >> 1) ??

[@VinothiniAnabayan]

yeah.

[@SURAJSINGH-sq4no]

or bit = (Aj >> i)&1

[@deepikadhamija4548]

I don't understand why we are taking mod value 10^9 + 7? plz explain

[@alGOds99]

Hi Deepika! It's specified in the question to return the count taking modulo by 10^9 + 7

[@rishisharma5249]

it is a prime number which is nearer to constraint