This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
The Solution is shared considering CAN I SHARE MY SOLUTIONS? Problem XOR is a bitwise operator which returns 0 if the bits are the same, and 1 otherwise. In textbooks the XOR operator is denoted by ⊕, but in most challenges and programming languages you will see the caret ^ used instead. A B Output 0 0 0 0 1 1 1 0 1 1 1 0 For longer binary numbers we XOR bit by bit: 0110 ^ 1010 = 1100 . We can XOR…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.