Uber Interview Question

Top K Frequent Elements: given an integer array and integer k, return the k most frequent elements. Walk through both the min-heap approach (O(n log k) time) and the bucket-sort approach (O(n) time), then discuss the trade-offs in time, space, and which one you'd pick for a streaming variant where new numbers keep arriving.