Category: bit hacks

Question: Write a function to compute the number of bits required to convert a integer to another. For example, Input 29 (or 11101), 15 (or 01111) the output is …

The Hamming Distance is the number of different symbols between two strings/numbers (equal length). It can be also considered as the number of changes required to convert from one …

The Hamming distance between two integers is the number of positions at which the corresponding bits are different. For example, given two integers x=1 and y=4, the hamming distance …

This is another classic interview question: You are asked to write a function (in C/C++) that determines the number of bits required to convert one integer to another. The …

Given two 32-bit integers N and M, write a function to replace N (between bits position i and j) with M, so M becomes a substring of N located …