Order Existence with Bloom Filter - Quant Developer Interview Question
Difficulty: Medium
Category: data_structures
Asked at: Akuna, Bloomberg, Two Sigma, Tower Research, HRT
Topics: hashing, data structures, probabilistic, c++
Problem Description
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 LeetCode for quants with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.