Write a function that checks if two non-negative integers make an "interlocking binary pair".
- numbers can be interlocked if their binary representations have no
1's in the same place - comparisons are made by bit position, starting from right to left (see the examples below)
- when representations are of different lengths, the unmatched left-most bits are ignored
a = 9,b = 4Stacking representations shows how they can interlock.
9 1001
4 100
Here, no 1's share any position, so the function returns true.
a = 3,b = 6
These representations do not interlock.
3 11
6 110
Finding they both have a 1 in the same position, the function returns false.
Two non-negative integers.
Boolean true or false whether these integers are interlockable.