# Bitwise-XOR

### Check if it is possible to construct an Array of size N having sum as S and XOR value as X

Given three numbers N, S and X the task is to find if it is possible to construct a sequence…

### Maximize XOR by selecting 3 numbers in range [0, A], [0, B], and [0, C] respectively

Given 3 integers A, B, C, the task is to find the maximum XOR value of three number selected one…

### Count of integers K in range [0, N] such that (K XOR K+1) equals (K+2 XOR K+3)

Count of integers K in range [0, N] such that (K XOR K+1) equals (K+2 XOR K+3)Given an integer N,…

### XOR of very large Binary Numbers in range [L, R]

#include using namespace std;  string sub(string s){    int n = s.size();    for (int i = n – 1; i >= 0; i–) {                        if…

### Split an array into subarrays with maximum Bitwise XOR of their respective Bitwise OR values

Split an array into subarrays with maximum Bitwise XOR of their respective Bitwise OR valuesGiven an array arr[] consisting of…

### Count ways to split array into three non-empty subarrays having equal Bitwise XOR values

Count ways to split array into three non-empty subarrays having equal Bitwise XOR valuesGiven an array arr[] consisting of N…

### Sum of Bitwise XOR of elements of an array with all elements of another array

#include using namespace std;  int xorSumOfArray(int arr[], int n, int k, int count[]){          int sum = 0;    int p = 1;          for (int i…