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

# Tag Archives: Bitwise-OR

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

Given an array arr[] consisting of N integers and integer K, the task is to find the smallest integer X with exactly K set bits… Read More

Given an array arr[] consisting of N integers, the task is to count the number of pairs whose Bitwise XOR is odd, that can be… Read More

Given an array arr[] consisting of N integers and an integer K, the task is to print an array generated such that the sum of… Read More

Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from… Read More

Given an integer N, the task is to find the count total number of pairs (P, Q) from the range 0 ≤ P, Q <… Read More