Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Check if the binary representation of a number is palindrome or not.

**Example 1:**

Input:N = 17Output:1Explanation:(17)_{10 }= (10001)_{2}Which is pallindrome hence output is 1.

**Example 2:**

**Input:**
N = 16
**Output:**
0
**Explanation:**
(17)_{10 }= (10000)_{2}
Which is not pallindrome
hence output is 0.

**Your Task:**

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)

**Constraints:**

1 <= N <= 10^{18}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Palindrome numbers

...