Check if actual binary representation of a number is palindrome - GeeksforGeeks (2024)

Table of Contents
C++ Java Python3 C# PHP Javascript Please Login to comment... Similar Reads Thank You! What kind of Experience do you want to share?

Skip to content

Check if actual binary representation of a number is palindrome - GeeksforGeeks (1)

Last Updated : 01 Aug, 2022

Summarize

Comments

Improve

Suggest changes

Like Article

Like

Save

Report

Recommended Problem

Given a non-negative integer n. The problem is to check if binary representation of n is palindrome or not. Note that the actual binary representation of the number is being considered for palindrome checking, no leading 0’s are being considered.

Examples :

Input : 9Output : Yes(9)10 = (1001)2Input : 10Output : No(10)10 = (1010)2

Approach: Following are the steps:

  1. Get the number obtained by reversing the bits in the binary representation of n. Refer this post. Let it be rev.
  2. If n == rev, then print “Yes” else “No”.

Implementation:

C++

// C++ implementation to check whether binary

// representation of a number is palindrome or not

#include <bits/stdc++.h>

using namespace std;

// function to reverse bits of a number

unsigned int reverseBits(unsigned int n)

{

unsigned int rev = 0;

// traversing bits of 'n' from the right

while (n > 0) {

// bitwise left shift 'rev' by 1

rev <<= 1;

// if current bit is '1'

if (n & 1 == 1)

rev ^= 1;

// bitwise right shift 'n' by 1

n >>= 1;

}

// required number

return rev;

}

// function to check whether binary representation

// of a number is palindrome or not

bool isPalindrome(unsigned int n)

{

// get the number by reversing bits in the

// binary representation of 'n'

unsigned int rev = reverseBits(n);

return (n == rev);

}

// Driver program to test above

int main()

{

unsigned int n = 9;

if (isPalindrome(n))

cout << "Yes";

else

cout << "No";

return 0;

}

 
Java
 
// Java code to check whether 
// binary representation of a 
// number is palindrome or not
import java.util.*;
import java.lang.*;
public class GfG
{
See Also
Coding problem on digit anagramCheck if Binary representation is Palindrome in Python - GeeksforGeeksPython Program to Check if Two Strings are Anagram - GeeksforGeeksCheck if two Integer are anagrams of each other - GeeksforGeeks
// function to reverse bits of a number
public static long reverseBits(long n)
{
long rev = 0;
// traversing bits of 'n' 
// from the right
while (n > 0) 
{
// bitwise left shift 'rev' by 1
rev <<= 1;
// if current bit is '1'
if ((n & 1) == 1)
rev ^= 1;
// bitwise right shift 'n' by 1
n >>= 1;
}
// required number
return rev;
}
// function to check a number
// is palindrome or not
public static boolean isPalindrome(long n)
{
// get the number by reversing
// bits in the binary
// representation of 'n'
long rev = reverseBits(n);
return (n == rev);
}
// Driver function 
public static void main(String argc[])
{
long n = 9;
if (isPalindrome(n))
System.out.println("Yes");
else
System.out.println("No");
}
}
// This code is contributed by Sagar Shukla 
 
 
Python3
 
# Python 3 implementation to check 
# whether binary representation of
# a number is palindrome or not
# function to reverse bits of a number
def reverseBits(n) :
rev = 0
# traversing bits of 'n' from the right
while (n > 0) :
# bitwise left shift 'rev' by 1
rev = rev << 1
# if current bit is '1'
if (n & 1 == 1) :
rev = rev ^ 1
# bitwise right shift 'n' by 1
n = n >> 1
# required number
return rev
# function to check whether binary
# representation of a number is
# palindrome or not
def isPalindrome(n) :
# get the number by reversing 
# bits in the binary
# representation of 'n'
rev = reverseBits(n)
return (n == rev)
# Driver program to test above
n = 9
if (isPalindrome(n)) :
print("Yes")
else :
print("No")
# This code is contributed by Nikita Tiwari.
 
 
C#
 
// C# code to check whether 
// binary representation of a 
// number is palindrome or not
using System;
public class GfG
{
// function to reverse bits of a number
public static long reverseBits(long n)
{
long rev = 0;
// traversing bits of 'n' 
// from the right
while (n > 0) 
{
// bitwise left shift 'rev' by 1
rev <<= 1;
// if current bit is '1'
if ((n & 1) == 1)
rev ^= 1;
// bitwise right shift 'n' by 1
n >>= 1;
}
// required number
return rev;
}
// function to check a number
// is palindrome or not
public static bool isPalindrome(long n)
{
// get the number by reversing
// bits in the binary
// representation of 'n'
long rev = reverseBits(n);
return (n == rev);
}
// Driver function 
public static void Main()
{
long n = 9;
if (isPalindrome(n))
Console.WriteLine("Yes");
else
Console.WriteLine("No");
}
}
// This code is contributed by vt_m
 
 
PHP
 
<?php
// PHP implementation to check 
// whether binary representation 
// of a number is palindrome or not
// function to reverse bits of a number
function reverseBits($n)
{
$rev = 0;
// traversing bits of 'n' 
// from the right
while ($n > 0) 
{
// bitwise left shift 'rev' by 1
$rev <<= 1;
// if current bit is '1'
if ($n & 1 == 1)
$rev ^= 1;
// bitwise right shift 'n' by 1
$n >>= 1;
}
// required number
return $rev;
}
// function to check whether 
// binary representation of a
// number is palindrome or not
function isPalindrome($n)
{
// get the number by reversing 
// bits in the binary representation 
// of 'n'
$rev = reverseBits($n);
return ($n == $rev);
}
// Driver code
$n = 9;
if (isPalindrome($n))
echo "Yes";
else
echo "No";
return 0;
// This code is contributed by mits 
?>
See Also
Python Dictionary | Check if binary representations of two numbers are anagram - GeeksforGeeks
 
 
Javascript
 
<script>
// JavaScript program to check whether 
// binary representation of a 
// number is palindrome or not
// function to reverse bits of a number
function reverseBits(n)
{
let rev = 0;
// traversing bits of 'n' 
// from the right
while (n > 0) 
{
// bitwise left shift 'rev' by 1
rev <<= 1;
// if current bit is '1'
if ((n & 1) == 1)
rev ^= 1;
// bitwise right shift 'n' by 1
n >>= 1;
}
// required number
return rev;
}
// function to check a number
// is palindrome or not
function isPalindrome(n)
{
// get the number by reversing
// bits in the binary
// representation of 'n'
let rev = reverseBits(n);
return (n == rev);
}
// Driver code
let n = 9;
if (isPalindrome(n))
document.write("Yes");
else
document.write("No");
</script>
 
 
Output
Yes
Time Complexity: O(num), where num is the number of bits in the binary representation of n.
Auxiliary Space: O(1).

 
 
 
   
 
 
 
 
 
 
Please Login to comment...
 
 
 
 
 
 
 
 
 
Similar Reads
 
  
 
Check if binary representation of a number is palindrome
 
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
 
 
 15 min read 
   
 
Find the n-th number whose binary representation is a palindrome
 
Find the nth number whose binary representation is a palindrome. Do not consider the leading zeros, while considering the binary representation. Consider the 1st number whose binary representation is a palindrome as 1, instead of 0 Examples: Input : 1Output : 11st Number whose binary representation is palindrome is 1 (1)Input : 9Output : 279th Nu
 
 
 15+ min read 
   
 
Reverse actual bits of the given number
 
Given a non-negative integer n. The problem is to reverse the bits of n and print the number obtained after reversing the bits. Note that the actual binary representation of the number is being considered for reversing the bits, no leadings 0's are being considered.Examples : Input : 11Output : 13Explanation: (11)10 = (1011)2.After reversing the bi
 
 
 15+ min read 
   
 
Invert actual bits of a number
 
Given a non-negative integer n. The problem is to invert the bits of n and print the number obtained after inverting the bits. Note that the actual binary representation of the number is being considered for inverting the bits, no leading 0’s are being considered. Examples: Input : 11Output : 4(11)10 = (1011)[2]After inverting the bits, we get:(010
 
 
 13 min read 
   
 
Check if the binary representation of a number has equal number of 0s and 1s in blocks
 
Given an integer N, the task is to check if its equivalent binary number has an equal frequency of consecutive blocks of 0 and 1. Note that 0 and a number with all 1s are not considered to have a number of blocks of 0s and 1s. Examples: Input: N = 5 Output: Yes Equivalent binary number of 5 is 101. The first block is of 1 with length 1, the second
 
 
 10 min read 
   
 
Check if given number contains only “01” and “10” as substring in its binary representation
 
Given a number N, the task is to check if the binary representation of the number N has only "01" and "10" as a substring or not. If found to be true, then print "Yes". Otherwise, print "No".Examples: Input: N = 5 Output: Yes Explanation: (5)10 is (101)2 which contains only "01" and "10" as substring.Input: N = 11 Output: No Explanation: (11)10 is
 
 
 6 min read 
   
 
Check if binary representation of a given number and its complement are anagram
 
Given a positive number you need to check whether it's complement and the number are anagrams or not.Examples: Input : a = 4294967295 Output : Yes Binary representation of 'a' and it's complement are anagrams of each other Input : a = 4 Output : No Simple Approach: In this approach calculation of the complement of the number is allowed.1. Find bina
 
 
 9 min read 
   
 
Number of leading zeros in binary representation of a given number
 
Given a positive integer N, the task is to find the number of leading zeros in its binary representation.A leading zero is any 0 digit that comes before the first nonzero digit in a number's binary form. Examples: Input : N = 16Output : 27Explanation: As Binary(16) = (00000000000000000000000000010000) Input : N = 33Output : 26Explanation: As Binary
 
 
 10 min read 
   
 
Count number of trailing zeros in Binary representation of a number using Bitset
 
Given a number. The task is to count the number of Trailing Zero in Binary representation of a number using bitset. Examples: Input : N = 16Output : 4Binary representation of N is 10000. Therefore,number of zeroes at the end is 4.Input : N = 8Output : 3Recommended: Please try your approach on {IDE} first, before moving on to the solution.Approach:
 
 
 5 min read 
   
 
Binary representation of next greater number with same number of 1's and 0's
 
Given a binary input that represents binary representation of positive number n, find binary representation of smallest number greater than n with same number of 1's and 0's as in binary representation of n. If no such number can be formed, print "no greater number".The binary input may be and may not fit even in unsigned long long int. Examples: I
 
 
 12 min read 
   
 
Find the occurrence of the given binary pattern in the binary representation of the array elements
 
Given an array arr[] of N positive integers and a string patt which consists of characters from the set {0, 1}, the task is to find the count occurrence of patt in the binary representation of every integer from the given array. Examples: Input: arr[] = {5, 106, 7, 8}, patt = "10" Output: 1 3 0 1 binary(5) = 101 -&gt; occurrence(10) = 1 binary(106)
 
 
 9 min read 
   
 
Check if Nodes in Top view of a Binary Tree forms a Palindrome Number or not
 
Given a binary tree consisting of N nodes, the task is to check if the nodes in the top view of a Binary Tree forms a palindrome number or not. If found to be a palindrome, then print "Yes". Otherwise, print "No". Examples: Input: 5 / \ 3 3 / \ \ 6 2 6Output: YesExplanation:Nodes in the top view are {6, 3, 5, 3, 6}. Hence, the generated number ( =
 
 
 10 min read 
   
 
Check if all the set bits of the binary representation of N are at least K places away
 
Given numbers N and K, The task is to check if all the set bits of the binary representation of N are at least K places away. Examples: Input: N = 5, K = 1 Output: YES Explanation: Binary of 5 is 101. The 1's are 1 place far from each other. Input: N = 10, K = 2 Output: NO Explanation: Binary of 10 is 1010. The 1's are not at least 2 places far fro
 
 
 6 min read 
   
 
Check if decimal representation of Binary String is divisible by 9 or not
 
Given a binary string S of length N, the task is to check if the decimal representation of the binary string is divisible by 9 or not. Examples: Input: S = 1010001Output:YesExplanation: The decimal representation of the binary string S is 81, which is divisible by 9. Therefore, the required output is Yes. Input: S = 1010011Output: NoExplanation: Th
 
 
 12 min read 
   
 
Count all palindrome which is square of a palindrome
 
Given two positive integers L and R (represented as strings) where [Tex]1\leq L \leq R\leq10^{18} [/Tex]. The task is to find the total number of super-palindromes in the inclusive range [L, R]. A palindrome is called super-palindrome if it is a palindrome and also square of a palindrome. Examples: Input: L = "4", R = "1000" Output: 4 Explanation:
 
 
 10 min read 
   
 
Sentence Palindrome (Palindrome after removing spaces, dots, .. etc)
 
Write a program to check if a sentence is a palindrome or not. You can ignore white spaces and other characters to consider sentences as a palindrome. Examples: Input : str = "Too hot to hoot." Output : Sentence is palindrome. Input : str = "Abc def ghi jklm." Output : Sentence is not palindrome. Note: There may be multiple spaces and/or dots betwe
 
 
 12 min read 
   
 
Length of longest consecutive zeroes in the binary representation of a number.
 
We have a number N. Determine the length of the longest consecutive 0's in its binary representation. Examples: Input : N = 14 Output : 1 Binary representation of 14 is 1110. There is only one 0 in the binary representation. Input : N = 9 Output : 2 A simple approach is to traverse through all bits and keep track of the maximum number of consecutiv
 
 
 4 min read 
   
 
Sum of decimal equivalent of all possible pairs of Binary representation of a Number
 
Given a number N. The task is to find the sum of the decimal equivalent of all the pairs formed from the binary representation of the given number. Examples: Input: N = 4 Output: 4 Binary equivalent of 4 is 100. All possible pairs are 10, 10, 00 and their decimal equivalent are 2, 2, 0 respectively. So, 2 + 2+ 0 = 4 Input: N = 11 Output: 13 All pos
 
 
 5 min read 
   
 
Next greater number than N with exactly one bit different in binary representation of N
 
Given a number N. The task is to find the smallest number which is greater than N and has only one bit different in the binary representation of N. Note: Here N can be very large 10^9 &lt; N &lt; 10^15.Examples: Input : N = 11 Output : The next number is 15 The binary representation of 11 is 1011 So the smallest number greater than 11 with one bit
 
 
 7 min read 
   
 
Number of mismatching bits in the binary representation of two integers
 
Given two integers(less than 2^31) A and B. The task is to find the number of bits that are different in their binary representation. Examples: Input : A = 12, B = 15 Output : Number of different bits : 2 Explanation: The binary representation of 12 is 1100 and 15 is 1111. So, the number of different bits are 2. Input : A = 3, B = 16 Output : Numbe
 
 
 8 min read 
   
 
Find consecutive 1s of length &gt;= n in binary representation of a number
 
Given two integers x and n, the task is to search for the first consecutive stream of 1s (in the x's 32-bit binary representation) which is greater than or equal to n in length and return its position. If no such string exists then return -1.Examples: Input: x = 35, n = 2 Output: 31 Binary representation of 35 is 00000000000000000000000000100011 an
 
 
 10 min read 
   
 
Maximum number of consecutive 1's in binary representation of all the array elements
 
Given an array arr[] of N elements, the task is to find the maximum number of consecutive 1's in the binary representation of an element among all the elements of the given array. Examples: Input: arr[] = {1, 2, 3, 4} Output: 2 Binary(1) = 01 Binary(2) = 10 Binary(3) = 11 Binary(4) = 100 Input: arr[] = {10, 15, 37, 89} Output: 4 Approach: An approa
 
 
 6 min read 
   
 
Find the number obtained after concatenation of binary representation of M and N
 
Given two integers M and N the task is to find the number formed by concatenating the binary equivalents of M and N i.e. M + N. Examples: Input: M = 4, N = 5 Output: 37 Binary equivalent of 4 is 100 and for 5 it is 101 after concatenation, the resultant binary number formed is 100101 whose decimal equivalent is 37. Input: M = 3, N = 4 Output: 28 Ap
 
 
 11 min read 
   
 
Smallest multiple of N with exactly N digits in its Binary number representation
 
Given a positive integer N, the task is to find the smallest multiple of N with exactly N digits in its binary number representation.Example: Input: N = 3 Output: 6 Explanation: 6 is the smallest multiple of 3 and has length also 3(110) in binary.Input: N = 5 Output: 20 Explanation: 6 is the smallest multiple of 5 and has length also 5(10100) in bi
 
 
 3 min read 
   
 
Count trailing zeroes present in binary representation of a given number using XOR
 
Given an integer N, the task is to find the number of trailing zeroes in the binary representation of the given number. Examples: Input: N = 12Output: 2Explanation:The binary representation of the number 13 is "1100".Therefore, there are two trailing zeros in the 12. Input: N = -56Output: 3Explanation:The binary representation of the number -56 is
 
 
 4 min read 
   
 
Find the maximum between N and the number formed by reversing 32-bit binary representation of N
 
Given a positive 32-bit integer N, the task is to find the maximum between the value of N and the number obtained by decimal representation of reversal of binary representation of N in a 32-bit integer. Examples: Input: N = 6Output: 1610612736Explanation: Binary representation of 6 in a 32-bit integer is 00000000000000000000000000000110 i.e., (0000
 
 
 6 min read 
   
 
Prime Number of Set Bits in Binary Representation | Set 1
 
Given two integers ‘L’ and ‘R’, write a program to find the total numbers that are having prime number of set bits in their binary representation in the range [L, R]. Examples: Input : l = 6, r = 10Output : 4Explanation :6 -&gt; 110 (2 set bits, 2 is prime)7 -&gt; 111 (3 set bits, 3 is prime)9 -&gt; 1001 (2 set bits, 2 is prime)10 -&gt; 1010 (2 set
 
 
 13 min read 
   
 
Binary representation of next number
 
Given a binary input that represents binary representation of positive number n, find a binary representation of n+1.The binary input may be and may not fit even in unsigned long long int. Examples: Input: 10011Output: 10100Explanation:Here n = (19)10 = (10011)2next greater integer = (20)10 = (10100)2 Input: 111011101001111111Output: 11101110101000
 
 
 9 min read 
   
 
Prime Number of Set Bits in Binary Representation | Set 2
 
Given two integers 'L' and 'R', we need to write a program that finds the count of numbers having the prime number of set bits in their binary representation in the range [L, R]. Examples: Input : 6 10 Output : 4 6 -&gt; 110 (2 set bits, 2 is prime) 7 -&gt; 111 (3 set bits, 3 is prime) 9 -&gt; 1001 (2 set bits , 2 is prime) 10-&gt;1010 (2 set bits
 
 
 9 min read 
   
 
Binary representation of a given number
 
Write a program to print a Binary representation of a given number. Recommended PracticeBinary representationTry It!Source: Microsoft Interview Set-3 Method 1: Iterative Method: For any number, we can check whether its 'i'th bit is 0(OFF) or 1(ON) by bitwise AND it with "2^i" (2 raise to i). 1) Let us take number 'NUM' and we want to check whether
 
 
 7 min read 
  
 
 
 
 
Article Tags : 
  
 
 
Practice Tags : 
  
 
 
 
 
 
 
 
 
 
 
 
  
 
 
 
 
 
 
 
 
 
 
 
 
 We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy  
Check if actual binary representation of a number is palindrome - GeeksforGeeks (4) 
 
'); $('.spinner-loading-overlay').show(); jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id, check: true }), success:function(result) { jQuery.ajax({ url: writeApiUrl + 'suggestions/auth/' + `${post_id}/`, type: "GET", dataType: 'json', xhrFields: { withCredentials: true }, success: function (result) { $('.spinner-loading-overlay:eq(0)').remove(); var commentArray = result; if(commentArray === null || commentArray.length === 0) { // when no reason is availaible then user will redirected directly make the improvment. // call to api create-improvement-post $('body').append('
'); $('.spinner-loading-overlay').show(); jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id, }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.unlocked-status--improve-modal-content').css("display","none"); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); return; } var improvement_reason_html = ""; for(var comment of commentArray) { // loop creating improvement reason list markup var comment_id = comment['id']; var comment_text = comment['suggestion']; improvement_reason_html += `
 ${comment_text} 
`; } $('.improvement-reasons_wrapper').html(improvement_reason_html); $('.improvement-bottom-btn').html("Create Improvement"); $('.improve-modal--improvement').hide(); $('.improvement-reason-modal').show(); }, error: function(e){ $('.spinner-loading-overlay:eq(0)').remove(); // stop loader when ajax failed; }, }); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); } else { if(loginData && !loginData.isLoggedIn) { $('.improve-modal--overlay').hide(); if ($('.header-main__wrapper').find('.header-main__signup.login-modal-btn').length) { $('.header-main__wrapper').find('.header-main__signup.login-modal-btn').click(); } return; } } }); $('.left-arrow-icon_wrapper').on('click',function(){ if($('.improve-modal--suggestion').is(":visible")) $('.improve-modal--suggestion').hide(); else{ $('.improvement-reason-modal').hide(); } $('.improve-modal--improvement').show(); }); function loadScript(src, callback) { var script = document.createElement('script'); script.src = src; script.onload = callback; document.head.appendChild(script); } function suggestionCall() { var suggest_val = $.trim($("#suggestion-section-textarea").val()); var array_String= suggest_val.split(" ") var gCaptchaToken = $("#g-recaptcha-response-suggestion-form").val(); var error_msg = false; if(suggest_val != "" && array_String.length >=4){ if(suggest_val.length <= 2000){ var payload = { "gfg_post_id" : `${post_id}`, "suggestion" : `
${suggest_val}
`, } if(!loginData || !loginData.isLoggedIn) // User is not logged in payload["g-recaptcha-token"] = gCaptchaToken jQuery.ajax({ type:'post', url: "https://apiwrite.geeksforgeeks.org/suggestions/auth/create/", xhrFields: { withCredentials: true }, crossDomain: true, contentType:'application/json', data: JSON.stringify(payload), success:function(data) { jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-section-textarea').val(""); jQuery('.suggest-bottom-btn').css("display","none"); // Update the modal content const modalSection = document.querySelector('.suggestion-modal-section'); modalSection.innerHTML = ` 
 
Thank You!
 
Your suggestions are valuable to us.
 
You can now also contribute to the GeeksforGeeks community by creating improvement and help your fellow geeks.
 
 `; }, error:function(data) { jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Something went wrong."); jQuery('#suggestion-modal-alert').show(); error_msg = true; } }); } else{ jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Minimum 5 Words and Maximum Character limit is 2000."); jQuery('#suggestion-modal-alert').show(); jQuery('#suggestion-section-textarea').focus(); error_msg = true; } } else{ jQuery('.spinner-loading-overlay:eq(0)').remove(); jQuery('#suggestion-modal-alert').html("Enter atleast four words !"); jQuery('#suggestion-modal-alert').show(); jQuery('#suggestion-section-textarea').focus(); error_msg = true; } if(error_msg){ setTimeout(() => { jQuery('#suggestion-section-textarea').focus(); jQuery('#suggestion-modal-alert').hide(); }, 3000); } } document.querySelector('.suggest-bottom-btn').addEventListener('click', function(){ jQuery('body').append('
'); jQuery('.spinner-loading-overlay').show(); if(loginData && loginData.isLoggedIn) { suggestionCall(); return; } // load the captcha script and set the token loadScript('https://www.google.com/recaptcha/api.js?render=6LdMFNUZAAAAAIuRtzg0piOT-qXCbDF-iQiUi9KY',[], function() { setGoogleRecaptcha(); }); }); $('.improvement-bottom-btn.create-improvement-btn').click(function() { //create improvement button is clicked $('body').append('
'); $('.spinner-loading-overlay').show(); // send this option via create-improvement-post api jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.improvement-reason-modal').hide(); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { $('.spinner-loading-overlay:eq(0)').remove(); var result = e.responseJSON; if(result.detail.non_field_errors.length){ $('.improve-modal--improve-content .improve-modal--improve-content-modified').text(`${result.detail.non_field_errors}.`); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); $('.improvement-reason-modal').hide(); } }, }); }); 
 
 
Continue without supporting 😢 
 `; $('body').append(adBlockerModal); $('body').addClass('body-for-ad-blocker'); const modal = document.getElementById("adBlockerModal"); modal.style.display = "block"; } function handleAdBlockerClick(type){ if(type == 'disabled'){ window.location.reload(); } else if(type == 'info'){ document.getElementById("ad-blocker-div").style.display = "none"; document.getElementById("ad-blocker-info-div").style.display = "flex"; handleAdBlockerIconClick(0); } } var lastSelected= null; //Mapping of name and video URL with the index. const adBlockerVideoMap = [ ['Ad Block Plus','https://media.geeksforgeeks.org/auth-dashboard-uploads/abp-blocker-min.mp4'], ['Ad Block','https://media.geeksforgeeks.org/auth-dashboard-uploads/Ad-block-min.mp4'], ['uBlock Origin','https://media.geeksforgeeks.org/auth-dashboard-uploads/ub-blocke-min.mp4'], ['uBlock','https://media.geeksforgeeks.org/auth-dashboard-uploads/U-blocker-min.mp4'], ] function handleAdBlockerIconClick(currSelected){ const videocontainer = document.getElementById('ad-blocker-info-div-gif'); const videosource = document.getElementById('ad-blocker-info-div-gif-src'); if(lastSelected != null){ document.getElementById("ad-blocker-info-div-icons-"+lastSelected).style.backgroundColor = "white"; document.getElementById("ad-blocker-info-div-icons-"+lastSelected).style.borderColor = "#D6D6D6"; } document.getElementById("ad-blocker-info-div-icons-"+currSelected).style.backgroundColor = "#D9D9D9"; document.getElementById("ad-blocker-info-div-icons-"+currSelected).style.borderColor = "#848484"; document.getElementById('ad-blocker-info-div-name-span').innerHTML = adBlockerVideoMap[currSelected][0] videocontainer.pause(); videosource.setAttribute('src', adBlockerVideoMap[currSelected][1]); videocontainer.load(); videocontainer.play(); lastSelected = currSelected; }  

                                                        Check if actual binary representation of a number is palindrome - GeeksforGeeks (2024)
                        

                            
                        

                    
                                                                                
Top Articles

                    

                                                                                    



    
    

        FAQ - Get Answers To All Your Google Fi Questions
    


                                                            



    
    

        Understanding Horse Ownership Disputes | Catanese and Wells
    


                                                                                                        



    
    

        UPS Paketshop: Filialen & Standorte
    


                



    
    

        Unit 30 Quiz: Idioms And Pronunciation
    


                



    
    

        Caesars Rewards Loyalty Program Review [Previously Total Rewards]
    


                



    
    

        Lexington Herald-Leader from Lexington, Kentucky
    


                



    
    

        The Potter Enterprise from Coudersport, Pennsylvania
    


                



    
    

        Retro Ride Teardrop
    


                



    
    

        Craigslist - Pets for Sale or Adoption in Zeeland, MI
    


                



    
    

        Western Razor David Angelo Net Worth
    


                



    
    

        Heska Ulite
    


                



    
    

        Spelunking The Den Wow
    


                



    
    

        Ukraine-Russia war: Latest updates
    


                



    
    

        Audrey Boustani Age
    


                



    
    

        Insidekp.kp.org Hrconnect
    


                



    
    

        Hoe kom ik bij mijn medische gegevens van de huisarts? - HKN Huisartsen
    


                



    
    

        Saberhealth Time Track
    


                



    
    

        Hell's Kitchen Valley Center Photos Menu
    


                



    
    

        Enterprise Car Sales Jacksonville Used Cars
    


                



    
    

        Bitlife Tyrone's
    


                



    
    

        Blackwolf Run Pro Shop
    


                



    
    

        Gem City Surgeons Miami Valley South
    


                



    
    

        Unterwegs im autonomen Freightliner Cascadia: Finger weg, jetzt fahre ich!
    


                



    
    

        Uconn Health Outlook
    


                



    
    

        [PDF] PDF - Education Update - Free Download PDF
    


                



    
    

        Crossword Help - Find Missing Letters & Solve Clues
    


                



    
    

        Cpt 90677 Reimbursem*nt 2023
    


                



    
    

        Kirk Franklin Mother Debra Jones Age
    


                



    
    

        Malluvilla In Malayalam Movies Download
    


                



    
    

        Craigslist Northern Minnesota
    


                



    
    

        Orange Park Dog Racing Results
    


                



    
    

        Babydepot Registry
    


                



    
    

        Planned re-opening of Interchange welcomed - but questions still remain
    


                



    
    

        Bursar.okstate.edu
    


                



    
    

        Have you seen this child? Caroline Victoria Teague
    


                



    
    

        Miss America Voy Board
    


                



    
    

        Greater Keene Men's Softball
    


                



    
    

        Woodman's Carpentersville Gas Price
    


                



    
    

        Linda Sublette Actress
    


                



    
    

        R/Moissanite
    


                



    
    

        craigslist: modesto jobs, apartments, for sale, services, community, and events
    


                



    
    

        Windshield Repair & Auto Glass Replacement in Texas| Safelite
    


                



    
    

        [Teen Titans] Starfire In Heat - Chapter 1 - Umbrelloid - Teen Titans
    


                



    
    

        Suntory Yamazaki 18 Jahre | Whisky.de » Zum Online-Shop
    


                



    
    

        Arch Aplin Iii Felony
    


                



    
    

        Dlnet Deltanet
    


                



    
    

        Okta Login Nordstrom
    


                



    
    

        Every Type of Sentinel in the Marvel Universe
    


                



    
    

        St Als Elm Clinic
    


                



    
    

        Wera13X
    


                



    
    

        David Turner Evangelist Net Worth
    


                                                

                                            
Latest Posts

                        

                                                            



    
    

        What are the best Spanish mortgage rates? September 2024 update
    


                                                            



    
    

        30+ Things Frugal People Don't Do
    


                                                    

                    
                    

        

    
    
    



                    

    
Article information

    
Author:  Duncan Muller 

    
Last Updated:   

    
Views: 6144

    
Rating: 4.9 / 5 (59 voted)

    
Reviews: 90% of readers found this page helpful





    
Author information

    
Name: Duncan Muller

    
Birthday: 1997-01-13

    
Address: Apt. 505 914 Phillip Crossroad, O'Konborough, NV 62411

    
Phone: +8555305800947

    
Job: Construction Agent

    
Hobby: Shopping, Table tennis, Snowboarding, Rafting, Motor sports, Homebrewing, Taxidermy

    
Introduction: My name is Duncan Muller, I am a enchanting, good, gentle, modern, tasty, nice, elegant person who loves writing and wants to share my knowledge and understanding with you.