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

Sdílet
Vložit
  • čas přidán 12. 07. 2020
  • This video is a solution to Leet code 190, Reverse bits. I first give a theoretical explanation and then I go over its Python implementation.
    Comment below if you have a better solution to this problem!
    Let me know if you have any feedback and don't forget to subscribe for more videos!
    Gear used:
    Mic: amzn.to/2Clxx4o
    Drawing pad: amzn.to/2O7PaaU

Komentáře • 10

  • @eustin
    @eustin Před 2 lety

    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!

  • @verryberrypie
    @verryberrypie Před 3 lety +1

    best tutorial here. thank you!

  • @ishayadav5221
    @ishayadav5221 Před 4 lety

    Amazingggg

  • @mallasatyanarayana1942

    Cool

  • @rihhard1072
    @rihhard1072 Před rokem +1

    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 ?

  • @AnuRadha-wk8vn
    @AnuRadha-wk8vn Před 4 lety

    👍🤩

  • @hameedmulani21
    @hameedmulani21 Před rokem +1

    outpur
    same as your pronunciation

    • @MrIloveit11
      @MrIloveit11 Před 11 měsíci

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