Bitwise AND of Numbers Range

Problem Statement

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

You need to solve this problem efficiently.

What to notice first

• Key insight 1 for Bitwise AND of Numbers Range
• Key insight 2 for solving this problem
• Key insight 3 specific to the approach

Examples

Input	Output	Explanation
Example 1	Result 1	Explanation for example 1
Example 2	Result 2	Explanation for example 2

Constraints

• Constraint 1 for Bitwise AND of Numbers Range
• Constraint 2
• Constraint 3

Real-World Applications

Where this pattern appears

• Network packet header parsing
• Permission and flag management in operating systems
• Compression algorithms and encoding
• Hardware register manipulation and embedded systems

Complexity Comparison

Approach	Time	Space	Best When
Shift	O(n)	O(1)	When applicable
Brian Kernighan	O(n)	O(1)	When applicable
Naive	O(n)	O(1)	When applicable

Approach 1: Shift

★ Recommended

This approach provides an efficient solution for bitwise and of numbers range.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Python

bitwise_and_of_numbers_range_shift.py

# Python Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

C++

bitwise_and_of_numbers_range_shift.cpp

# C++ Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

Java

bitwise_and_of_numbers_range_shift.java

# Java Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

JavaScript

bitwise_and_of_numbers_range_shift.js

# JavaScript Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

Rust

bitwise_and_of_numbers_range_shift.rs

# Rust Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

Go

bitwise_and_of_numbers_range_shift.go

# Golang Solution
# Problem: bitwise-and-of-numbers-range
# Approach: shift

# Implementation placeholder for bitwise_and_of_numbers_range_shift
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_shift():
    pass

if __name__ == "__main__":
    pass

Approach 2: Brian Kernighan

🎯 Interview Favourite

This approach provides an efficient solution for bitwise and of numbers range.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Python

bitwise_and_of_numbers_range_brian_kernighan.py

# Python Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

C++

bitwise_and_of_numbers_range_brian_kernighan.cpp

# C++ Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

Java

bitwise_and_of_numbers_range_brian_kernighan.java

# Java Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

JavaScript

bitwise_and_of_numbers_range_brian_kernighan.js

# JavaScript Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

Rust

bitwise_and_of_numbers_range_brian_kernighan.rs

# Rust Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

Go

bitwise_and_of_numbers_range_brian_kernighan.go

# Golang Solution
# Problem: bitwise-and-of-numbers-range
# Approach: brian_kernighan

# Implementation placeholder for bitwise_and_of_numbers_range_brian_kernighan
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_brian_kernighan():
    pass

if __name__ == "__main__":
    pass

Approach 3: Naive

✓ Simple

This approach provides an efficient solution for bitwise and of numbers range.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Python

bitwise_and_of_numbers_range_naive.py

# Python Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

C++

bitwise_and_of_numbers_range_naive.cpp

# C++ Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

Java

bitwise_and_of_numbers_range_naive.java

# Java Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

JavaScript

bitwise_and_of_numbers_range_naive.js

# JavaScript Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

Rust

bitwise_and_of_numbers_range_naive.rs

# Rust Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

Go

bitwise_and_of_numbers_range_naive.go

# Golang Solution
# Problem: bitwise-and-of-numbers-range
# Approach: naive

# Implementation placeholder for bitwise_and_of_numbers_range_naive
# This file is auto-generated and should contain the solution code.

def bitwise_and_of_numbers_range_naive():
    pass

if __name__ == "__main__":
    pass

Related Problems

• Two Sum ↗ Easy #1
• Palindrome Number ↗ Easy #9

Interview Tips

Key trade-offs to discuss

• Time vs. space trade-offs between approaches
• Handling edge cases (empty inputs, single elements, duplicates)
• Optimization opportunities and when they matter
• Follow-up variations and constraint changes

← Previous
#137 Single Number II