Check if the binary representation of a number is palindrome or not.
Input: N = 17 Output: 1 Explanation: (17)10 = (10001)2 Which is pallindrome hence output is 1.
Input: N = 16 Output: 0 Explanation: (17)10 = (10000)2 Which is not pallindrome hence output is 0.
You don't need to read input or print anything. Your task is to complete the function isPallindrome() which takes an integer N as input parameters and returns 1 if the binary equivalent of N is a palindrome.
Expected Time Complexity: O(log N)
Expected Space Complexity: O(logN)
1 <= N <= 1018
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.