Game Theory in Balanced Ternary Numeral System | (Moving 3k steps at a time)
Just like base 2 Binary numeral system having 0s and 1s as digits, Ternary(Trinary) Numeral System is a base 3 number system having 0s, 1s… Read More »
Category Archives: Bit Magic
Highest power of 2 that divides a number represented in binary
Given a binary string str, the task is to find the largest power of 2 that divides the decimal equivalent of the given binary number.… Read More »
Check if matrix A can be converted to B by changing parity of corner elements of any submatrix
Given two binary matrices A[][] and B[][] of N X M. In a single operation, one can choose a sub-matrix (min of 2 rows and… Read More »
Find the value at kth position in the generated array
Given three integer n, m and k. Find the element at kth position after repeating the given operation n number of times. In a single… Read More »
Pairs of strings which on concatenating contains each character of “string”
Given an array of strings arr[]. The task is to find the count of unordered pairs of strings (arr[i], arr[j]), which on concatenation contains each… Read More »
XOR of all the elements in the given range [L, R]
Given a range [L, R], the task is to find the XOR of all the integers in the given range i.e. (L) ^ (L +… Read More »
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 »
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 »
