## Minimize K whose XOR with given array elements leaves array unchanged

Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array… Read More »

- Find XOR of all elements in an Array
- Check if a Number is Odd or Even using Bitwise Operators
- Bitwise XOR of a Binary array
- Number of subsets with same AND, OR and XOR values in an Array
- XOR of elements in a given range with updates using Fenwick Tree
- XOR of every element of an Array with a given number K
- Maximum XOR value of maximum and second maximum element among all possible subarrays
- Find a number such that maximum in array is minimum possible after XOR
- Count subarrays with sum equal to its XOR value
- Count of subarrays of size K with elements having even frequencies
- XOR of pairwise sum of every unordered pairs in an array
- Path with minimum XOR sum of edges in a directed graph
- Find the subarray of size K with minimum XOR
- Count of distinct XORs formed by rearranging two Binary strings
- XOR of two Binary Strings
- Convert numbers into binary representation and add them without carry
- Choose an integer K such that maximum of the xor values of K with all Array elements is minimized
- Find sum of xor of all unordered triplets of the array
- Check whether an Array can be made 0 by splitting and merging repeatedly
- std::bit_xor in C++ with Examples
- Query to count odd and even parity elements in subarray after XOR with K
- Create an array such that XOR of subarrays of length K is X
- Maximum XOR path of a Binary Tree
- Count of elements to be inserted to make Array sum twice the XOR of Array
- Count of subtrees in a Binary Tree having XOR value K
- Construct XOR tree by Given leaf nodes of Perfect Binary Tree
- Minimum insertions to make XOR of an Array equal to half of its sum
- Count of even and odd set bit Array elements after XOR with K for Q queries
- Find the original Array using XOR values of all adjacent elements
- Check if Sum and XOR of all elements of array is equal

Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array… Read More »

Given an unsorted array arr[] of N integers that are in Arithmetic Progression, the task is to print the missing element from the given series.… Read More »

Given Bitwise AND, OR, and XOR of N elements of an array denoted by a, b, c. The task is to find the elements of… Read More »

Given an array arr[] of N positive integers the task is to find the minimum value of Bitwise XOR of Bitwise OR and AND of… Read More »

Given an array A[] of size N, find the Maximum Xor Subsequence such that both A [ i ] and A [ N – i… Read More »

Given an Array arr[] and an integer K, the task is to count subarrays of size K in which every element appears even number of… Read More »

Given an array arr[] of size N, the task is to find the minimum number of elements that need to be inserted into the array… Read More »

Given an array of positive integers, the task is to find the minimum number of insertions to be done in the array, to make the… Read More »

Given three integers N, K and X, the task is to construct an array of length N, in which XOR of all elements of each… Read More »

Given an array arr[] containing N elements, the task is to count the number of sub-arrays whose XOR of all the elements is equal to… Read More »

Given an array A[] of integers and array Q consisting of queries of the following two types: (1, L, R) : Return XOR of all… Read More »

Given an array arr[] consisting of N elements and Q queries represented by L, R, and K. The task is to print the count of… Read More »

Given an array arr of N elements and another array Q containing values of K, the task is to print the count of elements in… Read More »

Given an array arr[] with N elements, the task is to find whether all the elements of the given array can be made 0 by… Read More »

Given a Binary Tree, the task is to find the maximum of all the XOR value of all the nodes in the path from the… Read More »