Power-of-Two Check with Bit Trick | Dataford Interview Questions

Write a program to find whether a number is a power of two (interviewer wanted a complement-based bit trick).

Asked in the Technical Round 2 stage. Implement is_power_of_two(n), which accepts an integer and returns True if n is a positive power of two, otherwise False. Use constant extra space and demonstrate the bitwise approach.

Constraints

-2^31 <= n <= 2^31 - 1
Return True only for positive powers of two
Use O(1) extra space

Function Signature

def is_power_of_two(n):

Your question is Power-of-Two Check with Bit Trick. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a program to find whether a number is a power of two (interviewer wanted a complement-based bit trick).

Constraints

-2^31 <= n <= 2^31 - 1
Return True only for positive powers of two
Use O(1) extra space

Function Signature

def is_power_of_two(n):

Your question is Power-of-Two Check with Bit Trick. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.