Leetcode 231. Power of Two

Determine whether a given 32-bit integer n is a power of two (i.e., n == 2^x for some integer x), returning false for non-positive values. A common O(1) approach uses a bit-manipulation pattern to check this without loops.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early August, 2024

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 231. Power of Two

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact