Sparse Set: O(1) Operations - Quant Developer Interview Question

Problem Description

Sparse sets provide a cache-efficient mechanism for managing subsets of bounded integer identifiers, crucial for high-frequency trading systems where minimizing latency and memory fragmentation is paramount. By maintaining a dense array of active elements alongside a sparse index map, this structure guarantees O(1) time complexity for insertion, deletion, lookup, and clearing operations while enabling contiguous memory iteration. Task Implement the SparseSet class to manage a collection of non-