Power of Four LeetCode Solution

Problem – Power of Four

Given an integer n, return true if it is a power of four. Otherwise, return false.

An integer n is a power of four, if there exists an integer x such that n == 4x.

Example 1:

Input: n = 16
Output: true

Example 2:

Input: n = 5
Output: false

Example 3:

Input: n = 1
Output: true

Constraints:

• -231 <= n <= 231 - 1

Follow up: Could you solve it without loops/recursion?

Power of Four LeetCode Solution in Java

    public boolean isPowerOfFour(int num) {
        return num > 0 && (num&(num-1)) == 0 && (num & 0x55555555) != 0;
        //0x55555555 is to get rid of those power of 2 but not power of 4
        //so that the single 1 bit always appears at the odd position 
    }

Power of Four LeetCode Solution in C++

bool isPowerOfFour(int num) {
    return num > 0 && (num & (num - 1)) == 0 && (num - 1) % 3 == 0;
}

Power of Four LeetCode Solution in Python

def isPowerOfFour(self, num):
        return num != 0 and num &(num-1) == 0 and num & 1431655765== num

Power of Four LeetCode Solution Review:

In our experience, we suggest you solve this Power of Four LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Power of Four LeetCode Solution

Find on LeetCode

Conclusion:

I hope this Power of Four LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions