dsa5 min read
Bit Manipulation — Complete Guide
Master bit manipulation: XOR tricks, counting bits, bitmask DP, Brian Kernighan, two's complement, and 5-language operators.
Read →
Bitmask
6 articles
dsa1 min read
Subsets — Bitmask Enumeration
Generate all subsets of an array. Each subset corresponds to a bitmask of n bits where bit i = 1 means element i is included.
Read →
dsa1 min read
Number of Valid Words for Each Puzzle — Bitmask Subset
Count words that contain puzzle[0] and only letters from puzzle. Encode words as bitmasks, for each puzzle enumerate its subsets containing puzzle[0].
Read →
dsa1 min read
Maximum Product of Word Lengths — Bitmask Intersection
Find max product of lengths of two words with no common letters. Encode each word as bitmask; two words share letters if AND != 0.
Read →
dsa2 min read
Count Wonderful Substrings — Bitmask + Prefix XOR Map
Count substrings with at most one odd-frequency letter using bitmask prefix XOR and a hash map.
Read →
dsa3 min read
Bit Manipulation: XOR Tricks and Bitmasking
Master bitwise operations for DSA: XOR tricks, Brian Kernighan bit counting, subset enumeration, and bitmask DP.
Read →