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

# What is the Bitwise AND operator?

AND operator is the same as AND gate we studied in the chapter on digital electronics, as shown below:

The Bitwise AND operator is denoted by `&`. When an AND gate is given with two inputs, the corresponding output will be:

* If two input bits are 1, the output is 1.
* In all other cases its 0, for example
  *  1 & 0 => yields to 0.
  *  0 & 1 => yields to 0.
  *  0 & 0 => yields to 0.

> **Syntax:**  `a & b`

AND compares each bit of the **first operand** to the **second operand**'s corresponding bit. If both bits are 1, the corresponding result bit is set to 1. Otherwise, the corresponding result bit is set to 0.

___

## Truth table

Bitwise AND is the most commonly used logical Bitwise operator. It is represented by a sign (&). 

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

Introduction to AND

What is the Bitwise AND operator?