Difficulty: Medium
Category: data_structures
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: hashing, data structures, probabilistic, c++
Bloom filters are space-efficient probabilistic data structures used in high-frequency trading to rapidly check set membership with minimal memory overhead. By allowing for false positives but no false negatives, they enable low-latency verification of processed order IDs in resource-constrained environments. Task Implement the OrderBloomFilter class to track processed Order IDs using a bit array of a specified size. The class must support an add method to insert an ID and an exists method to c
Practice this medium developer interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.