## Circular shift on binary representation of an integer by k positions

Given a positive integer n and k, perform circular shift on binary representation of it by k positions.

Coding made easy

Given a positive integer n and k, perform circular shift on binary representation of it by k positions.

In this post we will discuss few related problems that can be solved without using multiplication and division operators.

Given an integer, reverse its bits using binary operators and lookup table in O(1) 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 array of integers, duplicates appear in it even number of times except two elements which appears odd number of times. Find both odd appearing element without using any extra memory.

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 a number, check if it is power of 8 or not.

Given an array of integers with all its elements between 1 to n with the exception of two elements which occur twice. Find two duplicate elements without using any extra memory.

Given an limited range array of integers of size n with all its elements between 1 to n with the exception of one element which occur twice and one number which is missing from the list. Find missing number and the duplicate element in linear time and without using any extra memory. For example, …

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.