Groups
Category
Level
XOR (Zobrist) hashing assigns a random 64-bit number to each possible element and hashes a set by XORing the numbers of present elements.
Tree isomorphism asks whether two trees have exactly the same shape, ignoring vertex names.
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.