Bit Manipulation Problems

Practise 30 bit manipulation problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers XOR tricks, counting set bits, masks, bit shifts, subsets as bitmasks and bitwise dynamic programming. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 10 easy problems such as The Lone Sock, Flip and Invert and Pile Duel.
• Core Problems: 14 medium problems such as Matching XOR Triplets, Symbol in Row K and Bit-Disjoint Stretch.
• Hard Problems: 6 hard problems such as Sticker Spelling, Hats for Everyone and Slot AND Sum.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.