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

## How to count the number of digits in an integer

Given a decimal number, continue dividing the number by ten until it reaches 0 and records the remainder at each step.

The resulting list of remainders is the equivalent place values of the Integer.

**Example:**
```
Input: 125

Output: 3

```
The illustration below explains the process of counting the digits in an integer.


# How to count the number of digits in an integer

Given a decimal number, continue dividing the number by ten until it reaches 0 and records the remainder at each step.

The resulting list of remainders is the equivalent place values of the Integer.

**Example:**
```
Input: 125

Output: 3

```
The illustration below explains the process of counting the digits in an integer.


In this lesson, we will write code to count the number of digits in an integer.

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

Count the Number of Digits in an Integer

How to count the number of digits in an integer