Skip to content

Tag Archives: Bitwise-OR

Given an array arr[] consisting of N integers, the task is to find the maximum Bitwise XOR of Bitwise OR of every subarray after splitting… 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, the task is to find the Bitwise OR of Bitwise AND of all subarrays of the… 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 positive integers, the task is to count the number of subarrays whose Bitwise OR of its elements even.… 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
Given an array arr[] consisting of non-negative integers, the task for each array element arr[i] is to print the sum of Bitwise OR of all… Read More
Given an integer N, the task is to find the decimal value of the binary string formed by concatenating the binary representations of all numbers… Read More