3.4. Check whether number is pow of 2 | Data Structures and Algorithm | Python

In this video, we solved a problem of Bit Manipulation.
Checking whether given number is power of 2 or not...
Using
- A Naïve Method
- Using Brain Kernighan's Algorithm
- Counting Set Bits
- Log with ceil and floor

Time Stamp:
🕒 00:00 : Outro
🕒 00:12 : Problem Statement
🕒 01:29 : Method - I: Naïve Solution
🕒 01:55 : Method - II: Brian Kernighan's Method
🕒 05:39 : Method - III: Bit Shift
🕒 07:34 : Method - IV: Log with ceil() and floor()
🕒 09:58 : Outro

Do Like and Share the video, and Subscribe to the Channel...