Skip to content

Category Archives: Bit Magic

Given an integer N, the task is to find the total count of N-Digit numbers such that the Bitwise XOR of the digits of the… Read More
Given an integer N, the task is to find the minimum number of bits required to be flipped to convert the binary representation of N… Read More
Given an integer N, the task is to find the number of Binary Strings of length N such that frequency of 1‘s is greater than… Read More
Given a string S of length N, consisting of lower case alphabets, and queries Q[][] of the form [L, R], the task is to count… Read More
Given an array arr[] consisting of N distinct integers and queries Q[][] of the type {X, Y}, the task for each query is to find… Read More
Given two positive integers L and R, the task is to count the total number of set bits in the binary representation of all the… Read More
Given an integer N, the task is to print the first K multiples of N using Bitwise Operators. Examples:Hey! Looking for some great resources suitable… Read More
Given an integer N, the task is to find the largest number M, where (M < N), such that N(XOR)M is equal to N(OR)M i.e.… Read More
Given an array A[ ] consisting of non-negative integers and a matrix Q[ ][ ] consisting of queries of the following two types: (1, l,… Read More
Given a number N, the task is to calculate the total number of corresponding different bit in the binary representation for every consecutive number from… Read More
Given an array arr[] of positive integers and a number K, the task is to find the minimum and maximum values of Bitwise operation on… Read More
Given a natural number N, the task is to find a number M smaller than N such that the difference between their bitwise XOR (N… Read More
Given a binary array arr[] of length N, and an integer K, the task is to find the maximum number of consecutive ones after flipping… Read More
Given an integer N, the task is to find the maximum frequency of set bits among all pairs of integers from 0 to N that… Read More

Start Your Coding Journey Now!