Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
either a hash table or a balanced binary search tree such as AVL Tree or Skip List. The space complexity is O(n) where n is the number of unique user ids. If n ~ O(10⁹), we would still requires somewhere around 30GB of RAM for storing the set. Can we live with some error in the counts of the number