Problem
Ask
Submissions

Problem: Power of Two

Medium
30 min
Discover how to identify whether an integer is a power of two by leveraging bitwise operations. This lesson guides you through the problem constraints and logic, helping you implement an efficient solution to a frequent coding interview question.

Statement

An integer n is considered a power of two if it can be expressed as n ==2x==2^x, where xx is an integer.

Determine whether a given integer n is a power of two. If it is, then return TRUE; otherwise, return FALSE.

Constraints:

  • 231-2^{31} \leq n 2311\leq 2^{31} - 1

Problem
Ask
Submissions

Problem: Power of Two

Medium
30 min
Discover how to identify whether an integer is a power of two by leveraging bitwise operations. This lesson guides you through the problem constraints and logic, helping you implement an efficient solution to a frequent coding interview question.

Statement

An integer n is considered a power of two if it can be expressed as n ==2x==2^x, where xx is an integer.

Determine whether a given integer n is a power of two. If it is, then return TRUE; otherwise, return FALSE.

Constraints:

  • 231-2^{31} \leq n 2311\leq 2^{31} - 1