Sum of Bitwise OR of all pairs in a given array
Given an array “arr[0..n-1]” of integers. The task is to calculate the sum of Bitwise OR of all pairs, i.e. calculate the sum of “arr[i]… Read More »
Category Archives: Bit Magic
Maximum subset sum such that no two elements in set have same digit in them
Given an array of N elements. Find the subset of elements which has maximum sum such that no two elements in the subset has common… Read More »
Count pairs of elements such that number of set bits in their AND is B[i]
Given two arrays A[] and B[] of N elements each. The task is to find the number of index pairs (i, j) such that i… Read More »
Number of 0s and 1s at prime positions in the given array
Given an array arr[] of size N where each element is either 0 or 1. The task is to find the count of 0s and 1s which are at prime… Read More »
Find uncommon characters of the two strings | Set 2
Given two strings str1 and str2, the task is to find and print the uncommon characters of the two given strings in sorted order without… Read More »
Fibonacci Power
Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »
Find N distinct numbers whose bitwise Or is equal to K
Given two integers N and K, the task is to find N distinct integers whose bit-wise OR is equal to K. If there does not… Read More »
Find a sub matrix with maximum XOR
Problem Given a square matrix of side N we have to find a submatrix such that bitwise XOR of its elements is maximum, and we… Read More »
Multiply a number by 15 without using * and / operators
Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »
Queries for bitwise OR in the given matrix
Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »
Find average of two numbers using bit operation
Given two integers x and y, the task is to find the average of these numbers i.e. (x + y) / 2 using bit operations.… Read More »
Queries for bitwise AND in the given matrix
Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »
Queries for bitwise AND in the index range [L, R] of the given array
Given an array arr[] of N and Q queries consisting of a range [L, R]. the task is to find the bit-wise AND of all… Read More »
Queries for bitwise OR in the index range [L, R] of the given array
Given an array arr[] of N and Q queries consisting of a range [L, R]. the task is to find the bit-wise OR of all… Read More »
Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
Given a perfect binary tree of N nodes, with nodes having values from 1 to N as depicted in the image below and Q queries… Read More »
