Given two decimal numbers num1 and num2, the task is to count the number of times carry operation is required while adding the two given… Read More

# Tag Archives: Bitwise-XOR

Given an array arr[] of N integers, where N is an even number. The task is to divide the given N integers into two equals… Read More

Given a natural number N, the task is to find the largest number M having the same length in binary representation as N such that… Read More

Given an integer N, the task is to find the total count of N-Digit numbers such that the Bitwise XOR of the digits of the… Read More

Given a string S of length N, consisting of lower case alphabets, and queries Q[][] of the form [L, R], the task is to count… Read More

Given an array arr[] consisting of N distinct integers and queries Q[][] of the type {X, Y}, the task for each query is to find… Read More

Given an integer N, the task is to find the largest number M, where (M < N), such that N(XOR)M is equal to N(OR)M i.e.… Read More

Given a natural number N, the task is to find a number M smaller than N such that the difference between their bitwise XOR (N… Read More

Given an array arr[], and queries Q[][] of the form (l, r, val), the task for each query is to update all the elements in… Read More

Given an array arr[] of N positive integers, the task is to find the length of the longest subsequence such that Bitwise XOR of all… Read More

Given two positive integers S and X which represents the sum and Bitwise XOR of all the elements of an array arr[]. The task is… Read More

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