CodingMediumcod-g402

Subject Bit manipulationLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given two integers m and n with 0 <= m <= n <= 2^31 - 1, return the bitwise AND of every integer in the inclusive range [m, n]. For example AND of 5,6,7 is 4. An O(number-of-bits) solution is required; iterating the whole range is too slow.

Implement

range_bitwise_and(m: int, n: int) → int

Examples

in[5,7]out4

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.