Brian Kernighan’s Algorithm to count set bits in an integer
Given an integer, count its set bits using the Brian Kernighan’s algorithm.
Tag: Easy
Check if adjacent bits are set in the binary representation of a number
Given a number, check if adjacent bits are set in the binary representation of it.
Find the total number of bits needed to be flipped
Find the total number of bits needed to be flipped to convert a given integer to another.
Check if binary representation of a number is palindrome or not
Check if the binary representation of a number is palindrome or not.
Bit Hacks – Part 5 (Find the absolute value of an integer without branching)
Given an integer, compute its absolute value (abs) without branching.
Bit Hacks – Part 4 (Playing with letters of the English alphabet)
This post will discuss some bit hacks/tricks on letters of the English alphabet. 1. Convert uppercase character to lowercase, 2. Convert lowercase character to uppercase, 3. Invert alphabet’s case, 4. Find a letter’s position in alphabet.
Bit Hacks – Part 3 (Playing with the rightmost set bit of a number)
This post will discuss a few related problems related to unsetting the rightmost set bit of a number.
Bit Hacks – Part 2 (Playing with k’th bit)
This post will discuss a few related problems that operate on the k’th bit of a number. 1. Turn off k’th bit in a number, 2. Turn on k’th bit in a number, 3. Check if k’th bit is set for a number, 4. Toggle the k’th bit.
Bit Hacks – Part 1 (Basic)
In this post, we will see how to 1. Check if an integer is even or odd, 2. Detect if two integers have opposite signs or not, 3. Add one to an integer, 4. Swap two numbers without using any third variable.
Efficiently implement power function – Iterative and Recursive
Given two integers, x and n, where n is non-negative, efficiently compute the power function pow(x, n) using Divide & Conquer.
Find the number of 1’s in a sorted binary array
Given a sorted binary array, efficiently find the total number of 1’s in it.
Find floor and ceil of a number in a sorted integer array
Given a sorted integer array, find the floor and ceil of a given number in it. The floor and ceil map the given number to the largest previous or the smallest following integer.