Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven a limited range integer array of size n with all its elements between 1 and n except for one element that occurs twice and one missing from the list. Find the missing number and the duplicate element in linear time and without using any extra memory.
Given an integer, swap consecutive b bits starting from the given positions in a binary representation of an integer. The bits to be swapped should not overlap with each other.
Given a number n, find the previous power of 2. If n itself is a power of 2, return n.
Given a number n, find the next highest power of 2. If n itself is a power of 2, return n.
Given two 16–bit positive values stored in 32–bit integer variables, find the product using the 8–bit multiply operator that takes two 8–bit numbers and returns a 16–bit value.
Given two integers, find their minimum and maximum without using branching.
Given an integer, count set bits in it using a lookup table.
In this post, we will see how to compute the parity of a number using a lookup table. The parity refers to the total number of 1’s in the binary number.
Given an integer, count its set bits using the Brian Kernighan’s algorithm.
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 to convert a given integer to another.
Check if the binary representation of a number is palindrome or not.