Bitwise AND of Numbers Range — LeetCode 201 Python Solution
- Problem
- #201
- Pattern
- Bit Manipulation
- Reading time
- 2 min
- Source
- leetcode.com
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
class Solution:
def rangeBitwiseAnd(self, left: int, right: int) -> int:
while left < right:
right &= right - 1
return rightComplexity
| Measure | Complexity |
|---|---|
| Time | O(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 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.