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 

Imagine we check the right-most significant bit to see if the bit and `&` operation of `1` yields to `1`.

In other words, we shift bits until the right MSB and `&` operation with `1`, and it yields `1`.

### Algorithm
* If `n == 0`, return.
* Initialize `k = 1`
* Loop
   * If `((n & (1 << (k - 1))) == 0)` increment the pointer `k`
   * Else, return `k`


# Solution review 

Imagine we check the right-most significant bit to see if the bit and `&` operation of `1` yields to `1`.

In other words, we shift bits until the right MSB and `&` operation with `1`, and it yields `1`.

## Algorithm
* If `n == 0`, return.
* Initialize `k = 1`
* Loop
   * If `((n & (1 << (k - 1))) == 0)` increment the pointer `k`
   * Else, return `k`


In this lesson, we try to solve this algorithm using the left shift operator. Try solving it on your own.

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: Get First Set Bit Position

Solution review

Algorithm