## Find the minimum or maximum of two integers without using branching

Given two integers, find their minimum and maximum without using branching.

Coding made easy

Given two integers, find their minimum and maximum without using branching.

Given an integer, count set bits in it.

Given an integer, calculate its Parity. The parity refers to the number of 1’s in a given binary number. Odd parity (encoded as 1) means there are an odd number of 1’s and even parity (encoded as 0) means that there are an even number of 1’s. Parity bits are often used as a …

Given an integer, count its set bits.

In this post, we will discuss few unrelated problems that can be solved using bit manipulation hacks. Below Problems are covered in this post – Problem 1. Find number of bits needed to be flipped to convert given integer to another Problem 2. Conditionally negate a value without branching Problem 3. Find XOR of …

Given an integer, compute its absolute value (abs) without branching We can use the expression ((n + mask) ^ mask) where mask is (n >> 31) (assuming 32 bit storage for integers) to compute the absolute value of n. The mask (n >> 31) will be evaluated to 0 for positive numbers and …

In this post we will discuss some of the bit hacks/tricks on letters of English alphabet. Below tricks are covered in this post – Trick 1. Convert uppercase character to lowercase Trick 2. Convert lowercase character to uppercase Trick 3. Invert alphabet’s case Trick 4. Find letter’s position in alphabet Trick 1. …

In this post we will discuss few related problems that are related to unsetting the rightmost set bit of a number. How to unset the rightmost set bit of a number? The expression (n & (n – 1)) will turn off the rightmost set bit of given number. (n – 1) will have all …

In this post we will discuss few related problems that operates on the k’th bit of a number. Below problems are covered in this post – Problem 1. Turn off kth bit in a number Problem 2. Turn on kth bit in a number Problem 3. Check if kth bit is set for a …

With this post, we will start a series of amazing bit manipulation hacks that every programmer should know. Below problems are covered in this post – Problem 1. Check if an given integer is even or odd Problem 2. Detect if two integers have opposite signs or not Problem 3. Add 1 to a …

Given two integers x and n where n is non-negative, efficiently compute the value of power function pow(x, n).

Given an integer, find its square without using multiplication and division operator. Also, use of power function from any programming language library is not allowed.