Range bitwise AND
Given two non-negative integers lo and hi with lo <= hi (both < 2^31), return the bitwise AND of every integer in the inclusive range [lo, hi]. Do it in O(log) without iterating the whole range. For example AND of [5,7] is 4.
Implement
range_bitwise_and(lo: int, hi: int) → intExamples
in
[5,7]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[5,7]4not run yetsample