Given an integer N, the task is to find the number of distinct values possible for the bit-wise XOR of X and Y where 1… Read More

# Tag Archives: Bitwise-XOR

Given an integer N, find the one’s complement of the integer. Examples: Input: N = 5Output: 2Explanation: Binary representation of 5 is “101”. Its one’s… Read More

Given a number N. The task is to count the number of distinct XOR of any possible pairs using numbers from 1 to N inclusive.… Read More

Given two integers N and K, generate a sequence of size N+1 where the ith element is (i-1)⊕K, the task is to find the MEX… Read More

Given N numbers with no duplicates, count the number of unique triplets (ai, aj, ak) such that their XOR is 0. A triplet is said… Read More

Given an array arr[] of odd length N containing positive integers. The task is to find a positive integer X such that, adding X to… Read More

Given an array arr[] consisting of N positive integers. The task is to count the number of different non-empty subsets of arr[] having maximum bitwise… Read More

Given an array arr[] of N integers, the task is to find the size of the largest subset such that the bitwise AND of all… Read More

Given two arrays that are duplicates of each other except one element, that is one element from one of the array is missing, we need… Read More