Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven two integers, return the Hamming distance between the two. The Hamming distance is the total number of places where the corresponding bits are different in the binary representation of two integers.
Compute modulus division of a positive number n by another positive number d which is a power of 2 without using division or modulo operator.
This post will discuss a few related problems that can be solved without using multiplication and division operators.
Given a positive integer n and k, perform a circular shift on the binary representation of n by k positions.
Given an integer, reverse its bits using binary operators and lookup table in linear time.
Given an integer, swap adjacent bits of it. In other words, swap bits present at even positions with those present in odd positions.
Given an integer array, duplicates appear in it an even number of times except for two elements, which appear an odd number of times. Find both odd appearing elements without using any extra memory.
Given an integer, swap two bits at given positions in a binary representation of it.
Given an integer array, duplicates are present in it in a way that all duplicates appear an even number of times except one which appears an odd number of times. Find that odd appearing element in linear time and without using any extra memory.
Given a number, check if it is a power of four or not.
Given a number, check if it is a power of 8 or not.
Given an integer array with all its elements between 1 and n except two elements, which occur twice. Find two duplicate elements without using any extra memory in linear time.