Powers of 2 to required sum
Given an integer N, task is to find the numbers which when raised to the power of 2 and added finally, gives the integer N.… Read More »
Category Archives: Bit Magic
Count number of distinct sum subsets within given range
Given a set S of N numbers and a range specified by two numbers L (Lower Bound) and R (Upper Bound). Find the number of… Read More »
Check a number is odd or even without modulus operator
Given a number, check whether it is even or odd. Input: n = 11 Output: Odd Input: n = 10 Output: Even Recommended: Please try… Read More »
XOR Encryption by Shifting Plaintext
Here is a cipher algorithm, based on hexadecimal strings that is implemented by XORing the given plaintext, N number of times where N is its… Read More »
Bitwise recursive addition of two integers
When adding two binary numbers by hand we keep the carry bits in mind and add it at the same time. But to do same… Read More »
Baum Sweet Sequence
Baum Sweet Sequence is an infinite binary sequence of 0s and 1s. The nth term of the sequence is 1 if the number n has… Read More »
Minimum digits to remove to make a number Perfect Square
Given a integer n, we need to find how many digits remove from the number to make it a perfect square. Examples: Input : 8314… Read More »
Count pairs in an array which have at least one digit common
Given an array of N numbers. Find out the number of pairs i and j such that i < j and Ai and Aj have… Read More »
Number whose sum of XOR with given array range is maximum
You are given a sequence of N integers and Q queries. In each query, you are given two parameters L and R. You have to… Read More »
Odd numbers in N-th row of Pascal’s Triangle
Given N, the row number of Pascal’s triangle(row starting from 0). Find the count of odd numbers in N-th row of Pascal’s Triangle. Prerequisite :… Read More »
Python program to convert floating to binary
Python doesn’t provide any inbuilt method to easily convert floating point decimal numbers to binary number. So, Let’s do this manually. Approach : To convert… Read More »
Check if bitwise AND of any subset is power of two
Given an array arr[] of n positive integers. The task is to check if there exist any subset of the array whose bitwise AND is… Read More »
Levelwise Alternating OR and XOR operations in Segment Tree
A Levelwise OR/XOR alternating segment tree is a segment tree, such that at every level the operations OR and XOR alternate. In other words at… Read More »
Booth’s Multiplication Algorithm
Booth’s algorithm is a multiplication algorithm that multiplies two signed binary numbers in 2’s compliment notation. Booth used desk calculators that were faster at shifting… Read More »
Leftover element after performing alternate Bitwise OR and Bitwise XOR operations on adjacent pairs
Given an array of N(always a power of 2) elements and Q queries. Every Query consists of two elements index and value.. We need to… Read More »