## Find position of left most dis-similar bit for two numbers

Given two numbers n1 and n2. The task is to find the position of first mismatching bit in the binary representation of the two numbers… Read More »

- Number of solutions of n = x + n ⊕ x
- Value in a given range with maximum XOR
- Hamming distance between two Integers
- Count pairs with Bitwise XOR as EVEN number
- Maximize the number of subarrays with XOR as zero
- Maximum value of XOR among all triplets of an array
- Minimum number of elements to be removed to make XOR maximum
- Count of cyclic permutations having XOR with other binary string as 0
- Count numbers whose difference with N is equal to XOR with N
- Count ordered pairs of positive numbers such that their sum is S and XOR is K
- Count pairs with Bitwise XOR as ODD number
- Find position of left most dis-similar bit for two numbers
- Count numbers whose XOR with N is equal to OR with N
- Replace every element of the array with BitWise XOR of all other
- Sum of XOR of sum of all pairs in an array
- Count all pairs of adjacent nodes whose XOR is an odd number
- String transformation using XOR and OR
- 2's compliment for a givin string using XOR
- Replace every array element by Bitwise Xor of previous and next element
- Minimum value of N such that xor from 1 to N is equal to K
- Count number of bits changed after adding 1 to given N
- Program to invert bits of a number Efficiently
- XOR of path between any two nodes in a Binary Tree
- Find a value whose XOR with given number is maximum
- Comparing leading zeros in binary representations of two numbers
- XOR of all Prime numbers in an Array
- XOR of all elements of array with set bits equal to K
- Check if elements of Linked List are present in pair
- Check if the Xor of the frequency of all digits of a number N is zero or not
- Number of ways to change the XOR of two numbers by swapping the bits

Given two numbers n1 and n2. The task is to find the position of first mismatching bit in the binary representation of the two numbers… Read More »

Given an array of N integers, the task is to find the number of pairs (i, j) such that A[i] ^ A[j] is even. Examples:… Read More »

Given two binary strings and . Let be set of all the cyclic permutations of string . The task is to find how many strings… Read More »

Given a value X, the task is to find the number Y which will give maximum value possible when XOR with X. (Assume X to… Read More »

Given a binary tree with distinct nodes and a pair of two nodes. The task is to find the XOR of all of the nodes… Read More »

Given an integer . The task is to find the number of bits changed after adding 1 to the given number. Examples: Input : N… Read More »

Given an array of integers and a number K. The task is to find the XOR of only those elements of the array whose total… Read More »

Given an array of integers. The task is to replace every element by the bitwise xor of all other elements of the array. Examples: Input:… Read More »

Given a string containing only lowercase english alphabets. The task is to find the bitwise XOR of all the prime frequencies of the characters in… Read More »

Given a number N, the task is to check if xor value of the frequency of the digits is zero or not. Examples: Input: N… Read More »

Given an array of integers, replace every element with xor of previous and next elements with following exceptions. a) First element is replaced by sum… Read More »

Given an array of integers arr[]. The task is to find the bitwise XOR of all the prime numbers present in the array. Examples: Input:… Read More »

Given two Integer numbers x and y. Compare and print which one of them has more leading zeros using Bitwise operation. If both the no.… Read More »

Given an array of integers ‘arr’, the task is to find the maximum XOR value of any triplet pair among all the possible triplet pairs.… Read More »

Given a number N, the task is to find the count of X such that N XOR X == N OR X, where 0<=X<=N Examples:… Read More »