Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
using repetition from the h unique hash values. Let H(n, j, h-j) be the number of ways of arranging n input hashes with h unique hashes and j hashes from set ‘a’ i.e. equal to K-1 leading zeros and h-j hashes from set ‘b’ i.e. less than K-1 leading zeros. Then we can use the following recursion