Minimum X (xor) A | GeeksforGeeks Problem of The Day

Просмотров 6 тыс.

% 156

Use coupon ALISHA on any GeeksforGeeks course to get 10% discount:
practice.geeksforgeeks.org/courses
Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/
Check out our other playlists:
Dynamic Programming:
ru-vid.com/group/PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS
Trees:
ru-vid.com/group/PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd
Heaps and Maps:
ru-vid.com/group/PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_out
Arrays and Maths:
ru-vid.com/group/PLLT4EuYB4kIb0G4k2LxdIs2dCaj9vebqC
Bit Manipulation:
ru-vid.com/group/PLLT4EuYB4kIZGBE71Udl0m68uFxRiMhGS
Greedy Algorithms:
ru-vid.com/group/PLLT4EuYB4kIZaOVWhgBnQr9w5JxgHAEld
Sorting and Searching:
ru-vid.com/group/PLLT4EuYB4kIaWgO_-unJeY4huZlP3Uln9
Strings:
ru-vid.com/group/PLLT4EuYB4kIah6F-m0v-zfrQKg1G1zAJC
Linked Lists:
ru-vid.com/group/PLLT4EuYB4kIZp5ApjgO_5K69Jv4GAGUYt
Stack and Queues:
ru-vid.com/group/PLLT4EuYB4kIY2nfXL0sxzHbDHReuMw_sE
Two Pointers:
ru-vid.com/group/PLLT4EuYB4kIbclnecGeKq8vmMdaFYdNyu
Graphs, BFS, DFS:
ru-vid.com/group/PLLT4EuYB4kIb5er32BqvSqnFFxJ0Ciqf7
Backtracking:
ru-vid.com/group/PLLT4EuYB4kIZfNt7M9FMfcJEiE5E8pmFL
Non- DSA playlists:
Probability:
ru-vid.com/group/PLLT4EuYB4kIZWrGlLjATLbuX7CRitUrq6
SQL-Basic Join functions:
ru-vid.com/group/PLLT4EuYB4kIZZxUKWLLufuviTI4jWhSHN
SQL-Basic Aggregate functions:
ru-vid.com/group/PLLT4EuYB4kIa5OBKfvrPRZB6tSVcxhVJN

Опубликовано:

4 июл 2022

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 35

@probabilitycodingisfunis1 2 года назад

int countbetsetinb ; int B = b; while(B) { countbetsetinb+=B%2; B/=2; } int noofbitstosetinx = countbetsetinb; int ans = 0; for(int i=31;i>=0 && noofbitstosetinx;i--) { if(a&(1

@ritvikmadhav4930 2 года назад

Knowing things is different and being able to teach and imprinting it to students mind is different. You are super talented to have both. Glad i found this channel. Thanks Alisha

@probabilitycodingisfunis1 2 года назад

Thank you so much Ritvik, this comment made my day!

@arghyadas2836 10 месяцев назад

Please upload more videos to this playlist. These problems are quite helpful! If possible, please upload some CP type problems which use bit manipulation instead of straightforward DSA questions.

@iamnoob7593 Год назад

Brilliant Explanation , Just wow

@prateekgirilateralentry5865 2 года назад

thankyou😀 so much for the great explanation

@chandanchoudhary349 2 года назад

% it is heavy u can use & to count bit if(n&1) count++ n=n>>1;

@tarunchandravanshi5739 Год назад

completed the playlist in 2 days loved it thanks a lot.

@rameshchandra1812 2 года назад

Hello....today i visited your profile on LinkedIn and then visit your channel...and then I watch this complete video... actually i am a petroleum engineer and 00 in computer science subjects...but after watching this video I thought that CS is very simple....you explained all the things in Amazing way....now know about XOR, how to set bit position and all .. thankyou for explaining all the things in batter way

@probabilitycodingisfunis1 2 года назад

Thank you so much Ramesh, happy to know that you found the concepts simple!!

@galibkiyaadein4627 2 года назад

You are awesome Alisha 🔥...keep going keep shining 🌟😃

@sagarghare9829 Год назад

Hi alisha. I have doubt. Why Xor was not used in code that was explained intuition ?

@piyush2750 2 года назад

Is there any sequence in which one can go though your different playlist for cp ?

@kanavphull9050 2 года назад

Wow! Thank You for the amazing explanation. I find bit manipulation concepts a bit hard to grasp. This video made it super easy. Keep it Up!

@probabilitycodingisfunis1 2 года назад

Thanks Kanav! Glad you found it easy 🤩

@adeshchhajed8473 2 года назад

It was asked in today lc weekly contest. Not able to solve that time But after watching it seems easy Learned many bits concept from this video. Thanks.

@sadiashafaque3517 2 года назад

Thanks alot, beautiful explanation!!!

@Yashkurzekar 2 года назад

will you please make dedicated video on how you calculate bits?

@pushkarraj4640 2 года назад

Always fond of your patient and descriptive explanations Thanks again.

@probabilitycodingisfunis1 2 года назад

Thank you so much Pushkar

@p25_rhythm70 Год назад

very nice explanation

@udaysabbisetty9509 2 года назад

Thankyou so much for the great explanation :)

@abhaydeepsharma5027 2 года назад

Thanks mam ...you explained a very hard problem in very easy way and efforts you to make to explain each and very concept with example is just awsm

@probabilitycodingisfunis1 2 года назад

Thanks Abhaydeep!!

@ghanshyampatil5850 2 года назад

Great Explaination!

@abhaysingh9955 2 года назад

how to improve logic build ..you have to give me a tipes . lot of company are rejected because .i am not solve the code .please help me .you have to provide the material any resource then i build the logic please.give me a replay