Optimize to O(1) Time | Dataford Interview Questions

Solve an algorithm problem with an emphasis on achieving an O(1) solution. Implement a function that determines whether a non-negative integer is a power of two without loops, recursion, logarithms, or string conversion. The input is a 64-bit non-negative integer, and the function must return a Boolean. Use the standard fixed-width integer model, so bitwise operations are treated as constant time.

Constraints

0 <= n <= 2^64 - 1
The input is represented as a fixed-width non-negative integer
Loops, recursion, logarithms, and string conversion are not allowed
The target complexity is O(1) time and O(1) auxiliary space

Function Signature

def is_power_of_two(n):

Your question is Optimize to O(1) Time. 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

Constraints

0 <= n <= 2^64 - 1
The input is represented as a fixed-width non-negative integer
Loops, recursion, logarithms, and string conversion are not allowed
The target complexity is O(1) time and O(1) auxiliary space

Function Signature

def is_power_of_two(n):

Your question is Optimize to O(1) Time. 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.