Sum of pairwise Hamming Distance InterviewBit Code C++

[@iamnoob7593]

Good Explaination , In LEETCODE it is count0 * count1

[@gauravbanerjee2898]

Thanks a lot ma'am

[@jayeshchaurasiya262]

Love ur explanation ❣️

[@ashishrajanand8021]

Thanks, Very good explanation

[@physicsrox184]

Crisp explanation. Keep up the good work.

[@aneeshakaushal267]

Thanks for the solution!

[@satyamgupta6030]

very nice explaination alisha (I always look for ur videos for leetcode solutions) please keep making them more.

[@sourabhsivare1876]

hey there,thnx for the solution. the last logic which is reducing the T.C. to O(N) was going over my head.

[@sumitsinha995]

first loop is in place of n put 32 you will get the logic

[@cricketsureshlucky]

Mam could you please explain why you have taken *2 i think just count0*count1 is enough. i have watched multiple times but couldn't get it

[@harendrasingh9719]

We have to check pairwise. for in that case (4,2) and (2,4) are different but their humming distance is same so we multiply it by two rather then calculate it again

[@sharathreddy2474]

great work!

[@shreyanshjain4781]

can we xor in place &?

[@shashwatbose6990]

no we can not use xor. As we want to know bit in exact position. For example if we use do and of two numbers let it be 001001101 & 000001000 the the result will be 000001000 but if we use XOR result will be 001000101. as you can see both of them are greater than 0 and we are not able to get any meaningful output from XOR.

[@kdevelopers8218]

thanks