Binary representation of a given number Last Updated : 17 Mar, 2025 Comments Improve Suggest changes Like Article Like Report Try it on GfG Practice Given an integer n, the task is to print the binary representation of the number. Note: The given number will be maximum of 32 bits, so append 0's to the left if the result string is smaller than 30 length.Examples: Input: n = 2Output: 00000000000000000000000000000010Input: n = 0Output: 00000000000000000000000000000000Approach - Using Bit Manipulation - O(1) time and O(1) spaceThe idea is to check each bit position of the number from left to right (most significant bit to least significant bit). For each bit position, we use the bitwise AND operation with a mask created by left-shifting 1 to that position (1<<i). If the result is non-zero, it means that bit is set to 1 in the original number, so we append '1' to our answer string; otherwise, we append '0'. C++ // C++ program to find binary // representation of a given number #include <iostream> using namespace std; string getBinaryRep(int n) { string ans = ""; // Check for each bit. for (int i=31; i>=0; i--) { // If i'th bit is set if (n&(1<<i)) ans += '1'; else ans += '0'; } return ans; } int main() { int n = 2; cout << getBinaryRep(n); return 0; } Java // Java program to find binary // representation of a given number class GfG { static String getBinaryRep(int n) { String ans = ""; // Check for each bit. for (int i = 31; i >= 0; i--) { // If i'th bit is set if ((n & (1 << i)) != 0) ans += '1'; else ans += '0'; } return ans; } public static void main(String[] args) { int n = 2; System.out.println(getBinaryRep(n)); } } Python # Python program to find binary # representation of a given number def getBinaryRep(n): ans = "" # Check for each bit. for i in range(31, -1, -1): # If i'th bit is set if (n & (1 << i)): ans += '1' else: ans += '0' return ans if __name__ == "__main__": n = 2 print(getBinaryRep(n)) C# // C# program to find binary // representation of a given number using System; class GfG { static string getBinaryRep(int n) { string ans = ""; // Check for each bit. for (int i = 31; i >= 0; i--) { // If i'th bit is set if ((n & (1 << i)) != 0) ans += '1'; else ans += '0'; } return ans; } static void Main() { int n = 2; Console.WriteLine(getBinaryRep(n)); } } JavaScript // JavaScript program to find binary // representation of a given number function getBinaryRep(n) { let ans = ""; // Check for each bit. for (let i = 31; i >= 0; i--) { // If i'th bit is set if ((n & (1 << i)) !== 0) ans += '1'; else ans += '0'; } return ans; } let n = 2; console.log(getBinaryRep(n)); Output00000000000000000000000000000010Approach - Using Modulus and Division Operator - O(1) time and O(1) spaceThe idea is to build a 32-bit binary representation by examining each bit of the number from right to left. We start by creating a string of 32 zeros, then iterate through all 32 bit positions. For each position, we check if the current rightmost bit is set (using n%2), and if so, we place a '1' at the appropriate position in our string. After checking each bit, we right-shift the number (using integer division by 2) to examine the next bit in the subsequent iteration.The expression n%2 (n modulo 2) reveals the rightmost bit because any binary number ends with either 0 or 1. If the number is odd, it ends with 1 and n%2 equals 1; if it's even, it ends with 0 and n%2 equals 0. Meanwhile, the integer division n/2 effectively performs a right shift operation in binary. When we divide by 2, we're removing the rightmost bit and shifting all other bits one position to the right. For example, 10 (binary 1010) divided by 2 gives 5 (binary 101), effectively shifting all bits right by one position. C++ // C++ program to find binary // representation of a given number #include <iostream> using namespace std; string getBinaryRep(int n) { // Create a 32 length string // of 0's string ans = ""; for (int i=0; i<32; i++) ans += '0'; for (int i=0; i<32; i++) { // Set 1 f rightmost bit is set if (n%2 == 1) ans[31 - i] = '1'; // Right shift bits using divison // operator n = n / 2; } return ans; } int main() { int n = 2; cout << getBinaryRep(n); return 0; } Java // Java program to find binary // representation of a given number class GfG { static String getBinaryRep(int n) { // Create a 32 length char array // of '0's char[] ans = new char[32]; for (int i = 0; i < 32; i++) ans[i] = '0'; for (int i = 0; i < 32; i++) { // Set 1 if rightmost bit is set if (n % 2 == 1) ans[31 - i] = '1'; // Right shift bits using division // operator n = n / 2; } return new String(ans); } public static void main(String[] args) { int n = 2; System.out.println(getBinaryRep(n)); } } Python # Python program to find binary # representation of a given number def getBinaryRep(n): # Create a 32 length string # of 0's ans = ['0'] * 32 for i in range(32): # Set 1 if rightmost bit is set if n % 2 == 1: ans[31 - i] = '1' # Right shift bits using division # operator n = n // 2 return "".join(ans) if __name__ == "__main__": n = 2 print(getBinaryRep(n)) C# // C# program to find binary // representation of a given number using System; class GfG { static string getBinaryRep(int n) { // Create a 32 length string // of 0's char[] ans = new char[32]; for (int i = 0; i < 32; i++) ans[i] = '0'; for (int i = 0; i < 32; i++) { // Set 1 if rightmost bit is set if (n % 2 == 1) ans[31 - i] = '1'; // Right shift bits using division // operator n = n / 2; } return new string(ans); } static void Main() { int n = 2; Console.WriteLine(getBinaryRep(n)); } } JavaScript // JavaScript program to find binary // representation of a given number function getBinaryRep(n) { // Create a 32 length string // of 0's let ans = Array(32).fill('0'); for (let i = 0; i < 32; i++) { // Set 1 if rightmost bit is set if (n % 2 === 1) ans[31 - i] = '1'; // Right shift bits using division // operator n = Math.floor(n / 2); } return ans.join(''); } let n = 2; console.log(getBinaryRep(n)); Output00000000000000000000000000000010 Comment More infoAdvertise with us Next Article Count set bits in an integer K kartik Follow Improve Article Tags : Bit Magic DSA Microsoft Practice Tags : MicrosoftBit Magic Similar Reads Bitwise Algorithms Bitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read Introduction to Bitwise Algorithms - Data Structures and Algorithms Tutorial Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0 or 1. In our world, we usually with numbers using the decimal base. In other words. we use the digit 0 to 9 However, there are other number representations that can be quite use 15+ min read Bitwise Operators in C In C, bitwise operators are used to perform operations directly on the binary representations of numbers. These operators work by manipulating individual bits (0s and 1s) in a number.The following 6 operators are bitwise operators (also known as bit operators as they work at the bit-level). They are 6 min read Bitwise Operators in Java In Java, Operators are special symbols that perform specific operations on one or more than one operands. They build the foundation for any type of calculation or logic in programming.There are so many operators in Java, among all, bitwise operators are used to perform operations at the bit level. T 6 min read Python Bitwise Operators Python bitwise operators are used to perform bitwise calculations on integers. The integers are first converted into binary and then operations are performed on each bit or corresponding pair of bits, hence the name bitwise operators. The result is then returned in decimal format.Note: Python bitwis 5 min read JavaScript Bitwise Operators In JavaScript, a number is stored as a 64-bit floating-point number but bitwise operations are performed on a 32-bit binary number. To perform a bit-operation, JavaScript converts the number into a 32-bit binary number (signed) and performs the operation and converts back the result to a 64-bit numb 5 min read All about Bit Manipulation Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementa 14 min read What is Endianness? Big-Endian & Little-Endian Computers operate using binary code, a language made up of 0s and 1s. This binary code forms the foundation of all computer operations, enabling everything from rendering videos to processing complex algorithms. A single bit is a 0 or a 1, and eight bits make up a byte. While some data, such as cert 5 min read Bits manipulation (Important tactics) Prerequisites: Bitwise operators in C, Bitwise Hacks for Competitive Programming, Bit Tricks for Competitive Programming Table of Contents Compute XOR from 1 to n (direct method)Count of numbers (x) smaller than or equal to n such that n+x = n^xHow to know if a number is a power of 2?Find XOR of all 15+ min read Easy Problems on Bit Manipulations and Bitwise AlgorithmsBinary representation of a given numberGiven an integer n, the task is to print the binary representation of the number. Note: The given number will be maximum of 32 bits, so append 0's to the left if the result string is smaller than 30 length.Examples: Input: n = 2Output: 00000000000000000000000000000010Input: n = 0Output: 000000000000 6 min read Count set bits in an integerWrite an efficient program to count the number of 1s in the binary representation of an integer.Examples : Input : n = 6Output : 2Binary representation of 6 is 110 and has 2 set bitsInput : n = 13Output : 3Binary representation of 13 is 1101 and has 3 set bits[Naive Approach] - One by One CountingTh 15+ min read Add two bit stringsGiven two binary strings s1 and s2 consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings.Note: The input strings may contain leading zeros but the output string should not have any leading zeros.Examples:Input: s1 = "1101", s2 = "111"Output: 10100Explanation: "1 1 min read Turn off the rightmost set bitGiven an integer n, turn remove turn off the rightmost set bit in it. Input: 12Output: 8Explanation : Binary representation of 12 is 00...01100. If we turn of the rightmost set bit, we get 00...01000 which is binary representation of 8Input: 7 Output: 6 Explanation : Binary representation for 7 is 0 7 min read Rotate bits of a numberGiven a 32-bit integer n and an integer d, rotate the binary representation of n by d positions in both left and right directions. After each rotation, convert the result back to its decimal representation and return both values in an array as [left rotation, right rotation].Note: A rotation (or cir 7 min read Compute modulus division by a power-of-2-numberGiven two numbers n and d where d is a power of 2 number, the task is to perform n modulo d without the division and modulo operators.Input: 6 4Output: 2 Explanation: As 6%4 = 2Input: 12 8Output: 4Explanation: As 12%8 = 4Input: 10 2Output: 0Explanation: As 10%2 = 0Approach:The idea is to leverage bi 3 min read Find the Number Occurring Odd Number of TimesGiven an array of positive integers. All numbers occur an even number of times except one number which occurs an odd number of times. Find the number in O(n) time & constant space. Examples : Input : arr = {1, 2, 3, 2, 3, 1, 3}Output : 3 Input : arr = {5, 7, 2, 7, 5, 2, 5}Output : 5 Recommended 12 min read Program to find whether a given number is power of 2Given a positive integer n, the task is to find if it is a power of 2 or not.Examples: Input : n = 16Output : YesExplanation: 24 = 16Input : n = 42Output : NoExplanation: 42 is not a power of 2Input : n = 1Output : YesExplanation: 20 = 1Approach 1: Using Log - O(1) time and O(1) spaceThe idea is to 12 min read Find position of the only set bitGiven a number n containing only 1 set bit in its binary representation, the task is to find the position of the only set bit. If there are 0 or more than 1 set bits, then return -1. Note: Position of set bit '1' should be counted starting with 1 from the LSB side in the binary representation of the 8 min read Check for Integer OverflowGiven two integers a and b. The task is to design a function that adds two integers and detects overflow during the addition. If the sum does not cause an overflow, return their sum. Otherwise, return -1 to indicate an overflow.Note: You cannot use type casting to a larger data type to check for ove 7 min read Find XOR of two number without using XOR operatorGiven two integers, the task is to find XOR of them without using the XOR operator.Examples : Input: x = 1, y = 2Output: 3Input: x = 3, y = 5Output: 6Approach - Checking each bit - O(log n) time and O(1) spaceA Simple Solution is to traverse all bits one by one. For every pair of bits, check if both 8 min read Check if two numbers are equal without using arithmetic and comparison operatorsGiven two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The idea is to use XOR operator. XOR of two numbers is 0 if the numbers are the same, otherwise non-zero. C++ // C++ program to check if two numbers // a 8 min read Detect if two integers have opposite signsGiven two integers a and b, the task is to determine whether they have opposite signs. Return true if the signs of the two numbers are different and false otherwise.Examples:Input: a = -5, b = 10Output: trueExplanation: One number is negative and the other is positive, so their signs are different.I 9 min read Swap Two Numbers Without Using Third VariableGiven two variables a and y, swap two variables without using a third variable. Examples: Input: a = 2, b = 3Output: a = 3, b = 2Input: a = 20, b = 0Output: a = 0, b = 20Input: a = 10, b = 10Output: a = 10, b = 10Table of ContentUsing Arithmetic OperatorsUsing Bitwise XORBuilt-in SwapUsing Arithmeti 6 min read Russian Peasant (Multiply two numbers using bitwise operators)Given two integers a and b, the task is to multiply them without using the multiplication operator. Instead of that, use the Russian Peasant Algorithm.Examples:Input: a = 2, b = 5Output: 10Explanation: Product of 2 and 5 is 10.Input: a = 6, b = 9Output: 54Explanation: Product of 6 and 9 is 54.Input: 4 min read Like