DSA learning path
Bit Manipulation
Masks, XOR, shifts and bitwise optimisation.
Problems in this path
- Single NumberOpen
Easy · XOR Cancellation - Count Bits from 0 to NOpen
Medium · Bit DP - Maximum XOR PairOpen
Hard · Binary Trie - Power of TwoOpen
Easy · Lowest Set Bit - Reverse 32 BitsOpen
Easy · Bit Shifts - Missing Number by XOROpen
Easy · XOR Cancellation - Two Single NumbersOpen
Medium · XOR Partition - Hamming DistanceOpen
Easy · XOR Popcount - Sum of All Subset XORsOpen
Medium · Bitmask Enumeration - Bitwise AND of a RangeOpen
Medium · Common Binary Prefix