Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
be the number of ways by which we can have n N-bit numbers such that the number of trailing zeros ranges from 0 to K-1 for all n numbers. Then the number of ways by which we can have n N-bit numbers such that at-least one of n has K trailing zeros = P-Q Probability that the maximum number of