About this question
Hard · Algorithms & Data Structures · Quant Trader interview question · algorithms, data-structures, probability, hashing, count-min-sketch
You're building a high-frequency trading system and need to track the frequency of various order types appearing in the market feed. Due to memory constraints, you decide to use a Count-Min Sketch to estimate these frequencies. The Count-Min Sketch uses multiple hash functions to map each order type to multiple counters. When querying the estimated frequency of an order type, you take the minimum counter value across all hash functions. Given this setup, does the Count-Min Sketch tend to overest