Bit Manipulation coding problems

Bit manipulation problems use AND, OR, XOR and shifts to count set bits, find the single number and build subsets fast.

18 problems: 11 easy, 6 medium, 1 hard. Free to read; a free account solves them and earns XP and Aura.

1. Check if Binary Representation is PalindromePractice · +10 XP · bit manipulation, stringseasy
2. Check Power of TwoPractice · +10 XP · bit manipulation, easyeasy
3. Count Bits in RangePractice · +10 XP · bit manipulationeasy
4. Count Numbers with Even Set BitsPractice · +10 XP · bit manipulation, loops, countingeasy
5. Count Set BitsPractice · +10 XP · bit manipulation, loops, basiceasy
6. Find Missing NumberPractice · +10 XP · bit manipulation, xor trickseasy
7. Find the Single NumberPractice · +10 XP · bit manipulation, xor tricks, arrayseasy
8. Find Unset BitsPractice · +10 XP · bit manipulation, beginnereasy
9. Parity of Set BitsPractice · +10 XP · bit manipulation, loops, basiceasy
10. Sort by Number of Set BitsPractice · +10 XP · sorting, counting sort, bit manipulationeasy
11. Unique NumberPractice · +10 XP · bit manipulation, xor tricks, beginnereasy
12. Count XOR PairsPractice · +20 XP · bit manipulation, hash map, prefix sumsmedium
13. Distinct XOR Prefix SumsPractice · +20 XP · bit manipulation, prefix sums, hash setmedium
14. Minimum XOR Sum of SubarraysPractice · +20 XP · bit manipulation, prefix sums, hash mapmedium
15. Subarray XOR with TargetPractice · +20 XP · bit manipulation, hash map, prefix summedium
16. XOR Pairs with Zero SumPractice · +20 XP · bit manipulation, hash map, prefix sumsmedium
17. XOR Sequence PartitionPractice · +20 XP · bit manipulation, hash map, prefix sumsmedium
18. Bitwise OR Subarray SumPractice · +30 XP · bit manipulation, prefix sums, data structureshard