Sum of bitwise OR of all subarrays
Give an array of positive integers, find the total sum after performing the bit wise OR operation on all the sub arrays of a given… Read More »
Category Archives: Bit Magic
Value in a given range with maximum XOR
Given positive integers N, L, and R, we have to find the maximum value of N ⊕ X, where X ∈ [L, R]. Examples: Input… Read More »
Check if a number can be expressed as 2^x + 2^y
Given a number n, we need to check if it can be expressed as 2x + 2y or not . Here x and y can… Read More »
Find the missing element in an array of integers represented in binary format
Given N strings which represents all integers from 0 to N in binary format except any one. The task is to find the missing number.… Read More »
Finding the Parity of a number Efficiently
Given an integer N. The task is to write a program to find the parity of the given number. Note: Parity of a number is… Read More »
Maximum set bit sum in array without considering adjacent elements
Given an array of integers arr[]. The task is to find the maximum sum of set bits(of the array elements) without adding the set bits… Read More »
Check whether bits are in alternate pattern in the given range
Given a non-negative number n and two values l and r. The problem is to check whether or not n has an alternate pattern in… Read More »
Increment a number without using ++ or +
The task is to Increment a number without using ++ and + operators. Examples: Input : 3 Output : 4 Input : 9 Output :… Read More »
Inserting M into N such that m starts at bit j and ends at bit i | Set-2
Given two 32-bit numbers, N and M, and two-bit positions, i and j. Write a method to insert M into N such that M starts… Read More »
First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
Given an array of N integers and a number X. The task is to find the index of first element which is greater than or… Read More »
Maximum sum by adding numbers with same number of set bits
Given an array of N numbers, the task is to find the maximum sum that can be obtained by adding numbers with the same number… Read More »
Count pairs with Bitwise XOR as ODD number
Given an array of N integers, the task is to find the number of pairs (i, j) such that A[i] & A[j] is odd. Examples:… Read More »
Sum of XOR of sum of all pairs in an array
Given an array, find the XOR of sum of all pairs in an array. Examples: Input : arr[] = {1, 2, 3} Output : 0… Read More »
Count pairs with Bitwise AND as ODD number
Given an array of N integers. The task is to find the number of pairs (i, j) such that A[i] & A[j] is odd. Examples:… Read More »
Count pairs with Bitwise OR as Even number
Given an array A[] of size N. The task is to find the how many pair(i, j) exists such that A[i] OR A[j] is even.… Read More »