Given two positive integers X and K, the task is to find the K-th smallest positive integer Y, such that X + Y = X… Read More

# Tag Archives: Bitwise-OR

Given an array arr[] consisting of N positive integers, the task is to find the number of subsequences from the given array whose Bitwise OR… Read More

Given an array arr[] consisting of N positive integers, where N is even, the task is to form N/2 pairs such that the sum of… Read More

Given two positive integers X and K, the task is to find the Kth smallest positive integer (Y) such that the sum of X and… Read More

Given an array arr[] consisting of N positive integers and an array of queries Q[] of type [L, R], the task is to find the… Read More

Given two integers X and Y, the task is to find two numbers whose Bitwise OR is X and their sum is Y. If there… Read More

Given two arrays arr[] of size N and queries[] of size Q, the task is to find the OR of AND of subsets of the… Read More

Given two binary strings S1 and S2, both of length N, the task is to count the number of different values of Bitwise OR other… Read More

Given two positive integers A and B, the task is to calculate the minimum number of operations required such that Bitwise OR of A and… Read More

Given two integers A and B, the task is to count possible values of X that satisfies the condition A | X = B. Note:… 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 an array arr[ ] consisting of N positive integers and a 2D array Q[][] consisting of queries of the form {i, val}, the task… Read More

Given three positives integers A, B, and C, the task is to count the minimum number of flipping of bits required in A and B,… Read More