(Remade) Leetcode 190 - Reverse Bits of An Integer | Bits Manipulation

Topic: Bits
Code:
github.com/Nid...
Leetcode:
leetcode.com/p...
Note I claim no rights to this question. All rights belong to Leetcode. If I'm reviewing a solution that was from another Leetcode user or Leetcode itself I will give credit below.
Credit to :
Hey there! Just wanted to let you know that some of the below links in this video description are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own!
Start getting great at system design: bytebytego.com?fpr=nideesh (affiliate link)
Handpicked Algorithms and Data Structures for Interview To Save Time: interviewpen.c... (affiliate link)

[@NideeshTerapalli]

Hey there! Just wanted to let you know that some of the links in this comment are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own! Start getting great at system design: bytebytego.com?fpr=nideesh (affiliate link) Handpicked Algorithms and Data Structures for Interview To Save Time: interviewpen.com/?via=nideesh (affiliate link)

[@NideeshTerapalli]

6:17 should be "|" instead of "||," made a mistake

[@Kai-iq2ps]

Followed. Saw 5 other videos, didn't understand sht. You explained beautifully my friend.

[@rrsonia10]

Thanks for remaking this video :) , very clearly explained!

[@NideeshTerapalli]

Thanks Sonia :)

[@dincerbeken5761]

Your videos are really the best.

[@kushal1]

Thanks. Really well explained! Suggestion - Just be louder. I have to be in super silence to hear you out or on headphones and definitely need subtitles to not miss out on any word. :)

[@NideeshTerapalli]

Hi KVM, thank you for your suggestion. Yes, I started using a different microphone system since this video to record audio.

[@geekystark3208]

fantastic. Please don't stop making more videos. This is the first video of yours that I saw and it was amazing.

[@1aggin_5amurai]

Nice explanation, gave me good insight into how to use bit operations. But why use list as a buffer? You can change bits in resulting number in place using techniques you've described. Example (sloppy): int bits = bytes * G_bitsInByte; // just in case we want to work with 32 and 64 bit integers int result = 0; while( bits > 0 ) { int bit = number & 1; // retreving 1st bit result |= bit >= 1; bits--; } return result;

[@shreyakumari71]

Beautifully explained. No room for doubts. Thank you!

[@trifacheung]

Thanks, man. I just get in touch with this kind of problem. I have understood the concept of this after watching your tutorial

[@NideeshTerapalli]

Thanks Jason

[@carloslazarin]

Great explanation! thx a lot!

[@dhananjaysharma1928]

Great explanation. Just one doubt. The list is completely optional right? I mean we can simply keep adding temp variable to the result within the same loop. The additional storage list is completely optional right? It doesnt change our time complexity but it can affect the space complexity !

[@hurfyd]

correct the list is optional. in one loop we can left shift the temp result variable, set the last bit with the OR operator, then right shift our input - res = res > 1

[@AnkitKumar-tp8hc]

Saw almost 10 videos over internet, but you explained beautifully. ❤️

[@Kai-iq2ps]

Same, this dude good

[@anushree3744]

Well explained. Subscribed. I have one question though. Will the implementation handle the condition stated in note, what if the function is called multiple times?

[@NideeshTerapalli]

Hi Anushree, no this implementation will not handle multiple function calls. For that I would go for something else like a bit mask

[@techbhupi9398]

Please increase the volume

[@sagarakshayan1184]

n will eventually become 0, dont think temp -- required

[@anushkabagchi1247]

thanks for explaining from scratch .. helped allot

[@ANANDJULU]

Thank you for the detailed explanation, got what I was exactly looking for :)

[@abhiramsathiraju6276]

ughhh!!! the accent 🔥🔥

[@theworsttake]

Thank you for the thorough explaination. But please, slap an audio compressor.

[@NideeshTerapalli]

Yeah I got a different mic 🎤 now

[@theworsttake]

@@NideeshTerapalli sick

[@olafo0o797]

Really easy to understand your explanation Thank You

[@biswamohandwari6460]

Just one thing please increase the sound

[@avert_]

Excellent!

[@sagarkumarbala5257]

Thanks man... keep up the good work!

[@hakoHiyo271]

Very nice and clear explanation. Thank you!

[@suawasthi]

Awesome brother

[@NideeshTerapalli]

Thank you

[@tresorbireke]

Thanks for this clear explanation sir

[@NideeshTerapalli]

You're welcome

[@drew982]

Can someone explain this in terms of an assembly program for ARM Cortex-M? I know there are REV commands available, but I'm being asked not to use them.

[@NideeshTerapalli]

Sorry dude assembly language was not my forte at all

[@drew982]

Understandable! Assembly is all over the place anyway. I was hoping to maybe translate some of the concepts in your videos to my application which proved to be more difficult than anticipated. I did like your explanation though. It was well conveyed.

[@vivekgr3001]

Thanks for the great explanation!

[@NideeshTerapalli]

Welcome Vivek

[@maxching2000]

well done, very clear

[@vibekdutta6539]

You are awesome sir! I'd love to be a patreon member!

[@NideeshTerapalli]

Thanks Vivek!

[@emmanueljakaregari16]

How to find a Max of two numbers using ONLY bitwise operator s

[@NideeshTerapalli]

If there is non-private LC question you can ask me

[@shreyachaturvedi9782]

Thank you!! @Nideesh

[@NideeshTerapalli]

Welcome Shreya

[@momchilantonov1419]

nice video! can you pls write with bigger letters on this white board? it will be better and more clear for understanding :)

[@NideeshTerapalli]

Thanks. Yeah sure I will write bigger

[@deepakdas4513]

Nice explanation.

[@NideeshTerapalli]

Thanks bro

[@contentprogramming]

clean job broo i like it 😀

[@NideeshTerapalli]

Thanks man, feel free to give me some feedback on how i can improve

[@NideeshTerapalli]

Ok I will keep that in mind thanks

[@abhinavghosh725]

can someone explain : how 00110 -> 01100 00110 01100 ? shouldnt it be 00110 11001 ? we are reversing the individual bits right?

[@NideeshTerapalli]

No that is called inverting the bits. Reversing means actually turning front to back

[@abhinavghosh725]

​@@NideeshTerapalli o shit!! i understood the question wrong! thnx man

[@abhinavghosh725]

@@NideeshTerapalli i finally understood the solution! good work! brother ,can you suggest some resources to understand bit manipulation from the very basics and gradually to the top! I AM KINDA struggling with this! thank you in advance. and one more thing in the last statement shouldn't it be res=res|l.get(i) rather than res=res||l.get(i)

[@NideeshTerapalli]

@@abhinavghosh725 Yeah, looks like the first 10 slides and short and quick for the basics web.stanford.edu/class/archive/cs/cs107/cs107.1186/lectures/02-bits.pdf Afterward, best advice would be to pick a small textbook with good diagrams. Textbooks will help you learn faster and remember better than watching videos like mine. Why is that? Because textbooks have questions and exercises at the end of the chapter. After all, textbooks are designed to teach dense material in the best way possible

[@abhinavghosh725]

@@NideeshTerapalli thnx man! you are the best! please explain why you did " || " instead of " | " ?

[@jianwenliu458]

So clear

[@maheshdudhanale9953]

Thanks

[@aayushnevatia7]

very poor sound

[@mrprime557]

Nitesh Naineni