## Find a number X such that (X XOR A) is minimum and the count of set bits in X and B are equal

Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count… Read More »

- Find maximum xor of k elements in an array
- Find XOR of numbers from the range [L, R]
- Equal Sum and XOR of three Numbers
- Quadruplet pair with XOR zero in the given Array
- Nth XOR Fibonacci number
- Minimum Bitwise XOR operations to make any two array elements equal
- Alternate XOR operations on sorted array
- Queries to check whether all the elements in the given range occurs even number of times
- Find array such that no subarray has xor zero or Y
- Longest Subarray having strictly positive XOR
- Maximum XOR of Two Numbers in an Array
- Count of elements which are equal to the XOR of the next two elements
- Find a partition point in array to maximize its xor sum
- Minimum given operations required to convert a given binary string to all 1's
- XOR in a range of a binary array
- Find number of subarrays with XOR value a power of 2
- Find an N x N grid whose xor of every row and column is equal
- Maximize the Expression | Bit Manipulation
- XOR of elements in an array having prime frequency
- Maximum XOR with given value in the path from root to given node in the tree
- XOR of K smallest prime and composite numbers from the given array
- Find the XOR of first N Prime Numbers
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Bitwise XOR of elements having odd frequency
- Check if the array has an element which is equal to XOR of remaining elements
- Number of ways to erase exactly one element in the Binary Array to make XOR zero
- XOR of K largest prime and composite numbers from the given array

Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count… Read More »

Given two arrays A[] and B[]. The second array B[] contains all the elements of A[] except for 1 extra element. The task is to… Read More »

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

Given a binary array of 0’s and 1’s, the task is to find the number of ways to erase exactly one element from this array… Read More »

Given two positive integers A and B. Let’s define D such that B AND D = D. The task is to maximize the expression A… Read More »

Given an array arr[] of N elements, the task is to find the XOR of the elements which appear odd number of times in the… Read More »

Given an array arr[] of N non-zero positive integers and an integer K, the task is to find the XOR of the K largest prime… Read More »

Given an array arr[] of n elements. The task is to find the count of elements which are equal to the XOR of the next… Read More »

Given an array arr[] of N positive integers, the task is to calculate the absolute difference between XOR of non-prime numbers and prime numbers. Note… Read More »

Given an array arr[] containing N integers and there are Q queries where each query consists of a range [L, R]. The task is to… Read More »

Given an array arr[] of N elements, the task is to find the xor of the elements which have prime frequencies in the array. Note… Read More »

Given an integer array, arr[] of size N. The XOR value of any subarray of arr[] is defined as the xor of all the integers… Read More »

Given an array arr[] of N elements, the task is to check if the array has an element which is equal to the XOR of… Read More »

Given a positive integer N, the task is to find the XOR of the first N prime numbers. Examples: Input: N = 3 Output: 4… Read More »