Bit Manipulation
Treat an integer as a row of switches — test, set, flip, and count bits, XOR tricks, and bitmask sets.
This topic is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.
What is in it
- 1Binary and the bitwise operatorsHow integers are stored in bits, the six operators, and testing, setting, clearing, and flipping bit i. Pro
- 2Classic bit tricksx & (x − 1) drops the lowest set bit — counting bits, powers of two, and counting bits for every number with DP. Pro
- 3XOR tricksPairs cancel, zero changes nothing — find the single number, the missing number, and two unique numbers. Pro
- 4Bitmasks as setsAn n-bit integer is a subset of n items — enumerate all subsets in a loop, and use masks as DP state. Pro