[challenge] -given 2 integer .Find the position of the right most bit in which they differ in their binary representation.

Question

counting right to left .
return value of 2^position.

input-
---------
2 positive integer , space separated.

output-
----------
2^position of the right most bit which differ.

constrain-
---------------
n<m
0<=m<=2^30
n!=m(not equal )
---------------------------------------------
all languages are welcomed.

Answer 1

https://code.sololearn.com/ch3k3hk4dTRK/?ref=app