Google Coding Interview Question - Bit Manipulation - Different Bits sum pairwise

  Рет қаралды 15,286

SCALER

SCALER

Күн бұрын

Пікірлер: 36
@dpxy1599
@dpxy1599 2 жыл бұрын
Excellent question
@smrutiranjan3623
@smrutiranjan3623 3 жыл бұрын
Very nice explanation
@SCALER
@SCALER 3 жыл бұрын
Thanks for your kind words Smruti :)
@saicharan-dn3jz
@saicharan-dn3jz 3 жыл бұрын
Super Clean And Neat, Good Explaination!
@hackytech7494
@hackytech7494 3 жыл бұрын
Thanks. Nice explanation. But i didn't understood that why we are iterating for 32 times in outer loop. Can anyone explain me please
@JaideepKumarSingh14
@JaideepKumarSingh14 3 жыл бұрын
Because there are 32 bits in a number
@bhopalsingh4102
@bhopalsingh4102 4 жыл бұрын
I think we should take modulus at the time of adding itself. i.e. in this statement "ans+=2*count*(A.size()-count);" otherwise it may give wrong answer...
@SohanonYoutification
@SohanonYoutification 4 жыл бұрын
ans is long long int datatype which is 64 bits so not needed to do that.
@harishkandikatla9791
@harishkandikatla9791 4 жыл бұрын
Excellent explanation! Keep on posting these kinds of videos!!
@adityasingh7288
@adityasingh7288 3 жыл бұрын
the plane took off
@KD-xi9wu
@KD-xi9wu 3 жыл бұрын
How (A.size()-count ) give count of number of zeros????
@PrathamGupta2408
@PrathamGupta2408 4 жыл бұрын
Nice explanation Paridhi 👌
@shourabhpayal1198
@shourabhpayal1198 3 жыл бұрын
good vid. Pace can be improved plus example could have been explained more clearly and faster.
@Sampathgayani
@Sampathgayani 3 жыл бұрын
I think this is important.... This pseudo-code is written using C++ .... Not java... if you don't know the differences, you may get confused. It would be helpful if Paridhi mentioned this. Also if she elaborated the pseudo-code a little more how it matches the previous explanation. Maybe she thought certain things are obvious... :) but still, we are not there :D @Paridhi.... Thank you so much... great work!
@korleonedon8381
@korleonedon8381 4 жыл бұрын
Your voice is sweet
@AradhyaMudgal
@AradhyaMudgal 4 жыл бұрын
Awwwww
@sonumahto1364
@sonumahto1364 4 жыл бұрын
Thank u so much.
@balaganesh_spk
@balaganesh_spk 4 жыл бұрын
Why MOD is required at end and why mod with 10000007??
@NamrataBilurkar
@NamrataBilurkar 3 жыл бұрын
That is asked in the question
@shivanktripathi4661
@shivanktripathi4661 3 жыл бұрын
The first test case is wrong for 2,7 the answer should be 4 because f(2,7) + f(7,2) = 4
@TheDarkaqua
@TheDarkaqua 4 жыл бұрын
so for the given question i.e [1,3,5] is the answer 8 or 16? correct me if i'm wrong!
@TheDarkaqua
@TheDarkaqua 4 жыл бұрын
I wrote the code, the ans comes out to be 8.
@sibanshpal8536
@sibanshpal8536 4 жыл бұрын
ans is 4*2 = 8
@Sampathgayani
@Sampathgayani 3 жыл бұрын
It is asking for the diff bits... not the equal bits... I made the same mistake and realized it later :)
@dhanorammardi646
@dhanorammardi646 4 жыл бұрын
In 10.58, instead of left shifted it is right shifted.
@ankitgoyal8556
@ankitgoyal8556 4 жыл бұрын
Loved it, thank you I feel like the sound is bit low.
@SHASHANKRUSTAGII
@SHASHANKRUSTAGII 2 жыл бұрын
handwriting
@salmankhatik4985
@salmankhatik4985 2 жыл бұрын
too confusing
@shrutisharma9297
@shrutisharma9297 4 жыл бұрын
why is f(5, 1) different from f(1, 5)?
@adityakrishna11
@adityakrishna11 4 жыл бұрын
its not
@ayushgarg5929
@ayushgarg5929 4 жыл бұрын
Very long video...it could be easily explained in 5 minutes
@ashutoshbisht8563
@ashutoshbisht8563 4 жыл бұрын
your low voice is totally irritating .so please mam make your voice loud
@gunahawk6893
@gunahawk6893 Жыл бұрын
dude stfu
@sibanshpal8536
@sibanshpal8536 4 жыл бұрын
Great explanation..
@dushyantsingh2624
@dushyantsingh2624 4 жыл бұрын
Thanks a lot
Coding interview question - Next Permutation - Arrays
7:30
Top 7 Algorithms for Coding Interviews Explained SIMPLY
21:22
Codebagel
Рет қаралды 454 М.
How Strong Is Tape?
00:24
Stokes Twins
Рет қаралды 14 МЛН
Why no RONALDO?! 🤔⚽️
00:28
Celine Dept
Рет қаралды 120 МЛН
Sum of pairwise Hamming Distance InterviewBit Code C++
10:03
Code with Alisha
Рет қаралды 5 М.
Bitwise Operators and WHY we use them
8:41
Alex Hyett
Рет қаралды 93 М.
Algorithms Explained for Beginners - How I Wish I Was Taught
17:38
Internet Made Coder
Рет қаралды 374 М.
Does Google’s new quantum computer prove the multiverse exists?
23:57
❌ Don't Run Behind 500 LEETCODE Problems ❌ Focus on QPCD
8:31
Google Coding Interview With A Facebook Software Engineer
49:59
Clément Mihailescu
Рет қаралды 948 М.
Fast Inverse Square Root - A Quake III Algorithm
20:08
Nemean
Рет қаралды 5 МЛН
Binary Search : Median of two sorted arrays of different sizes.
24:48
Tushar Roy - Coding Made Simple
Рет қаралды 550 М.