Grokking Bit Manipulation For Coding Interviews

Estimated Time: 8hrs to complete.

Getting Started

Introductory learning topics about bit-manipulation. Start here to learn the basics.

1. Introduction to bit manipulation (preview)
2. What is bit manipulation? (preview)

Gift

3. Grab your FREE IntelliJ Idea/JetBrains license 🤩

Number Systems, Bitwise, and Binary

Next, you need to understand the number systems in mathematics like binary, decimal, octal, and hexadecimal. You will be introduced to number representations and mathematical conversions.

4. Introduction to number systems (preview)
5. Decimal number system (preview)
6. Binary number system and representation (preview)
7. What are bitwise operators? (preview)
8. Count the number of digits in an integer (preview)
9. Convert Decimal Numbers to binary numbers (preview)

Bitwise AND

The Bitwise AND operator is denoted by &. When an AND gate is given with 2 inputs, the corresponding outputs will be: If two input bits are 1, then the output is 1. In all other cases, it is 0.

10. Introduction to AND operator
11. Bitwise AND, computations, and examples
12. Challenge 1: Count set bits or number of 1 bit's (preview)
13. Solution Review: Count set bits or number of 1 bit's (preview)
14. Counting bits II
15. Challenge 2: Check if a given number is even/odd
16. Solution Review: Check if a given number is even/odd
17. Challenge 3: Power of 2 (preview)
18. Solution Review: Power of 2 (preview)

Bitwise OR

The Bitwise OR operator is denoted by |. When an OR gate is given with 2 inputs, the corresponding outputs will be: If two input bits are 0, then the output is 0. In all other cases, it is 1.

19. Introduction to OR operator
20. Bitwise OR, computations, and examples
21. Number of flips required to make a|b equals c

Bitwise NOT

The Bitwise NOT operator evaluates the binary representation of the value of a single input. If the bit contains 1, the output will be 0 for that bit location. If the bit contains 0, the output will be 1.

22. Introduction to NOT operator
23. Bitwise NOT, computations, and examples
24. Switch sign of a number

Bitwise XOR

The Bitwise XOR operator is denoted by ^. When an XOR gate is given with 2 inputs, the corresponding outputs will be: If two input bits are different, the output is 1. In all other cases, it is 0.

25. Introduction to XOR
26. Bitwise XOR, computations, and examples
27. Swap two numbers
28. Find odd occurring element
29. Detect if two integers have opposite signs
30. Hamming distance
31. Challenge 1: Single number
32. Solution Review: Single number
33. Challenge 2: Missing number
34. Solution Review: Missing number

Bit Shifring - Left, Right

A bit shift is a Bitwise operation where the order of a series of bits is moved, either to the left or right, to efficiently perform a mathematical operation.

35. Introduction to bit shifting
36. Left shifts
37. Arithmetic and logical right shifts

Bitwise Left Shift Problems

Problems on left shift.

38. Find the bit length of a number
39. Check if the k^th bit is set/unset using left shift
40. Subsets or Powerset (preview)
41. Challenge 1: Get the first set bit position using the left shift
42. Solution Review: Get the first set bit position using the left shift

Bitwise Right Shift Problems

Problems on the right shift.

43. Check if the k^th bit is set/unset using right shift
44. Challenge 1: Get the first set bit position using the right shift
45. Solution Review: Get the first set bit position using the right shift

Final Thoughts

This concludes the course on bit manipulation.

This course has taught you how to re-write arithmetic operators like +, -, /, * into left, right shift, and other bit-level operations.

I hope the learning you gained in this course will be useful in solving Leetcode, Hackerrank, HackerEarth, Codeforces, Codechef, and other online coding challenges. This will also help you with interviews at FAANG or other top tech companies.

I wish you good luck and hope this course makes a difference in your coding journey!

Note: In the upcoming edits, you will see the following items:

1. Solutions in Rust and Go.
2. A few medium and hard problems were asked in recent FAANG and fast-paced startup coding interviews.

Happy Coding 👨🏻‍💻 !!

If you have finished the course, I'm super happy for you 🥳, and it's been a pleasure to be part of your professional journey.

I'm working hard in my spare time to keep the site up and running and to update the site with the most requested features. So long as people are having fun, I want to keep the site going.