Practice Problems for Bit Manipulation
Basic Bit Manipulation Problems
XOR Problems
- Single Number II
- Find Missing Number
- XOR Queries of a Subarray
- Maximum XOR of Two Numbers in an Array
- Find the Duplicate Number
AND, OR, and Shifting Problems
Advanced Bit Manipulation Problems
- Maximum XOR of Two Numbers in an Array
- Total Hamming Distance
- Binary Watch
- Gray Code
- Concatenation of Consecutive Binary Numbers
Masking and Shifting Problems
- Palindrome Partitioning IV
- Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
- Decode XORed Permutation
- Find XOR Sum of All Pairs Bitwise AND
Miscellaneous Bit Manipulation Problems
Bit manipulation is a powerful technique to optimize problems related to numbers and binary operations. Practicing these problems will help you get familiar with how bitwise operators work and how to apply them in different scenarios.
Track Your Progress
Done with this topic? Mark it as complete to track your progress.
💬 Discuss this page
Have a question or spot something confusing in "Practice Problems for Bit Manipulation"? Ask below — it's backed by GitHub Discussions, so maintainers get notified like any other GitHub activity.