Count number of trailing zeros in Binary representation of a number using Bitset
Given a number. The task is to count the number of Trailing Zero in Binary representation of a number using bitset. Examples: Input : N… Read More »
Category Archives: Bit Magic
Position of the K-th set bit in a number
Given two numbers N and K. The task is to find the index of the K-th set bit in the number from the right. Note:… Read More »
Minimum value among AND of elements of every subset of an array
Given an array of integers, the task is to find the AND of all elements of each subset of the array and print the minimum… Read More »
Count of numbers having only 1 set bit in the range [0, n]
Given an integer n, the task is to count the numbers having only 1 set bit in the range [0, n]. Examples: Input: n =… Read More »
Sum of Bitwise-OR of all Submatrices
Given a NxN matrix, the task is to find the sum of bit-wise OR of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »
Sum of bitwise AND of all submatrices
Given a NxN matrix, the task is to find the sum of bit-wise AND of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »
Minimum number of given powers of 2 required to represent a number
Given an integer x and an array arr[] each element of which is a power of 2. The task is to find the minimum number… Read More »
Number of submatrices with OR value 1
Given a N*N binary matrix, task is to find the count of rectangular sub-matrices with OR value 1. Examples: Input : arr[][] = {{0, 0,… Read More »
XOR of XORs of all sub-matrices
Given a ‘N*N’ matrix, the task is to find the XOR of XORs of all possible sub-matrices. Examples: Input :arr = {{3, 1}, {1, 3}}… Read More »
XOR of a submatrix queries
Given an N * N matrix and q queries, each containing position of top-left and bottom-right corner of a rectangular sub-matrix, the task is to… Read More »
Maximum Bitwise AND pair from given range
Given a range [L, R], the task is to find a pair (X, Y) such that L ≤ X < Y ≤ R and X… Read More »
Iterating over all possible combinations in an Array using Bits
There arises several situations while solving a problem where we need to iterate over all possible combinations of an array. In this article, we will… Read More »
Given two binary strings perform operation until B > 0 and print the result
Given two binary strings A and B of length N and M (up to 105). The task is to repeat the below process and find… Read More »
Sum of bitwise AND of all subarrays
Given an array consisting of N positive integers, find the sum of bit-wise and of all possible sub-arrays of the array. Examples: Input : arr[]… Read More »
Sum of XOR of all subarrays
Given an array containing N positive integers, the task is to find the sum of XOR of all sub-arrays of the array. Examples: Input :… Read More »