## Construct an array from XOR of all elements of array except element at same index

Given an array A[] having n positive elements. The task to create another array B[] such as B[i] is XOR of all elements of array… Read More »

- Find maximum xor of k elements in an array
- XOR of all the elements in the given range [L, R]
- Find XOR of numbers from the range [L, R]
- Equal Sum and XOR of three Numbers
- Range Queries to Find number of sub-arrays with a given xor
- Quadruplet pair with XOR zero in the given Array
- Alternate XOR operations on sorted array
- Minimum Bitwise XOR operations to make any two array elements equal
- Sum of XOR of all sub-arrays of length K
- Find array such that no subarray has xor zero or Y
- Find a number which give minimum sum when XOR with every number of array of integers
- Longest Subarray having strictly positive XOR
- Find a sub matrix with maximum XOR
- Choose X such that (A xor X) + (B xor X) is minimized
- Find a partition point in array to maximize its xor sum
- Minimizing array sum by applying XOR operation on all elements of the array
- Print steps to make a number in form of 2^X - 1
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- XOR in a range of a binary array
- Convert given integer X to the form 2^N - 1
- XOR of all the nodes in the sub-tree of the given node
- Create a sequence whose XOR of elements is y
- Total pairs in an array such that the bitwise AND, bitwise OR and bitwise XOR of LSB is 1
- Check if a number from every row can be selected such that xor of the numbers is greater than zero
- Count of sub-arrays whose elements can be re-arranged to form palindromes
- Find the node whose xor with x gives minimum value
- Number of ways for playing first move optimally in a NIM game
- Find the root of the sub-tree whose weighted sum XOR with X is maximum
- Find the node whose xor with x gives maximum value
- Find the root of the sub-tree whose weighted sum XOR with X is minimum

Given an array A[] having n positive elements. The task to create another array B[] such as B[i] is XOR of all elements of array… Read More »

Given an array of size n and integer k, count all pairs in array which differ in exactly K bits of binary representation of both… Read More »

Given four arrays and an integer x, find the number of quadruples which satisfy a^b^c^d = x, where a belongs from Arr1, b belongs from… Read More »

Given an array arr[] of size n, we need to find sum of all the values that comes from XORing all the elements of the… Read More »

Given a sequence of three binary sequences A, B and C of N bits. Count the minimum bits required to flip in A and B… Read More »

Given a positive integer n, count numbers x such that 0 < x <n and x^n > n where ^ is bitwise XOR operation. Examples:… Read More »

Given two integers A & B. Task is to check if A and B are same or not without using comparison operators. Examples: Input :… Read More »

Given three binary arrays, each of size n, the task is to find minimum flip of bits in the first and second array such that… Read More »

Given a number, the task is to find XOR of count of 0s and count of 1s in binary representation of a given number. Examples:… Read More »

Given pointer to the head node of a linked list, the task is to reverse the linked list. Examples: Input : Head of following linked… Read More »

Given an array of integers. Find the pair in an array which has minimum XOR value. Examples : Input : arr[] = {9, 5, 3}… Read More »

Given an array of integers, the task is to find maximum XOR value of a subarray of size K. Examples : Input : arr[] =… Read More »

Given a sorted singly linked list and a value x, the task is to find pair whose sum is equal to x. We are not… Read More »

Given an array of distinct positive integers and a number x, find the number of pairs of integers in the array whose XOR is equal… Read More »

XOR Encryption is an encryption method used to encrypt data and is hard to crack by brute-force method, i.e generating random encryption keys to match… Read More »