Given an array of integers arr[] of size N, the task is to check whether arr[] can be split into different subarrays such that on… Read More

# Tag Archives: Bitwise-XOR

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

Given an array a[] of size N and an integer K, the task is to find a value X in the range [0, K] which… Read More

Given two integers A and B, the task is to find the minimum possible size of the array whose MEX of the array is A… Read More

Given a string S of N characters, the task is to calculate the total number of non-empty substrings such that at most one character occurs… Read More

Given a positive integer N, the task is to find the pair of integers (X, Y) such that the Bitwise XOR of X and Y… Read More

Given three numbers N, S and X the task is to find if it is possible to construct a sequence A of length N, where… Read More

Given 3 integers A, B, C, the task is to find the maximum XOR value of three number selected one from each range [0, A],… Read More