L3. Minimum Bit Flips to Convert Number | Bit Manipulation

[@faizanalam8823]

Easy pisy❤😅 Int num = (start xor goal) Int cnt = 0; while(num) { num &= (num - 1) ; cnt++; } return cnt;

[@ashurajput6916]

int differ = start^end; return __builtin_popcount(differ); ; )

[@ThePROestRedn99]

​@@ashurajput6916😂😂 op

[@Shantisingh-tz5sr]

int bitmask=(1

[@aswin6261]

Most anticipated one❤

[@i8you]

long awaited video finally ❤

[@rahulsangvikar7973]

I think it would have been much better to use n&(n-1) to count set bits, because if we're doing this, this is no different than doing count += (start&(1

[@theangaarbatchbynamansharm2622]

Code readibility😢

[@yunik_developer]

Yup

[@CodewithAnuragBassu]

keep it up bhaiya and thanku so much🙏🙏🙏🙏

[@diyatoliya9067]

int minBitFlips(int start, int goal) { int count=0; while(start!=goal){ if(start%2 != goal%2){ count++; } start=start>>1; goal=goal>>1; } return count; }

[@sumitdon2004]

std::string num2Bin(int n) { if (n == 0) return "0"; std::string res = ""; while (n > 0) { res += (n % 2 == 1) ? '1' : '0'; n = n / 2; } std::reverse(res.begin(), res.end()); return res; } class Solution { public: int minBitFlips(int start, int goal) { string x = num2Bin(start); string y = num2Bin(goal); while (x.length() < y.length()) x = '0' + x; while (y.length() < x.length()) y = '0' + y; int g = x.length(); int cnt = 0; for (int i = 0; i < g; i++) { if (x[i] != y[i]) { cnt++; } } return cnt; } };

[@ansariaburehan263]

Love it. THank you sir.

[@rohitchakraborty4619]

Well I used a bit of different approach and just compared the bits linearly class Solution { public: int minBitFlips(int start, int goal) { int a = start; int b = goal; int ct=0; while(a>0 || b>0){ if((a&1)!=(b&1)) ct++; a=a>>1; b=b>>1; } return ct; } }; not so creative but still works. Have a good day!!

[@HaamroNotes]

i also did the same bro

[@shubhrajit2117]

Same pinch! But why did u create new variables a and b?

[@rohitchakraborty4619]

@@shubhrajit2117 actually striver once said never mess with the original variables just a good practice of mine

[@HarshKumar-mx9nj]

​@@shubhrajit2117 its good practice to not alter the data given as the test case

[@codesetter2497]

I also done same

[@DeadPoolx1712]

UNDERSTOOD;

[@UECAshutoshKumar]

Thank you 😊

[@ANKAMJANAKIRAM]

The way striver blushes when calling *" 13 "*.... May it's our bhabhi favourite 😅

[@pratyushtripathi1728]

Understood++++ 😁

[@shahidullahmuffakir668]

done and dusted😃❤

[@spartannng]

int minBitFlips(int start, int goal) { int n=start^goal; int cnt=0; while(n>0){ if((n&1)==1) cnt++; n=n>>1; } return cnt; }

[@dayashankarlakhotia4943]

public int minimumBitFlip(int start,int goal){ int val=start^goal,cnt=0; while(val>0){ val&=val-1; cnt++; } return cnt;

[@riteshbisht94]

Make more lectures 🙏🥺

[@bthulasikrishna9597]

Python one liner return bin(start^goal)[2:].count('1')

[@ishwarreddy8820]

Very helpful .

[@aviralgoel5709]

class Solution { public: int numOfBits(int n) { int result = 0; for(int i = 0; i < 32; i++) { result += (n >> i) & 1; } return result; } int minBitFlips(int start, int goal) { int y = (start ^ goal); return numOfBits(y); } };

[@SibiRanganathL]

Understood🤗🤗🤗🤗

[@DeepakPatel-d5v]

Thanks a lot Bhaiya

[@khalasianiket816]

understood ❤

[@navinchaudhary2812]

understood

[@vishnupandey3390]

here is the python3 solution for this problem num1=int(input("Enter number : ")) num2=int(input("Enter Desired number : ")) diff=num1^num2 ans=0 while diff: diff=diff&(diff-1) ans+=1 print("You need",ans,"bit flips to convert",num1,"to",num2)

[@bthulasikrishna9597]

print(bin(start^goal)[2:].count('1'))

[@pratulyapratap9329]

God 🙏

[@khyatikakkar9259]

C++ one liner class Solution { public: int minBitFlips(int start, int goal) { return __builtin_popcount(start^goal); } };

[@Learnprogramming-q7f]

thank you Bhaiya

[@hakunamatata-nl4js]

Thank you

[@shashankgsharma0901]

Understood!

[@shikher4559]

great!

[@animeshkumar2683]

Understood

[@vkgaming3316]

One line solution would be return __builtin_popcount(start^goal); 😅

[@manyachandra3566]

but if start is 1 0 10 xor with 0 1 1 1 then ans is 1101 as written by striver but 1 and 0 cant give 1 na after fliiping it should be 0 as per start

[@rohanyadav101]

while (number > 0) { bit += (number & 1); number >>= 1; }

[@Bob_Celestine]

❤❤❤❤❤❤❤❤❤

[@eshuthakur2982]

Can someone plz tell where to get this code

[@tamannaverma4178]

🙌

[@anshsaxena7297]

UnderStood

[@adityapandey23]

Understood

[@saurabhdwivedi2831]

int minBitFlips(int start, int goal) { int ans = start ^ goal; int cnt = 0; while(ans != 0){ ans = ans & (ans -1); cnt = cnt +1; } return cnt; }

[@chiragbansod8252]

understood

[@SitaRam-m1i]

Understood

[@pranavmisra5870]

understood

[@hardikpatel352]

understood

[@shaiksoofi3741]

understood