## Swap two bits at given position in an integer

Given an integer, swap two bits at given positions in binary representation of it.

Coding made easy

Given an integer, swap two bits at given positions in binary representation of it.

Given an array of integers, duplicates are present in it in such a way that all duplicates appear even number of times except one which appears 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 power of four or not.

Given an integer, reverse its bits using binary operators. The idea is to initialize the result by 0 (all bits 0) and process the given number starting from its least significant bit. If the current bit is 1, then we set the corresponding most significant bit in the result and finally move on …

Huffman Coding is a algorithm for doing data compression and it forms the basic idea behind file compression. This post talks about fixed length and variable length encoding, uniquely decodable codes, prefix rules and construction of Huffman Tree.

Given a positive number N, efficiently generate all binary numbers between 1 to N.

Given an integer, swap consecutive b bits starting from given positions in binary representation of the integer. The bits to be swapped should not overlap with each other.

Given a number n, find previous power of 2. If n itself is a power of 2, return n.

Given a number n, find 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 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.