Given 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…

Given 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: 10100…

Try it on GfG Practice Given 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…

Given 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 4 Output: 2 Explanation: As 6%4 = 2 Input: 12 8 Output: 4 Explanation: As 12%8 = 4 Input: 10 2 Output: 0 Explanation: As 10%2 = 0 Approach: The idea is to…

Try it on GfG Practice Given a number n and a value k. From the right, set the kth bit in the binary representation of n. The position of LSB(or last bit) is 0, second last bit is 1 and so on. Also, 0 <= k < x, where x is the number of bits in the binary representation of n. Examples: Input : n =…

Try it on GfG Practice Given a number n and a bit position k, check if the kth bit of n is set or not. A bit is called set if it is 1. Note: Indexing starts with 0 from LSB (least significant bit) side in the binary representation of the number. Examples: Input: n = 7, k = 2 Output: Yes Explanation:…

Given an integer n, turn remove turn off the rightmost set bit in it. Input: 12 Output: 8 Explanation : Binary representation of 12 is 00...01100. If we turn of the rightmost set bit, we get 00...01000 which is binary representation of 8 Input: 7 Output: 6 Explanation : Binary representation for 7…

Prerequisite: It is recommended to refer Interesting facts about Bitwise Operators How to set a bit in the number 'num': If we want to set a bit at nth position in the number 'num', it can be done using the 'OR' operator( | ). First, we left shift '1' to n position via (1<

Table of Contents 1. Compute XOR from 1 to n (direct method): The problem can be solved based on the following observations: Say x = n%4. The XOR value depends on the value if x. If x = 0, then the answer is n.x = 1, then answer is 1.x = 2, then answer is n+1.x = 3, then answer is 0. Below is the…

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 = 2 Output: 00000000000000000000000000000010 Input:…

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…

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…

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…

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…

Try it on GfG Practice 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…

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…

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…

Try it on GfG Practice Given an array arr[] containing 2*n + 2 positive numbers, out of which 2*n numbers exist in pairs whereas the other two number occur exactly once and are distinct. The task is to find the other two numbers. Note: Return the numbers in increasing order. Example: Input: arr[] =…

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 : 1 Output : 1 1st Number whose binary…

A pair of strings when concatenated is said to be a 'Pandigital Concatenation' if their concatenation consists of all digits from (0 - 9) in any order at least once.The task is, given N strings, compute the number of pairs resulting in a 'Pandigital Concatenation'. Examples: Input : num[] =…

Booth's algorithm is a multiplication algorithm that multiplies two signed binary numbers in 2's complement notation. Booth used desk calculators that were faster at shifting than adding and created the algorithm to increase their speed. Booth’s algorithm is of interest in the study of computer…

The task of converting a floating-point number to its binary representation in Python involves representing the number in the IEEE 754 format, which consists of a sign bit, an exponent and a mantissa. For example, given the floating-point number 10.75, its IEEE 754 32-bit binary representation is…

Given an array of N numbers. Find out the number of pairs i and j such that i < j and Ai and Aj have at least one digit common (For e.g. (11, 19) have 1 digit common but (36, 48) have no digit common) Examples: Input: A[] = { 10, 12, 24 } Output: 2 Explanation: Two valid pairs are (10, 12) and (12,…

Here is a cipher algorithm, based on hexadecimal strings that is implemented by XORing the given plaintext, N number of times where N is its length. But, the catch is that every next XOR operation is done after shifting the consecutive plain text entry to the right. A sample operation is shown below…

Try it on GfG Practice Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has “odd parity”, if it contains odd number of 1-bits and is “even parity” if it contains even number of 1-bits. 1 --> parity of the set is odd 0 --> parity of the set is even…

Given a positive integer n, print the next smallest and the previous largest number that has the same number of 1 bit in their binary representation. Examples: Input : n = 5 Output : Closest Greater = 6 Closest Smaller = 3 Note that 5, 6 and 3 have same number of set bits. Input : n = 11 Output :…

Try it on GfG Practice Given an array of integers. The task is to find the maximum subarray XOR value in the given array. Examples: Input: arr[] = {1, 2, 3, 4} Output: 7 Explanation: The subarray {3, 4} has maximum XOR value Input: arr[] = {8, 1, 2, 12, 7, 6} Output: 15 Explanation: The subarray {1,…

Give an integer n. We can flip exactly one bit. Write code to find the length of the longest sequence of 1 s you could create. Examples: Input : 1775 Output : 8 Binary representation of 1775 is 11011101111. After flipping the highlighted bit, we get consecutive 8 bits. 11011111111. Input : 12 Output…

Given a number x, find next number with same number of 1 bits in it's binary representation.For example, consider x = 12, whose binary representation is 1100 (excluding leading zeros on 32 bit machine). It contains two logic 1 bits. The next higher number with two logic 1 bits is 17 (10001 2).…

Try it on GfG Practice Binary Number is the default way to store numbers, but in many applications, binary numbers are difficult to use and a variety of binary numbers is needed. This is where Gray codes are very useful. Gray code has a property that two successive numbers differ in only one bit…

Try it on GfG Practice A number 'n' is called Bleak if it cannot be represented as sum of a positive number x and set bit count in x, i.e., x + countSetBits(x) is not equal to n for any non-negative number x.Examples : Input : n = 3 Output : false 3 is not Bleak as it can be represented as 2 +…

Try it on GfG Practice Given two numbers x and y, and a range [l, r] where 1 <= l, r <= 32. The task is consider set bits of y in range [l, r] and set these bits in x also.Examples : Input : x = 10, y = 13, l = 2, r = 3 Output : x = 14 Binary representation of 10 is 1010 and that of y is 1101. There…

Cyclic Redundancy Check or CRC is a method of detecting accidental changes/errors in the communication channel. CRC uses Generator Polynomial which is available on both sender and receiver side. An example generator polynomial is of the form like x3 + x + 1. This generator polynomial represents key…

Given an integer n, calculate the square of a number without using *, / and pow(). Examples : Input: n = 5 Output: 25 Input: 7 Output: 49 Input: n = 12 Output: 144 A Simple Solution is to repeatedly add n to result. Below is the implementation of this idea. C++ // Simple solution to calculate square…

Euclid's algorithm is used to find GCD of two numbers. There are mainly two versions of algorithm. Version 1 (Using subtraction) C++ // Recursive function to return gcd of a and b int gcd(int a, int b) { if (a == b) return a; return (a > b) ? gcd(a - b, b) : gcd(a, b - a); } C // Recursive function…

Try it on GfG Practice Write a function to check if a given number is Sparse or not. A number is said to be a sparse number if in the binary representation of the number no two or more consecutive bits are set. Example: Input: x = 72 Output: true Explanation: Binary representation of 72 is 01001000.…

Try it on GfG Practice Given a number N, generate bit patterns from 0 to 2^N-1 such that successive patterns differ by one bit. Examples: Input: N = 2 Output: 00 01 11 10 Input: N = 3 Output: 000 001 011 010 110 111 101 100 Method-1 The above sequences are Gray Codes of different widths. Following…

Try it on GfG Practice Given an integer x, determine whether its binary representation is a palindrome. Return true if it is a palindrome; otherwise, return false. Input: x = 9 Output: true Explanation: The binary representation of 9 is 1001, which is a palindrome. Input: x = 10 Output: false…

Parity: Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has "odd parity" if it contains an odd number of 1-bits and is "even parity" if it contains an even number of 1-bits. The main idea of the below solution is - Loop while n is not 0 and in loop unset…

Try it on GfG Practice Write a function that, for a given no n, finds a number p which is greater than or equal to n and is the smallest power of 2. Examples : Input: n = 5 Output: 8 Input: n = 17 Output: 32 Input : n = 32 Output: 32 Recommended Practice Smallest power of 2 greater than or equal to…