Concepts3
⚙️AlgorithmIntermediate
XOR Hashing (Zobrist Hashing)
XOR (Zobrist) hashing assigns a random 64-bit number to each possible element and hashes a set by XORing the numbers of present elements.
#xor hashing#zobrist hashing#incremental hashing+11
⚙️AlgorithmIntermediate
Tree Isomorphism
Tree isomorphism asks whether two trees have exactly the same shape, ignoring vertex names.
#tree isomorphism#ahu algorithm#canonical form+12
⚙️AlgorithmIntermediate
String Hashing (Polynomial Hash)
Polynomial string hashing encodes a string as a base-p number modulo a large prime, letting us compare substrings in O(1) after O(n) preprocessing.
#string hashing#polynomial hash#rolling hash+12