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

# Tag Archives: Bitwise-XOR

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

Given three integers L, R, and K, the task is to find the minimum Bitwise XOR of at most K integers between [L, R]. Examples:… Read More

Given an array arr[] consisting of N integers, the task is to re-construct an array arr[] such that the values in arr[] are obtained by doing… Read More

Given a positive integer N, the task is to find the number of ways to represent N as Bitwise XOR of distinct positive integers less… Read More

Given two integers A and B, the task is to check if there exists two integers P and Q over the range [1, A] and… Read More

Given an array arr[] of size N and an array Q[], the task is to calculate the sum of Bitwise XOR of all elements of… Read More

Given two positive integers A and B representing Bitwise XOR and Bitwise OR of two positive integers, the task is to find all possible pairs… Read More

Given a positive integer N, the task is to print all the distinct even and odd values of prefix Bitwise XORs of first N natural… Read More

Given N nodes valued by [1, N], an array arr[] consisting of N positive integers such that the ith node ( 1-based indexing ) has… Read More

Given an array arr[] consisting of N positive integers and a positive integer K, the task is to count minimum Bitwise XOR of array elements… Read More

Given a positive integer N, the task is to find the Nth term of the Ruler Function Series. The Ruler Function Series is a series,… Read More