How hard is LeetCode 190. Reverse Bits?

LeetCode 190. Reverse Bits is rated Easy on LeetCode.

What is the time complexity of LeetCode 190. Reverse Bits?

The Python solution on this page runs in O(\log n).

What is the space complexity of LeetCode 190. Reverse Bits?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 190. Reverse Bits cover?

LeetCode 190. Reverse Bits is tagged Bit Manipulation and Divide and Conquer on LeetCode.

Reverse Bits — LeetCode 190 Python Solution

EasyBit ManipulationDivide and Conquer

Problem: #190
Pattern: Bit Manipulation
Reading time: 2 min
Source: leetcode.com

The problem

Reverse bits of a given 32 bits signed integer.

Python solution

Python

class Solution:
    def reverseBits(self, n: int) -> int:
        ans = 0
        for i in range(32):
            ans |= (n & 1) << (31 - i)
            n >>= 1
        return ans

Complexity

Measure	Complexity
Time	O(\log n)
Space	O(1) auxiliary

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 190. Reverse Bits is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.

The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.

On study lists

This problem is on Blind 75, NeetCode 150 and Top Interview 150.

Frequently asked questions

How hard is LeetCode 190. Reverse Bits?: LeetCode 190. Reverse Bits is rated Easy on LeetCode.
What is the time complexity of LeetCode 190. Reverse Bits?: The Python solution on this page runs in O(\log n).
What is the space complexity of LeetCode 190. Reverse Bits?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 190. Reverse Bits cover?: LeetCode 190. Reverse Bits is tagged Bit Manipulation and Divide and Conquer on LeetCode.