Reverse bits | Leet code 190| Theory explained + Python code | July leet code

[@verryberrypie]

best tutorial here. thank you!

[@saianishmalla2646]

Thank you!!

[@eustin]

I watched a few videos on the bit shifting solution to this question and yours was the best. your explanation was very clear. thank you!

[@kks5475]

you explain very well but i think it can be more optimise- def reverseBits(self, n: int) -> int: result=0 for i in range(32): result = result >i)&1 return result

[@rihhard1072]

Im confused why we dont just convert the integer to a string, reverse slice it and then convert back to int. What am I missing ?

[@shreehari2589]

Interviewers won’t accept that solution

[@saleheen1]

It's not only about solving a problem. The interviewers want to see how smart you are. In this problem they will want to see if you can solve the problem using bit operators. That's why

[@ishayadav5221]

Amazingggg

[@AnuRadha-wk8vn]

👍🤩

[@mallasatyanarayana1942]

Cool

[@hameedmulani21]

outpur same as your pronunciation

[@MrIloveit11]

it doesn't matter at all, this Reverse bits video is the best so far on youtube.