All challenges
Medium 0 solved 0% acceptance

Reverse the Bits

Reverse the order of the lowest width bits of a number.

What you'll learn

  • Read the lowest bit with AND 1
  • Build a number bit by bit with shifts
  • Respect a fixed bit width

Problem

Write n in binary using exactly width bits, adding leading zeros as needed, then read those bits backwards. For n = 6 and width = 4, 6 is 0110, reversed it is 0110 again, so the result is 6. For width = 8 it is 00000110, reversed 01100000, which is 96. Bit reversal is used in the fast Fourier transform and in some hashing tricks.

Implement reverse_the_bits(n, width).

Input

n: A non-negative integer that fits in width bits.

width: How many bits to reverse.

Output

Return the value of the reversed width-bit pattern.

Constraints

1 ≤ width ≤ 63

0 ≤ n < 2^width

Examples

Example 1
Input:
n = 6
width = 8

Expected output:
expected = 96
Input:
long long n = 6;
long long width = 8;

Expected output:
long long expected = 96;
Input:
long n = 6;
long width = 8;

Expected output:
long expected = 96;

Explanation

6 is 00000110 in 8 bits; reversed it is 01100000, which is 96.

Example 2
Input:
n = 1
width = 3

Expected output:
expected = 4
Input:
long long n = 1;
long long width = 3;

Expected output:
long long expected = 4;
Input:
long n = 1;
long width = 3;

Expected output:
long expected = 4;

Explanation

1 is 001; reversed it is 100, which is 4.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Repeat width times: take the lowest bit of n, then shift n right.

Hint 2

Shift the result left by one before adding the bit you just took.

Hint 3

Leading zeros of n become trailing zeros of the result, which the fixed loop count handles.

Expected complexity

O(width) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.