Bitwise AND of Numbers Range — LeetCode 201 Python Solution

MediumBit Manipulation
Problem
#201
Reading time
2 min

The problem

Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive.

Example

Input
left = 5, right = 7
Output
4

Python solution

Python
class Solution:
    def rangeBitwiseAnd(self, left: int, right: int) -> int:
        while left < right:
            right &= right - 1
        return right

Complexity

MeasureComplexity
TimeO(n)
SpaceO(1) auxiliary

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 201. Bitwise AND of Numbers Range 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.

Related problems

On a study list

This problem is on Top Interview 150.

Frequently asked questions

How hard is LeetCode 201. Bitwise AND of Numbers Range?
LeetCode 201. Bitwise AND of Numbers Range is rated Medium on LeetCode.
What is the time complexity of LeetCode 201. Bitwise AND of Numbers Range?
The Python solution on this page runs in O(n).
What is the space complexity of LeetCode 201. Bitwise AND of Numbers Range?
The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 201. Bitwise AND of Numbers Range cover?
LeetCode 201. Bitwise AND of Numbers Range is tagged Bit Manipulation on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview