Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
trailing zeros. Let the cardinality with n hashes be h i.e. out of n hashes seen, h are unique hashes. I can choose j hashes from ‘a’ hashes (‘a’ is defined above) and h-j hashes from ‘b’ hashes varying j from 1 to h. After filling the h hashes out of n hashes, I can fill the remaining n-h hashes