Solving Bitwise AND of Numbers Range in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

Example 1:

Input: [5,7]
Output: 4

Example 2:

Input: [0,1]
Output: 0

11010  
11011  
11100   
11101   
11110  

See the full details of the problem Bitwise AND of Numbers Range at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go