Given an integer ‘x’, write a C function that returns true if binary representation of x is palindrome else return false.

For example a numbers with binary representation as 10..01 is palindrome and number with binary representation as 10..00 is not palindrome.

The idea is similar to checking a string is palindrome or not. We start from leftmost and rightmost bits and compare bits one by one. If we find a mismatch, then return false.

**Algorithm:**

isPalindrome(x)

1) Find number of bits in x using sizeof() operator.

2) Initialize left and right positions as 1 and n respectively.

3) Do following while left ‘l’ is smaller than right ‘r’.

..…..a) If bit at position ‘l’ is not same as bit at position ‘r’, then return false.

..…..b) Increment ‘l’ and decrement ‘r’, i.e., do l++ and r–-.

4) If we reach here, it means we didn’t find a mismatching bit.

To find the bit at a given position, we can use the idea similar to this post. The expression “**x & (1 << (k-1))**” gives us non-zero value if bit at k’th position from right is set and gives a zero value if if k’th bit is not set.

Following is C++ implementation of the above algorithm.

`#include<iostream> ` `using` `namespace` `std; ` ` ` `// This function returns true if k'th bit in x is set (or 1). ` `// For example if x (0010) is 2 and k is 2, then it returns true ` `bool` `isKthBitSet(unsigned ` `int` `x, unsigned ` `int` `k) ` `{ ` ` ` `return` `(x & (1 << (k-1)))? ` `true` `: ` `false` `; ` `} ` ` ` `// This function returns true if binary representation of x is ` `// palindrome. For example (1000...001) is paldindrome ` `bool` `isPalindrome(unsigned ` `int` `x) ` `{ ` ` ` `int` `l = 1; ` `// Initialize left position ` ` ` `int` `r = ` `sizeof` `(unsigned ` `int` `)*8; ` `// initialize right position ` ` ` ` ` `// One by one compare bits ` ` ` `while` `(l < r) ` ` ` `{ ` ` ` `if` `(isKthBitSet(x, l) != isKthBitSet(x, r)) ` ` ` `return` `false` `; ` ` ` `l++; r--; ` ` ` `} ` ` ` `return` `true` `; ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `unsigned ` `int` `x = 1<<15 + 1<<16; ` ` ` `cout << isPalindrome(x) << endl; ` ` ` `x = 1<<31 + 1; ` ` ` `cout << isPalindrome(x) << endl; ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

1 1

This article is contributed by **Saurabh Gupta**. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Check if actual binary representation of a number is palindrome
- Find the n-th number whose binary representation is a palindrome
- Check if binary representation of a given number and its complement are anagram
- Binary representation of next number
- Binary representation of a given number
- Next greater number than N with exactly one bit different in binary representation of N
- Largest number with binary representation is m 1's and m-1 0's
- Binary representation of previous number
- Number of leading zeros in binary representation of a given number
- Prime Number of Set Bits in Binary Representation | Set 2
- Prime Number of Set Bits in Binary Representation | Set 1
- Find consecutive 1s of length >= n in binary representation of a number
- Number of mismatching bits in the binary representation of two integers
- Sum of decimal equivalent of all possible pairs of Binary representation of a Number
- Length of longest consecutive zeroes in the binary representation of a number.