Small Vector Optimization - Quant Developer Interview Question

Problem Description

Dynamic memory allocation on the heap is a significant source of latency and cache misses. A "Small Vector" optimization mitigates this by storing a small number of elements inline on the stack and only allocating heap memory when the capacity is exceeded. This hybrid approach reduces allocation overhead for frequently used small datasets. Task Implement a class SmallVector<T, N> that manages a hybrid memory model, storing elements in an internal inline buffer if the count is within N, and swit