Algorithms: Bit Manipulation

Learn about bit manipulation. This video is a part of HackerRank's Cracking The Coding Interview Tutorial with Gayle Laakmann McDowell.

[griffintoal]

still a little 'bit' lost ;)))

[FWTteam]

It's all the bits and pieces into one video, represented very interestingly. Thank you!

[dorondavid]

Great video, but the masking section was done too quickly... You needed a bit more in depth examples for each type.

[simplelife]

I came to youtube understand bit manipulation after reading first chapter of your book.... And boom I have the author explaining me herself... Thank you soo much Gayle😀

[RagingWhoremoans]

I'm still trying to compute all of this information. It's a bit overwhelming.

[quirkyquester]

the best video talks about bit operation i've ever found! Thank you so much!

[rydmerlin]

It has to be said Gayle is a superwoman. Looking at what she was wearing it appears as though she did this series of videos in the same day and that’s just amazing to me that she can offer this instruction like that.

[laurenortiz]

This REALLY helped clarify the shifting and mask business for me. Thanks!

[shankar]

After watching several videos of others, I finally landed on the right one, which is precisely what I was looking for. Thanks a lot.

[HackerUC]

I got a little lost at 7:23 when she starts talking about shifting the number to the left by i spots

[JackWootton]

If anyone tries this in Python, be careful because shifting 1 "i times" will not provide the correct bit mask for the "i th" bit: 1<<1 is 2 (or 0b0010 in binary). And 1<<2 is 4 (0b0100). And 1<<3 is 8 (0b1000). Staying with these examples, shifting by 1 provides a bit mask for the 2rd bit. Shifting by 2 provides a bit mask for the 3rd bit. Shifting by 3 provides a mask for the 4th bit. This is because by starting with 1, a bit has already been shifted once (into the first bit). In other words, we start with a bit mask for finding the first bit.

[zongweifan]

you helped me get much more clear with the bit manipulation things, thanks!

[MonjurulIslamKhan]

For 2's complement, you don't have to do that much work. Just keep same all the bits till you encounter first 1 from right to left. After first 1 complement each bit. For example, 010100 -> xxx100 ->101100. :D

[mj-svep]

At 2:45, she says "So let's think about this. What number would we have to add to 00 100 10 to get 1 000 000 0." I know about 2s complement, but I donot get why we need to get 1 000 000 0?

[SoyJayP]

Excellent video. It feels good to finally understand something about Bit Manipulation

[snlgrg]

explanation of concept is very good but only one thing is missing i.e some real world problem, just introduce some real world problem without solution, You can post solution in some other video.. ;)

[ledzeppelin]

1. convert 123 to binary. 2 Invert bits, and then add 1. Why do we add one? 4:22

[DarkSpydaIV]

Very wordy and much technical jargon. Hard to follow for someone new to the topic.
The curse of knowledge means that the more you know, the easier it is to talk like an expert and
alienate non-experts. The way to explain this bit manipulation information to beginners is to keep it in very simple wording.
Such is understanding your audience and who is receiving the information. If that audience is people who are new to the topic, they will be lost in translation.

[emilyhuang]

8:19 for big picture of getting, setting, and clearing

[sakshamjain]

you guys provide a great explanation, but I still think you need to go a little slower so the people can understand it much better and please try to explain videos in depth a little bit ;)