## Sum of XOR of all subarrays

Given an array containing N positive integers, the task is to find the sum of XOR of all sub-arrays of the array. Examples: Input :… Read More »

- Sum of XOR of all subarrays
- Find elements of array using XOR of consecutive elements
- Convert Singly Linked List to XOR Linked List
- Count pairs with Bitwise XOR as EVEN number
- Check whether XOR of all numbers in a given range is even or odd
- XOR of path between any two nodes in a Binary Tree
- Maximum value of XOR among all triplets of an array
- Maximize the number of subarrays with XOR as zero
- Count of values of x <= n for which (n XOR x) = (n - x)
- Count of cyclic permutations having XOR with other binary string as 0
- Replace every element of the array with BitWise XOR of all other
- Count ordered pairs of positive numbers such that their sum is S and XOR is K
- Replace every array element by Bitwise Xor of previous and next element
- Find array using different XORs of elements in groups of size 4
- Count no. of ordered subsets having a particular XOR value
- Find a value whose XOR with given number is maximum
- Count numbers whose difference with N is equal to XOR with N
- Find position of left most dis-similar bit for two numbers
- Count numbers whose XOR with N is equal to OR with N
- All pairs whose xor gives unique prime
- XOR of all Prime numbers in an Array
- Count number of bits changed after adding 1 to given N
- Composite XOR and Coprime AND
- Pairs from an array that satisfy the given condition
- XOR of all elements of array with set bits equal to K
- Comparing leading zeros in binary representations of two numbers
- Check if the Xor of the frequency of all digits of a number N is zero or not
- XOR of Prime Frequencies of Characters in a String

Given an array containing N positive integers, the task is to find the sum of XOR of all sub-arrays of the array. Examples: Input :… Read More »

Given a range [ L, R ], the task is to find if value of XOR of all natural numbers in range L to R… Read More »

Given an array arr[], the task is to count the number of unordered pairs of indices (i, j) such the gcd(2, a[i]^a[j]) > 1 and… Read More »

Given an array q[] of XOR queries of size N (N is a multiple of 4) which describe an array of the same size as… Read More »

Prerequisite: XOR Linked List – A Memory Efficient Doubly Linked List | Set 1 XOR Linked List – A Memory Efficient Doubly Linked List |… Read More »

Given an integer n, the task is to find the number of possible values of 0 ≤ x ≤ n which satisfy n XOR x… Read More »

Given an array arr[] of n elements and a number K, find the number of ordered subsets of arr[] having XOR of elements as K… Read More »

Given an array arr[], the task is to count all the valid pairs from the array. A pair (arr[i], arr[j]) is said to be valid… Read More »

Given an array arr[] in which XOR of every 2 consecutive elements of the original array is given i.e if the total number of elements… Read More »

Given an array arr[], the task is to count all the pairs whose xor gives the unique prime, i.e. no two pairs should give the… Read More »

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 »