Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
HyperLogLog is pretty intuitive. Assuming we have a ‘good’ hash function that generates hashes with an uniform distribution in the range [0, 2³² -1]. If the maximum number of trailing zeros in the binary representation of the hash is K, then the approximate cardinality is 2^K. For e.g. if we use