# Tag Archives: Bitwise-XOR

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 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 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
Given an array A[] consisting of N integers, the task is to check if it is possible to reduce array of at least length 2… Read More
Given two arrays A[] and B[] consisting of N positive integers, the task is to the Bitwise XOR of same indexed array elements after rearranging… Read More
Given a positive integer N, the task is to find the two smallest integers A and B such that the Bitwise XOR of A and… Read More
Given an integer N, the task is to print the count of all the non-negative integers K less than or equal to N, such that… Read More
Given two binary strings L and R, the task is to find the xor from L to R. Length of the binary string is <… Read More
Given two arrays A and B of sizes N and M respectively, the task is to calculate the XOR sum of bitwise ANDs of all… Read More
Given an unweighted and undirected graph consisting of N nodes and two integers a and b. The edge between any two nodes exists only if… Read More
Given an array arr[] of size N, and an array Q[] consisting of M queries of type {L, R}, the task is to print the… Read More