Bit Manipulation
54 problems · 36 with full explanations
16 Easy20 Medium1 Hard
Bit manipulation uses bitwise operators (&, |, ^, ~, <<, >>) for compact and fast solutions. Key tricks: x & (x-1) clears lowest set bit, x ^ x = 0 (XOR cancellation), and bitmask DP represents subsets as integers. In C#, use int (32-bit) or long (64-bit) for bitmasking.
How to practice
To practice Bit Manipulation problems effectively, start with the Easy problems listed below, trace through each solution on paper, then re-implement without looking. When you can recognise the bit manipulation pattern within 30 seconds of reading a new problem, move on to Medium difficulty. Use the related topic pages and our study guide for a structured progression.
Start here (Easy + explained)
All Bit Manipulation problems
- 29.Divide Two IntegersMedium
- 67.Add BinaryEasy
- 137.Single Number IIMedium
- 190.Reverse BitsEasy
- 231.Power of TwoEasy
- 342.Power of FourEasy
- 401.Binary WatchEasy
- 476.Number ComplementEasy
- 477.Total Hamming DistanceMedium
- 693.Binary Number with Alternating BitsEasy
- 762.Prime Number of Set Bits in Binary RepresentationMedium
- 784.Letter Case PermutationMedium
- 832.Flipping an ImageEasy
- 868.Binary GapUnknown
- 898.Bitwise ORs of SubarraysMedium
- 1009.Complement of Base 10 IntegerEasy
- 1310.XOR Queries of a SubarrayMedium
- 1371.Find the Longest Substring Containing Vowels in Even CountsMedium
- 1461.Check If a String Contains All Binary Codes of Size KMedium
- 1486.XOR Operation in an ArrayEasy
- 1611.Minimum One Bit Operations to Make Integers ZeroUnknown
- 1680.Concatenation of Consecutive Binary NumbersUnknown
- 1684.Count the Number of Consistent StringsEasy
- 1799.Maximize Score After N OperationsUnknown
- 1829.Maximum XOR for Each QueryUnknown
- 1863.Sum of All Subset XOR TotalsUnknown
- 1938.Maximum Genetic Difference QueryUnknown
- 1994.The Number of Good SubsetsUnknown
- 2044.Count Number of Maximum Bitwise-OR SubsetsMedium
- 2206.Divide Array Into Equal PairsEasy
- 2220.Minimum Bit Flips to Convert NumberEasy
- 2275.Largest Combination With Bitwise AND Greater Than ZeroMedium
- 2322.Minimum Score After Removals on a TreeUnknown
- 2401.Longest Nice SubarrayMedium
- 2411.Smallest Subarrays With Maximum Bitwise ORMedium
- 2419.Longest Subarray With Maximum Bitwise ANDMedium
- 2425.Bitwise XOR of All PairingsMedium
- 2429.Minimize XORHard
- 2438.Range Product Queries of PowersUnknown
- 2572.Count the Number of Square-Free SubsetsUnknown
- 2657.Find the Prefix Common Array of Two ArraysMedium
- 2683.Neighboring Bitwise XORMedium
- 2749.Minimum Operations to Make the Integer ZeroUnknown
- 2980.Check if Bitwise OR Has Trailing ZerosEasy
- 3003.Maximize the Number of Partitions After OperationsUnknown
- 3011.Find if Array Can Be SortedUnknown
- 3097.Shortest Subarray With OR at Least K IIMedium
- 3133.Minimum Array EndMedium
- 3191.Minimum Operations to Make Binary Array Elements Equal to One IMedium
- 3307.Find the K-th Character in String Game IIUnknown
- 3315.Construct the Minimum Bitwise Array IIUnknown
- 3370.Smallest Number With All Set BitsEasy
- 3495.Minimum Operations to Make Array Elements ZeroEasy
- 3539.Find Sum of Array Product of Magical SequencesUnknown