Power of Two Using Bitwise

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Power of Two Using Bitwise. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

Bosch IoT Suite components may use powers of two when configuring buffer sizes, alignment values, or capacity limits. Given an integer n, determine whether it is an exact power of two using binary representation and bitwise operations.

Return True if there exists an integer k >= 0 such that n = 2^k; otherwise, return False. The value 1 is a power of two because 1 = 2^0. Non-positive values are not powers of two.

Formal Specification

Implement is_power_of_two(n), which accepts an integer and returns a boolean. Prefer an O(1) time and O(1) space bitwise solution.

Constraints

-2^31 <= n <= 2^31 - 1
The input is an integer.
Return a boolean result.
Use bitwise operations for the primary solution.
Use O(1) additional space.

Function Signature

def is_power_of_two(n):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output