dsa1 min read
Gray Code — Binary XOR Construction
Generate n-bit Gray code sequence where adjacent codes differ by exactly 1 bit. Formula: gray(i) = i ^ (i >> 1).
Read →
All Posts
1575 articles
dsa1 min read
Repeated DNA Sequences — Rolling Hash
Find all 10-letter DNA sequences that appear more than once. Use rolling hash (4-bit per char) or set of seen substrings.
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 →
dsa3 min read
Bit Manipulation — Master Recap & Cheatsheet
Complete bit manipulation cheatsheet: all critical tricks, bitmask DP patterns, XOR properties, complexity table, and problem index.
Read →
Page 93 of 315