Low-Latency Flat Map (Open Addressing) - Quant Developer Interview Question

Problem Description

High-frequency trading systems require low-latency data structures to minimize cache misses caused by pointer chasing in standard hash maps. A Flat Map optimizes memory access patterns by storing entries in a contiguous array using open addressing and linear probing. This approach significantly reduces access time for critical order book and market data lookups. Task Implement a FlatMap class that utilizes open addressing with linear probing to store key-value pairs in a single contiguous std::