so, when we do n&1- if last bit is 1 then result =1 i.e. odd if last bit is 0 then result =0 i.e. even*/ ...
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.