The ultimate guide to bit manipulation for coding interviews. Developed by FAANG engineers, practice with real-world interview questions, and get interview-ready in just a few hours.

This course teaches bit manipulation, a powerful technique to enhance algorithmic and problem-solving skills. It is a critical topic for those preparing for coding interviews for top tech companies, startups and industry leaders. Competitive programmers can take full advantage of this course by running most of the bit-related problems in O(1) complexity.

The course will begin by educating you about the number system and its representation, decimal and binary, followed by the six bitwise operators: AND, OR, NOT, XOR, and bit-shifting (left, right).

You will receive ample practical experience working through practice problems to improve your comprehension.

Upon completing this course, you will be able to solve problems with greater efficiency and speed.

Grokking Bit Manipulation for Coding Interviews

# Bitwise XOR

A Bitwise **XOR** is a binary operation that takes two bit patterns of equal length and performs the logical exclusive OR operation on each corresponding bits pair. Each position's result is 0 if both bits are `0` or if both bits are `1`. Otherwise, the result is 1.

-------------------------

The Bitwise **XOR** operator does the following:
* It is a binary operator that takes two numbers.
* When we do Bitwise `^` of these two numbers, it considers the binary representation of these two numbers.
* Bitwise XOR compares bit by bit in binary representation, and whatever binary representation you get, the corresponding Integer is returned as an output.

___

Here, we will discuss more on the '^' operator in detail. 

Getting Started

Number Systems, Bitwise, and Binary

Bitwise AND

Bitwise OR

Bitwise NOT

Bitwise XOR

Bit Shifting - Left, Right

Bitwise LeftShift Problems

Bitwise RightShift Problems

Final Thoughts

Bitwise XOR, Computations, and Examples

Bitwise XOR