Search
⌘K

Leetcode 342. Power of Four

Determine whether a given integer n is a power of four (n == 4^x for some integer x). The key is an O(1) check using number properties (n>0, exactly one set bit like a power of two, and that bit lies in an even position) to avoid loops/recursion.


Question Timeline

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

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