Coding · Hard

Find the top-K most frequent items in an unbounded stream with bounded memory.