Top-K problem (Heavy Hitters) system design

In today's episode, we explore the intriguing Top-K problem, also known as the Heavy Hitters problem. This challenge is commonly encountered by companies with high data loads, such as selecting top-liked Instagram posts or the most popular YouTube videos. We will discuss the following data structures: hash map, min heap, and count-min sketch as part of the solution.