Hello coders, In this blog, I’ll give you a solution for another Leetcode problem: the ” Power of Two Leetcode solution “.

Let’s first see the problem statement for the power of two Leetcode problem.

**Problem Statement:**

Given an integer `n`

, return * true if it is a power of two. Otherwise, return false*.

An integer `n`

is a power of two, if there exists an integer `x`

such that `n == 2`

.^{x}

**Example 1:**

Input:n = 1Output:trueExplanation:2^{0}= 1

**Example 2:**

Input:n = 16Output:trueExplanation:2^{4}= 16

**Example 3:**

**Input:** n = 3 **Output:** false Power of Two Leetcode Solution

## Power of Two Leetcode Solution in Java

//Power of Two Leetcode Solution in Java class Solution { public boolean isPowerOfTwo(int n) { if(n<1){ return false; } return ((n&(n-1)) == 0); } } //Power of Two Leetcode Solution in Java

**Disclaimer:** This problem (**Power of Two Leetcode solution**) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.