Bit Manipulation - XOR Tricks, Power of Two, and Counting Bits

Public lesson preview

Unlock bit-level thinking for coding interviews. Master XOR cancellation, Brian Kernighan's trick, bit masking for subsets, and practical applications.

Learning objectives

By the end of this lesson, you will understand:

• ✓Binary Number Review
• ✓Core Bitwise Operations
• ✓Essential Bit Tricks
• ✓Single Number - XOR Cancellation
• ✓Single Number III - Two Unique Numbers

Lesson outline

1. Binary Number Review
2. Core Bitwise Operations
3. Essential Bit Tricks
4. Check if Power of Two
5. Count Set Bits (Brian Kernighan's Algorithm)
6. Swap Without Temp Variable
7. Single Number - XOR Cancellation
8. Single Number III - Two Unique Numbers
9. Number of 1 Bits (LeetCode 191)
10. Bit Masking for Subsets
11. Reversing Bits (LeetCode 190)
12. Missing Number (LeetCode 268)
13. Hamming Distance (LeetCode 461)
14. Practical Applications
15. 📚 Further Reading