# Tag Archives: Bitwise-XOR

Given an array integer arr[] of size N and Q queries. Each query is of the form (L, R), where L and R are indices… Read More
Given a positive integer N, the task is to find the largest integer M such that 0 <= M < N and XOR(M, N) is… Read More
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 an even number… 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