Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
the remaining n-th hash, I have to pick one of the b-(h-j-1) hashes from set ‘b’ because I need to have h-j hashes from set ‘b’. Here is the Python code to find H using memoization technique: def H(n, x, y, dp): if x < 0 or y < 0: dp[(n, x, y)] = 0 return dp[(n, x, y)] if n < x+y: dp[(n, x, y)] = 0