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

# Solution review

We need to go through all the elements to check if any are even/Odd.

It would be best if you saw the pattern of bits present in odd numbers. If you take a closer look at each of them, you can see the right-most significant bit is set to `1` (for $2^{0}$ place).

So, we do an **AND** bitwise operation with `1` decimal number to see if the resultant output is `1`. If not, it is an even number else odd.

## Algorithm

* Iterate over all the elements, to check

* if `(element & 1) == 1`
  * if `true`, print `"Odd"`
  * else, print `"Even"`

### Explanation

Table illustrating values at various levels of each operation.

Here, we see the solution for checking if a number is even/odd.

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

Solution Review: Check If Number Is Even/Odd

Solution review